ZeroFreeAll from Green, VWin and HypsAlt
drafted
Statement
Assume three inputs. The Lean local name of each input is in parentheses.
- () The statement Green. For each prime , each label datum and each , the cuspidal characters of are in bijection with the monic irreducible polynomials of degree over with nonzero constant term, with the degree and an explicit value formula.
- () 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. The second parameter is the condition DefiniteSideCondition. By the definition Closed,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 ZeroFreeAll holds. By definition, ZeroFreeAll is ZeroFreeOn fun _ => True, and ZeroFreeOn Q says: for each primitive Dirichlet character with Q ฯ, satisfies ZeroFreeAbove (1/2). So ZeroFreeAll says the following. Let be a primitive Dirichlet character of modulus (a value of the structure PChar, which holds , the character and a proof that it is primitive). Then for each with , the Dirichlet L-function of Mathlib has .
Lean
theorem UpperTheory.Top.zero_free_all_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)) : Formalism.HC.ZeroFreeAll
The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/TopPlug.lean, line 12. Its page has the full list of what it uses and what uses it, and a link to the source.
Proof
The proof is one term with four parts.
- The hypothesis is a proof of
Nonempty (HypsAlt ...). The proof takes one record out of it withh.elim. This is bookkeeping:HypsAltis a type inType 1, and the goal is a proposition, so the elimination is allowed. - The theorem
shape_closed_link_n_of_greentakes and givesTopShapeAlt True True N TopG, with the same as in .TopShapeAlt V NR N Gis a long implication. It says: for each family class and about 50 named data and conditions on (a selection, bounds, closed bounds of the formClosed, a proof of , a proof of , and more), the proposition holds. - The theorem
forall_goal_of_shape_of_hypshas the typeTopShapeAlt V NR N G โ V โ NR โ HypsAlt N DefiniteSideCondition โ G. The proof applies it with and , the result of part 2,trivialtwice, and the record from part 1. The theorem passes the fields of the record into the slots ofTopShapeAlt. The result isTopG.TopGsays: for each and each requirement (a value ofFReq), ifHostExW ฮป G.reqholds and each family in the classG.cls ฮปsatisfiesHypV, then the classG.cls ฮปisFamilyClassConnected. - The theorem
zeroFreeAll_of_topGtakes a number with , a proof ofTopG, and for each primitive character a proof ofHostExW ฮป (GChi ฯ).req. It givesZeroFreeAll. The proof uses . The fact is closed bynorm_num. For each , the theoremsupplyChiturnshV ฯ, a proof ofVWinAt ฯ 401, intoHostExW (3/2) (GChi ฯ).req.
So the term is zeroFreeAll_of_topG (la := 3/2) _ (forall_goal_of_shape_of_hyps _ _ _ _ (shape_closed_link_n_of_green hG) trivial trivial h) (fun ฯ => supplyChi ฯ (hV ฯ)), inside h.elim. The theta matching chapter describes the proof of zeroFreeAll_of_topG, with the sums of the von Mangoldt function and the statement FormB.
Notes
The input is used only in part 2. Inside shape_closed_link_n_of_green, it goes into the lemma closed_linkIRR_of_join_count. So a statement on the characters of the finite groups enters the proof of a statement on Dirichlet L-functions only through that lemma. This page does not follow that link.
The two slots and of TopShapeAlt are the proposition True here. They are filled with trivial and carry no content.
The input is used only through supplyChi, at the fixed value .
ZeroFreeAll has no exception at . For the trivial character of modulus , is the Riemann zeta function. Mathlib gives it a value at the pole by a convention, and this value is not zero. The theta matching chapter says more on this point.
The user of this step is EveryCharacter from Green, VWin and HypsAlt, which applies the step imprimitive to the result.
Uses
- The statement Green, the step for
GlobalTheory.GLq.Green. - The window bound VWin, the step for
UpperTheory.Top.VWin. - 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.HC.ZeroFreeAll, Formalism.MainNotions.LinkN, GlobalTheory.Fc.forall_goal_of_shape_of_hyps, UpperTheory.Top.shape_closed_link_n_of_green, UpperTheory.Top.supplyChi, UpperTheory.Top.zeroFreeAll_of_topG.
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.