From the row statement to every character
The Lean code proves EveryCharacter from one statement, Row0b. This page says what Row0b, VWin, RecTExists and OpenLiteratureStatements state, how the chain uses them, and which chapter proves each input.
draft
Result
Let , let be a Dirichlet character modulo , and let be its Dirichlet L-function. The overview calls the statement below EveryCharacter:
This page is about one theorem of the Lean code:
Here is a statement about -adic Galois representations attached to cuspidal automorphic representations of over CM fields. The Lean code proves it in a separate theorem, galoisLocalGlobalStrong_recParameter. The two theorems together give everyCharacter.
Idea
The theorem everyCharacter is one line. It applies everyCharacter_of_row to a proof of Row0b. All the work is below these two names.
The theorem everyCharacter_of_row takes one hypothesis , a proof of . It uses two times.
- It builds a value of the structure
OpenLiteratureStatements. This structure has three fields. Two fields are itself. The third field isRecTExists, which says that a local Langlands map with a list of properties exists at each place of each number field. The theoremrecTExistsproves it. - It gives to
vwin_of_row, which proves a statement calledVWin.VWinis a bound on lengths of Tate-Shafarevich type groups of certain abelian number fields. It is stated for every primitive Dirichlet character.
Then every_character_of_literature_of_vWin takes the structure and VWin and gives EveryCharacter. Its proof makes seven inputs from the structure and passes them to every_character_of_theta_integrals_local_matching. That theorem calls nonempty_hyps_definite_side_of_closed_bound, which shows that a certain type of hypotheses is not empty. Then every_character_of_green_v_win turns this, with VWin, into the statement that has no zero with for each primitive character . A last step passes from primitive characters to all characters.
So the trunk is a chain of five theorems. Each link is short. Each large input is a separate theorem with its own chapter.
Before you read
- Algebraic number field, place of a number field, and the completion at a place, which is a local field.
- Cuspidal representation of , and the local Langlands conjectures for .
- Galois representation and the Weil group of a local field.
- Cyclotomic field, Galois cohomology and the Tate-Shafarevich group.
- The Generalized Riemann hypothesis for Dirichlet L-functions.
Plan
everyCharacterapplieseveryCharacter_of_rowtogaloisLocalGlobalStrong_recParameter.everyCharacter_of_rowbuildsOpenLiteratureStatementsfrom andrecTExists, and getsVWinfromvwin_of_row h.every_character_of_literature_of_vWinturns the structure into seven inputs and calls the next theorem.every_character_of_theta_integrals_local_matchingmakes a nonempty type of hypotheses and callsevery_character_of_green_v_win.every_character_of_green_v_winproves the zero-free statement for primitive characters and then for all characters.
The steps
Step 1. The top line
theorem UpperTheory.FinalTheorems.everyCharacter : UpperTheory.EveryCharacter :=
UpperTheory.FinalTheorems.everyCharacter_of_row UpperTheory.Gal.Int.galoisLocalGlobalStrong_recParameter
The proof is a function application. The argument galoisLocalGlobalStrong_recParameter (RowSrc.lean#L6) has type Row0b recT. Here recT is the predicate fun h rc => IsRecT h rc (Development.lean#L18). This is the same predicate that everyCharacter_of_row asks for. The chapter The Galois row explains this proof.
Step 2. The hypothesis Row0b
Row0b takes a parameter Rc of type RecNotion. A RecNotion is a predicate on maps rc from isomorphism classes of irreducible smooth representations of (all together, the type IrrGL) to isomorphism classes of Weil-Deligne representations (the type WD h). Here is the completion of a number field at a finite place , and h : IsPlaceOver A w says that a valuation subring of an algebraic closure of lies over .
def Row0b : Prop :=
∀ (E Ω : Type) [Field E] [NumberField E] [IsCMField E] [Field Ω] [Algebra E Ω] [IsAlgClosure E Ω]
(l : ℕ) [Fact l.Prime] (ι : Qbar l ≃+* ℂ) (a : ℕ), 1 ≤ a →
∀ (π : CuspSub E a) (χ : HChar (maximalRealSubfield E)), (CG.mk π).IsRegAlg → GlobalTheory.ContraPair.PolarizedPair π χ →
∃ (r : G E Ω →* GL (Fin a) (Qbar l)) (wt : ℤ) (HT : (E →+* Qbar l) → Multiset ℤ), PropsB Rc π ι r wt HT
In words. Let be a CM number field with algebraic closure . Let be a prime, let , and let . Let be an irreducible space of cusp forms on over (the structure CuspSub). Let be a Hecke character of the maximal totally real subfield . Suppose that the infinity type of is regular algebraic (IsRegAlg). Suppose that is a polarized pair: at each infinite place of , and the dual of is the complex conjugate of up to a twist by (PolarizedPair, DualIsConjByOne.lean#L53). Then there are a homomorphism , an integer and a function from embeddings to multisets of integers, with the properties PropsB (WeightsConjBis.lean#L54).
The six fields of PropsB say this.
cont: is continuous.ss: is semisimple (IsSSRep).away: at each finite place not above , for each maprcwithRc h rcand each local component of at , the Weil-Deligne representation of at and the valuerc σsatisfyAwayB.AwayBsays that the two have the same dimension. It also says that they are equal under the conditionsTorandmono0, and that under further conditions (IsQpBig,TmW,Sqf) their characteristic polynomials agree on elements of degree 0.weights: for each , the multiset , read in , is , where runs over the infinitesimal character of at .weights_conj: , where is complex conjugation of .above: at places above , the conditions ofAboveB. They use the predicatesIsCrysAt,IsdRAt,IsPstAtandIsJumpsAton the restriction of to a decomposition group.
The page does not unfold Tor, mono0, TmW, Sqf, IsCrysAt, IsdRAt, IsPstAt or IsJumpsAt. The names point to crystalline, de Rham and potentially semistable conditions, but this page has not checked the definitions.
The trunk uses Row0b with Rc = IsRecT. The code also gives this instance a name:
def UpperTheory.One.M.Row : Prop := UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc
So One.M.Row and the type of the hypothesis of everyCharacter_of_row are the same proposition (RecT.lean#L6).
Step 3. The predicate IsRecT
def IsRecT (rc : IrrGL (w.adicCompletion E) → WD h) : Prop := ∃ a ha, LawsT (h := h) a ha rc
In words, IsRecT h rc says that there is a homomorphism from the Weil group at to , with the property IsLocalArtin, such that rc satisfies the laws LawsT (IsRecTOfIsRec.lean#L55). The laws are these.
dim:rcsends a representation of to a Weil-Deligne representation of dimension .one: on a smooth character of ,rcgives the character .langlands:rcis compatible with the Langlands classification by segments (IsL,segSum).cusp: a cuspidal class goes to an irreducible Weil-Deligne representation.nu: the twist by goes to the twistlpTw s.absCentral: the absolute value of the determinant ofrc xat equals , where is the central character of .twist,central,dual,inj,depth: compatibility with twists, central characters and contragredients, injectivity, and depth zero goes to tame. These five hold only for classes with the propertyGood.type: the lawTypeLaw, which fixes the inertia polynomial ofrcon some depth-zero cuspidal types over fields with .
The property Good x says that the cuspidal support of contains only characters, or twists of cuspidal representations with a nonzero vector fixed by the first congruence subgroup, over a field isomorphic to (IsRecTOfIsRec.lean#L20). So IsRecT is a list of properties of a local Langlands map for . The list does not ask for a bijection, and it does not mention -factors. The same file has a stronger predicate IsRec with an family, and the theorem isRecT_of_isRec shows that IsRec gives IsRecT (with the extra input DepthZeroTypeInertia).
Step 4. The structure and RecTExists
structure UpperTheory.LiteratureTheorems.OpenLiteratureStatements : Prop where
caraianiLocalGlobalDual : _root_.UpperTheory.One.M.Row
localLanglandsExists : _root_.UpperTheory.Zero.LLC.RecTExists
galoisRepOfPolarizedPairLit : _root_.UpperTheory.One.M.Row
The structure has three fields. The first and the third have the same type, One.M.Row, which is Row0b IsRecT. The second has type RecTExists:
def RecTExists : Prop :=
∀ (E Ω : Type) [Field E] [NumberField E] [Field Ω] [Algebra E Ω] [IsAlgClosure E Ω] (A : ValuationSubring Ω)
(w : HeightOneSpectrum (𝓞 E)) (h : IsPlaceOver A w), ∃ rc, IsRecT h rc
In words: for each number field , each algebraic closure , and each finite place with a valuation subring over it, there is a map rc with IsRecT h rc.
The field names refer to the literature (a local-global result with the name Caraiani, the existence of local Langlands, and Galois representations of polarized pairs). The Lean types are the ones above. This page does not claim that a published theorem has exactly these statements. In the Lean code, no field is an axiom. The theorem everyCharacter_of_row fills all three fields with proofs:
theorem UpperTheory.FinalTheorems.everyCharacter_of_row (h : UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc) : UpperTheory.EveryCharacter :=
UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin ⟨h, UpperTheory.Zero.LLC.recTExists, h⟩ (UpperTheory.One.vwin_of_row h)
The anonymous constructor ⟨h, recTExists, h⟩ puts in the first and third fields.
The theorem recTExists (RecTExists.lean#L20) proves RecTExists. The Lean proof does this. It takes a local Artin map from artEx. It takes a map r on cuspidal classes from cuspEx. It extends r to all classes with exists_isLExt, through the Langlands classification. Then it checks each law of LawsT with the lemmas extDim, extTw, extDual, extInj, extDepth and typeIff. Its dependency closure has 11,316 declarations, which is small for this proof. This page does not go below it. No later chapter in the list above covers it in detail.
Step 5. The statement VWin
def VWin : Prop := ∀ ψ : PChar, VWinAt ψ 401
A PChar is a primitive Dirichlet character modulo some . VWinAt ψ Ct (ExistsPageN.lean#L44) unfolds as follows. Let . Let satisfy for . Then there are and such that for each and each pair of numbers with WinPair ε (X^(1/J)) q d, there is with and , and for each the statement VAt ψ ε Ct q d (e x) x holds.
WinPair ε Y q d says: is a prime with and ; is a prime with and ; ; and each odd prime divides .
VAt ψ ε Ct q d e x says: for each number field with IsChiField ψ e q d E, the bound VVle E ⌊x^Ct⌋ (√(exp(x^ε))) holds. IsChiField says that embeds in a cyclotomic field with , the modulus of , and all dividing , and that is the fixed field of the classes with , , and .
VVle E t B (ExistsPageN.lean#L12) says: for each algebraic closure and each choice of data LData E Ω p for each prime , the lengths are finite for , and for each finite set of primes
Here is the submodule Sha D e' of of with the action through the -th power of a character chi of a Galois group unramified outside the places above . The field hchi of LData ties chi to the map cycZ. The page does not unfold Sha1, cycZ or locFam.
The theorem vwin_of_row proves VWin from :
theorem UpperTheory.One.vwin_of_row (h : UpperTheory.GalStar.Row0b fun h rc => UpperTheory.Zero.LLC.IsRecT h rc) : UpperTheory.Top.VWin :=
UpperTheory.One.Join.automorphic_window_of_inputs (UpperTheory.LiteratureTheorems.OpenImageCondition.mk h) UpperTheory.BaseChangeIdentities.baseChangeN h
It wraps as an OpenImageCondition, adds the theorem baseChangeN, and calls automorphic_window_of_inputs. The chapter The window statement explains it.
Step 6. From the structure to seven inputs
theorem UpperTheory.LiteratureTheorems.every_character_of_literature_of_vWin (O : OpenLiteratureStatements) (hV : UpperTheory.Top.VWin) : UpperTheory.EveryCharacter
The proof (shortened here) is one application of every_character_of_theta_integrals_local_matching to seven arguments:
P := published_results_eigen O, of typeUnitaryGroupThirdPlaceHypotheses;F := published_results_first O, of typeThetaLocalInputs;hAandhM, the two parts oftheta_integrals_agree_and_local_matching_of_literature O, of typesThetaIntegralsAgreeandLocalMatching;hX, of typeCovolumeBoundOfX, fromtopCovolSlim2_use_alt_altapplied to fifteen theorems;hL := local_langlands_gl_recT_exists_of_literature O, of typeRecTExists;hV, which isVWin.
The file has many helper theorems of the form NAME_of_literature (O : OpenLiteratureStatements) : T. Most of them do not use O. They are theorems of the Lean code with an unused argument. Only four places in the file read a field of O: O.localLanglandsExists (line 284), O.galoisRepOfPolarizedPairLit (line 286), and O.caraianiLocalGlobalDual (lines 460 and 618). So all three fields reach the seven inputs. The chapter The literature structure follows these paths, and explains topCovolSlim2_use_alt_alt and theta_integrals_agree_and_local_matching_of_literature.
Step 7. From the seven inputs to EveryCharacter
theorem every_character_of_theta_integrals_local_matching (P : UnitaryGroupThirdPlaceHypotheses) (F : ThetaLocalInputs) (hA : ThetaIntegralsAgree)
(hM : LocalMatching) (hX : CovolumeBoundOfX) (hL : RecTExists) (hV : VWin) :
UpperTheory.EveryCharacter :=
every_character_of_green_v_win (green_of_regular P.greenRegularCharacters) hV
(nonempty_hyps_definite_side_of_closed_bound P F hA hM hX hL fun cDep => boundAtTwoThree_linked_of_recT P.nLink (parametersOfDependence hL cDep))
(Namespaces are cut here; the full text is at SiegelEisensteinSecondTermHypotheses.lean#L69.) The proof makes three things.
- A proof of
Greenfrom the fieldgreenRegularCharactersofP. - For each real number
cDep, a linking condition, from the fieldnLinkofP. - With these,
nonempty_hyps_definite_side_of_closed_boundgives a value of typeNonempty (HypsAlt S0.NL DefiniteSideCondition).
Then every_character_of_green_v_win (TopPlug.lean#L16) uses Green, VWin and the nonempty type. It first proves ZeroFreeAll: for each primitive character and each with , . Here VWin enters character by character, as supplyChi ψ (hV ψ). Then UpperTheory.Top.imprimitive (Imprimitive.lean#L5) passes from to an arbitrary character through the primitive character that induces . The chapter Theta integrals and local matching explains these two theorems.
The theorem nonempty_hyps_definite_side_of_closed_bound (SiegelEisensteinSecondTermHypotheses.lean#L44) has the same six inputs and the linking condition. Its tactic proof builds a list of intermediate facts (separation of functionals, a rationality statement RowRat, a Fourier coefficient fit, two grid constants CF0 and CF1, and open and linked parameter statements). It ends with hypotheses_nonempty_of_unramified_exponents_alt. The chapter The unitary hypotheses explains it.
Where it is in the code
All paths are relative to lean/src. "Closure" is the number of declarations that the name uses, directly or not (rh graph -count closure). "Dominated" is the size from the spine data: the number of declarations that the proof reaches only through this name. The page gives it where the spine data lists it.
| Declaration | Module | Closure | Dominated |
|---|---|---|---|
FinalTheorems.everyCharacter |
MainConclusion.lean#L10 | 757,477 | |
FinalTheorems.everyCharacter_of_row |
MainConclusion.lean#L7 | ||
Gal.Int.galoisLocalGlobalStrong_recParameter |
RowSrc.lean#L6 | 181,653 | 51,591 |
GalStar.Row0b |
WeightsConjBis.lean#L69 | 707 | |
Zero.LLC.IsRecT, RecTExists |
IsRecTOfIsRec.lean#L76 | 152 (RecTExists) |
|
Zero.LLC.recTExists |
RecTExists.lean#L20 | 11,316 | |
One.vwin_of_row |
VwinOfRow.lean#L4 | 164,523 | 55,805 |
Top.VWin |
ExistsPageN.lean#L49 | 38 | |
LiteratureTheorems.OpenLiteratureStatements |
EveryCharacterOfLiteratureOfVWin.lean#L215 | ||
LiteratureTheorems.every_character_of_literature_of_vWin |
EveryCharacterOfLiteratureOfVWin.lean#L810 | 634,302 | |
SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt |
TopCovolSlim2Use.lean#L16 | 147,778 | 52,186 |
LiteratureTheorems.theta_integrals_agree_and_local_matching_of_literature |
EveryCharacterOfLiteratureOfVWin.lean#L565 | 38,926 | 8,520 |
Lit.every_character_of_theta_integrals_local_matching |
SiegelEisensteinSecondTermHypotheses.lean#L69 | 452,823 | |
Lit.nonempty_hyps_definite_side_of_closed_bound |
SiegelEisensteinSecondTermHypotheses.lean#L44 | 440,406 | |
Top.every_character_of_green_v_win |
TopPlug.lean#L16 | 50,160 | 12,070 |
The whole proof of riemannHypothesis has 757,483 declarations in its closure. The spine data puts eight names on the trunk, from riemannHypothesis down to nonempty_hyps_definite_side_of_closed_bound. The largest single branch below the trunk is hypotheses_nonempty_of_unramified_exponents_alt, with 88,131 dominated declarations.
Notes
everyCharacter_of_rowhas one real hypothesis, . The other ingredient,RecTExists, is a theorem. So the nameOpenLiteratureStatementsdoes not mean that the statements are open in the Lean code. All three fields get proofs.- The structure has two fields with the same type. The Lean code fills both with the same proof . The two names point to two different sources in the literature, but in Lean they are one proposition.
- This page does not check that
Row0bmatches a published theorem. The namescaraianiLocalGlobalDualandgaloisRepOfPolarizedPairLitrefer to the literature. The Lean statement is the one in Step 2, with the conditionsAwayBandAboveBin the special form of this code. IsRecTis weaker than a full local Langlands correspondence in some ways. Several laws hold only on the classGood, there is no surjectivity, and there are no -factors. The page does not say whether this matters for the proof.- The page does not unfold
Tor,mono0,TmW,Sqf,IsCrysAt,IsdRAt,IsPstAt,IsJumpsAt,Sha1,cycZ,locFam,IsLocalArtin,TypeLawin full,Green,HypsAlt,DefiniteSideCondition,S0.NL,UnitaryGroupThirdPlaceHypotheses,ThetaLocalInputs,ThetaIntegralsAgree,LocalMatchingandCovolumeBoundOfX. Later chapters must unfold the ones they use. - The type that
nonempty_hyps_definite_side_of_closed_boundgives is writtenHypsAlt S0.NL DefiniteSideCondition. The type thatevery_character_of_green_v_winasks for is writtenHypsAlt (fun 𝒞 => Closed 𝒞 fun Fm _ => LinkN Fm) DefiniteSideCondition. Lean accepts the proof, so the two types are equal by definition. The page has not unfoldedS0.NLto see this. - The constant 401 in
VWinand the bound come from the code. The page does not explain where they come from. - The closure and dominator counts come from the syntactic graph tool
rh graphand the spine data. They count declarations, not lines.
The source of this page. Markdown. Something is wrong? Report it.