Rademacher's convexity bound for primitive Dirichlet -functions
ProvedQRHLittlewood.rademacher_convexityLet be a primitive Dirichlet character modulo and let be a complex number with . Then
It interpolates between the trivial bound on and the bound on given by the functional equation.
import Mathlib.NumberTheory.Harmonic.EulerMascheroni import Mathlib.NumberTheory.LSeries.DirichletContinuation open Real
namespace QRHLittlewood
theorem rademacher_convexity (q : ℕ) [NeZero q] (hq : 3 ≤ q) (χ : DirichletCharacter ℂ q) (hprim : χ.IsPrimitive)
(s : ℂ) (hs1 : -1 / 2 ≤ s.re) (hs2 : s.re ≤ 3 / 2) :
‖DirichletCharacter.LFunction χ s‖ ≤
(riemannZeta (3 / 2)).re * ((q : ℝ) * ‖1 + s‖ / (2 * π)) ^ ((3 / 2 - s.re) / 2) := by sorry
end QRHLittlewoodRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. Let be a natural number with and . Let be a primitive -valued Dirichlet character modulo (conductor exactly ). Let with
Then
where is the complex modulus and enters as the real part of Mathlib's (which is real).
Here is Mathlib's Dirichlet -function: the unique meromorphic continuation to all of of (built from Hurwitz zeta functions); it is a total function , and at a pole (only possible at for the trivial character) it returns a fixed finite junk value. "Primitive" means the conductor of (the least through which factors) equals . "Real-valued" means for every residue class , including non-units (where anyway).
Edge cases and scope.
- No reality assumption on : the statement covers every primitive character modulo , both even and odd, real or complex.
- Since and is primitive, is nontrivial, so is entire and the value at (which lies in the strip) is genuine.
- The base is a nonnegative real; since , it is strictly positive. The exponent lies in ; it equals at , where the bound reads , and equals at .
- The bound uses (not or ) and the closed strip, both endpoints included. There is no zero-free or other analytic hypothesis.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.