Skip to content

feat: prove LSeries_totient_eq (IK L1029 sorry closure, corrected hypothesis Re(s) > 2)#1437

Open
d0d1 wants to merge 2 commits into
AlexKontorovich:mainfrom
d0d1:fix/ik-lseries-totient-sorry
Open

feat: prove LSeries_totient_eq (IK L1029 sorry closure, corrected hypothesis Re(s) > 2)#1437
d0d1 wants to merge 2 commits into
AlexKontorovich:mainfrom
d0d1:fix/ik-lseries-totient-sorry

Conversation

@d0d1

@d0d1 d0d1 commented May 25, 2026

Copy link
Copy Markdown
Contributor

Summary

Closes the sorry at IwaniecKowalskiCh1.lean L1029 for LSeries_totient_eq.

Bug fix: incorrect hypothesis

The original statement has hypothesis (hs : 1 < s.re), which is mathematically incorrect. The Euler totient L-series:
629069L(\varphi, s) = \sum_{n=1}^{\infty} \frac{\varphi(n)}{n^s}629069
converges absolutely only for Re(s) > 2, not for Re(s) > 1. This is because $\varphi(n) \le n$, so bounding the terms by $n / n^{\mathrm{Re}(s)}$ requires $\mathrm{Re}(s) - 1 &gt; 1$. (The original hypothesis 1 < s.re is the convergence range for the Riemann zeta function, not for the totient L-series.)

In Lean, LSeries (↗totient) s = 0 when the series is not absolutely summable (since tsum of non-summable terms is 0), so the statement with 1 < s.re is false for Re(s) \in (1, 2].

Proof strategy

  1. Define a private helper totientAF : ArithmeticFunction ℂ wrapping Nat.totient
  2. Prove totientAF * ζ = powR 1 via the identity $\sum_{d \mid n} \varphi(d) = n$ (Nat.sum_totient)
  3. Establish LSeriesSummable (↗totientAF) s for Re(s) > 2 using LSeriesSummable_of_le_const_mul_rpow with bound Nat.totient_le
  4. Apply LSeries_mul', LSeries_powR_eq, LSeries_zeta_eq_riemannZeta to conclude

All helpers are private. No public API surface changed beyond the hypothesis strengthening.

d0d1 and others added 2 commits May 25, 2026 23:53
…othesis)

Close the sorry at IwaniecKowalskiCh1.lean L1029. The original hypothesis
`1 < s.re` is incorrect; the totient L-series converges absolutely only for
Re(s) > 2 (using φ(n) ≤ n to bound terms; average order ∑_{n≤x} φ(n) ~ 3x²/π²
establishes the abscissa of absolute convergence is 2). Lean's tsum returns 0
for non-summable series, so the original statement is false for Re(s) ∈ (1, 2].

Changes:
- Strengthen hypothesis to `2 < s.re`
- Add private helpers: totientAF, totientAF_apply, totientAF_mul_zeta_eq_powR1,
  lseriesSummable_totientAF (all private, no public API change)
- Replace sorry with a proof via: summability + convolution identity
  (totientAF * ζ = powR 1 via ∑_{d|n} φ(d) = n) + LSeries_powR_eq

Reviewed and approved by GPT 5.5 xhigh adversarial review.

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants