The definite side condition
drafted
Statement
DefiniteSideCondition is a definition of the type DefiniteSideType. A DefiniteSideType is a predicate on six arguments: a datum of the type D7, an object of the type Obj D, a real , a bundle of the type BundleCondition D O c, and two reals and .
A bundle is a structure with seven fields: a reciprocity record R, spectral ties S, a row side family P, a fact pin that the row side is determined, a pair of natural numbers DH with and (where ), square integrable columns C, and a real bundle B. The field B contains an indefinite realisation B.Q. Write for B.Q (the abbreviation qRealOfBundle b) and for the scale function zsc b.P Δ h0 c. The function zsc is the scale of ZscOfNum3 with its l6m part shifted by times its l6u part and its l6u part set to .
Then DefiniteSideCondition D O c b C CH is this statement. Take the following data.
hok1: a proof ofb.P.A3.fam3.Ok3 1.hsep: a proof ofb.P.A3.fam3.TypesSep3.hP: a proof ofCovolumeOntoIsometryConditions Q.Rl F Q.sEE (hkCan b.P.A3) C CH, where is the facefaceT b.P b.C.toS.c.face b.C.toS.Sp Zc. This structure extendsPrimRows3and has the fieldsw1,covol(the boundL3),onto(the boundON),lamLow(the boundL6),seeIso,miStarandfun0, all at the numbersQ.Rl.num F C CH.hI: a proof ofPassIn3 Q.Rl F C CH. It says that there are a finite type , finite dimensional representations of the group over the fieldD.what₂.LL, and a real with the pass conditionCxPassIn3.- Five reals , , , , .
H: for each word , the numerical factsNumFactsof the recordofRecord D O.L Δ h0at the letter of , with the constants , , , , , , .NuC: for each member of the column face, a submodule over the ring of integers ofD.what₂.LLof the space . Here is read off the face at the subspaceZsof the packagePk = packageOfPrimitiveLinks Q hok1 hsep C CH hP hI.I: division compatibility dataDivisionCompatibilityDataThreeSidedfor the row side of , the subspacePk.Zs, the two indefinite data of the package (Pk.core.baseandPk.core.cols), the base levelO.ex.p0and the column face atPk.Zs.
If DivTied3 ... Pk.core.cols.col NuC I holds (the data are tied to the package and to NuC), and if is equal to the division data b.P.I of the bundle (as a heterogeneous equality HEq I b.P.I), then for each word the row statement
holds. Here is the record of numbers RecNums.ofNum (ofRecord D O.L Δ h0) (Equiv.refl _) (letterOf u) T O.L.Nc λ0 C0 ce c Sw C1 (H u), with , and nuOf O.L u e is the pullback of the lattice O.L.NuLat u along the linear equivalence .
DivTied3 is a structure of ten fields: equal ranks, and the ties grp, tup, mu1, sharp, base, mt, th, num and cols. RowsU says that there are a column chain, a chain tie, a matrix family at the infinite places of LL with a Hermitian identity, height numbers, an operator norm bound and column bound data with logarithmic bounds, and that Nu is a lattice. This step does not unfold these objects further.
Lean
def GlobalTheory.Fc.DefiniteSideCondition : _root_.GlobalTheory.Fc.R1.DefiniteSideType
The declaration is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/ThirdPlaceSeries/DefiniteSideCondition.lean, line 25. 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 definition. It is one long universal implication. The abbreviations qRealOfBundle, faceT, ofRecord and letterOf only read fields of and or pack them into a tuple.
Notes
The bound variable lam0 of the definition has the same name as the global definition Formalism.BasicNotions.lam0. The dependency list contains the global name, but the definition does not use it. The name lam0 in the text is the bound real .
The package packageOfPrimitiveLinks Q hok1 hsep C CH hP hI is written out in full ten times in the Lean text. Each time it is the same term.
The word "definite" is in the name only. The text does not mention a definite form. The predicate enters the record HypsAlt through the field rRows : SelectionDefiniteRows DR 𝒜 σ, with DR = DefiniteSideCondition in the trunk. See HypsAlt is nonempty from the closed bound.
Uses
The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: Formalism.BasicNotions.lam0, GlobalTheory.Fc.qRealOfBundle, Formalism.IndefR.faceT, Formalism.L2.DIV.letterOf, Formalism.L2.DIV.ofRecord.
The proof cites these declarations, but their steps are not written yet. The text above tells what each one gives: GlobalTheory.Fc.R1.DefiniteSideType, Formalism.IndefR.Links.CovolumeOntoIsometryConditions, Formalism.IndefR.Links.PassIn3, Formalism.IndefR.hkCan, Formalism.L2.DIV.Cons.nuOf, Formalism.L2.DIV.DivTied3, Formalism.L2.DIV.DivisionCompatibilityDataThreeSided, Formalism.L2.DIV.RecNums.ofNum, Formalism.L2.RowDataTransport.RowsU, Formalism.L2.RowDataTransport.packageOfPrimitiveLinks, GlobalTheory.Fc.zsc.
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.