Siegel's theorem on L(1, χ) for real Dirichlet characters
Source: github.com/jtraverso/siegel-theorem/tree/dbe9353374a11317bd…
A Lean 4 / Mathlib proof of Siegel's theorem (1935): for every ε > 0 there is c > 0 with c·N^(-ε) ≤ ‖L(1, χ)‖ for every real non-principal Dirichlet character χ modulo N (SiegelThm.siegel, with Mathlib's DirichletCharacter.LFunction; χ need not be primitive). The proof is Goldfeld's (1974): F = ζ·L(χ₁)L(χ₂)L(χ₁χ₂) has non-negative Dirichlet coefficients with a₁ = 1; its regular part G = F − λ/(s−1) is expanded in a Taylor series at s = 2, with Cauchy's estimate on the circle |s−2| = 3/2 (where |G| ≤ 4000 (N₁N₂)²), giving ‖λ‖ ≥ (1−β)/2 · (50000 (N₁N₂)²)^(−4(1−β)) whenever Re F(β) ≤ 0 and 7/8…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-12-000005
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000005/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-12-000005/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'