The window bound VWin
The Lean code proves VWin from the row hypothesis Row0b. VWin bounds a weighted sum of lengths of Tate-Shafarevich groups over fields cut out by a primitive character and two auxiliary primes. This page says what VWin states and how the 55,805 declarations below vwin_of_row are put together.
draft
Result
This chapter is one branch of the trunk. The theorem everyCharacter_of_row (MainConclusion.lean#L7) needs two things from the row hypothesis: a structure of literature statements, and the statement VWin. This branch gives VWin.
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
In words: if the row hypothesis Row0b holds (for local parameters that satisfy IsRecT), then VWin holds. The Galois row chapter explains Row0b. The rest of this section says what VWin states.
Fix notation. A PChar is a primitive Dirichlet character of some conductor . For an odd prime , a number field and an integer , let be continuous Galois cohomology of the Galois group that the code calls GS (attached to the finite set of places of above ), with coefficients twisted by . Here is a character to whose pullback to the absolute Galois group is the -adic cyclotomic character. The code takes the Tate-Shafarevich submodule Sha D e of this (classes that are locally trivial at the chosen places in ), and shaLen D e is its length as a -module, a value in . Write for it.
The statement VVle E t B (ExistsPageN.lean#L12) says: for each choice of these data, for each prime and , and for each finite set of primes
The statement IsChiField ψ e q d E says that embeds in a cyclotomic field with , as the fixed field of the classes with , and Jacobi symbols .
The statement WinPair ε Y q d says: and are primes, , , , , , and each odd prime divides .
def VWinAt (ψ : PChar) (Ct : ℝ) : Prop :=
∀ eps : ℝ, 0 < eps → eps < 1 / 52 → ∀ e : ℝ → ℕ, (∀ x ≥ (1 : ℝ), PageN eps x (e x)) →
∃ J : ℝ, 1 ≤ J ∧ ∃ X0 : ℝ, ∀ X ≥ X0, ∀ q d : ℕ, WinPair eps (X ^ (1 / J)) q d →
∃ Y : ℝ, X ^ (1 / J) ≤ Y ∧ Y ^ (2 : ℝ) ≤ X ∧ ∀ x : ℝ, Y ≤ x → x ≤ Y ^ (2 : ℝ) → VAt ψ eps Ct q d (e x) x
def VWin : Prop := ∀ ψ : PChar, VWinAt ψ 401
So VWin states this. Let be a primitive character, let , and let be any integer function with for (this is PageN). Then there are and such that for each and each pair with WinPair ε (X^{1/J}) q d, there is with such that for every and every field with IsChiField ψ (e x) q d E:
and each length in the sum is finite.
Idea
The proof of vwin_of_row has two layers.
The top layer is bookkeeping. The row hypothesis is placed in a structure OpenImageCondition. A long list of named statements is then produced, each one by a theorem of the Lean code. The names refer to results in the literature (Bernstein-Zelevinsky, Jacquet-Shalika, Poitou-Tate, Serre-Tate and others). The statements are packed into the structure LiteratureRankNHypothesis and then into a larger structure HypothesesH'. The literature chapter is the place for those statements.
The lower layer is a counting argument. The code splits the length into three parts: the prime , and for odd the and eigenspaces of complex conjugation (shaLen_eq_add). Each part gets its own bound (ThmBab, ThmBcFree, and ThmHV). The bound for the "plus" part comes from a case split. For a host datum (a character , an exponent and two primes ) and a Dirichlet character of the host modulus, a prime falls in one of the cases I, II, III, IV, V or Z. Each case has a statement CountI, ..., CountZ that bounds a Selmer-type length polynomially in , the modulus and . The largest sub-branches of the tree prove these case bounds. They go through Galois representations of dimensions 2, 3 and 4: Kato-type vanishing for two-dimensional representations (case I), symplectic four-dimensional automorphy (cases II and III), unitary three-dimensional automorphy (case V), and a Hida-theory threshold statement.
Before you read
- Dirichlet characters, primitive characters and conductors.
- Cyclotomic fields and their subfields as fixed fields of subgroups of .
- Jacobi symbol.
- p-adic numbers and the cyclotomic character.
- Galois cohomology and the Tate-Shafarevich group.
- Length of a module.
- Galois representations, for the sub-branches.
Plan
vwin_of_rowwraps the row asOpenImageConditionand callsautomorphic_window_of_inputswith a base change theorem.automorphic_window_of_inputsbuilds the CM and abelian variety inputs and callsv_window_of_depth_zero_residual_bc_cm.v_window_of_depth_zero_residual_bc_cmpacks four groups of inputs intoLiteratureRankNHypothesisand callsv_window_of_literal_automorphy_n.v_window_of_automorphy_csd_ss_mono_oddextends this toHypothesesH'and callsvwin_of_hypotheses_H_E_alt.vwin_of_hypotheses_H_E_altprovesLemmaKand the four countsCountI,CountII,CountIII,CountV.of_four_altaddsThmBab,ThmBcFreeandCountZ, and callsvwin_of_counts.vwin_of_countscombines all bounds intoJointWin 401and then intoVWin.
The steps
Step 1. The entry point
vwin_of_row uses the hypothesis twice. It builds OpenImageCondition.mk h, a structure with one field galoisRepOfPolarizedPairLit : RowT (TemperedProductOfSquareIntegrable.lean#L207). Here RowT is by definition Row0b fun h rc => IsRecT h rc (WeakOfAtt.lean#L47), the same Prop as the type of . It also passes as the argument gal : RowT.
The third input is baseChangeN : BaseChangeIsobaricN (DefiniteNHolds.lean#L5). It states: for a CM field such that over its maximal real subfield is unramified at all finite places, and for an automorphic representation of the unitary group in the sense of IsAutRepU, there is a base change datum IsBaseChangeN with isobaric pieces of sizes . This theorem is not in the dominator subtree of vwin_of_row. Other parts of the proof use it too.
IsRecT h rc says that a map rc from irreducible representations of of a local field to Weil-Deligne representations has a local Artin map and satisfies the list of laws LawsT (IsRecTOfIsRec.lean#L55): dimension, characters, the Langlands classification by segments, twists, central characters, duality, injectivity on "good" representations, depth and a type law. This page does not unfold these laws further.
Step 2. CM and abelian variety inputs
theorem UpperTheory.One.Join.automorphic_window_of_inputs (O : OpenImageCondition)
(bc : BaseChangeIsobaricN) (gal : RowT) : UpperTheory.Top.VWin :=
v_window_of_depth_zero_residual_bc_cm O bc gal (cm_abelian_inputs_from_literature O)
The theorem cm_abelian_inputs_from_literature (TopMainZj.lean#L59) fills the 11 fields of LiteratureCMHypothesis. Their names are GrothendieckDeformation, AbelianDeRham, AbelianDualCrystal, PeriodComparison, GaussManinPeriods, SerreTateGoodReductionSt, EllipticMainTheoremCM, HilbertClassFieldJ, SiegelKlingenDeligneRibet, PartialZetaFunctionalEquation and HeckeTateFunctionalEquation. The names refer to results in the literature. Each field is given by a theorem of the Lean code. For example elliptic_main_theorem_cm_of_open O is defined as PositivityTheory.Prw.ellipticMainTheoremCM_holds, and it does not use O. The largest part of this sub-branch (489 declarations) is UpperTheory.Lit.serreTateGoodReduction. The whole sub-branch has 594 declarations.
Step 3. The rank n package
theorem UpperTheory.One.Join.v_window_of_depth_zero_residual_bc_cm (O : OpenImageCondition)
(bc : BaseChangeIsobaricN) (gal : RowT) (cm : LiteratureCMHypothesis) : UpperTheory.Top.VWin :=
UpperTheory.V.v_window_of_literal_automorphy_n
⟨local_inputs_from_literature O, automorphic_inputs_from_literature O bc gal,
galois_cohomology_from_literature O, cm⟩
LiteratureRankNHypothesis (LitAut.lean#L59) has four fields. loc : LitLocAlt has 18 local statements on of a local field (Bernstein-Zelevinsky finiteness, Langlands classification, local converse theorem, depth zero induction and others). aut : LiteratureAutomorphyHypothesis has 15 global statements. Two of them are the inputs bc and gal. So the row enters the counting argument here, as the field aut.gal. coh : LitCoh has 12 statements on Galois cohomology (Poitou-Tate, local finiteness, local Tate duality, Euler characteristics, Greenberg-Wiles, Bloch-Kato). cm is Step 2. The three builder theorems are small (23, 20 and 13 declarations), because each field comes from a theorem that is proved elsewhere.
Step 4. The extended hypotheses
theorem v_window_of_automorphy_csd_ss_mono_odd (hN : LiteratureRankNHypothesis) : VWin :=
vwin_of_hypotheses_H_E_alt (published_hypotheses_from_patching_alt hN UpperTheory.V.Z.Tf.SR.descWeak)
v_window_of_literal_automorphy_n is equal to this theorem. published_hypotheses_from_patching_alt (PublishedHypothesesFromPatching.lean#L98) builds HypothesesH'. This structure keeps litN := hN and adds fields for Clozel's conjectures on cohomology (ClozelCohC, ClozelConjC), Galois representations for totally real fields in rank 2, strong multiplicity one, quadratic base change, newforms, a descent statement DescWeak, cyclotomic statements and the existence of a definite quaternion algebra. Its dominator subtree has 3,449 declarations. The largest parts are RankTwoDescent.descS (1,506) and clozelConjC (787).
Step 5. Lemma K and the four counts
theorem vwin_of_hypotheses_H_E_alt (hH : HypothesesH') : VWin :=
have hK := lemmaK_litN_alt hH.litN
have hE := ends0_alt hH
have h4 := countII_and_countIII_of_printsH_of_sp4In hH hK (sp4In0_alt hH)
of_four_alt hH.litN hK
(count_i_of_printed_bound_k_kato_automorphy hH hK (katoTwoW_of_printsH hH)
(automorphyUnramified_of_litN_of_gdEnd hH.litN hE.1))
h4.1 h4.2 (count_v_of_printed_bound_k_reduced_unitary_lift hH hK hE.2)
This theorem is the main fork. Its dominator subtree has 48,127 declarations.
LemmaK CK (LemmaK.lean#L13) states: for a prime , a totally complex number field that contains a primitive root of unity of order (order 4 if ), and , the group with coefficients twisted by is finite, and , where and .
The counts live on a Host (DirichletPrimeToLPartMulLPowerPart.lean#L148): a primitive character of conductor , an exponent and primes , coprime to . Its modulus is . The set h.X c e is the set of Dirichlet characters modulo that are trivial on a subgroup and satisfy . For such the code defines a length Vlen (a Tate-Shafarevich-type length for the twist over ), and VLe Ω c e ψ B says that this length is finite and its normalized value times is at most . Then (Counts.lean#L60):
def CountShape (P : ∀ (h : Host) (l : ℕ) [Fact l.Prime] (c : Coef l) (_ : ℕ), DirichletCharacter c.O h.N → Prop) : Prop :=
∀ χ : PChar, ∃ C : ℕ, ∀ h : Host, h.chi = χ → ∀ t : ℕ, h.Big t →
∀ (Ω : Type) [Field Ω] [CharZero Ω] [IsAlgClosure ℚ Ω] (l : ℕ) [Fact l.Prime] (c : Coef l) (e : ℕ),
l ≠ 2 → 0 < e → e < t → ∀ ψ ∈ h.X c e, P h l c e ψ → VLe Ω c e ψ (((l : ℝ) * h.N * e) ^ C)
In words: for each there is an exponent such that, for each host with large enough primes, each odd prime , each and each in case , the length is at most . CountII, CountIII and CountV are this shape for the cases CaseII, CaseIII and CaseV (with ). CountI has a different shape: it bounds the sum over primes in case I by . The cases are conditions on , and , such as , in a finite bad set Bchi χ, or the parity of the order of .
The inputs to the counts are statements on Galois representations.
KatoTwoW(KatoTwoW.lean#L10) states: if a two-dimensional representation of , twisted by , is attached to a newform of weight , and satisfies the side conditionsUsedandWitAQ, then the Bloch-Kato Selmer groups of two twists of vanish. It feedsCountI.SymplecticFourImageDense(IsAut4.lean#L14) states: for good raw dataDin the case of , the data is finite, has no "end", and all its irreducible pieces are automorphic four-dimensional representations in the sense ofIsAut4Alt. It feedsCountIIandCountIII.ends0_altgivesGdEndAltandThmS6Core_s. The second one feedsCountV. Underends0_altsitsUnitaryThreeAutomorphyDense(SymUse.lean#L27): for each bound there is with and an irreducible three-dimensional representation of with prescribed seed data. This page does not unfoldIsSeedAlt,Raw,UsedorWitAQ.
Step 6. Adding the other bounds
theorem of_four_alt (hN : LiteratureRankNHypothesis) (hK : ∃ CK : ℝ, LemmaK CK)
(h1 : CountI) (h2 : CountII) (h3 : CountIII) (h5 : CountV) : VWin := by
obtain ⟨B, hB⟩ := Win.thmBab_of_lemmaK (pt_s hN) hN.coh.lfK hN.coh.ltK FW.ferreroWashington hK
obtain ⟨CK, hL⟩ := hK
exact vwin_of_counts (pt_s hN) hN.coh.lfK hN.coh.ltK hL (hB 401 (by norm_num))
(Odd.thmBcFree_of (ML.iv (pt_s hN) hN.coh.uo)) h1 h2 h3 h5 (countZ X.propZ)
The proof gets three more facts. ThmBab K 401 comes from Lemma K, Poitou-Tate, local finiteness, local Tate duality and a statement named ferreroWashington. It gives a window in which the part (BaAt) and the parts over cyclotomic layers (BbAt) are bounded by . ThmBcFree (PrimeSetBoundDataOfPrimitiveChar.lean#L64) bounds the "minus" part VVminusLe for every CM field of the family. CountZ comes from PropZ, which says that the length is for the trivial character when , is even and .
Step 7. From counts to VWin
theorem vwin_of_counts (hP : PoitouTateDuality) (hF : LocalFinitenessK) (hT : LocalTateDualityK) {CK : ℝ}
(hK : LemmaK CK) {K : BConst} (hB : ThmBab K 401) (hc : ThmBcFree) (h1 : CountI) (h2 : CountII) (h3 : CountIII)
(h5 : CountV) (hZ : CountZ) : VWin :=
vwin_of_joint (jointWin_of_counts hP hF hT hK hB h1 h2 h3 h5 hZ) ((thmBc_iff (by norm_num)).2 hc)
The six counts give PointHV and then ThmHV K 401. This is a bound for the "plus" part VVplusLe over each CM field with IsChiField. JointWin 401 puts the windows of ThmBab and ThmHV together. Then vwin_of_joint (AdmissibleOfPageN.lean#L131) fixes , shows that a field with IsChiField is a CM field, adds the three parts with vvle_of_parts, and checks that the sum is at most for large.
Where it is in the code
Sizes are dominator subtree sizes: the number of declarations that only this declaration reaches from the root.
| Declaration | Module | Size |
|---|---|---|
UpperTheory.One.vwin_of_row |
VwinOfRow.lean | 55,805 |
UpperTheory.One.Join.automorphic_window_of_inputs |
TopMainZj.lean | 55,802 |
UpperTheory.One.Join.v_window_of_depth_zero_residual_bc_cm |
TopMainZj.lean | 55,154 |
UpperTheory.V.v_window_of_literal_automorphy_n |
WindowBoundOfLiteratureLevel.lean | 55,095 |
…DescentVanishingReductions.vwin_of_hypotheses_H_E_alt |
WindowBoundOfLiteratureLevel.lean | 48,127 |
UpperTheory.V.Z.Kato.WeilSphericalRecords.katoTwoW_of_printsH |
KatoTwoWOfPublishedH.lean | 9,555 |
…DescentVanishingReductions.sp4In0_alt |
Sp4In0.lean | 7,295 |
UpperTheory.V.Z.Sym.W.unitary_three_automorphy_dense_of_prints |
UnitaryThreeInputsOfLiterature.lean | 4,238 |
…DescentVanishingReductions.published_hypotheses_from_patching_alt |
PublishedHypothesesFromPatching.lean | 3,449 |
UpperTheory.V.ZK.lemmaK_litN_alt |
KFinal.lean | 2,836 |
UpperTheory.V.Z.Int.slopeAll |
SlopeAll.lean | 2,414 |
UpperTheory.V.Th.core_alt_bis |
ThFinal.lean | 1,145 |
UpperTheory.V.HV.Core.of_four_alt |
HVCore.lean | 957 |
UpperTheory.One.Join.cm_abelian_inputs_from_literature |
TopMainZj.lean | 594 |
Some notes on the largest sub-branches:
katoTwoW_of_printsH(9,555) provesKatoTwoW. It reads the row fromhH.litN.aut.galand usesquadBC2. Most of its size istwoS(9,174) and below itKato.Final.zetaUr(8,219), with parts named after Kato's Euler system and Hecke projectors on newforms.sp4In0_alt(7,295) provesSymplecticFourImageDense. Its largest parts areseedIIs_alt(3,287) andindCs(2,024).unitary_three_automorphy_dense_of_prints(4,238) provesUnitaryThreeAutomorphyDense. It is reached throughends0_altandlinkedUnlE_alt.lemmaK_litN_alt(2,836) proves∃ CK, LemmaK CKfromLiteratureRankNHypothesis. Its largest part isbOdd(1,788).slopeAll(2,414) provesSlopeAll: for a cuspidal polarized on a CM field with regular infinitesimal character given by a strictly decreasing , the Satake parameters at each place have slopes in the range set by . It is used byintKandintP. One path to it starts atcount_i_of_printed_bound_k_kato_automorphy.core_alt_bis(1,145) provesDenseThresholdMainCase, a statement on ordinary points of a universal ordinary determinant ring in a Hida setting for . It is reached throughlinkedUnlE_alt.
Notes
- The field of
OpenImageConditionis never read in this branch. A search forgaloisRepOfPolarizedPairLitfinds only its definition here, and one use for a different structure inEveryCharacterOfLiteratureOfVWin.lean. The…_of_open Otheorems that this page looked at do not useO. The row reaches the counts only through the argumentgal, which becomesLiteratureAutomorphyHypothesis.gal. This page has not checked every…_of_opentheorem one by one. - The names of the literature statements (
BernsteinZelevinskyFiniteness,PoitouTateDuality,ferreroWashingtonand so on) refer to published results. This page does not check that the Lean statements match the published theorems. The literature chapter treats them. - This page does not unfold
GS,Sha1,locFam,cycZorShaU. The reading ofshaLenas the length of a Tate-Shafarevich group of follows the names and the visible definitions, not a full unfolding. - This page does not unfold the cases
CaseItoCaseVpast their definitions inHost, norBchi,pK,hStar,pOneandordC, which enterHost.Big. - This page does not explain why the constant is 401, why , or why
PageNuses the exponent . The code fixes these values. The reasons belong to the part of the proof that usesVWin, underevery_character_of_literature_of_vWin. - The dominator sizes count declarations, not difficulty. Many small sub-branches (for example the three builders in Step 3) are small because their fields are proved in other parts of the tree.
The source of this page. Markdown. Something is wrong? Report it.