Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
28 commits
Select commit Hold shift + click to select a range
0c78c23
feat(autoresearch): isolate proof strategy and runtime ownership
Jul 26, 2026
fc0e605
feat(autoresearch): certify definition remediation resumes
Jul 27, 2026
15d8165
fix(autoresearch): preserve upstream resume evidence
Jul 27, 2026
90bd139
fix(autoresearch): exclude superseded strategy dependencies
Jul 27, 2026
2e75df4
fix(autoresearch): dispatch certified definition resolution
Jul 27, 2026
2c48d1d
fix(autoresearch): record target interface blockers
Jul 27, 2026
e8bf5ac
fix(autoresearch): exhaust underspecified target interfaces
Jul 27, 2026
69f3fb2
feat(autoresearch): bootstrap sourced RH root
Jul 27, 2026
1b42fed
fix(autoresearch): clear stale target strategy state
Jul 27, 2026
2df7b6a
fix(autoresearch): preserve bootstrapped root checkpoint
Jul 27, 2026
5e366b1
fix(autoresearch): elaborate subgoal before OProver
Jul 27, 2026
5d4f59c
fix(autoresearch): recover blocked contract at loop boundary
Jul 27, 2026
4f92eff
fix(autoresearch): resume bound decomposition directly
Jul 27, 2026
cec4309
fix(autoresearch): bind resumed candidate to root
Jul 27, 2026
b97b8fb
fix(autoresearch): certify resumed role launch
Jul 27, 2026
ff8b692
fix(autoresearch): bind contract artifact dependency
Jul 27, 2026
40b7380
fix(autoresearch): bind resume lease to worker
Jul 27, 2026
bf83630
fix(autoresearch): normalize certified ledger payload
Jul 27, 2026
9685a25
fix(autoresearch): make formal root binding canonical
Jul 27, 2026
38334d5
fix(autoresearch): reclaim dead resume leases
Jul 27, 2026
4910a92
fix(autoresearch): preserve contract on role migration
Jul 27, 2026
cc7c73f
fix(autoresearch): split contract audit provenance
Jul 27, 2026
5e4cd95
feat(autoresearch): add bounded decomposition exploration
Jul 27, 2026
612fcd8
fix(autoresearch): preserve contract during definition resume
Jul 27, 2026
0c072ea
fix(autoresearch): make exploration exhaustion terminal
Jul 27, 2026
e78e636
feat(autoresearch): analyze unmappable candidate representations
Jul 27, 2026
054d939
fix(autoresearch): preserve typed representation verdicts
Jul 27, 2026
7e34d49
fix(autoresearch): recognize formatted L-function gaps
Jul 27, 2026
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions KakeyaLeanGate.lean
Original file line number Diff line number Diff line change
@@ -1 +1,2 @@
import KakeyaLeanGate.Prelude
import KakeyaLeanGate.RiemannHypothesisRoot
14 changes: 14 additions & 0 deletions KakeyaLeanGate/Prelude.lean
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,7 @@ import Mathlib.Analysis.Complex.JensenFormula
import Mathlib.Analysis.Complex.LocallyUniformLimit
import Mathlib.Analysis.Complex.Order
import Mathlib.Analysis.Analytic.Uniqueness
import Mathlib.NumberTheory.LSeries.RiemannZeta

/-!
Minimal import target for AutoResearch theorem-signature validation.
Expand Down Expand Up @@ -40,3 +41,16 @@ def agreesWithSimplePoleOnPuncturedDisk
def nonzeroComplex (z : ℂ) : Prop := z ≠ 0

def positiveRadius (radius : ℝ) : Prop := 0 < radius

/- General, target-independent constructors admitted by candidate
representation analysis. These only wrap Mathlib types and predicates. -/
def continuousComplexMap (f : ℂ → ℂ) : Prop := Continuous f

def holomorphicComplexMapOn (f : ℂ → ℂ) (domain : Set ℂ) : Prop :=
DifferentiableOn ℂ f domain

def convergesComplexSequence (seq : ℕ → ℂ) (limit : ℂ) : Prop :=
Tendsto seq atTop (nhds limit)

def boundedComplexMapOn (f : ℂ → ℂ) (domain : Set ℂ) : Prop :=
∃ bound : ℝ, 0 ≤ bound ∧ ∀ z ∈ domain, ‖f z‖ ≤ bound
25 changes: 25 additions & 0 deletions KakeyaLeanGate/RiemannHypothesisRoot.lean
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
import Mathlib.NumberTheory.LSeries.RiemannZeta

/-!
The canonical AutoResearch root is an alias of Mathlib's pinned
`RiemannHypothesis` declaration. The expanded branch is retained separately
and its relationship to the canonical branch is proved definitionally below.
-/

def KakeyaRiemannHypothesisRoot : Prop := RiemannHypothesis

def KakeyaRiemannHypothesisExpanded : Prop :=
∀ (s : ℂ), riemannZeta s = 0 →
(¬ ∃ n : ℕ, s = -2 * (n + 1)) →
s ≠ 1 →
s.re = 1 / 2

theorem kakeya_rh_expanded_iff_canonical :
KakeyaRiemannHypothesisExpanded ↔ KakeyaRiemannHypothesisRoot := by
rfl

#check riemannZeta
#check completedRiemannZeta
#check completedRiemannZeta₀
#check riemannZeta_neg_two_mul_nat_add_one
#check RiemannHypothesis
Loading
Loading