The record HypsAlt
drafted
Statement
HypsAlt N DR is a structure in Type 1 with forty-six fields. It has two parameters. The first parameter is a property of family classes, of the type FamClass β Prop. The second parameter is of the type DefiniteSideType, so gives a relation on two reals for each bundle condition BundleCondition D O c. In the trunk, is S0.NL and is the predicate DefiniteSideCondition.
A value of the structure holds a family class , a selection on it, some constants, and many rows (bounds and conditions) on them. Most rows have one of two forms.
- A row "per selection" is a statement for each , each family
Fm : FamP Ξ΅with (the proof is ), each real with (the proof is , and is the fieldFm.x1), each proof that the threshold of the selection is at most , and each indexi : Fm.Ix x. - A row "closed on " is a statement
Closed π P, see the predicate Closed. It says that holds for each family in whose constants are large, for all small .
Two family classes come from :
-
WithTw (WithSm (WithChN π)). This class adds to the conditionsDGamDvdF,TameDistinctF,BoxesF,QDRowsF, (fromWithChN), thenDGamSmooth(fromWithSm), thenTwGood(fromWithTw). -
D3 3 π, that isDes (WithChN π) 3. This class is with three more conditions: there isCHwithChosenE Fm 3 CH, thenTuSize, thenDGamSize. The theoremd3_atakes a proof of to the proof of inside it. It is a projection.
The selection gives these objects at a family, and :
familySelection Ο Fm hcis the pair of the thresholdFm.x1and the map that takes to the partRof the selected bundle condition.spectralConditionOfRawSelection Οgives the partS.baseLevelChoiceOfRawSelection Οgives the pair of the partsPandpin. The rows below use its first componentP.selectionBundleOfRawSelection Οgives the partB.
The forty-six fields follow, in nine groups. The meaning of a row comes from the name of its predicate, by its name, except where this step unfolds the predicate.
Data (5 fields). These fields give the objects that the rows talk about.
π : FamClass, the family class.Ο : RawSel BundleCondition π. For each family in , each and each , it gives a bundle conditionBundleCondition (Fm.D x i) (objAt Fm x hx i) Fm.Csz. A bundle condition has the partsR,S,P,pin,DH,C,B.cT : β β β β β, a constant that depends on and .c30 : List β β CountingConstants, a choice of counting constants for each list of reals.cIc : β, one more constant.
Facts on the constants (2 fields).
hc30: for each family, and for the constantsc30 Fm.cOut.hcI: .
Statements on the families of (3 fields).
hEx : MinkDiv β ExS π cT. IfMinkMult n (minkM n)holds for each , then for each and each hostGwithHostExW Ξ» G.req, the classWithTw (π β§ G.cls Ξ»)has design choices with the constant 3 andcT.hduty: each family in hasDuty Fm. This is the conjunction ofPageFix,PageWin,SmallFirstModulusBelowScale,TameDistinctF,ChosenWall,TupUsedFandTwAllF.hMt: for each family in and each large , each , each tuple and each element of the ring of integers of the number fieldLL, the image of underembLLmaps the setMtilde ΞΌto itself.
Rows per selection (8 fields). For each family in , , and as above:
hRB: the partBgivesIndefiniteRealisationBoundedRows.hTw:TieTwRec (Fm.L x i)holds for the fieldS0.Twof the partP.hPA:PrimRows3holds for the fieldsQ.RlandQ.FofB, andTypesSep3holds forP.A3.fam3.hLamP:RowsHoldLam3 P.hDivG:DivRows3G P.hDcPtG:DcPtG P.hInstR:VolSigIndep (Fm.D x i)(the volumes of the fundamental domains do not depend on the signature) andClassItemsAt (Fm.D x i) n, where is the rank of the first spacesp.Y 0.ClassItemsAtis the conjunction ofGenusMassAt,ClassFinAtandClassMassAt.selJ:IndefiniteRealisationJoinwith the partsR,SandB.Q.
Rows closed on (2 fields).
hTu: if , thenTuSize Fm.TuSizesays that for large , eachFm.L x ihasTuGeand .hn4: for each and each ,ClassNumberFormulaβ (Fm.D x i) (Fm.ex x hx i).lev.
Rows closed on (14 fields). In each of these rows, "for large " means: there is such that the statement holds for each (with where the row asks for it) and each .
hTF:TFrame Fm (C_YL + 1) (1/4) 3 (1/2) C_Tu 3.sO: for each proof of ,TheoremSSelected Fm 3for the selection with the threshold offamilySelectionand the map toS.toSTies.h30:CountAllPointsClass PLevT' Fm n0 A C c cbwith the constantsc30 Fm.cOut.jOn: for large , the image ofV0 mu0underiota mu0is the whole space ().aPt0: for large ,Conclusion6 (Fm.D x i) ufor each .aPtTw: for large ,TwistedPointIntegral (Fm.D x i) (Fm.ex x hx i).tw.aPer0: for large ,PeriodClassSumWeyl (Fm.D x i).aPerTw: for large ,TwistedPeriodAdmissible (Fm.D x i) (Fm.X x i) (Fm.ex x hx i).tw.aP10: for large and each ,Conclusion5Sharp (Fm.D x i) uandTwistedColumnBoundAtT (Fm.X x i) (Fm.ex x hx i).tw u.aAtG: there is such that for large ,UsedTuplesBoundByConstant (Fm.D x i) (Fm.L x i) (Fm.ex x hx i).errX C1, andfamilySizeBoundAtTypePrime Fm C1.aC2:FamilySecondComplementInputs Fm.irrC: for large , there isA : AllRows (Fm.D x i)withLabelCountGoodInjective A,AllJoinA AandCountAllRows A (epsC cIc r f), where and are the fieldsR.randR.fofFm.D x i.zL: for each proof of , there is such that for each with , each and eachk : Fin m, the map(lPrj (Fm.D x i) A P0 Ο0 Z k ΞΌ0).mulVecis surjective. HereA,P0,Ο0andΞΌ0are fields ofPand ofP.A3, andZisP.A3.fam3.toSub2 P.Zs.tie:RealPlaceSecondLayerConditions Fm. This says thatRealTiedholds for large and that there isColsTiedSym CwithChiFin0.
Statements that do not depend on a family (8 fields).
hLit : LitThin. This is three existence statements ofShortIntervalPrimes, for the levelsadm6,adm7andadm11, each for all data .hWu : WuDecayOfGap. For each datum withGapHypand eachHidaSetting,WuDecay Xholds together with an integrability statement.hRF : RowsFinDim, a statement of finite dimension for operators on automorphic spaces.sTy : TypeP,sNG : RowNGP,sM : RowMainEqP. Each is a statement with uniform constants over all data of the typeD7.hU:MassRatioUnderVolume Dfor each . That isVolTie D β VolumeRatioβ D.hG:GenusMassAt D 2for each . That is: the mass of each positive definite hermitian space of rank 2 ismassI D 2.
Statements on the selection over (3 fields).
sLp : LoopRowS 3 πβ s, wherestakes a family to the threshold offamilySelectionand to the map toS.toSTies.rRows : SelectionDefiniteRows DR π Ο. This is a row closed on . For each proof , there is such that, eventually along the selection,IndefiniteRealisationConstantBoundsholds and holds for the bundle condition of and .hServ : SelectionServed πβ (familySelection Ο). This has two fieldstwUandpdv. Each is a row closed on .
The class property (1 field).
nRest : N πβ.
The counts are .
Lean
structure GlobalTheory.Fc.HypsAlt (N : FamClass β Prop) (DR : _root_.GlobalTheory.Fc.R1.DefiniteSideType) : Type 1
The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/Hyps.lean, line 22. Its page has the full list of what it uses and what uses it, and a link to the source.
Proof
There is no proof. This is a structure definition. It only lists the forty-six fields and their types.
Notes
The threshold of familySelection Ο Fm hc is Fm.x1. So in each row per selection, the hypothesis only says , and already gives . The hypothesis adds nothing.
The four selection maps familySelection, spectralConditionOfRawSelection, baseLevelChoiceOfRawSelection and selectionBundleOfRawSelection only read parts of the bundle condition that gives. The theorem d3_a is a projection. This step explains them in the Statement and lists them as routine.
Each of the parameters is used by one field only: by nRest and by rRows. In the trunk, HypsAlt is nonempty from the closed bound builds a value of HypsAlt S0.NL DefiniteSideCondition. There nRest is a statement Closed πβ LinkN.
Uses
- The predicate Closed on family classes, the step for
Formalism.MainNotions.Closed.
The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: GlobalTheory.Fc.familySelection, GlobalTheory.Fc.baseLevelChoiceOfRawSelection, GlobalTheory.Fc.selectionBundleOfRawSelection, GlobalTheory.Fc.spectralConditionOfRawSelection, GlobalTheory.Cp.d3_a.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: Formalism.IndefR.IndefiniteRealisationBoundedRows, Formalism.IndefR.Links.PrimRows3, Formalism.L2.DIV.TieTwRec, Formalism.L2.DIV.lPrj, Formalism.L2.G.Adm2InU.TwistedColumnBoundAtT, Formalism.L2.G.Adm2InU.TwistedPeriodAdmissible, Formalism.L2.G.Adm2InU.TwistedPointIntegral, Formalism.L2.G.Adm2InU.UsedTuplesBoundByConstant, Formalism.L2.GlobalTheoryTheory.AllJoin.AllJoinA, Formalism.L2.GlobalTheoryTheory.ConcN.CountAllRows, Formalism.L2.GlobalTheoryTheory.ConcN.epsC, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.ClassItemsAt, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.GenusMassAt, Formalism.L2.GlobalTheoryTheory.GenusMassVolumes.VolSigIndep, Formalism.L2.Rows.RowsHoldLam3, Formalism.L2.SG.JoinSI.IndefiniteRealisationJoin, Formalism.L2.SG.Pf.WuDecayOfGap, Formalism.L2.SG.RowsDef.RowsFinDim, Formalism.L2.SG.RowsPos.RowMainEqP, Formalism.L2.SG.RowsPos.RowNGP, Formalism.L2.SG.RowsPos.TypeP, Formalism.L2.SG.ThmSOwn.LoopRowS, Formalism.L2.SG.ThmSOwn.PLevT', Formalism.L2.SG.ThmSOwn.TheoremSSelected, Formalism.MainNotions.ArithmeticCylinders.AllRows, Formalism.MainNotions.ArithmeticCylinders.LabelCountGoodInjective, Formalism.MainNotions.FamClass, Formalism.MainNotions.FamP, Formalism.MainNotions.LitThin, Formalism.MainNotions.MinkDiv, Formalism.MainNotions.PX.TFrame, Formalism.MainNotions.RT.MassRatioUnderVolume, Formalism.MainNotions.RealPlaceSecondLayerConditions, Formalism.MainNotions.S.CountE.CountAllPointsClass, Formalism.MainNotions.S.CountingConstants, Formalism.MainNotions.StandardLattice.ClassNumberFormulaβ, Formalism.MainNotions.TuSize, Formalism.MainNotions.WeightDegreeSizes.FamilySecondComplementInputs, Formalism.MainNotions.WeightDegreeSizes.PeriodClassSumWeyl, Formalism.MainNotions.WeightDegreeSizes.familySizeBoundAtTypePrime, Formalism.MainNotions.WithSm, Formalism.MainNotions.WithTw, Formalism.MainNotions.product_first_zeroth_parts.Conclusion5Sharp, Formalism.MainNotions.product_first_zeroth_parts.Conclusion6, GlobalTheory.Cp.D3, GlobalTheory.Cp.DcPtG, GlobalTheory.Cp.DivRows3G, GlobalTheory.Cp.Duty, GlobalTheory.Cp.SelectionServed, GlobalTheory.Cp.WithChN, GlobalTheory.Fc.BundleCondition, GlobalTheory.Fc.R1.DefiniteSideType, GlobalTheory.Fc.R1.SelectionDefiniteRows, GlobalTheory.Fc.RawSel, UpperTheory.Top.ExS.
Used by
- EveryCharacter from Green, VWin and HypsAlt
- HypsAlt is nonempty from the closed bound
- ZeroFreeAll from Green, VWin and HypsAlt
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.