riemann

The Lean code claims a proof of the Riemann Hypothesis. This site has not checked the claim yet. See what is checked.

Bessel periods, seesaw and separation of functionals

The timeline says that the period of an iterated theta lift is a Bessel period, and that interlacing weights control it. The Lean code has a theorem of this shape, called FunctionalsSeparate. This page shows what it states, how the proof goes up a tower of Bessel and Fourier-Jacobi periods, and where the seesaw is.

draft

Result

The unitary hypotheses node needs a statement called FunctionalsSeparate. It gets it from one theorem:

theorem functionalsSeparate_of_howeUnram_of_siegelWeil (P : ThetaLocalInputs)
    (hH : GlobalTheory.Hk3.HoweUnram) (hSW : GlobalTheory.Published.SiegelWeilUnitaryConvergent) :
    FunctionalsSeparate :=
  real_functionals_separate_of_hypothesis P hH hSW realInputE_holds

This is at FunctionalsSeparateOfHoweUnramOfSiegelWeil.lean#L17. Its dominator subtree has 4,530 declarations.

In words, FunctionalsSeparate says this. Take an iterated theta lift of a form uu along a row of mm steps, and take its Bessel period against a vector valued form Ψ\Psi on a smaller unitary group. For families with large parameters, there is one real test datum (ρ,ξ)(\rho, \xi), chosen from the input vector ww only, such that this Bessel period is not zero for every nonzero Hecke eigen-direction tt. So the Bessel periods separate the inputs.

The proof has two parts. The first part goes up a tower of Bessel and Fourier-Jacobi periods. It is proved in Lean with no literature hypothesis. The second part is a local multiplicity one statement at the real place. It turns "for each tt there is a test datum" into "one test datum for all tt".

The Lean code is not reviewed by a person. It compiles, but this page does not claim that the statements are the intended ones.

Idea

The timeline of the plan has two steps that this page compares with the code:

  • Step 7: "Determinants for W(⋅)W(\cdot) that contain the GGP periods. The values 00 and 11 mean interlacing weights."
  • Step 12: "Seesaw: the period of the iterated lift is a Bessel period, and it does not depend on the Hecke characters (Rallis)."

The code has the first half of Step 12 in a precise form. The quantity in FunctionalsSeparate is, by definition, a Bessel period (a GGP period) of an iterated theta lift. The proof that it is not zero uses a seesaw identity at the bottom of a tower, and then goes up one rung at a time. Each rung changes a Fourier-Jacobi period into a Bessel period, or back. This is the method of Ginzburg, Rallis and Soudry for the descent.

The code has interlacing weights only as a sign condition on Harish-Chandra parameters at the real place. The signs take values in Bool, so they are the "00 and 11" of the timeline. This page did not find a determinant whose entries are GGP periods. It also did not find a statement that the period does not depend on the Hecke characters. See the Notes.

Before you read

Plan

  1. Define the iterated lift thetaChi and the Bessel period Bplus.
  2. State FunctionalsSeparate.
  3. Follow the proof of real_functionals_separate_of_hypothesis.
  4. Look at the "seesaw pair" PairEx.
  5. Define the bottom period per0 and say why it is not zero.
  6. Go up the tower: Ascent, proved with no literature input.
  7. Get one nonzero period for each tt: WeakSep.
  8. Get one test datum for all tt: real multiplicity one, BurGapPos.
  9. Say where interlacing appears.

The steps

Step 1. The iterated lift and the Bessel period

The code works with a grid of hermitian spaces Vi,jV_{i,j} over EE, with nodes such as .grid i 0, .core i and .top 0. For a node XX, Fn G X is the type of functions on U(VX)(𝔸)U(V_X)(\mathbb A). The type M : Vol G gives each node a set M.fd X and a measure M.ν X, and an integral over M.fd X plays the role of an integral over [U(VX)]=U(VX)(F)\U(VX)(𝔸)[U(V_X)] = U(V_X)(F) \backslash U(V_X)(\mathbb A).

One lift step along an arrow aa of the grid is liftA. It is the integral of a theta kernel against the input form, over the fundamental set of the source. The iterated lift liftP composes these steps along a path. For a form uu on U(V0,0)(𝔸)U(V_{0,0})(\mathbb A), a real datum ρ\rho and a Schwartz datum Φ\Phi, the code sets (BplusOfEquivariant.lean#L263)

θχ(ρ,Φ,u)=θm−1∘⋯∘θ0(u),\theta_\chi(\rho, \Phi, u) = \theta_{m-1} \circ \dots \circ \theta_0 (u),

the lift along the row path from .grid 0 0 to .grid m 0. Each θi\theta_i uses the Weil datum on the edge ii and the Schwartz function given by (ρ,Φ)(\rho, \Phi).

The Bessel period is Bplus (BplusOfEquivariant.lean#L286). Let VtopV_{\mathrm{top}} be the space of the node .top 0, and let ι:U(Vtop)→U(Vm,0)\iota : U(V_{\mathrm{top}}) \to U(V_{m,0}) be the stabilizer embedding embTop for an orthogonal decomposition of Vm,0V_{m,0}. Let NN be the unipotent radical of a flag in Vm,0V_{m,0} (the type NFlag), and let ψN\psi_N be the generic character besChar. Then for φ\varphi on U(Vtop)(𝔸)U(V_{\mathrm{top}})(\mathbb A) and FF on U(Vm,0)(𝔸)U(V_{m,0})(\mathbb A),

B+(φ,F)=∫[U(Vtop)]∫[N]φ(h) F(n ι(h)) ψN(n)‾ dn dh.B^+(\varphi, F) = \int_{[U(V_{\mathrm{top}})]} \int_{[N]} \varphi(h)\, F(n\, \iota(h))\, \overline{\psi_N(n)}\, dn\, dh.

The lemma Bplus_eq says that this is the general Bessel period Per.besPer of the pair, with φ‾\overline{\varphi} in place of φ\varphi. So Bplus is the global GGP period of Bessel type.

The last definition is fPsiPhi (BplusOfEquivariant.lean#L326):

f(ρ,ξ,Ψ,Φ,u)=B+(⟨ξ,Ψ⟩,θχ(ρ,Φ,u)).f(\rho, \xi, \Psi, \Phi, u) = B^+\big(\langle \xi, \Psi \rangle, \theta_\chi(\rho, \Phi, u)\big).

Here Ψ\Psi is a vector valued function and ξ\xi is a linear functional on its target space. The scalar function pairVec c ξ Ψ is h↦ξ(c.ρ(h)−1Ψ(hf))h \mapsto \xi\big(c.\rho(h)^{-1} \Psi(h_f)\big).

So the code does contain the first claim of timeline Step 12, as a definition: the number that is studied is the Bessel period of the iterated lift.

Step 2. The statement FunctionalsSeparate

FunctionalsSeparate is at LevelPlusSubgroup.lean#L83. Leaving out the bookkeeping of the families, it says:

For all ε\varepsilon and all CF≥6510C_F \geq 6510 there is x0x_0 such that the following holds for each family whose size xx is at least x0x_0 and which satisfies the size conditions SizeRows. For each grid GG with Weil data WW, each choice of measures MM of row type, and each nonzero vector ww in the space SmT (R.MY 0), there are ρ\rho and ξ\xi with Separates R W M w ρ ξ.

And Separates (line 65 of the same file) says: for each nonzero tt in the eigenspace R.EEat R.triv there are Ψ\Psi in the column space Cols G W.θ and a datum Φ\Phi such that the integrals converge (FConv) and

f(ρ,ξ,Ψ,Φ,uw,t)≠0,f(\rho, \xi, \Psi, \Phi, u_{w,t}) \neq 0,

where uw,tu_{w,t} = rowForm R w t is the form built from ww and tt.

The order of the quantifiers is the content. The pair (ρ,ξ)(\rho, \xi) depends on ww, but not on tt. The forms Ψ\Psi and Φ\Phi may depend on tt.

Step 3. The proof of real_functionals_separate_of_hypothesis

The theorem real_functionals_separate_of_hypothesis (RealFunctionalsSeparateOfHypothesis.lean#L15, 3,524 declarations) takes four inputs: the literature record ThetaLocalInputs, the hypotheses HoweUnram and SiegelWeilUnitaryConvergent, and the real statement RealInputE. The fourth input is proved: it is realInputE_holds (942 declarations). The first three are hypotheses that come from the parent node.

The proof is a sequence of have steps:

  1. rowModels, rowStep, rowTower: one theta step maps a space of forms of a given type to the next one, so the whole row is a tower of such spaces (RowTower). The step rowStep uses the "seesaw pair" of Step 4.
  2. conv: the integrals of the row converge.
  3. per: the bottom period is not zero (PeriodNe, Step 5).
  4. onto: the core lifts are onto (CoreOnto). This is twist_core_surjective, with 332 declarations. It uses HoweUnram and SiegelWeilUnitaryConvergent.
  5. weak: for each tt some Bessel period is not zero (WeakSep, Step 7). This step calls the ascent bessel_period_nonvanishing_ascent_of_depth_data (Step 6).
  6. The last line, bessel_separate_of_step_gap, makes the test datum independent of tt (Step 8).

Step 4. The "seesaw pair" PairEx

The anchor exists_seesaw_pair_of_theta_data (ExistsSeesawPairOfThetaData.lean#L40) has the type ThetaLocalInputs → PairEx. Its name says "seesaw". Its content is different.

PairEx (ParRowZero.lean#L17) says: for each pair of real parameters and each pair of discrete series models MM, M′M', there is a linear map

I:Pol→Hom(M′,M)I : \mathrm{Pol} \to \mathrm{Hom}(M', M)

where Pol\mathrm{Pol} is the space PolF of the code, such that, for each Weil representation ω\omega and each vacuum vector ff, the operator I(f)I(f) has the property IsItW (LinksChar.lean#L58). This property says that I(f)I(f) is nonzero, bounded, equivariant for one group of the dual pair and invariant for the other, at the real places.

So PairEx is the existence of a real intertwiner for one theta step. It is not a seesaw identity between two periods. Its proof uses the fields discreteSeriesCover and harishChandraModules of ThetaLocalInputs, so it rests on literature hypotheses. Its own subtree has only 3 declarations, because the lemmas it calls are shared with other branches.

Step 5. The bottom period

At the bottom of the tower, the code uses the period per0 (OffQOfSizeRows.lean#L81):

P0(F,u)=∫[U(V0,0)]F(ι0(h)) u(h) dh,P_0(F, u) = \int_{[U(V_{0,0})]} F(\iota_0(h))\, u(h)\, dh,

where FF is a form on the core node .core 0 and ι0\iota_0 is a stabilizer embedding. This is a period of GGP type for the smallest pair of the tower.

PeriodNe (line 119) says that, for some core vectors, P0≠0P_0 \neq 0. It is proved by Branch.periodNe_of_eigen (651 declarations) from HarishChandraModules, CasselmanWallach, CuspRapidDecay and RealInputE. The statement RealInputE is a real matrix coefficient identity of the form

∫⟨v,π(ιh)v⟩‾ ⟨b,σ(h)w′⟩ dh=c ⟨w′,w′⟩ ⟨b,w′⟩,c>0,\int \overline{\langle v, \pi(\iota h) v \rangle}\, \langle b, \sigma(h) w' \rangle\, dh = c\, \langle w', w' \rangle\, \langle b, w' \rangle, \qquad c > 0,

with bounds on decay. So the real place gives a nonzero local period, and a cusp form with a nonzero global period exists.

Step 6. The ascent

This is the main step. Ascent (OffQOfSizeRows.lean#L127) says:

Let Ψ0,…,Ψm\Psi_0, \dots, \Psi_m be a chain of rapidly decreasing forms on the core nodes, with Ψi\Psi_i the down lift of Ψi+1\Psi_{i+1} (IsColChain). Let uu be rapidly decreasing on the row. If P0(Ψ0,u)≠0P_0(\Psi_0, u) \neq 0, then there are ρ\rho and Φ\Phi with B+(Ψm,θχ(ρ,Φ,u))≠0B^+(\Psi_m, \theta_\chi(\rho, \Phi, u)) \neq 0.

In words: if the bottom period is not zero, then the Bessel period at the top of the iterated lift is not zero.

The theorem bessel_period_nonvanishing_ascent_of_depth_data : DepFixed → Ascent (BesselPeriodNonvanishingAscentOfDepthDataStatement.lean#L11, 2,123 declarations) proves it. The hypothesis DepFixed says that the depth vectors are fixed by the level groups. It is proved by dependence_fixed (DependenceFixedStatement.lean#L11).

The proof ascent_of_depFixed (BesselPeriodNonvanishingAscentOfDepthData.lean#L21) puts together four facts about a tower of periods:

  • Rung0: if P0≠0P_0 \neq 0, then the first Fourier-Jacobi period of the tower is not zero.
  • RungB: if the Fourier-Jacobi period at level 2k+12k+1 is not zero, then the Bessel period at level 2k+22k+2 is not zero.
  • RungJ: if the Bessel period at level 2k+22k+2 is not zero, then the Fourier-Jacobi period at level 2k+32k+3 is not zero.
  • The frames (existsGoodGridFrames_of_depthFixed, 1,356 declarations): the grid has the orthogonal decompositions that each rung needs, and the top Bessel period of the tower is Bplus.

Each rung is a statement about the lift of one form, UpBF and UpFB in TowerEx.lean. The rungs share one fact about the Heisenberg group: a tame functional on theta functions that kills the translates of one nonzero vacuum vector kills all vacuum vectors (tame_functional_vacuum_irreducibility, 45 declarations).

The seesaw is in Rung0. Its key lemma is UpLast (TowerEx.lean#L155). For an orthogonal sum X=T⊕L′′X = T \oplus L'' with dim⁡L′′=1\dim L'' = 1, it says: if

∫[U(T)]θX(φ,Ξ)(ι(h,1)) u(h) dh≠0,\int_{[U(T)]} \theta_{X}(\varphi, \Xi)\big(\iota(h, 1)\big)\, u(h)\, dh \neq 0,

then the Fourier-Jacobi period of the lift θT(u,Φ)\theta_T(u, \Phi) against φ\varphi is not zero for some vacuum vectors Φ\Phi, Φ0\Phi_0. The proof upLast writes both sides as one double integral over [U(W0)]×[U(T)][U(W_0)] \times [U(T)] of φ(y1) u(y2) ω(y1,ι(y2,1))Ξ(0)\varphi(y_1)\, u(y_2)\, \omega(y_1, \iota(y_2, 1))\Xi(0), and changes the order of integration. This exchange of the two integrals is the seesaw identity.

The closure of bessel_period_nonvanishing_ascent_of_depth_data has 14,131 declarations. It contains no literature hypothesis and no axiom. So, if the Lean statements are the intended ones, the ascent is a theorem of the code and not an input.

Step 7. A nonzero period for each tt

WeakSep (OffQOfSizeRows.lean#L130) says that for each tt there are ρ,ξ,Ψ,Φ\rho, \xi, \Psi, \Phi with f(ρ,ξ,Ψ,Φ,uw,t)≠0f(\rho, \xi, \Psi, \Phi, u_{w,t}) \neq 0. Here (ρ,ξ)(\rho, \xi) may depend on tt.

The proof weakSep_of_steps (RowSeparationByRealFunctionalsOfChainSteps.lean#L71) is short:

  1. PeriodNe gives core vectors with P0≠0P_0 \neq 0.
  2. CoreOnto puts these vectors in the span of the vectors that a chain can reach.
  3. So there is a chain Ψ0,…,Ψm\Psi_0, \dots, \Psi_m with Ψm=⟨ξ,Ψ⟩\Psi_m = \langle \xi, \Psi \rangle and P0(Ψ0,u)≠0P_0(\Psi_0, u) \neq 0.
  4. Ascent gives B+(Ψm,θχ(ρ,Φ,u))≠0B^+(\Psi_m, \theta_\chi(\rho, \Phi, u)) \neq 0.

Step 8. One test datum for all tt

The last step is bessel_separate_of_step_gap (288 declarations). Its main part is separate_of_burGapPos (SepGap.lean#L222). It uses a factorization, the lemma factor_gap in the same file. It gives one function a(ρ,ξ)a(\rho, \xi), the same for all tt, Ψ\Psi and Φ\Phi, such that for each tt, Ψ\Psi and Φ\Phi there is a number ℓ\ell with

f(ρ,ξ,Ψ,Φ,uw,t)=a(ρ,ξ)⋅ℓfor all (ρ,ξ).f(\rho, \xi, \Psi, \Phi, u_{w,t}) = a(\rho, \xi) \cdot \ell \quad \text{for all } (\rho, \xi).

To build aa, the code uses that the line of real Bessel functionals at the top has dimension at most one. Now take any tt. WeakSep gives (ρ0,ξ0)(\rho_0, \xi_0) with f≠0f \neq 0, so a(ρ0,ξ0)≠0a(\rho_0, \xi_0) \neq 0. For a second t′t', WeakSep gives some (ρ′,ξ′,Ψ′,Φ′)(\rho', \xi', \Psi', \Phi') with f≠0f \neq 0, so the number ℓ\ell for (t′,Ψ′,Φ′)(t', \Psi', \Phi') is not zero. Then f(ρ0,ξ0,Ψ′,Φ′,uw,t′)=a(ρ0,ξ0)⋅ℓ≠0f(\rho_0, \xi_0, \Psi', \Phi', u_{w,t'}) = a(\rho_0, \xi_0) \cdot \ell \neq 0. So the one datum (ρ0,ξ0)(\rho_0, \xi_0) works for every tt. This is FunctionalsSeparate.

The dimension bound is BurGapPos (BurGapOfHyp.lean#L33):

Let JJ and J0J_0 be hermitian matrices with a frame in which J(z,z)<0J(z, z) < 0 and J0J_0 is positive definite. Let χ\chi be a generic character, σ\sigma an irreducible unitary representation of U(J)U(J) with a gap at least 120n3120 n^3 in its parameter (IsGapDS), and π0\pi_0 an irreducible finite dimensional representation of U(J0)U(J_0). Then the space besselForms of Bessel functionals for (σ,π0,χ)(\sigma, \pi_0, \chi) on the smooth vectors of σ\sigma has rank at most 11.

This is real local multiplicity one for Bessel models, in a case with a large gap. It is proved in the code by burGapPos (145 declarations), not assumed.

Step 9. Interlacing

The interlacing condition of the timeline appears at the real place as Interlaced (ProjExists.lean#L34). Let λ1,…,λn+1\lambda_1, \dots, \lambda_{n+1} be the Harish-Chandra parameter of a discrete series of a unitary group in n+1n+1 variables, with signs εi∈{true,false}\varepsilon_i \in \{\text{true}, \text{false}\}, and let μ1,…,μn\mu_1, \dots, \mu_n with signs εj′\varepsilon'_j be one for nn variables. Merge the two lists in increasing order. Then Interlaced ε λ ε' μ says: for two neighbours xx, yy of the merged list, the signs are equal if and only if xx and yy come from different lists.

This is the sign form of the branching law for discrete series. The signs are values in Bool, so they are the "00 and 11" of timeline Step 7. The structure Par (line 52) adds this condition and size bounds to a pair of parameters. The quantifier ForPair (line 81), which is used in the statement RealInputE of Step 5, ranges over such pairs.

There is a second form in Formalism. The statement BesselPeriodGGP (BesselPeriodGGP.lean#L105) says: for k≥2k \geq 2 even and Harish-Chandra parameters uu, vv, bb with the interlacing InterlacingCondition (vi<uiv_i < u_i, ui+1<viu_{i+1} < v_i and −b0<uk−1-b_0 < u_{k-1}) and half-integral differences, a discrete series σ\sigma and a finite dimensional π\pi of the right type have a nonzero local Bessel integral

∫⟨σ(x0)w,σ(p1p2)σ(x)w⟩ ψ(p2)‾ π(p1)−1 dp1 dp2≠0.\int \langle \sigma(x_0) w, \sigma(p_1 p_2)\sigma(x) w \rangle\, \overline{\psi(p_2)}\, \pi(p_1)^{-1}\, dp_1\, dp_2 \neq 0.

This is the local GGP statement at the real place in the interlacing case. It is not reachable from the main theorem, so it is not part of the proof.

Where it is in the code

Size is the number of declarations that the node dominates in the spine of the main theorem. A size of 1 is a definition that is used in more than one place.

Declaration Module Size
UpperTheory.Lit.functionalsSeparate_of_howeUnram_of_siegelWeil FunctionalsSeparateOfHoweUnramOfSiegelWeil.lean#L17 4,530
UpperTheory.Lit.real_functionals_separate_of_hypothesis RealFunctionalsSeparateOfHypothesis.lean#L15 3,524
GlobalTheory.T.bessel_period_nonvanishing_ascent_of_depth_data BesselPeriodNonvanishingAscentOfDepthDataStatement.lean#L11 2,123
GlobalTheory.Asc.ascent_of_depFixed BesselPeriodNonvanishingAscentOfDepthData.lean#L21 2,122
GlobalTheory.T.existsGoodGridFrames_of_depthFixed ExistsGoodGridFramesOfDepthFixedStatement.lean#L12 1,356
GlobalTheory.T.fockConjugates_span_depth_data FockConjugatesSpanDepthDataStatement.lean#L11 226
GlobalTheory.T.bessel_to_fourierJacobi_nonvanishing_tower BesselToFourierJacobiNonvanishingTowerStatement.lean#L11 119
GlobalTheory.T.fourierJacobi_to_bessel_nonvanishing_tower FourierJacobiToBesselNonvanishingTowerStatement.lean#L11 71
GlobalTheory.T.tame_functional_vacuum_irreducibility TameFunctionalVacuumIrreducibilityStatement.lean#L11 45
GlobalTheory.T.nonvanishing_thetaTower_bottom_rung NonvanishingThetaTowerBottomRungStatement.lean#L11 15
GlobalTheory.T.lastSeesaw_periodNonvanishing LastSeesawPeriodNonvanishingStatement.lean#L11 12
GlobalTheory.T.dependence_fixed DependenceFixedStatement.lean#L11 30
UpperTheory.Lit.realInputE_holds RealBranch.lean#L231 942
UpperTheory.Lit.Branch.periodNe_of_eigen BranchPeriod.lean#L14 651
GlobalTheory.T.twist_core_surjective TwistCoreSurjectiveOfLocalComponents.lean#L32 332
UpperTheory.Lit.bessel_separate_of_step_gap BesselSeparate.lean#L9 288
UpperTheory.Lit.burGapPos Separate.lean#L32 145
UpperTheory.Lit.Bur.separate_of_burGapPos SepGap.lean#L222 56
GlobalTheory.T.rowSeparation_by_realFunctionals_of_chain_steps RowSeparationByRealFunctionalsOfChainStepsStatement.lean#L11 8
GlobalTheory.T.exists_seesaw_pair_of_theta_data ExistsSeesawPairOfThetaData.lean#L40 3
UpperTheory.Lit.Rallis.RallisIPProof.rallis_of_dm RallisDM.lean#L24 93
PI.BesselPeriodGGP.BesselPeriodGGP BesselPeriodGGP.lean#L105 not in the spine

The node functionalsSeparate_of_howeUnram_of_siegelWeil is a child of nonempty_hyps_definite_side_of_closed_bound (SiegelEisensteinSecondTermHypotheses.lean#L44). The node rallis_of_dm is in a different branch: its parent is rallis_inner_product_convergent_of_literature, under the literature branch.

Notes

  • What is hypothesis and what is proof. ThetaLocalInputs, HoweUnram and SiegelWeilUnitaryConvergent are hypotheses of this branch. They are used in the "seesaw pair" (Step 4), in the bottom period (Step 5) and in CoreOnto (Step 3). The ascent (Step 6), the dependence statement dependence_fixed, RealInputE and the multiplicity one bound BurGapPos are proved in the code. The page did not check whether each hypothesis is a correct form of the published theorem it is named after.
  • The name "seesaw". The theorem exists_seesaw_pair_of_theta_data builds a real intertwiner for one theta step. It does not state a seesaw identity. The real seesaw identity of the branch is the change of the order of integration in upLast (Step 6).
  • Timeline Step 7, determinants. The page found no determinant for W(⋅)W(\cdot) whose entries are GGP periods. In this branch the periods enter one at a time, and the step from many tt to one test datum is a dimension bound (BurGapPos), not a determinant. The namespace Formalism.QuantumDeterminants is used for the hermitian forms and the matrix groups of the real place, not for a determinant of periods. The quantity W(⋅)W(\cdot) of the timeline has no counterpart here.
  • Timeline Step 7, "00 and 11". The only counterpart is the Bool valued sign vectors of Interlaced and of eps48 in BesselPeriodGGP. The timeline does not say more, so the page does not claim more.
  • Timeline Step 12, independence of the Hecke characters. The page found no statement that the period does not depend on the Hecke characters. The rung statements UpBF, UpFB and UpLast hold for all splitting characters that satisfy a product relation (for example χV=χAχz\chi_V = \chi_A \chi_z). This is a uniform statement in the characters, not an identity between periods for different characters.
  • Rallis. The name Rallis appears in rallis_of_dm, which proves RallisInnerProductConvergent from ResidueKilled.DM, SiegelWeilUnitaryConvergent and WeilThetaConvergence. That statement is a Rallis inner product formula: the Petersson inner product of two theta lifts is a zeta integral at the point sZero. It is not used by FunctionalsSeparate. The other proof that a theta lift is not zero, through a Rallis identity, is on the page Block determinants and theta Parseval.
  • The GGP statement in Formalism. BesselPeriodGGP is a clear statement of local nonvanishing in the interlacing case, but it is not reachable from the main theorem. The proof uses RealInputE and BurGapPos in its place.
  • Not unfolded. This page does not unfold SizeRows, Cols, rowForm, RowTower, CoreOnto beyond its role, Frames, Ends, Loc, StBF, StFB, IsGapDS or besselForms. The plain words for these objects stay at the level of their names and shapes.

The source of this page. Markdown. Something is wrong? Report it.