EveryCharacter from theta integrals and local matching
drafted
Statement
Assume the following seven inputs. The Lean local name of each input is in parentheses.
- () A proof of
UnitaryGroupThirdPlaceHypotheses. This is a structure of 60 propositions. Most of them have names of published results on unitary groups and automorphic forms. - () A proof of
ThetaLocalInputs, a structure of 53 propositions with names of published results. - () A proof of
ThetaIntegralsAgree. For each admissible triple, two global theta integrals into the same unitary group are proportional, with one nonzero constant , when their test functions match. Two recursion laws relate the constants for spaces of sizes and . - () A proof of
LocalMatching. For each admissible triple, at each place the two local Weil representations have matched quotient maps onto one common irreducible representation of . - () A proof of
CovolumeBoundOfX, a bound namedL3for the families of the classFamHyp, in the "closed" sense (small , large constants). - () A proof of RecTExists. At each finite place of each number field there is a map from irreducible representations of to Weil and Deligne parameters with the laws
IsRecT. This is in the style of the local Langlands conjectures. - () A proof of VWin, that is,
VWinAt ψ 401for each primitive Dirichlet character .
Then EveryCharacter holds: for each , each Dirichlet character modulo and each with and ( or ), the Dirichlet L-function has .
Lean
theorem UpperTheory.Lit.every_character_of_theta_integrals_local_matching (P : _root_.GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses) (F : _root_.GlobalTheory.FunPr.ThetaLocalInputs) (hA : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree) (hM : GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching) (hX : _root_.GlobalTheory.CovTop.CovolumeBoundOfX) (hL : _root_.UpperTheory.Zero.LLC.RecTExists) (hV : VWin) : UpperTheory.EveryCharacter
The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/SiegelEisensteinSecondTermHypotheses.lean, line 69. 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. It applies EveryCharacter from Green, VWin and HypsAlt to three arguments.
- Green. The field
P.greenRegularCharactershas the typeGreenRegularCharacters. This is a statement in the style of Green's theorem on the cuspidal characters of , indexed by regular characters of . The theoremgreen_of_regularturns it into the statementGlobalTheory.GLq.Green, which indexes the cuspidal characters of by "prime labels". A prime label is a monic irreducible polynomial of degree over with a nonzero constant term. - VWin. The hypothesis , with no change.
- A record of
HypsAlt. The theorem HypsAlt is nonempty from the closed bound takes , , , , , and one more hypothesis: for each real , the statementLinkedAt (parametersOfDependence hL cDep) (...)with the closed boundBoundAtTwoThreeFamilyFonAlt. The proof supplies this last hypothesis as a function of . For each it appliesboundAtTwoThree_linked_of_recTto the fieldP.nLinkand to the parametersparametersOfDependence hL cDep. The result isNonempty (HypsAlt S0.NL DefiniteSideCondition).
The step EveryCharacter from Green, VWin and HypsAlt asks for Nonempty (HypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DefiniteSideCondition). The definition of S0.NL is fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm. So the two types are equal by unfolding, and Lean accepts the term with no conversion step.
Notes
The theorem is named after the theta inputs and . In this proof they go only into HypsAlt is nonempty from the closed bound. The branch EveryCharacter from Green, VWin and HypsAlt does not take them.
The input is not used here. It is passed on to the branch.
Of the 60 fields of , this proof reads two by name: greenRegularCharacters and nLink. The other fields reach the proof only through the step HypsAlt is nonempty from the closed bound, which takes all of .
The field greenRegularCharacters is not an open assumption in the final proof. The only caller fills it, through the bundle published_results_eigen, with green_regular_characters_of_literature, which cites the theorem PositivityTheory.Stage1.PM.greenRegularCharacters. The field nLink has the type NLink.Hypotheses₂, a structure of seven named results (Fontaine , global Artin reciprocity, Bloch and Kato, local Tate duality, local Euler characteristic, local finiteness, Bhatt and Scholze).
The theta matching chapter unfolds ThetaIntegralsAgree and LocalMatching. The unitary hypotheses chapter follows the record HypsAlt.
Uses
- EveryCharacter from Green, VWin and HypsAlt, the step for
UpperTheory.Top.every_character_of_green_v_win. - HypsAlt is nonempty from the closed bound, the step for
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound. - The statement EveryCharacter, the step for
UpperTheory.EveryCharacter. - The window bound VWin, the step for
UpperTheory.Top.VWin. - The statement RecTExists, the step for
UpperTheory.Zero.LLC.RecTExists. - The statement ThetaIntegralsAgree, the step for
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree. - The statement LocalMatching, the step for
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching. - Green from regular characters, the step for
GlobalTheory.GreenBridge.green_of_regular. - The record UnitaryGroupThirdPlaceHypotheses, the step for
GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses. - The record ThetaLocalInputs, the step for
GlobalTheory.FunPr.ThetaLocalInputs. - The covolume bound CovolumeBoundOfX, the step for
GlobalTheory.CovTop.CovolumeBoundOfX.
The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.Mem.Top.Bl.parametersOfDependence.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: UpperTheory.N.boundAtTwoThree_linked_of_recT.
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.