def
definition
defectIterate
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.NumberTheory.ZeroCompositionLaw on GitHub at line 54.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
cascade_doubly_exponential_lower -
cascade_exponential_growth -
composition_cascade_stronger_than_single_defect -
CompositionClosureHypothesis -
composition_violates_budget -
defectIterate_exponential_lower -
defectIterate_four_mul_le -
defectIterate_mono -
defectIterate_nonneg -
defectIterate_succ -
defectIterate_succ' -
defectIterate_unbounded -
defectIterate_zero_eq_J_log -
defectIterate_zero_eq_zeroDefect -
defectIterate_zero_param -
defectIterate_zero_pos -
zero_composition_diverges
formal source
51 For a zeta zero with deviation η = Re(ρ)−1/2, set t = 2η.
52 Then d₀ = cosh(2η)−1 is the zero's defect, and dₙ is the
53 n-th iterate under the RCL self-composition. -/
54def defectIterate (t : ℝ) (n : ℕ) : ℝ := Real.cosh ((2 : ℝ) ^ n * t) - 1
55
56/-- dₙ(0) = 0 for all n: on the critical line, all iterates vanish. -/
57@[simp] theorem defectIterate_zero_param (n : ℕ) : defectIterate 0 n = 0 := by
58 simp [defectIterate, Real.cosh_zero]
59
60/-- d₀(t) = cosh(t) − 1 = J_log(t). -/
61theorem defectIterate_zero_eq_J_log (t : ℝ) :
62 defectIterate t 0 = Foundation.DiscretenessForcing.J_log t := by
63 simp [defectIterate, Foundation.DiscretenessForcing.J_log]
64
65/-- dₙ ≥ 0 for all n and t (from cosh ≥ 1). -/
66theorem defectIterate_nonneg (t : ℝ) (n : ℕ) : 0 ≤ defectIterate t n := by
67 simp only [defectIterate]
68 linarith [Real.one_le_cosh ((2 : ℝ) ^ n * t)]
69
70/-- d₀ > 0 for t ≠ 0 (off the critical line). -/
71theorem defectIterate_zero_pos {t : ℝ} (ht : t ≠ 0) : 0 < defectIterate t 0 := by
72 rw [defectIterate_zero_eq_J_log]
73 exact Foundation.DiscretenessForcing.J_log_pos ht
74
75/-! ## §2. The recurrence from the RCL -/
76
77/-- **The composition recurrence.**
78
79 dₙ₊₁ = 2 · dₙ · (dₙ + 2)
80
81 This is forced by the Recognition Composition Law: applying the
82 RCL to the pair (e^{2ⁿt}, e^{−2ⁿt}) yields the cosh double-angle
83 formula, which is exactly this recurrence.
84