Current task: —

← Session 35 — ii′-6-R: Lagarias 6.1 right-tail re-proof (E-032/D-073)

#2229 assistant 2026-08-26 13:00:44.198 UTC · 3192→4967 tok open ⤢
thinking (11446 chars)
Not malware — this is the project's own Lean verification code. Now I have the complete picture. Let me check the remaining pieces: 1. `HIntegral` and `VIntegral` definitions (Zeta23). 2. The `RectangleIntegral` side decomposition in Zeta23. 3. The tight R-bound capstone signature (5f). 4. `nearZeros` definition and `ZeroCountProp2`. Then plan ii′-6-c sub-stages: **6-c-i: Rectangle side decomposition + I_III (left vertical)** - Decompose RectangleIntegral (Jlag n) z w into the 4 sides (Zeta23 def: RectangleIntegral = HIntegral bottom + VIntegral right + HIntegral top(reversed?) ...). Let me check the Zeta23 definition. - I_III = left vertical VIntegral at re = −5/2, from −T to T. - Bound: kernel ≤ 2 (kFun_norm_le_two, re = −5/2 ≤ 1/2 ✓). - Zeta: split |t| ≤ 10 (MZeroProp: ≤ 1.3352) and 10 ≤ |t| ≤ T (tight R-bound capstone + near sum ≤ (2/3)·Z2). - The tight capstone: `logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC) (hZC2) (hNLZ)`: ‖logDeriv ζ s − Σ_{near} m/(s−ρ)‖ ≤ 10.5·log(t+2) + 48 for σ ∈ [−5/2, 7/2]?? Let me check the exact range — from session 036: "on σ ∈ [1/2, 7/2], |t| ≥ 10" was the loose one... no wait, the TIGHT one: "‖logDeriv ζ s − Σ_{near} m/(s−ρ)‖ ≤ 10.5·log(t+2) + 48" — I need the exact σ range. D-071 says σ ∈ [−5/2, 3] ✓. Let me verify the signature. - Near sum at s = −5/2 + it: Σ_{ρ ∈ nearZeros t} m/‖s−ρ‖. ‖s−ρ‖ ≥ |re(s−ρ)| = |−5/2 − ρ.re| ≥ 5/2 − 1 = 3/2 (ρ.re ≤ 1). So each term ≤ (2/3)m. Σ over nearZeros t of mult ≤ Z2hat(t)?? ZeroCountProp2: the two-unit count ≤ 0.6·L + 0.886·LL + 2.7 = Z2hat t. Need nearZeros t ⊆ two-unit window — nearZeros is presumably {ρ : |γ − t| < 1} which is a two-unit window centered at t. Z2hat at t vs at T: monotone, t ≤ T so Z2hat t ≤ Z2hat T. - So ‖logDeriv‖ ≤ (2/3)·Z2hat T + 10.5·log(t+2) + 48 ≤ (2/3)·Z2hat T + 10.5·log(T+2) + 48. - Integrate: ‖I_III‖ ≤ ∫_{-T}^{T} 2·(zeta bound) dt = 2·[∫_{|t|≤10} 1.3352 + ∫_{10≤|t|≤T} ((2/3)Z2hat T + 10.5 log(T+2) + 48)] ≤ 2·[20·1.3352 + 2T·((2/3)Z2hat T + 10.5 log(T+2) + 48)] = 40·1.3352 + 4T·(...). ✓ Bn's I_III charge. The VIntegral is over a symmetric interval [−T, T]? VIntegral f x y₁ y₂ = ∫_{y₁}^{y₂} f(x + it) dt presumably. The left side of the rectangle in Zeta23's RectangleIntegral: let me check the definition. From LiDogLeg: VIntegral (Jlag n) 3 T U = ∫ over t from T to U of Jlag n (3 + it). So VIntegral f x y1 y2 := ∫ t in y1..y2, f (x + t·I). The RectangleIntegral z w = HIntegral bottom (z.im) + VIntegral right (w.re, z.im→w.im) + HIntegral top reversed + VIntegral left reversed. I need the exact Zeta23 definition. **6-c-ii: horizontals mid [−5/2, 3]** - Kernel ≤ e⁴+1: kFun_shift_norm_le_exp_four_add_one — check signature: (hs : s.re ≤ 3) (hn : n ≤ s.im²)? From ii′-4: `kFun_shift_norm_le_exp_four_add_one` (horizontals, re s ≤ 3, n ≤ im²). At s = σ + iT with T ≥ √n: n ≤ T² ✓. - Zeta segment integral: ∫_{−5/2}^{3} ‖logDeriv ζ (σ + iT)‖ dσ. Tight R-bound at height T (T ≥ 316 ≥ 10 ✓): ‖logDeriv − near‖ ≤ 10.5 log(T+2) + 48. Integrate over length 5.5: ≤ 5.5·(10.5 log(T+2) + 48). - Near-sum integral: Σ_{ρ near T} m·∫_{−5/2}^{3} dσ/‖σ + iT − ρ‖. For ρ = β + iγ with δ = |T − γ| ≥ c_clear (the wide pigeonhole gives clearance for γ ∈ (√n−1, √n+2); zeros with |γ−T| < 1 are in that window since T ∈ [√n, √n+1]: γ ∈ (T−1, T+1) ⊆ (√n−1, √n+2) ✓). - ∫_{−5/2}^{3} dσ/√((σ−β)² + δ²) = asinh((3−β)/δ) + asinh((β+5/2)/δ) ≤ 2·asinh(5.5/δ) ≤ 2·log(2·5.5/δ + 1)?? Actually asinh(x) = log(x + √(x²+1)) ≤ log(2x+1). For δ ≥ c: asinh(5.5/δ) ≤ log(11/c + 1) ≤ log(16.5/c) if 1 ≤ 5.5/c i.e. c ≤ 5.5 — c_clear = 1/(9·Ĉ₀) ≤ 1/18 ✓ so 11/c + 1 ≤ 11/c + 5.5/c·... hmm: 1 ≤ 5.5/c ⟺ c ≤ 5.5 ✓, so 11/c + 1 ≤ 11/c + 5.5/c = 16.5/c ✓. - So per zero: ≤ 2·log(16.5/c_clear). Near zeros: |γ − T| < 1 — that's a two-unit window at T ⟹ mult-count ≤ Z2hat T (ZeroCountProp2). Total near-integral ≤ 2·Z2hat T·log(16.5/c_clear) =: NI(T). - Which zeros are "near" in the tight R-bound? nearZeros t — need the exact definition. From 5f: nearZeros s₀ or nearZeros t: zeros with |γ − t| < 1? and the capstone gives the R-bound with that near set. The nearZerosSub in LiTightR. Let me check. - So mid horizontal ≤ (e⁴+1)·[NI(T) + 5.5·(10.5 log(T+2) + 48)]. - Then the pinch: NI(T) + 5.5·(10.5 log(T+2)+48) ≤ 7·Hhat T. Hhat T = 3·C0hat T² + 10.5 log(T+2) + 48. So need 2·Z2hat T·log(16.5·9·Ĉ₀(√n+2)) + 5.5·(10.5 log(T+2)+48) ≤ 7·(3Ĉ₀(T)² + 10.5 log(T+2) + 48) = 21Ĉ₀² + 7·(10.5 log + 48). Since 5.5 ≤ 7 on the (10.5 log + 48) part, the crux is 2·Z2hat T·log(148.5·Ĉ₀(√n+2)) ≤ 21·Ĉ₀(T)². With T ∈ [√n, √n+1]: Ĉ₀(T) vs Ĉ₀(√n+2) comparable; Z2hat ~ 0.6L + 0.886LL + 2.7 vs Ĉ₀² ~ (0.433L)² ≈ 0.187L². log(148.5·Ĉ₀) ~ log(148.5·0.433·L) ~ LL + const. So LHS ~ 2·(0.6L)·(LL + c) ~ 1.2·L·LL vs RHS ~ 21·0.187·L² ≈ 3.9·L². Fits with huge margin for large L; the base case L = log(√10⁵+1) ≈ 5.86: need certified endpoint + monotonicity. This is the pinch-lemma-pattern real-analytic comparison (6-d? or 6-c?). D-071 says ii′-6-d = the fold incl. the horizontal pinch. But the per-piece fits might be in 6-c. Let me plan: 6-c proves the four side bounds in the form ≤ [charged expressions], 6-d does the comparisons + final assembly. Hmm, actually, wait. Let me reconsider — Bn charges 2(e⁴+1)(7Ĥ) for BOTH horizontals' mid parts + 2·DogLegRight(n) for both right tails. So per horizontal: mid ≤ (e⁴+1)·[NI + 5.5(10.5 log + 48)] ≤ (e⁴+1)·7Ĥ [the pinch] and right tail ≤ DogLegRight [DL-5]. Total horizontal: 2(e⁴+1)(7Ĥ) + 2·DogLegRight ✓. **6-c-iii: I_I (right vertical σ₁ = 2√n)** - VIntegral (Jlag n) (2√n) (−T) T — length 2T. - Kernel ≤ e^{√n/2}+1: kFun_shift_norm_le_exp_sqrt_half_add_one (2√n ≤ re s ✓; also needs n ≤ im²?? from ii′-4: "right vertical, 2√n ≤ re s" — for t ∈ [−T, T], the kernel bound might need something about im. Let me check the exact signature. From LiDogLeg DL-4: `kFun_right_vertical_norm_le_exp_sqrt_half_add_one {n} {t} (hn : 16 ≤ n) (ht : |t| ≤ ...)`? Let me check. - Zeta ≤ 0.57·2^{−(2√n−2)}: norm_logDeriv_zeta_le_iimZeta (n ≥ 5, any t). ✓ - So ‖I_I‖ ≤ 2T·(e^{√n/2}+1)·0.57·2^{−(2√n−2)} ≤ 2(√n+1)(e^{√n/2}+1)·0.57·2^{−(2√n−2)} = IIMaj n (since T ≤ √n+1). ✓ Bn charge. Wait — IIMaj n = 2(√n+1)(e^{√n/2}+1)·0.57·2^{−(2√n−2)} exactly. ✓ **6-c-iv: triv** — already in the bridge (+1). ✓ Done in 6-b. **6-d: the fold** — RectangleIntegral' = (2πi)⁻¹•RectangleIntegral ⟹ norm ≤ (1/(2π))·‖RectangleIntegral‖... wait: RectangleIntegral' = (1/(2πi))•RectangleIntegral, ‖(1/(2πi))‖ = 1/(2π) < 1, so ‖RectInt'‖ ≤ ‖RectInt‖ ≤ sum of side norms (RectangleIntegral = sum of 4 side integrals with signs). Then |Sf n| ≤ [sum of 4 side bounds] + [4FAlt + 1] ≤ Bn − 4FAlt... wait Bn = 4F + [4T((2/3)Z2 + 10.5 log + 48) + 40·1.3352 + 2(e⁴+1)(7Ĥ) + 2·DogLegRight + IIMaj + 1]. And sides: I_III ≤ 4T((2/3)Z2hat + 10.5 log + 48) + 40·1.3352 ✓, horizontals ≤ 2(e⁴+1)(7Ĥ) + 2·DogLegRight ✓, I_I ≤ IIMaj ✓, bridge ≤ 4FAlt + 1 ✓. Sum = Bn exactly. One wrinkle: ‖RectangleIntegral'‖ = ‖(1/(2πi))•RectangleIntegral‖ = (1/(2π))·‖RectangleIntegral‖ ≤ ‖RectangleIntegral‖ — need 1/(2π) ≤ 1. Fine. Also the horizontal at height −T: the rectangle's bottom is at im = −T. The mid part [−5/2, 3] at −T by the conj symmetry (Jlag_conj — but wait, the tight R-bound at height −T: the capstone is stated for t ≥ 10 positive presumably. For −T use conj symmetry of logDeriv (logDeriv_zeta_conj or similar) or the capstone at T applied to conj s. DL-5 did exactly this for the dog-leg via intervalIntegral_conj. For the mid part the same trick: HIntegral at −T = conj of HIntegral at T (Jlag_conj) ⟹ same norm. So the near-sum integral machine only needs to be built at +T. Now — the near-sum integral machine is the long pole. Components: (a) The tight R-bound: logDeriv ζ s = near-sum + R(s), ‖R‖ ≤ 10.5 log(|t|+2) + 48 — capstone exists (5f). (b) ∫_{−5/2}^{3} ‖R(σ+iT)‖ dσ ≤ 5.5·(10.5 log(T+2)+48) — immediate (interval length × sup bound; norm_integral_le_of_norm_le_const or intervalIntegral.integral_of... the standard machine). (c) ∫_{−5/2}^{3} ‖Σ_{near} m/(s−ρ)‖ dσ ≤ Σ m·∫ dσ/‖s−ρ‖ — swap sum/integral (finite sum ✓ intervalIntegral.integral_finset_sum or similar), then per-zero integral bound via asinh. The per-zero integral: ∫_{−5/2}^{3} dσ/‖(σ+iT) − (β+iγ)‖ = ∫ dσ/√((σ−β)² + (T−γ)²). In Lean: this is a real integral of 1/√((σ−β)²+δ²). The antiderivative is asinh((σ−β)/δ) = log((σ−β) + √((σ−β)²+δ²)) − log δ. Mathlib has Real.arcsinh? There is `Real.arcsinh` in Mathlib (yes, Real.arcsinh exists) and its derivative: deriv arcsinh x = 1/√(x²+1) — `Real.deriv_arcsinh`? There might be hasDerivAt arcsinh. Alternatively avoid asinh entirely: bound the integral directly without the antiderivative: ∫_{−5/2}^{3} dσ/√((σ−β)²+δ²) — split at β: ∫_{|σ−β| ≤ δ} ≤ 2δ/δ = 2; ∫_{δ ≤ |σ−β|} dσ/|σ−β| ≤ 2·log(5.5/δ)... hmm that's ≤ 2 + 2·log(5.5/δ) = 2 + 2·log(5.5) + 2·log(1/δ) ≤ 2·log(16.5/c)? 2 + 2 log(5.5/δ) vs 2 log(16.5/δ) = 2 log(5.5/δ) + 2 log 3. Since 2 ≤ 2 log 3 ✓. So the crude split bound 2 + 2·log(5.5/δ) ≤ 2·log(3·5.5/δ) = 2·log(16.5/δ) ✓ — NO asinh needed! Just: near part (|σ−β| ≤ δ): integrand ≤ 1/δ over length ≤ 2δ ⟹ ≤ 2. Far part: integrand ≤ 1/|σ−β|, integral over [−5/2,3]∩{|σ−β| ≥ δ} ≤ 2·∫_{δ}^{5.5} dx/x = 2·log(5.5/δ). In Lean, though, integrating 1/|σ−β| needs the log antiderivative anyway — ∫_δ^{5.5} dx/x = log(5.5) − log(δ). That's `integral_one_div` or FTC with Real.log. Manageable: intervalIntegral with the split at β (if β ∈ [−5/2, 3]; β ∈ (0,1) always for nontrivial zeros ✓ so β is interior). Alternatively — an even simpler route avoiding the antiderivative: the comparison ∫_{|σ−β|≥δ, σ∈[−5/2,3]} dσ/|σ−β| ≤ ∫_{δ}^{5.5} 2dx/x via monotonicity + the substitution... the substitution in Lean is annoying. FTC on each side: ∫_{β+δ}^{3} dσ/(σ−β) = log(3−β) − log δ ≤ log 5.5 − log δ. FTC for 1/x: `intervalIntegral.integral_one_div` exists? There's `integral_one_div` (for [a,b] with 0 ∉ [a,b]): ∫ x⁻¹ = log b − log a or log|b| − log|a|. Let me plan for that. Actually — simpler still: use the asinh form? Mathlib: `Real.arcsinh : ℝ → ℝ` exists (Real.arcsinh x = log (x + sqrt (x^2 + 1))). deriv: `Real.deriv_arcsinh : deriv Real.arcsinh x = 1 / sqrt (x^2 + 1)`? There's `Real.hasDerivAt_arcsinh`? I recall Mathlib has Real.arcsinh with hasDerivAt. But the D-071 design uses the asinh bound 2·asinh(5.5/δ) ≤ 2·log(16.5/c). Either way works. The crude split avoids asinh but needs the 1/x FTC. Both are standard. I'll decide during implementation — probably the split route (2 + 2·log(5.5/δ) ≤ 2·log(16.5/δ)) since log-FTC is more robust in Mathlib than arcsinh. Hmm wait — actually even simpler: bound ∫ dσ/√((σ−β)²+δ²) ≤ ∫ dσ·min(1/δ, 1/|σ−β|)... same thing. OK. (d) The near-zero mult-count: Σ_{ρ ∈ nearZeros(T)} mult ≤ Z2hat T. nearZeros definition — from LiDisc/LiTightR: `nearZeros t` probably = nontrivial zeros with |γ − t| < 1 as a Finset. ZeroCountProp2 statement: the two-unit count ≤ 0.6L + 0.886LL + 2.7 = Z2hat. Need: nearZeros T's mult-sum ≤ Z2hat T. ZeroCountProp2 is stated in which form? "the two-unit specialization" — need to check its exact statement to bridge nearZeros ⊆ its window. Also: the tight capstone's near set — `nearZerosSub`? The capstone: logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC) (hZC2) (hNLZ): ‖logDeriv riemannZeta s − ∑ ρ ∈ nearZeros t, (zeroMult ρ : ℂ)/(s − ρ)‖ ≤ 10.5*log(t+2) + 48. Need exact signature: σ range, t range (t ≥ 10), near set. Let me now grep those signatures. Also ZeroCountProp2's statement and nearZeros def.
Now checking the remaining signatures: the 5f tight capstone, `nearZeros`, `ZeroCountProp2`, and the Zeta23 `RectangleIntegral` side decomposition.
tool: Grep
input
{
  "pattern": "theorem logDeriv_riemannZeta_sub_nearZeros_le_tight|def nearZeros|def ZeroCountProp2|theorem nearSum|nearZeros_count",
  "path": "D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1",
  "output_mode": "content",
  "-n": true,
  "-A": 12,
  "head_limit": 120
}
raw content_json (database row)
[{"type":"thinking","thinking":"Not malware — this is the project's own Lean verification code.\n\nNow I have the complete picture. Let me check the remaining pieces:\n\n1. `HIntegral` and `VIntegral` definitions (Zeta23).\n2. The `RectangleIntegral` side decomposition in Zeta23.\n3. The tight R-bound capstone signature (5f).\n4. `nearZeros` definition and `ZeroCountProp2`.\n\nThen plan ii′-6-c sub-stages:\n\n**6-c-i: Rectangle side decomposition + I_III (left vertical)**\n- Decompose RectangleIntegral (Jlag n) z w into the 4 sides (Zeta23 def: RectangleIntegral = HIntegral bottom + VIntegral right + HIntegral top(reversed?) ...). Let me check the Zeta23 definition.\n- I_III = left vertical VIntegral at re = −5/2, from −T to T.\n- Bound: kernel ≤ 2 (kFun_norm_le_two, re = −5/2 ≤ 1/2 ✓).\n- Zeta: split |t| ≤ 10 (MZeroProp: ≤ 1.3352) and 10 ≤ |t| ≤ T (tight R-bound capstone + near sum ≤ (2/3)·Z2).\n  - The tight capstone: `logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC) (hZC2) (hNLZ)`: ‖logDeriv ζ s − Σ_{near} m/(s−ρ)‖ ≤ 10.5·log(t+2) + 48 for σ ∈ [−5/2, 7/2]?? Let me check the exact range — from session 036: \"on σ ∈ [1/2, 7/2], |t| ≥ 10\" was the loose one... no wait, the TIGHT one: \"‖logDeriv ζ s − Σ_{near} m/(s−ρ)‖ ≤ 10.5·log(t+2) + 48\" — I need the exact σ range. D-071 says σ ∈ [−5/2, 3] ✓. Let me verify the signature.\n  - Near sum at s = −5/2 + it: Σ_{ρ ∈ nearZeros t} m/‖s−ρ‖. ‖s−ρ‖ ≥ |re(s−ρ)| = |−5/2 − ρ.re| ≥ 5/2 − 1 = 3/2 (ρ.re ≤ 1). So each term ≤ (2/3)m. Σ over nearZeros t of mult ≤ Z2hat(t)?? ZeroCountProp2: the two-unit count ≤ 0.6·L + 0.886·LL + 2.7 = Z2hat t. Need nearZeros t ⊆ two-unit window — nearZeros is presumably {ρ : |γ − t| < 1} which is a two-unit window centered at t. Z2hat at t vs at T: monotone, t ≤ T so Z2hat t ≤ Z2hat T.\n  - So ‖logDeriv‖ ≤ (2/3)·Z2hat T + 10.5·log(t+2) + 48 ≤ (2/3)·Z2hat T + 10.5·log(T+2) + 48.\n- Integrate: ‖I_III‖ ≤ ∫_{-T}^{T} 2·(zeta bound) dt = 2·[∫_{|t|≤10} 1.3352 + ∫_{10≤|t|≤T} ((2/3)Z2hat T + 10.5 log(T+2) + 48)] ≤ 2·[20·1.3352 + 2T·((2/3)Z2hat T + 10.5 log(T+2) + 48)] = 40·1.3352 + 4T·(...). ✓ Bn's I_III charge.\n\nThe VIntegral is over a symmetric interval [−T, T]? VIntegral f x y₁ y₂ = ∫_{y₁}^{y₂} f(x + it) dt presumably. The left side of the rectangle in Zeta23's RectangleIntegral: let me check the definition. From LiDogLeg: VIntegral (Jlag n) 3 T U = ∫ over t from T to U of Jlag n (3 + it). So VIntegral f x y1 y2 := ∫ t in y1..y2, f (x + t·I). The RectangleIntegral z w = HIntegral bottom (z.im) + VIntegral right (w.re, z.im→w.im) + HIntegral top reversed + VIntegral left reversed. I need the exact Zeta23 definition.\n\n**6-c-ii: horizontals mid [−5/2, 3]**\n- Kernel ≤ e⁴+1: kFun_shift_norm_le_exp_four_add_one — check signature: (hs : s.re ≤ 3) (hn : n ≤ s.im²)? From ii′-4: `kFun_shift_norm_le_exp_four_add_one` (horizontals, re s ≤ 3, n ≤ im²). At s = σ + iT with T ≥ √n: n ≤ T² ✓.\n- Zeta segment integral: ∫_{−5/2}^{3} ‖logDeriv ζ (σ + iT)‖ dσ. Tight R-bound at height T (T ≥ 316 ≥ 10 ✓): ‖logDeriv − near‖ ≤ 10.5 log(T+2) + 48. Integrate over length 5.5: ≤ 5.5·(10.5 log(T+2) + 48).\n- Near-sum integral: Σ_{ρ near T} m·∫_{−5/2}^{3} dσ/‖σ + iT − ρ‖. For ρ = β + iγ with δ = |T − γ| ≥ c_clear (the wide pigeonhole gives clearance for γ ∈ (√n−1, √n+2); zeros with |γ−T| < 1 are in that window since T ∈ [√n, √n+1]: γ ∈ (T−1, T+1) ⊆ (√n−1, √n+2) ✓).\n  - ∫_{−5/2}^{3} dσ/√((σ−β)² + δ²) = asinh((3−β)/δ) + asinh((β+5/2)/δ) ≤ 2·asinh(5.5/δ) ≤ 2·log(2·5.5/δ + 1)?? Actually asinh(x) = log(x + √(x²+1)) ≤ log(2x+1). For δ ≥ c: asinh(5.5/δ) ≤ log(11/c + 1) ≤ log(16.5/c) if 1 ≤ 5.5/c i.e. c ≤ 5.5 — c_clear = 1/(9·Ĉ₀) ≤ 1/18 ✓ so 11/c + 1 ≤ 11/c + 5.5/c·... hmm: 1 ≤ 5.5/c ⟺ c ≤ 5.5 ✓, so 11/c + 1 ≤ 11/c + 5.5/c = 16.5/c ✓.\n  - So per zero: ≤ 2·log(16.5/c_clear). Near zeros: |γ − T| < 1 — that's a two-unit window at T ⟹ mult-count ≤ Z2hat T (ZeroCountProp2). Total near-integral ≤ 2·Z2hat T·log(16.5/c_clear) =: NI(T).\n  - Which zeros are \"near\" in the tight R-bound? nearZeros t — need the exact definition. From 5f: nearZeros s₀ or nearZeros t: zeros with |γ − t| < 1? and the capstone gives the R-bound with that near set. The nearZerosSub in LiTightR. Let me check.\n- So mid horizontal ≤ (e⁴+1)·[NI(T) + 5.5·(10.5 log(T+2) + 48)].\n- Then the pinch: NI(T) + 5.5·(10.5 log(T+2)+48) ≤ 7·Hhat T. Hhat T = 3·C0hat T² + 10.5 log(T+2) + 48. So need 2·Z2hat T·log(16.5·9·Ĉ₀(√n+2)) + 5.5·(10.5 log(T+2)+48) ≤ 7·(3Ĉ₀(T)² + 10.5 log(T+2) + 48) = 21Ĉ₀² + 7·(10.5 log + 48). Since 5.5 ≤ 7 on the (10.5 log + 48) part, the crux is 2·Z2hat T·log(148.5·Ĉ₀(√n+2)) ≤ 21·Ĉ₀(T)². With T ∈ [√n, √n+1]: Ĉ₀(T) vs Ĉ₀(√n+2) comparable; Z2hat ~ 0.6L + 0.886LL + 2.7 vs Ĉ₀² ~ (0.433L)² ≈ 0.187L². log(148.5·Ĉ₀) ~ log(148.5·0.433·L) ~ LL + const. So LHS ~ 2·(0.6L)·(LL + c) ~ 1.2·L·LL vs RHS ~ 21·0.187·L² ≈ 3.9·L². Fits with huge margin for large L; the base case L = log(√10⁵+1) ≈ 5.86: need certified endpoint + monotonicity. This is the pinch-lemma-pattern real-analytic comparison (6-d? or 6-c?). D-071 says ii′-6-d = the fold incl. the horizontal pinch. But the per-piece fits might be in 6-c. Let me plan: 6-c proves the four side bounds in the form ≤ [charged expressions], 6-d does the comparisons + final assembly.\n\nHmm, actually, wait. Let me reconsider — Bn charges 2(e⁴+1)(7Ĥ) for BOTH horizontals' mid parts + 2·DogLegRight(n) for both right tails. So per horizontal: mid ≤ (e⁴+1)·[NI + 5.5(10.5 log + 48)] ≤ (e⁴+1)·7Ĥ [the pinch] and right tail ≤ DogLegRight [DL-5]. Total horizontal: 2(e⁴+1)(7Ĥ) + 2·DogLegRight ✓.\n\n**6-c-iii: I_I (right vertical σ₁ = 2√n)**\n- VIntegral (Jlag n) (2√n) (−T) T — length 2T.\n- Kernel ≤ e^{√n/2}+1: kFun_shift_norm_le_exp_sqrt_half_add_one (2√n ≤ re s ✓; also needs n ≤ im²?? from ii′-4: \"right vertical, 2√n ≤ re s\" — for t ∈ [−T, T], the kernel bound might need something about im. Let me check the exact signature. From LiDogLeg DL-4: `kFun_right_vertical_norm_le_exp_sqrt_half_add_one {n} {t} (hn : 16 ≤ n) (ht : |t| ≤ ...)`? Let me check.\n- Zeta ≤ 0.57·2^{−(2√n−2)}: norm_logDeriv_zeta_le_iimZeta (n ≥ 5, any t). ✓\n- So ‖I_I‖ ≤ 2T·(e^{√n/2}+1)·0.57·2^{−(2√n−2)} ≤ 2(√n+1)(e^{√n/2}+1)·0.57·2^{−(2√n−2)} = IIMaj n (since T ≤ √n+1). ✓ Bn charge.\n\nWait — IIMaj n = 2(√n+1)(e^{√n/2}+1)·0.57·2^{−(2√n−2)} exactly. ✓\n\n**6-c-iv: triv** — already in the bridge (+1). ✓ Done in 6-b.\n\n**6-d: the fold** — RectangleIntegral' = (2πi)⁻¹•RectangleIntegral ⟹ norm ≤ (1/(2π))·‖RectangleIntegral‖... wait: RectangleIntegral' = (1/(2πi))•RectangleIntegral, ‖(1/(2πi))‖ = 1/(2π) < 1, so ‖RectInt'‖ ≤ ‖RectInt‖ ≤ sum of side norms (RectangleIntegral = sum of 4 side integrals with signs). Then |Sf n| ≤ [sum of 4 side bounds] + [4FAlt + 1] ≤ Bn − 4FAlt... wait Bn = 4F + [4T((2/3)Z2 + 10.5 log + 48) + 40·1.3352 + 2(e⁴+1)(7Ĥ) + 2·DogLegRight + IIMaj + 1]. And sides: I_III ≤ 4T((2/3)Z2hat + 10.5 log + 48) + 40·1.3352 ✓, horizontals ≤ 2(e⁴+1)(7Ĥ) + 2·DogLegRight ✓, I_I ≤ IIMaj ✓, bridge ≤ 4FAlt + 1 ✓. Sum = Bn exactly. \n\nOne wrinkle: ‖RectangleIntegral'‖ = ‖(1/(2πi))•RectangleIntegral‖ = (1/(2π))·‖RectangleIntegral‖ ≤ ‖RectangleIntegral‖ — need 1/(2π) ≤ 1. Fine.\n\nAlso the horizontal at height −T: the rectangle's bottom is at im = −T. The mid part [−5/2, 3] at −T by the conj symmetry (Jlag_conj — but wait, the tight R-bound at height −T: the capstone is stated for t ≥ 10 positive presumably. For −T use conj symmetry of logDeriv (logDeriv_zeta_conj or similar) or the capstone at T applied to conj s. DL-5 did exactly this for the dog-leg via intervalIntegral_conj. For the mid part the same trick: HIntegral at −T = conj of HIntegral at T (Jlag_conj) ⟹ same norm. So the near-sum integral machine only needs to be built at +T. \n\nNow — the near-sum integral machine is the long pole. Components:\n(a) The tight R-bound: logDeriv ζ s = near-sum + R(s), ‖R‖ ≤ 10.5 log(|t|+2) + 48 — capstone exists (5f).\n(b) ∫_{−5/2}^{3} ‖R(σ+iT)‖ dσ ≤ 5.5·(10.5 log(T+2)+48) — immediate (interval length × sup bound; norm_integral_le_of_norm_le_const or intervalIntegral.integral_of... the standard machine).\n(c) ∫_{−5/2}^{3} ‖Σ_{near} m/(s−ρ)‖ dσ ≤ Σ m·∫ dσ/‖s−ρ‖ — swap sum/integral (finite sum ✓ intervalIntegral.integral_finset_sum or similar), then per-zero integral bound via asinh.\n\nThe per-zero integral: ∫_{−5/2}^{3} dσ/‖(σ+iT) − (β+iγ)‖ = ∫ dσ/√((σ−β)² + (T−γ)²). In Lean: this is a real integral of 1/√((σ−β)²+δ²). The antiderivative is asinh((σ−β)/δ) = log((σ−β) + √((σ−β)²+δ²)) − log δ. Mathlib has Real.arcsinh? There is `Real.arcsinh` in Mathlib (yes, Real.arcsinh exists) and its derivative: deriv arcsinh x = 1/√(x²+1) — `Real.deriv_arcsinh`? There might be hasDerivAt arcsinh. Alternatively avoid asinh entirely: bound the integral directly without the antiderivative:\n∫_{−5/2}^{3} dσ/√((σ−β)²+δ²) — split at β: ∫_{|σ−β| ≤ δ} ≤ 2δ/δ = 2; ∫_{δ ≤ |σ−β|} dσ/|σ−β| ≤ 2·log(5.5/δ)... hmm that's ≤ 2 + 2·log(5.5/δ) = 2 + 2·log(5.5) + 2·log(1/δ) ≤ 2·log(16.5/c)? 2 + 2 log(5.5/δ) vs 2 log(16.5/δ) = 2 log(5.5/δ) + 2 log 3. Since 2 ≤ 2 log 3 ✓. So the crude split bound 2 + 2·log(5.5/δ) ≤ 2·log(3·5.5/δ) = 2·log(16.5/δ) ✓ — NO asinh needed! Just: near part (|σ−β| ≤ δ): integrand ≤ 1/δ over length ≤ 2δ ⟹ ≤ 2. Far part: integrand ≤ 1/|σ−β|, integral over [−5/2,3]∩{|σ−β| ≥ δ} ≤ 2·∫_{δ}^{5.5} dx/x = 2·log(5.5/δ). \n\nIn Lean, though, integrating 1/|σ−β| needs the log antiderivative anyway — ∫_δ^{5.5} dx/x = log(5.5) − log(δ). That's `integral_one_div` or FTC with Real.log. Manageable: intervalIntegral with the split at β (if β ∈ [−5/2, 3]; β ∈ (0,1) always for nontrivial zeros ✓ so β is interior). \n\nAlternatively — an even simpler route avoiding the antiderivative: the comparison ∫_{|σ−β|≥δ, σ∈[−5/2,3]} dσ/|σ−β| ≤ ∫_{δ}^{5.5} 2dx/x via monotonicity + the substitution... the substitution in Lean is annoying. FTC on each side: ∫_{β+δ}^{3} dσ/(σ−β) = log(3−β) − log δ ≤ log 5.5 − log δ. FTC for 1/x: `intervalIntegral.integral_one_div` exists? There's `integral_one_div` (for [a,b] with 0 ∉ [a,b]): ∫ x⁻¹ = log b − log a or log|b| − log|a|. Let me plan for that.\n\nActually — simpler still: use the asinh form? Mathlib: `Real.arcsinh : ℝ → ℝ` exists (Real.arcsinh x = log (x + sqrt (x^2 + 1))). deriv: `Real.deriv_arcsinh : deriv Real.arcsinh x = 1 / sqrt (x^2 + 1)`? There's `Real.hasDerivAt_arcsinh`? I recall Mathlib has Real.arcsinh with hasDerivAt. But the D-071 design uses the asinh bound 2·asinh(5.5/δ) ≤ 2·log(16.5/c). Either way works. The crude split avoids asinh but needs the 1/x FTC. Both are standard. I'll decide during implementation — probably the split route (2 + 2·log(5.5/δ) ≤ 2·log(16.5/δ)) since log-FTC is more robust in Mathlib than arcsinh.\n\nHmm wait — actually even simpler: bound ∫ dσ/√((σ−β)²+δ²) ≤ ∫ dσ·min(1/δ, 1/|σ−β|)... same thing. OK.\n\n(d) The near-zero mult-count: Σ_{ρ ∈ nearZeros(T)} mult ≤ Z2hat T. nearZeros definition — from LiDisc/LiTightR: `nearZeros t` probably = nontrivial zeros with |γ − t| < 1 as a Finset. ZeroCountProp2 statement: the two-unit count ≤ 0.6L + 0.886LL + 2.7 = Z2hat. Need: nearZeros T's mult-sum ≤ Z2hat T. ZeroCountProp2 is stated in which form? \"the two-unit specialization\" — need to check its exact statement to bridge nearZeros ⊆ its window.\n\nAlso: the tight capstone's near set — `nearZerosSub`? The capstone: logDeriv_riemannZeta_sub_nearZeros_le_tight (hZC) (hZC2) (hNLZ): ‖logDeriv riemannZeta s − ∑ ρ ∈ nearZeros t, (zeroMult ρ : ℂ)/(s − ρ)‖ ≤ 10.5*log(t+2) + 48. Need exact signature: σ range, t range (t ≥ 10), near set.\n\nLet me now grep those signatures. Also ZeroCountProp2's statement and nearZeros def.","signature":""},{"type":"text","text":"Now checking the remaining signatures: the 5f tight capstone, `nearZeros`, `ZeroCountProp2`, and the Zeta23 `RectangleIntegral` side decomposition."},{"type":"tool_use","id":"Grep_17","name":"Grep","input":{"pattern":"theorem logDeriv_riemannZeta_sub_nearZeros_le_tight|def nearZeros|def ZeroCountProp2|theorem nearSum|nearZeros_count","path":"D:\\Python\\Quantum\\research\\lean\\NguyenRH1\\NguyenRH1","output_mode":"content","-n":true,"-A":12,"head_limit":120},"extra_content":null}]