EveryCharacter from Green, VWin and HypsAlt
drafted
Statement
Assume three inputs. The Lean local name of each input is in parentheses.
- () The statement
GlobalTheory.GLq.Green. For each prime , each label datum and each , there is a map from polynomials over to complex functions on with three properties. For each prime label (a monic irreducible polynomial of degree with nonzero constant term), is a cuspidal character attached to and , and . The map is injective on prime labels. Each cuspidal character is for some prime label . - () The statement VWin, that is,
VWinAt ψ 401for each primitive Dirichlet character . - () A proof that the type
HypsAlt N DefiniteSideConditionis nonempty, where isClosed 𝒞 fun Fm _ => LinkN Fm.HypsAltis a record of 46 fields about a class of families, a selection of bundles and many bounds.Closed 𝒞 Pmeans: there is such that for each there are thresholds such that holds for each family of with parameter whose constants are above the thresholds.LinkNis a bound on a weighted count of twisted places.
Then EveryCharacter holds: for each , each Dirichlet character modulo and each with and ( or ), the Dirichlet L-function has .
Lean
theorem UpperTheory.Top.every_character_of_green_v_win (hG : GlobalTheory.GLq.Green) (hV : UpperTheory.Top.VWin) (h : Nonempty (_root_.GlobalTheory.Fc.HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) _root_.GlobalTheory.Fc.DefiniteSideCondition)) : UpperTheory.EveryCharacter
The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean, line 16. Its page has the full list of what it uses and what uses it, and a link to the source.
Proof
The proof has two steps.
Step 1. Primitive characters. The theorem zero_free_all_of_green_v_win takes , and and proves ZeroFreeAll. By definition, ZeroFreeAll is ZeroFreeOn fun _ => True. It says: for each primitive Dirichlet character (a value of the structure PChar, with a conductor ) and each with , . The theta matching chapter describes this proof. In short, it takes one record from . It turns into a large implication TopShapeAlt by shape_closed_link_n_of_green. It feeds the 46 fields of the record into that implication and gets the statement TopG. Then zeroFreeAll_of_topG with gives ZeroFreeAll, and supplies the hosts for each through supplyChi.
Step 2. All characters. The theorem imprimitive proves ZeroFreeAll → EveryCharacter. Let be a Dirichlet character modulo and let be the primitive character that induces , with conductor . Mathlib gives the Euler product relation
when or . This condition follows from the hypothesis or : if , then is the trivial character, since is the change of level of . The first factor is not zero by ZeroFreeAll, applied to . For each prime , and . So , and the factor is not zero. A product of nonzero numbers is not zero.
The Lean term is imprimitive (zero_free_all_of_green_v_win hG hV h).
Notes
The branch does not take any theta input. The inputs ThetaIntegralsAgree and LocalMatching reach this proof only inside the record . See EveryCharacter from theta integrals and local matching.
The statement Green is about the characters of the finite groups . The step from it to a statement on Dirichlet L-functions is inside shape_closed_link_n_of_green and the record HypsAlt. This page does not follow that link.
ZeroFreeAll has no exception at . For the trivial character modulo , is the Riemann zeta function, which has a pole at . In Mathlib the function DirichletCharacter.LFunction still has a value at , so the statement is well formed. This page does not check how the chain proves the case for the trivial character. The step imprimitive never needs that case. It applies ZeroFreeAll at only when , and then .
The step imprimitive is a complete and short argument from Mathlib facts. The weight of this branch is in zero_free_all_of_green_v_win.
Uses
- The statement EveryCharacter, the step for
UpperTheory.EveryCharacter. - The window bound VWin, the step for
UpperTheory.Top.VWin. - ZeroFreeAll from Green, VWin and HypsAlt, the step for
UpperTheory.Top.zero_free_all_of_green_v_win. - From primitive to all Dirichlet characters, the step for
UpperTheory.Top.imprimitive. - The statement Green, the step for
GlobalTheory.GLq.Green. - The predicate Closed on family classes, the step for
Formalism.MainNotions.Closed. - The definite side condition, the step for
GlobalTheory.Fc.DefiniteSideCondition. - The record HypsAlt, the step for
GlobalTheory.Fc.HypsAlt.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.MainNotions.LinkN.
Used by
Status
Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.
A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.
The source of this page. Markdown. Something is wrong? Report it.