Block determinants and theta Parseval
The timeline has a Stepanov determinant and a positivity proof through a determinant. The Lean code does not contain them. This page shows what the code has in their place, in the proof that a theta lift is not zero.
draft
Result
The theorem UpperTheory.TP.K.tLiftK proves the statement TLiftK (see Step 7 of the Galois row). In short, TLiftK says this. Let be a CM field, let be a definite hermitian space of dimension and let be an automorphic representation of with weights at the infinite places. Then there is a such that for each skew-hermitian space of dimension (with a weight condition) there is an automorphic representation of with IsLift: matched weights at infinity and matched local components at split places.
The proof is one line:
theorem UpperTheory.TP.K.tLiftK : UpperTheory.TP.TLiftK :=
UpperTheory.TP.tLift_holds_k
theorem tLift_holds_k : TLift_k := tLift_of_tools_k tools_holds_k (hgtEx_of_k stab2Cpt_k)
This page is about tLift_of_tools_k (TPGTop.lean#L46). It has 503 declarations in its dominator subtree. Its heart is a proof that the theta lift of is not zero. The files are in the folders ThetaParseval/BlockDeterminants and ThetaParseval/ThetaKernels.
The Lean code is not reviewed by a person. This page does not claim that the statements are the intended ones.
Idea
The timeline of the plan has three steps that this page compares with the code:
- Step 1: "The Stepanov determinant."
- Step 4: " through a determinant. Read it as Stepanov with multiplicity one."
- Step 8: iterated theta lifts that gain multiplicity , with near .
The word "Stepanov" does not occur in the Lean code. There is no auxiliary polynomial with a zero of high order, no Wronskian in this branch, and no quantity . The code has a different, standard way to show that something is not zero:
- A Rallis inner product identity (the "theta Parseval" of the folder name). If the lift of is zero, then the integral of the Weil matrix coefficient against the matrix coefficient of is zero.
- A choice of test data that makes this integral a main term plus a tail. The main term is not zero, and the tail is smaller. So the integral is not zero, and so the lift is not zero.
- In this branch, this page found determinants of matrices in one place only: the test vector at infinity is a product of powers of leading principal minors of a matrix of variables. This is the classical highest weight vector.
So the role of "a determinant that is not zero" is played by an inequality "main block is larger than the tail". The determinant itself enters only through the highest weight vector.
Before you read
- The theta correspondence for a pair of unitary groups, and the Weil representation on a Schwartz space of polynomial type.
- Hermitian forms (the space ) and skew-hermitian forms (the space ).
- The adele ring, automorphic forms and cuspidal representations.
- The Petersson inner product and matrix coefficients.
- Siegel Eisenstein series and the doubling method, for the Rallis identity.
Plan
- Show where the branch sits and how large it is.
- Show the existence skeleton
tLift_of_kand its fourteen tools. - Show the test vector made of leading minors (
joint,realPair_k). - Show the Rallis identity (
rallis_k). - Show the main term and the tail (
nonVan_kandAbsNe). - Show how a nonzero lift gives one irreducible .
- Say where the other determinants of the code are.
The steps
Step 1. Where the branch sits
The spine of tLiftK is short:
UpperTheory.TP.K.tLiftK(2,709 declarations) is dominated bygaloisLocalGlobalStrong_recParameter(51,591).tLift_holds_k(2,708) is the whole proof.tools_holds_k(2,169) builds the structureTools_k(GalTPDefs.lean#L27). It has fourteen fields:swFull(a full Siegel-Weil statement),boxSec,dbl(doubling),stab2,cpt(compactness of the quotients),basic,polSch,unfold0,pairEx(existence of a model of the dual pair),split,vacFix,acts,lie1andlie2. This page does not describe their proofs.tLift_of_tools_k(503) uses the tools to prove the lift. This page describes it.
The page the Galois row gives older sizes (5,201 for tLiftK and 2,998 for tLift_of_tools_k). The numbers on this page come from the current full spine.
Step 2. The existence skeleton
tLift_of_tools_k is one term:
theorem tLift_of_tools_k (T : Tools_k) (hH : HgtEx_k) : TLift_k :=
tLift_of_k T hH brEx (hgtFst_k T) (realPair_k T)
(nonVan_k T (rallis_k T) (decomp_k T) (bumpAny_k T) (datum_k T) (tail_k T) absNe (schurStep_k T))
(liftAut_k T) projEx (readLift_k T (liftAut_k T) absIso)
So the proof is split into named statements. Each one is a def ... : Prop in GalTPDefs.lean#L45, and each one has its own proof ..._k. The theorem tLift_of_k (GalTPDefs.lean#L141) puts them together in this order:
- From
HgtEx_k, get a height function on the doubled group. FromHgtFst_k, get such that is integrable for . - Take with . So each has and .
- From
pairEx, get a model of the dual pair and its Weil representation. FrombrEx, get the identifications of the adelic groups. - From
RealPair_k, get a polynomial and a form , , of matched types (Step 3). - From
NonVan_k, get finite test data with (Steps 4 and 5). - From
LiftAut_k,ProjExandReadLift_k, get and its properties (Step 6).
The theta lift is the function on
which is the Lean lift M om Φ φ h (SchurStep.lean#L22). The matrix coefficient of is mc M φ g, the Petersson product of the translate with (SchurStep.lean#L25). The matrix coefficient of the Weil representation is coef om ν Φ g.
Step 3. Test vectors made of leading minors
This is the only place in the branch where determinants of matrices appear.
Let be a matrix of variables with . For , let be the leading minor, lpMinor. For a weight , the Lean hw (StatementA.lean#L63) is
This is the classical highest weight vector of weight for in the polynomial ring. The definition joint h μ (RightSub.lean#L32) moves into the Fock space PP n d of polynomials in the variables. The theorem jointNe (JointNe.lean#L13) says that joint h μ ≠ 0 when is antitone. Its proof uses Formalism.GradedWeylDivisibility.hwNe.
Two theorems, exists_act1_equivariant_nablaSq_map_hitting_joint and exists_act2_equivariant_nablaSq_map_hitting_joint, give maps that commute with the and the actions and that hit joint. The proof for uses the rule that the top minor is multiplied by under the right action.
The theorem realPair_k (TPGRealPair.lean#L29) uses these to build as an image of over the infinite places . Its conclusion is that , that some with has the same type as (SameType), and that at each the weight seen by on the side satisfies IsLiftWt. So the minors pick a test vector whose -types match on both sides.
Step 4. The theta Parseval identity
The statement Rallis_k (GalTPDefs.lean#L61) ends with:
Integrable (fun g => coef om ν Φ g * star (mc M φ g)) M.μ ∧
(lift M om Φ φ = 0 → ∫ g, coef om ν Φ g * star (mc M φ g) ∂M.μ = 0)
In standard notation: if , then is integrable on , and
This is one direction of the Rallis inner product formula. The proof rallis_k (TPGRallis.lean#L99) works like this:
- It bounds the Weil coefficient by a constant times . With , this gives the integrability.
- It takes the Siegel Eisenstein series on the doubled group from
swFulland its pairing with (kpair). For large, the doubling tooldblgives - A private lemma
zero_of_half_pk(analytic continuation on a connected open set) extends this identity to . - At , the Siegel-Weil statement writes the left side as a double integral of against . If the lift is zero, this is zero, and so the right side is zero.
Step 5. A main term that is larger than the tail
NonVan_k (GalTPDefs.lean#L114) says: if , and , have the same type, then there are finite test data with lift M om (pure f₀ φf) (φ ∘ e.symm) ≠ 0. By Step 4, it is sufficient to show that the integral of Step 4 is not zero. The proof nonVan_k (TPGNonVan.lean#L26) uses five inputs.
Decomp_k: for a finite set of places, as a product of three closed subgroups (gInf,gAt,gOff). is compact, because is definite.BumpAny_k: at each place there is a "bump" test function whose Weil coefficient is supported in a given small subgroup .Datum_k: with these bumps, the Weil coefficient vanishes for , and on with it equals times its value at , where and when is integral at all places.SchurStep_k: the integral over the compact of is with . By its name and its form, this is a Schur orthogonality step. It needs the matched types of Step 3.Tail_k: for large, the integral of over the part of that is not integral is smaller than the measure of the integral part.
The abstract statement AbsNe (SchurStep.lean#L183) then closes the proof. In words: let on vanish for and equal for , with . Let with . Let and on a set , with and everywhere. If , then . The reason is that , the part over has absolute value , and the part over has absolute value at most , which is smaller. The bound with on comes from UpperTheory.matrix_coefficient_bounded_by_value_at_one: a matrix coefficient is largest at .
This is the counterpart, in the code, of the nonvanishing of an auxiliary function. The main block is the integral part, where everything is explicit. The tail is controlled by the height. No determinant is involved.
Step 6. From a nonzero lift to one representation
LiftAut_kgives a map that sends to the lift, shows that the lift is an automorphic form on , and shows that commutes with the group actions.ProjEx(proofprojEx, ProjEx.lean#L98) takes a nonzero automorphic form and gives an irreducible automorphic representation and an equivariant projection onto that does not kill the form. Its proof uses the Petersson inner product and Zorn's lemma.ReadLift_kuses the abstract lemmaAbsIso(an isotypic projection lemma) to read the weights of from the types of , and the local pairsLocPairat split places.
So the code takes one irreducible constituent of the lift. It does not count the multiplicity of the constituent.
Step 7. The other determinants of the code
The folder Development/WeilBound/ThetaLifts/LeviDeterminants has 116 files. None of them is below tLiftK on the spine. Most of its declarations on the spine are below theta_integrals_agree_and_local_matching_of_literature (8,520), on the side of the theta matching. There, the determinants are determinants of Levi blocks and characters of the Siegel parabolic subgroup. An example is PositivityTheory.ThKF0.parabolic_character_trivial_on_diagonal (53 declarations), which needs . These are not Stepanov determinants either.
Where it is in the code
| Declaration | Module | Size |
|---|---|---|
UpperTheory.TP.K.tLiftK |
…ThetaKernels.TLiftK |
2,709 |
tLift_holds_k |
…ThetaKernels.TPGHolds |
2,708 |
tools_holds_k |
same | 2,169 |
tLift_of_tools_k |
…ThetaKernels.TPGTop |
503 |
realPair_k |
…ThetaKernels.TPGRealPair |
140 |
RP.fockOf_k |
(below realPair_k) |
93 |
RP.formEx |
(below realPair_k) |
15 |
RP.exists_act2_equivariant_nablaSq_map_hitting_joint |
…ExponentialEntries.ExistsAct2EquivariantNablaSqMapHittingJoint |
10 |
RP.exists_act1_equivariant_nablaSq_map_hitting_joint |
…ExponentialEntries.ExistsAct1EquivariantNablaSqMapHittingJoint |
7 |
RP.jointNe |
…ExponentialEntries.JointNe |
2 |
bumpAny_k |
…ThetaKernels.TPGBumpAny |
128 |
liftAut_k |
…ThetaKernels.TPGLiftAut |
38 |
brEx |
…BlockDeterminants.MemClosureOf |
34 |
decomp_k |
…ThetaKernels.TPGDecomp |
34 |
datum_k |
…ThetaKernels.TPGDatum |
28 |
nonVan_k |
…ThetaKernels.TPGNonVan |
18 |
readLift_k |
…ThetaKernels.TPGReadLift |
14 |
schurStep_k |
…ThetaKernels.TPGSchurStep |
11 |
tail_k |
…ThetaKernels.TPGTail |
7 |
rallis_k |
…ThetaKernels.TPGRallis |
6 |
hgtFst_k |
…ThetaKernels.TPGHgtFst |
5 |
projEx |
…BlockDeterminants.ProjEx |
2 |
absIso |
…BlockDeterminants.AbsIso |
1 |
absNe |
…BlockDeterminants.AbsNe |
1 |
The prefix … is Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.ThetaParseval, and ExponentialEntries is inside BlockDeterminants. Names without a namespace are in UpperTheory.TP. "Size" is the number of declarations in the dominator subtree: the declarations that the trunk reaches only through this one. The small sizes of rallis_k, absNe and absIso mean that their proofs use shared lemmas that are also used elsewhere. The definitions hw, lpMinor and hwNe are shared in the same way: their dominator is the top theorem everyCharacter, not this branch.
Notes
- The timeline step 1 (the Stepanov determinant) has no counterpart in the code. There is no auxiliary polynomial, no vanishing to high order and no Wronskian in this branch. The closest piece is the argument of Step 5, where a main term is shown to be larger than a tail.
- The timeline step 4 ( through a determinant) has no counterpart in the code. There is no quantity in this branch and no positivity proved by a determinant. The code proves that one integral is not zero. It does not prove that some quantity is at least zero.
- The idea "Stepanov with multiplicity one" has no counterpart. The code projects onto one irreducible constituent (
projEx,absIso) and does not use or count multiplicity. - The timeline step 8 (iterated theta lifts , multiplicity , near ) has only a partial counterpart. The code has one lift for all . This page found no iteration of lifts in this branch, no gain of multiplicity and no parameter like near .
- The word "Parseval" in the folder name
ThetaParsevalis not used in any declaration of this branch. This page reads it as the Rallis inner product identity of Step 4, because that is the only identity of Parseval type in the branch. - The name
BlockDeterminantscovers files with no determinant in them (AbsNe,ProjEx,AbsIso,MemClosureOf). Only the subfolderExponentialEntriesand the definitionhwuse determinants. - The sizes on this page come from the full spine. They are smaller than the sizes on the Galois row page, which come from an older spine.
- This page does not unfold the fourteen tools of
Tools_k, the heightIsHgt,IsBump,SameType,HasType,IsLiftWtandLocPair. The Rallis step depends onswFullanddbl, which are large statements on their own. - The Lean code is not reviewed by a person. The words above describe what the statements say, as read from the code.
The source of this page. Markdown. Something is wrong? Report it.