The unitary hypotheses node
The Lean code ends the trunk with one existence statement. A record of forty-six fields, called HypsAlt, has an element. This page says what that record is, what the words "definite side" and "closed bound" mean in the code, and what the three large branches prove.
draft
Result
The previous chapter, theta matching, ends at the theorem UpperTheory.Lit.every_character_of_theta_integrals_local_matching. That theorem calls one more node of the trunk. This node is the last node of the trunk. Its statement is:
theorem nonempty_hyps_definite_side_of_closed_bound :
GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses →
GlobalTheory.FunPr.ThetaLocalInputs →
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.ThetaIntegralsAgree →
GlobalTheory.IndefiniteRowSideFullHecke.WeilTensorModels.LocalMatching →
GlobalTheory.CovTop.CovolumeBoundOfX →
∀ (hL : UpperTheory.Zero.LLC.RecTExists),
(∀ cDep : ℝ, GlobalTheory.Fc.RL.LinkedAt (parametersOfDependence hL cDep)
(fun Q L => SlotNormCondition Q L fun 𝒞 =>
Closed 𝒞 fun Fm _ => BoundAtTwoThreeFamilyFonAlt Fm)) →
Nonempty (GlobalTheory.Fc.HypsAlt S0.NL GlobalTheory.Fc.DefiniteSideCondition)
(Namespaces are shortened here. The full text is at SiegelEisensteinSecondTermHypotheses.lean#L44.)
In words: assume seven inputs. The first is a list of about sixty statements named after published results on unitary groups and automorphic forms. The sixth, RecTExists, is an existence statement of local Langlands type. The seventh is a "closed bound" on certain families. Then there is at least one record of type HypsAlt NL DefiniteSideCondition. The caller every_character_of_theta_integrals_local_matching gives this record to UpperTheory.Top.every_character_of_green_v_win, together with VWin, and gets UpperTheory.EveryCharacter.
The node dominates 263,615 declarations. Its three largest dominator children are the three branches of this page: 88,131, 19,399 and 12,608 declarations.
Idea
The target HypsAlt is a record of forty-six fields. Most fields are statements about a class of "families" of arithmetic data, often in the form "this holds once the constants of the family are large". The proof does not build the record field by field at the top. It works in four moves.
First, it proves twelve "open parameter statements" for one choice of parameters (branch 3). Second, it proves two estimates, SurjectiveOntoX and LambdaLowerBound₂ (branch 2). Third, the top node uses these to get a constant cDep and two more row statements, a functional condition and a covolume bound. Fourth, branch 1 turns all of this into a record AllRowsAlt (one "row" per field of HypsAlt) and then into an element of HypsAlt.
Each input that is named after the literature is a hypothesis. The Lean code does not prove those inputs in this subtree. It proves that they imply the conclusion.
Before you read
- An algebraic number field , its finite places and the completion .
- The Weil group of a local field and Weil-Deligne representations.
- The local Langlands conjectures for .
- Unitary groups and the theta correspondence.
- Cusp forms and Harish-Chandra modules. These appear only as names of hypotheses.
Plan
- State what the hypotheses record
UnitaryGroupThirdPlaceHypothesescontains. - Unfold
Closed, the meaning of "closed bound". - Unfold
DefiniteSideCondition, the meaning of "definite side". - Unfold
HypsAlt, the record that is shown nonempty, andNL. - Unfold
RecTExists,LinkedAtand the parameters. - Follow the proof of the top node.
- Describe branch 3 (
open0_of_unitary_group_hypotheses). - Describe branch 2 (
ontoX_and_lamLow_of_unitaryGroupHypotheses'). - Describe branch 1 (
hypotheses_nonempty_of_unramified_exponents_alt).
The steps
1. The input record of literature hypotheses
UnitaryGroupThirdPlaceHypotheses is a structure of type Prop with sixty fields (BernsteinUnitaryProductIrreducible.lean#L22). Each field is one Prop. Most are in the namespace GlobalTheory.Published. A few examples:
structure UnitaryGroupThirdPlaceHypotheses : Prop where
clozelCohomological : GlobalTheory.Published.ClozelCohomological
greenCuspidal : GlobalTheory.Published.GreenCuspidal
cuspRapidDecay : GlobalTheory.Published.CuspRapidDecay
siegelWeilUnitaryConvergent : GlobalTheory.Published.SiegelWeilUnitaryConvergent
doublingMethod : GlobalTheory.Published.DoublingMethodLocalZetaIntegrals
...
siegelEisensteinSimplePole : GlobalTheory.Published.UnusedSlot72
litN : GlobalTheory.Mem.LiteralAutomorphy.NonEndoscopicHypothesesAlt
...
The field names refer to the literature (Clozel, Green, Siegel-Weil, the doubling method, Harish-Chandra, Casselman-Wallach, Bernstein-Zelevinsky and others). This page unfolds one of them as an example. CuspRapidDecay says: for each datum D : D7 and each admissible family of real embeddings, every function on the group GA D V that is automorphic, smooth, of uniform moderate growth and cuspidal has rapid decay. Here rapid decay means: for each there is with for all , where is the infimum of a height over the rational points . This is the form of the classical statement that cusp forms decay rapidly, stated for the objects of this code base. The other fields are not unfolded on this page.
One field is the trivial statement. UnusedSlot72 is defined as True (DiscreteSpectrumResidualClassification.lean#L7), although the field that has this type is named siegelEisensteinSimplePole.
2. "Closed bound": the predicate Closed
A FamP ε is a structure ("family") with a real parameter . It has a threshold , an index type for each real , a datum of type D7 and size data for each and , and many named constants. A FamClass is a predicate on families, for all at once. The definition of Closed is:
def Closed (𝒞 : FamClass) (P : ∀ {eps : ℝ}, FamP eps → ℝ → Prop) : Prop :=
∃ ε1 : ℝ, 0 < ε1 ∧ ∀ eps : ℝ, 0 < eps → eps ≤ ε1 → ∃ K : TransportedAlt, ∀ (Fm : FamP eps) (CH : ℝ),
𝒞 Fm → Fm.Large K CH → P Fm CH
In words: there is such that for each there is a threshold record with this property. For each family with parameter in the class and each real , if is large with respect to and , then . The record has a number and three functions from lists of reals to reals. Fm.Large K CH says that three lists of constants of are above thresholds, and that the thresholds may depend on a fourth list (cOut) of constants of . So Closed 𝒞 P means " holds for all small , for each family in whose constants are large enough".
The "closed bound" of the theorem name is the seventh hypothesis. It applies Closed to BoundAtTwoThreeFamilyFonAlt. That predicate says: there are and such that for all , all and all auxiliary data that satisfy a setup condition SetupAlt, the statement BoundAtTwoThree (L x i) X.ρ C holds. This page does not unfold BoundAtTwoThree. The top caller gets this hypothesis from UpperTheory.N.boundAtTwoThree_linked_of_recT and the field nLink of the input record.
3. "Definite side": DefiniteSideCondition
The type DefiniteSideType is a predicate on a datum D : D7, an object O, a real , a "bundle" b : BundleCondition D O c and two reals . DefiniteSideCondition is one such predicate (DefiniteSideCondition.lean#L25). Its shape is one long implication:
def DefiniteSideCondition : DefiniteSideType := fun D O c b C CH =>
∀ (hok1 : ...) (hsep : ...) (hP : CovolumeOntoIsometryConditions ...) (hI : PassIn3 ...)
(lam0 C0 ce Sw C1 : ℝ) (H : ∀ u, ... .NumFacts ...) (NuC : ...) (I : DivisionCompatibilityDataThreeSided ...),
DivTied3 ... → HEq I b.P.I → ∀ u, RowsU ...
In words: for each choice of side data for the bundle (two structural facts, a covolume and isometry condition, a pass condition, five reals with numerical facts, a family of submodules over the ring of integers of a field D.what₂.LL, and division compatibility data ), if the data are tied (DivTied3) and is the division data of , then the row statement RowsU holds at every index . This page does not unfold RowsU, DivTied3 or the side conditions. The word "definite" is in the name only; the definition does not mention a definite form directly.
In HypsAlt, this predicate enters through the field rRows : SelectionDefiniteRows DR 𝒜 σ. That field says: Closed (D3 3 𝒜) of the statement "there is such that, eventually along the selection, the bundles satisfy constant bounds and DR b C CH".
4. The record HypsAlt and the class NL
HypsAlt N DR is a structure in Type 1 with forty-six fields (Hyps.lean#L22). It takes a predicate N on family classes and a definite side predicate DR. The first fields are data:
- a family class ,
- a selection
σ : RawSel BundleCondition 𝒜(for each family in , each large and each , a bundle), - a function
cT : ℝ → ℝ → ℝ.
The other fields are properties. Many are of the form Closed (D3 3 𝒜) (...) or "for all after the selection threshold and all , the selected bundle has property ...". The properties have names such as twist condition, period admissibility, divisor condition, class number formula at the datum (StandardLattice.ClassNumberFormula₂), counting bounds, a surjectivity of a projection map (zL), and genus mass conditions. The last field is nRest : N (D3 3 𝒜). Here D3 3 𝒜 is a class derived from (Des (WithChN 𝒜) 3). This page does not unfold Des or WithChN.
The theorem uses N = NL, where
def NL (𝒞 : FamClass) : Prop := Closed 𝒞 fun Fm _ => Formalism.MainNotions.LinkN Fm
LinkN F says: there are and such that for all , all for which ShaFinOdd (D x i) holds, and each lift index , if a series converges then
Here , summed over places in the support of where the twist differs from , and is the ramification index. The letters are fields of the datum and of the size data (GlobalTheoremInputs.lean#L45). So nRest asks that a weighted count of twisted places is bounded, in the "closed" sense.
5. RecTExists, parameters and LinkedAt
RecTExists (IsRecTOfIsRec.lean#L78) says: for each number field , algebraic closure , valuation subring of and finite place of under , there is a map rc from irreducible representations of (all ) to Weil-Deligne representations with the laws LawsT. The laws include: dimension , agreement with local class field theory for , compatibility with Langlands classification by segments, cuspidal goes to irreducible, compatibility with twists, central characters and duals. This is an existence statement in the style of the local Langlands correspondence for . The caller gets it from local_langlands_gl_recT_exists_of_literature.
A Parameters hL is a record of four parts: a position R, a norm choice extension N, an SExt and a GeoP. The parameters used here are
parametersOfDependence hL cDep =
parametersOfExtension (extensionWithList hL cDep) SExt.none (geoCl anyGeometry)
This page does not unfold extensionWithList.
LinkedAt p r says: there is a further condition R on bases such that LargeBaseCondition holds for it, and the row statement r holds for the combined slot and the bundle linkage of p. A row statement Row Q Lk H says: there is a choice E of bundle properties with RowE Q Lk E, and H 𝒜 σ holds for every class and selection that are selections for E. SlotNormCondition Q L N is Row Q L (fun 𝒜 _ => N (D3 3 𝒜)). So the "closed bound" hypothesis says: for every real , along the parameters of dependence , every admissible selection has Closed (D3 3 𝒜) BoundAtTwoThreeFamilyFonAlt.
6. The proof of the top node
The Lean proof (lines 45 to 68) does these steps.
- It gets
FunctionalsSeparatefromfunctionalsSeparate_of_howeUnram_of_siegelWeil(4,530 declarations). - It gets
S0.RowRatfromtest_vector_assembly_holdsthroughrowRatW_of_rowTest. - It gets
ConstantFunctionFitsfromfourier_coefficient_fit_of_join_alt(4,155). This uses the second half of branch 2. evaluation_grid_of_joingives a constant such thatEvLgG (GridA CF)holds for .rowFun_at_gridA_altgives a constant .- It sets .
- Branch 3 gives
OpenParameterStatementsat the parameters of dependence . open_and_linked_of_stronger_extension_altmoves these statements to the stronger parametersextensionWithAtProperty ... (GridA cDep).- It gets the functional condition and the covolume bound
CovolumeBoundThirdPlaceSeriesat the stronger parameters. The second uses the inputCovolumeBoundOfX. - It applies branch 1 to all of the above.
7. Branch 3: the twelve open parameter statements
theorem GlobalTheory.T.open0_of_unitary_group_hypotheses :
UnitaryGroupThirdPlaceHypotheses → ∀ (hL : RecTExists) (cDep : ℝ),
OpenParameterStatements (parametersOfDependence hL cDep)
OpenParameterStatements p is a structure of twelve fields. Each field is LinkedAt p r for one row statement r: primitivity, a lambda prime condition, a divisor condition, a decomposition point condition, a selection jump condition, a tie condition, a label condition, a goodness condition, a weak geometric compatibility, a multiplicity condition, a kappa condition, and a defect condition. The defect condition RowDefectCondition is the row form of DefiniteSideCondition. So branch 3 already proves the definite side condition in row form.
The theorem at line 75 only calls Open0ProofU.open_orbit_of_unramified_exponents_alt (line 39). That proof builds each of the twelve fields from one lemma and the input record. The largest part is main_theorem_published_inputs_third_alt_alt (10,941 declarations). It gives the multiplicity condition, from fourteen named hypotheses (Harish-Chandra finiteness, rapid decay of cusp forms, Weil representation of the unitary pair, Siegel-Weil formula, doubling method, strong approximation and others). The next parts are weil_unitary_entries' (1,187, the defect condition) and good_ft_entries_alt_alt (262, the label condition).
8. Branch 2: SurjectiveOntoX and LambdaLowerBound₂
theorem ontoX_and_lamLow_of_unitaryGroupHypotheses' :
UnitaryGroupThirdPlaceHypotheses →
GlobalTheory.BigOn.SurjectiveOntoX ∧ GlobalTheory.BigTop.LambdaLowerBound₂
Both conclusions have the form Closed FamHyp (...) for one fixed class FamHyp.
SurjectiveOntoX: for large families inFamHyp, ifDIVinN Fholds, then there is such that eventually, at every point withMore p, and for every , the statement(p.S false).ON (p.N C CH)holds.LambdaLowerBound₂: for large families, eventually at every point and for every ,(p.S true).L6 (p.N C CH)holds.
Here "eventually at points" means: there is such that for every with , every and every point that satisfies PointConditions', the property holds. This page does not unfold FamHyp, ON or L6. The names suggest "onto" and "a lower bound for ", but this page does not claim more than the definitions.
The proof is two calls. ontoX_of_hypotheses_alt_alt (19,069 declarations) proves the first part from twelve named hypotheses. One of them is RecTExists, which is made by llOf_alt from the field litN.loc.llc. Its main sub-branches are runHolds_of_parOK (5,710), geoSt_of_pageSt_alt (5,131) and expSt_of_base_change_and_crystalline_lattices (3,719). lamLow_of_hypotheses_alt_alt (312 declarations) proves the second part from seven named hypotheses: rapid decay, the Weil-Siegel formula, Siegel-Weil convergence, the doubling method, unramified doubling for , Bernstein-Zelevinsky finiteness and formal degrees.
9. Branch 1: the record is nonempty
theorem hypotheses_nonempty_of_unramified_exponents_alt :
UnitaryGroupThirdPlaceHypotheses → S0.RowRat →
∀ (hL : RecTExists) (cDep : ℝ) (A : GroupRetwisting.AtP), EvLgG A →
LinkedAt (parametersOfDependence hL cDep) (closed bound) →
LinkedAt (parametersOfExtension (extensionWithAtProperty ... A) ...) FunctionalCondition →
LinkedAt (parametersOfExtension (extensionWithAtProperty ... A) ...) CovolumeBoundThirdPlaceSeries →
Nonempty (HypsAlt S0.NL DefiniteSideCondition)
(The fifth line is the same "closed bound" hypothesis as in the top node.) The proof (HypothesesNonemptyOfUnramifiedExponents.lean#L42) has six steps.
large_unramified_exponent_bundles_exist_alt(19,960 declarations) gives three facts:SiegelMassRatioCM,MemberEfor the stronger parameters, andExBL(there is a large base condition with bundles). Its main part ismember_exists_baseLattice_alt(13,155).hyps_e_third_layer_ser_n_of_geometric_galois(1,263) gives two inputsprNandserNfrom the fieldslitNandtoHypothesesX.- It calls branch 2 and branch 3 again at .
UpperTheory.GalC.final_alt_alt(15,614) turns the closed bound intoNL. Its typeNLink.Final.mainTheoremsays: from the named hypotheses and the closed bound forBoundAtTwoThreeFamilyFonAlt, the sameLinkedAtstatement holds withClosed 𝒞 LinkN. This is where the "closed bound" hypothesis is used. Its main part isfinal_of_alt(14,859).open_and_linked_of_stronger_extension_altmoves the open statements and theNLrow to the stronger parameters.allRows_of_open0_alt(33,892) gives a recordAllRowsAlt ... NL DefiniteSideCondition. Thennonempty_hyps_of_allRows_alt(419) builds theHypsAltelement from it.
AllRowsAlt has one "row" for each property field of HypsAlt, each in the form Lg1 KP Q Q' (fun S => ...). The last step joins these rows with RowL.and into one row, takes one selection from ExBL, and reads off the fields. The largest parts of allRows_of_open0_alt are lg1_sLp_sO_hTF (13,601; the selection, order and torsion free rows, from one Siegel-Weil hypothesis) and hServ_of_linkR (10,829; the service row, from global Artin reciprocity).
What "unramified exponents" means here
The phrase "unramified exponents" is in the names of four files and theorems of this chapter. It is not in any hypothesis or conclusion of these theorems. No definition with that name enters the statements above. So this page does not give it a meaning. The same holds for "open orbit" in the name of branch 3, and for "surjective and low weight" in the file name of branch 2. The theorem names ontoX and lamLow do match the conclusions SurjectiveOntoX and LambdaLowerBound₂, and open0 matches the structure OpenParameterStatements (and its near copy S0.Open0).
Where it is in the code
All modules below are in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/ unless the name says otherwise. Size is the number of declarations that the node dominates.
| Declaration | Module | Size |
|---|---|---|
UpperTheory.Lit.nonempty_hyps_definite_side_of_closed_bound |
SiegelEisensteinSecondTermHypotheses.lean#L44 | 263,615 |
GlobalTheory.Fc.S0.StageU.hypotheses_nonempty_of_unramified_exponents_alt |
HypothesesNonemptyOfUnramifiedExponents.lean#L41 | 88,131 |
GlobalTheory.Fc.AllAtMemberStage0.allRows_of_open0_alt |
LinkROfIsLinked.lean#L50 | 33,892 |
GlobalTheory.T.large_unramified_exponent_bundles_exist_alt |
MemberBundlesLargeUnramifiedExponents.lean#L69 | 19,960 |
UpperTheory.GalC.final_alt_alt |
CFinal.lean#L19 | 15,614 |
GlobalTheory.Fc.nonempty_hyps_of_allRows_alt |
NonemptyHypsOfAllRows.lean#L19 | 419 |
GlobalTheory.Fc.S0.ontoX_and_lamLow_of_unitaryGroupHypotheses' |
SurjectiveAndLowWeightOfUnramifiedExponents.lean#L16 | 19,399 |
GlobalTheory.BigOn.ontoX_of_hypotheses_alt_alt |
OntoXOfPrints.lean#L28 | 19,069 |
GlobalTheory.BigTop.lamLow_of_hypotheses_alt_alt |
LamLowOfPublished.lean#L17 | 312 |
GlobalTheory.T.open0_of_unitary_group_hypotheses |
OpenOrbitOfUnramifiedExponents.lean#L75 | 12,608 |
GlobalTheory.T.main_theorem_published_inputs_third_alt_alt |
MainTheoremPublishedInputsThird.lean#L34 | 10,941 |
GlobalTheory.Fc.HypsAlt |
Hyps.lean#L22 | 1 |
GlobalTheory.Fc.DefiniteSideCondition |
DefiniteSideCondition.lean#L25 | 1 |
GlobalTheory.Fc.S0.UnitaryGroupThirdPlaceHypotheses |
BernsteinUnitaryProductIrreducible.lean#L22 | 1 |
Formalism.MainNotions.Closed |
ParamsHeightRankConstant.lean#L159 | 1 |
UpperTheory.Zero.LLC.RecTExists |
IsRecTOfIsRec.lean#L78 | 1 |
Branches 2 and 3 are used twice: once by the top node and once inside branch 1. So in the dominator tree they hang under the top node, not under branch 1.
Notes
- What is hypothesis and what is proof. The sixty fields of
UnitaryGroupThirdPlaceHypotheses, the inputsThetaLocalInputs,ThetaIntegralsAgree,LocalMatching,CovolumeBoundOfX,RecTExistsand the closed bound are all assumptions of this node. The node proves that they imply the existence of aHypsAltrecord. Whether each assumption is a correct form of the published theorem it is named after is a separate question. This page checked onlyCuspRapidDecayandRecTExistsin any detail. - A trivial field. The field
siegelEisensteinSimplePolehas typeUnusedSlot72, which isTrue. So this field asks for nothing. - A pass-through.
llOf_alttakesRecTExistsand eleven other hypotheses, and returns its first argument. The other eleven hypotheses are not used in its proof. - Not unfolded. This page does not unfold
RowsU,DivTied3,BoundAtTwoThree,FamHyp,ON,L6,Des,WithChN,extensionWithList,extensionWithAtProperty,EvLgG,GridAbeyond its first line,RowRat,MemberEbeyond its four conjuncts,ExBL,SiegelMassRatioCM, or most fields ofHypsAlt. The plain words for these objects stay at the level of their names and shapes. - Names. Many names in this subtree (
_alt,_alt_alt,', "third place", "unramified exponents", "open orbit") do not match a defined object. This page does not guess their meaning. - What the record is used for. This page stops at the element of
HypsAlt. Howevery_character_of_green_v_winuses it, together withVWinand the Green character input, is not on this page.
The source of this page. Markdown. Something is wrong? Report it.