theorem
proved
composition_violates_budget
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.NumberTheory.CompositionDivergence on GitHub at line 86.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
nontrivial -
of -
Hypothesis -
carrier -
carrier -
Composition -
of -
defect -
is -
of -
from -
is -
of -
is -
of -
is -
defectIterate -
zero_composition_diverges -
OnCriticalLine -
zeroDeviation
used by
formal source
83 The composition law generates defect values that grow as
84 cosh(2ⁿ·2η) − 1 ≥ 4ⁿ·(cosh(2η)−1), which exceeds any finite
85 carrier budget for n large enough. -/
86theorem composition_violates_budget (ρ : ℂ) (hρ : ¬OnCriticalLine ρ) (B : ℝ) :
87 ∃ n : ℕ, B < defectIterate (zeroDeviation ρ) n :=
88 zero_composition_diverges ρ hρ B
89
90/-- **Riemann Hypothesis from Composition Closure.**
91
92 If the Composition Closure Hypothesis holds, then every nontrivial
93 zero of ζ(s) lies on the critical line Re(s) = 1/2.
94
95 Proof: Suppose ρ is off-critical. By CCH, every iterated defect is
96 bounded by the carrier budget. But by the composition law, the
97 iterated defects diverge. Contradiction. -/
98theorem rh_from_composition_closure (cch : CompositionClosureHypothesis) :
99 ∀ ρ : ℂ, ¬OnCriticalLine ρ → False := by
100 intro ρ hρ
101 obtain ⟨n, hn⟩ := composition_violates_budget ρ hρ cch.bound
102 have hle := cch.reflected ρ hρ n
103 linarith
104
105/-! ## §3. The Forcing Chain (summary) -/
106
107/-- **Certificate**: the full forcing chain from RCL to RH.
108
109 This packages the entire argument:
110 - T5: RCL uniquely forces J
111 - Bridge: ξ-symmetry = J-symmetry
112 - Composition: RCL self-composition amplifies defect
113 - Divergence: iterated defect is unbounded
114 - Budget: carrier budget is finite
115 - Conclusion: off-critical zeros are impossible -/
116structure CompositionRHCertificate where