The Weil bound and arithmetic positivity
The folder WeilBound does not contain Weil's explicit formula. Its largest branch on the spine proves a positivity statement of Arakelov geometry, the statement DeepStR. This page states DeepStR, shows the inputs it comes from, and says what the code has in place of the positivity steps of the timeline.
draft
Result
This page covers four steps of the timeline: step 4 ( through a determinant), step 5 (the Guinand-Weil sign), step 6 (a positivity for a test function with a factor ) and step 13 (the Bost slope inequality). The Lean code has no direct counterpart for steps 4 and 6. It has the Guinand-Weil function of step 5 and a proved Bost slope inequality for step 13, but neither is in this branch. The Notes section gives the details.
What the code does have, under the folder Development/WeilBound, is a positivity theorem of a different kind. The anchor of this page is this theorem (AhSlimU.lean#L9).
theorem deep_slim_use (h₁ : ResolutionCharZero) (h₂ : PrincipalisationCharZero)
(hPL : PoincareLelongInv) (hU : PositivityTheory.MbHsUse.HSUse)
(hBig : MoriwakiBigStatement) (hF : HT.FarguesExact) (hZ : GR.ZarhinStatement)
(hN : Pub.NefRR) : Plug.DeepStR
The conclusion DeepStR (ModelSmall.lean#L63) says this. There is a constant with the following property. Take data (a structure D7), a core T : CoreJ D that satisfies the laws LawsJ, with for the two integers of . Take , a tower object Y : Deep T j that is good for some and , and whose level has at most 15 prime factors. Then
holds, where
Here is the CM field of the host of (a number field), is its root discriminant, and is the quadratic Dirichlet character modulo the prime of (SemiposAtOfPositive.lean#L105). The number is the norm of a fixed vector .
In words, the Lean code states: if eight published theorems hold, then on the unitary Shimura varieties of the tower, the mean volume slope of small cusp sections is at least times an error term. The error term grows like times the size of the weight.
Idea
A lower bound on a slope is a positivity statement. It says that a lattice of sections is not too thin. The branch gets it from two theorems of arithmetic intersection theory.
- Moriwaki and Yuan: for a nef hermitian line bundle on an arithmetic variety of dimension , the self-intersection is at most the arithmetic volume. So a lower bound for gives many small sections.
- The arithmetic Hilbert-Samuel bound (Gillet-Soulé, Abbes-Bouche, Zhang): the number of small sections grows at most like . Together with Zhang's successive minima, this controls the intersection number from both sides.
The branch then builds a tower of integral models of unitary Shimura varieties (the RootTower of GoodTowerExistsX). On that tower it computes the arithmetic intersection numbers of the Hodge line bundles twisted by a weight (the statement VolumeTheoremX). A Bost-style bound on the slopes of the Lie algebra, and the Chowla-Selberg formula, give the error term . The volume theorem then gives the lower bound for the mean slope.
DeepStR is not the end. It feeds topCovolG_alt_alt, which gives a height lower bound (HeightCondition) and then the covolume bound CovolumeBoundOfX of the literature step.
Before you read
You need these ideas.
- A number field , its ring of integers , CM fields and the root discriminant.
- A Hermitian form and its unitary group. A unitary Shimura variety of signature .
- Cusp forms, as sections of an automorphic line bundle with a sup norm.
- A hermitian lattice over : a projective -module with a hermitian norm at each complex place. Its degree, its slope and its maximal slope .
- Arithmetic intersection numbers and the arithmetic volume (Arakelov geometry).
- Dirichlet characters, Dirichlet L-functions and the von Mangoldt function (only for the Notes on step 5).
- For one input: p-adic Hodge theory (the Hodge-Tate sequence of Fargues).
Plan
- Unfold the error term and
MeanAll. - State the two positivity inputs,
MoriwakiBigStatementandHSUse, and the volume they use. - Get an absolute Siegel lemma (
LineOfLargeDegree) and a slope bound for the Lie algebra (SlopeBoundSt). - Get a good tower and the volume theorem (
GoodTowerExistsX,VolumeTheoremX). - Get
DeepStRfrom the volume theorem (deepStR_of_volume). - Say which inputs are literature and which are proved.
The steps
Step 1. The mean slope and the error term
The definitions are in the namespace GlobalTheory.CovHt (SemiposAtOfPositive.lean#L101). A weight is a family of integers , with one row for each index and entries in each row. Write . The condition WtGap u g says that , that each row is strictly decreasing, and that when and . For a number the error term is
where is an explicit bound (bndB). Then MeanAll s C says: for each and with WtGap u g, there are real numbers , one for each connected component , with
The volume slope is compVolSlope (IsHomogeneousCompIdeal.lean#L280). For , let count the lattice sections of weight on whose sup norm at the good embeddings is at most , normalized in . Then means for all , where is the top degree of on . So a lower bound on the mean slope says: on average over the components, there are many small cusp sections.
In DeepStR the value of is .
Step 2. Arithmetic positivity: Moriwaki and Hilbert-Samuel
The arithmetic volume is defined in PenVol.lean#L35. For a family of lattices and a smallness condition ,
MoriwakiBigStatement (MoriwakiSt.lean#L29) works with an arithmetic variety of dimension inside a product of projective spaces, and a hermitian line bundle (HermLine) that is semipositive, invariant under complex conjugation, nef on the fibres and nef on the generic fibre. It says
where is computed by an IntersectionSystem that satisfies the axioms IsIntersectionSystem, and the volume counts sections with sup norm at most 1.
HSUse (SmallGeneratedCountUpperOfUse.lean#L12) is three statements. ArithKleiman says that a nef bundle with nonnegative heights on arithmetic curves has . G7 and ArithmeticVolumeNef say that the normalized count of small sections has . The proof hsLinks_of_use turns HSUse and MoriwakiBigStatement into six statements. Two of them are Zhang's successive minima bounds: if every curve has height at least , then , and if a Zariski dense set of curves has height at most , then .
Both inputs are proved in Lean without hypotheses: moriwakiBig_outright (Outright.lean#L9) and hsUse_outright (line 13 of the same file). Their proofs go through hsChain, which dominates 3,745 declarations. The site also lists them in the literature inputs, because the intersection numbers are abstract.
Step 3. The Siegel lemma and the slope bound
LineOfLargeDegree.Statement (KernelsLattice.lean#L85) is an absolute Siegel lemma. For each number field , each hermitian lattice of rank over and each , there is a finite extension and a vector with
The proof lineOfLargeDegree_of_use gets it from the successive minima upper bound of Step 2.
SlopeBoundSt (SlopeBoundSt.lean#L72) is a bound on the Lie algebra of a semi-abelian scheme over with principal generic fibre. Let be the Lie algebra with the Hodge metric. Then there is a constant , independent of all data, with
Here is the supremum of the slopes over the nonzero submodules , and is the degree divided by (Slopes.lean#L35). This is the place where the branch is closest to the Bost slope method. The proof TopSlope.slopeBound (SlopeBoundOfLargeDegreeLine.lean#L94) does not use a slope inequality. For each it takes a short vector of from the Siegel lemma, over an extension . Then a key degree bound () bounds the degree of that vector. Together they give .
Step 4. The good tower and the volume theorem
good_tower_volume_theorem_bis gives two statements (GoodTowerExistsX.lean#L22).
GoodTowerExistsX says: for a CM field , a host, a datum with and a global integral model with split components, there is a root tower with a good origin that satisfies the condition Extra.
VolumeTheoremX (GoodTowerExistsX.lean#L28) says: there is such that for abelian over , , , and at most bad primes in , six things hold for every full intersection system . The last of them is MeanSlope. For a weight and above the bad primes,
where is the self-intersection of the line bundle of weight on the component , divided by , the volume and the flag degree (Proportional.lean#L62). This proof is the largest part of the branch: volume_theorem_of_inputs dominates 8,967 declarations. The Chowla-Selberg formula GlobalTheory.LFunction_one_and_mean_log_eta gives the term with . It says , and the mean of over the ideal classes is .
Step 5. From the volume theorem to DeepStR
deepStR_of_volume (DeepStROfVolume.lean#L21) takes NefRR, the bundle Top.Given, an intersection system, the birational pullback formula, GoodTowerExistsX and VolumeTheoremX. It checks the bad prime count and the conditions on for the data of DeepStR. Then it compares the intersection slope of Step 4 with the volume slope of Step 1. The lemma SlopeVolM.slope_sub_cost_le_compVolSlope (UniformAllNormHeightBound.lean#L300) gives
This is where the Moriwaki inequality of Step 2 is used: an intersection number gives a count of small sections.
The proof of the anchor, deepStR_of_use (DeepStROfUse.lean#L12), joins Steps 2 to 5 in five lines. It builds the Siegel lemma, Top.Given, and the tower and volume pair. It takes Prov.HS and the birational pullback formula out of Top.Given, and calls deepStR_of_volume.
Step 6. What is literature and what is proved
The parent topCovolSlim2_use_alt_alt receives fifteen hypotheses and passes eight of them to deep_slim_use. In the proof of the Riemann Hypothesis, every_character_of_literature_of_vWin supplies them (EveryCharacterOfLiteratureOfVWin.lean#L812).
| Hypothesis | Source | Published result (from links/literature.yaml) |
|---|---|---|
ResolutionCharZero |
resolution_char_zero_of_literature |
Hironaka's resolution of singularities |
PrincipalisationCharZero |
principalisation_char_zero_of_literature |
Principalisation of ideals (Hironaka) |
PoincareLelongInv |
poincare_lelong_inv_of_literature |
The Poincaré-Lelong formula |
HSUse |
hsUse_outright (proved in Lean) |
Arithmetic Hilbert-Samuel, upper bound |
MoriwakiBigStatement |
moriwakiBig_outright (proved in Lean) |
Moriwaki and Yuan on volumes |
FarguesExact |
fargues_exact_of_literature |
Exactness of the Hodge-Tate sequence (Fargues) |
ZarhinStatement |
zarhin_statement |
Zarhin's trick |
NefRR |
nef_rr_of_literature |
Asymptotic Riemann-Roch for nef divisors |
Everything else in the branch is proved in Lean from these eight inputs. That includes the Siegel lemma, SlopeBoundSt, the tower, the volume theorem and the comparison of Step 5. The proofs have not been reviewed by a person.
Where it is in the code
Sizes are dominator sizes: the number of declarations that only this node reaches on the way down from the top. All paths are relative to lean/src.
| Declaration | File | Size |
|---|---|---|
SelfIntersectionVolumeEstimates.topCovolSlim2_use_alt_alt (parent) |
.../ThirdPlaceSeries/TopCovolSlim2Use.lean |
52,322 |
PositivityTheory.HtPt.Ah.deep_slim_use |
.../HilbertSamuelApplications/AhSlimU.lean |
30,358 |
GlobalTheory.CompanionTheory.Ar.Plug.deepStR_of_use |
.../HilbertSamuelApplications/DeepStROfUse.lean |
29,968 |
GlobalTheory.CompanionTheory.Ar.Link.good_tower_volume_theorem_bis |
.../HilbertSamuelApplications/GoodTowerVolumeTheoremBis.lean |
21,078 |
volume_theorem_of_inputs (under the previous line) |
8,967 | |
GlobalTheory.CompanionTheory.Ar.Plug.deepStR_of_volume |
.../GeometryProofs/DeepStROfVolume.lean |
1,218 |
GlobalTheory.CompanionTheory.Ar.Giv.lineOfLargeDegree_of_use |
.../HilbertSamuelApplications/LineOfLargeDegreeOfUse.lean |
1,206 |
GlobalTheory.CompanionTheory.Ar.Sl.TopSlope.slopeBound |
.../GeometryProofs/SlopeBoundOfLargeDegreeLine.lean |
850 |
PositivityTheory.Pf1.HilbertSamuelMoriwaki.moriwakiBig_outright |
.../MoriwakiBigTheorem/Outright.lean |
3 |
PositivityTheory.Pf1.HilbertSamuelMoriwaki.hsUse_outright |
.../MoriwakiBigTheorem/Outright.lean |
3 |
The HilbertSamuelApplications and MoriwakiBigTheorem files are in Development/WeilBound/CoreStatements/AutomorphicKernels/MoriwakiBigness/. The GeometryProofs files are in Development/AutomorphicSpectrum/Proofs/. The parent file is in Development/AutomorphicArithmetic/ThetaCorrespondence/ThetaPairLifts/. The other child of the parent, topCovolG_alt_alt, dominates 12,516. The two outright theorems have size 3 because their proof hsChain (3,745) is shared: its dominator is every_character_of_literature_of_vWin. The full closure of deep_slim_use (all declarations it uses, shared or not) has 87,553 declarations. In the dominated part, about 14,800 declarations are in Development/AutomorphicSpectrum/Proofs, about 6,700 in Development/WeilBound/CoreStatements and about 6,400 in GroundTheory/HeightsAndTheta/Heights.
Notes
- The name
WeilBoundof the folder does not refer to Weil's explicit formula. The names with "Weil" in this branch are about Weil pairings on abelian schemes. The words "Guinand", "Stepanov" and "Bost" do not occur in the Lean source. - Timeline step 4 ( through a determinant, read as Stepanov with multiplicity one) has no counterpart in the code. There is no quantity and no positivity proved by a determinant. See also the determinants page.
- Timeline step 6 ( gives a bound larger than ) has no counterpart in the code. There is no test function of this form and no exponent of this kind. The positivity in this branch is the lower bound on mean slopes of Step 1, with an error term in and .
- Timeline step 5 (the Guinand-Weil sign): the code has a Guinand-Weil type function,
GfuninFormalism/LocalRingCardinality/DataParams₂.lean, with . It is used on the side of the theta matching. It is not in the closure ofdeep_slim_use. The only L-function term in this branch is , which comes from Chowla-Selberg, not from an explicit formula. - Timeline step 13 (the Bost slope inequality): the code proves a slope inequality for Euclidean -lattices,
Formalism.F.SlopeInequality(Statement.lean#L75). If is injective and , then . Its proof isslopeInequality_of. It is not used in this branch. Here the role of a slope bound is played bySlopeBoundSt, which is proved from the Siegel lemma and a degree bound, not from a slope inequality. - In
TopSlope.slopeBoundthe second conclusionProv.LemmaSis the same statement asSlopeBoundSt(anabbrev). The proof gives the same term twice. MoriwakiBigStatementis weaker than the published theorem: it has where the published result for nef bundles has equality.HSUsehas only the upper bound. In both, the intersection numbers come from an abstractIntersectionSystemwith the axiomsIsIntersectionSystem, not from the Gillet-Soulé construction. So the results depend on those axioms.- This page does not unfold
Top.Given(a large conjunction of about twenty statements), the structuresD7,CoreJ,LawsJandDeep, the conditionExtra, or the first five parts ofVolumeTheoremX. - The site does not claim that the proof is correct. The Lean code states the results above, and nobody has reviewed it. The trust report says what has been checked.
The source of this page. Markdown. Something is wrong? Report it.