riemann

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

The Weil bound and arithmetic positivity

To read this chapter you need Arakelov geometry: Hermitian line bundles, arithmetic intersection numbers and volumes, and the slopes of Hermitian lattices, with a little about CM fields and Shimura varieties.

The Weil bound chapter is not about Weil's explicit formula. It follows the branch deep_slim_use, which proves a positivity statement of Arakelov geometry from eight published theorems. Its conclusion DeepStR (defined below) bounds from below a mean slope of small cusp sections on unitary Shimura varieties. It also lists the timeline steps with no counterpart in the code.

Read first

The new objects

  • DeepStR says that MeanAll holds with s=ℓ(D)=log⁡rd(E)+∣Re⁡L′/L(1,χd)∣s = \ell(D) = \log \mathrm{rd}(E) + |\operatorname{Re} L'/L(1, \chi_d)| for each tower object.
  • MeanAll says: for each weight uu with a gap, the volume slopes μvol(Z,u)\mu_{\mathrm{vol}}(Z, u) of the components ZZ have mean at least −C err(s,u,g)-C\,\mathrm{err}(s, u, g). A volume slope grows with the number of lattice sections of small sup norm, so there are many small cusp sections.
  • MoriwakiBigStatement is the inequality A‾D+1≤vol(A‾)\overline{A}^{D+1} \le \mathrm{vol}(\overline{A}) of Moriwaki and Yuan for a nef Hermitian line bundle. HSUse is the upper half of arithmetic Hilbert-Samuel with the arithmetic Kleiman criterion. Both are proved in Lean, for intersection numbers given by axioms.
  • An absolute Siegel lemma gives each Hermitian lattice a vector of large degree over some finite extension. SlopeBoundSt bounds μmax⁡\mu_{\max} of the Lie algebra of a semi-abelian scheme by Clog⁡(2+rank⁡+max⁡(−deg⁡^,0))C \log(2 + \operatorname{rank} + \max(-\widehat{\deg}, 0)).
  • GoodTowerExistsX gives a tower of integral models of a unitary Shimura variety. VolumeTheoremX bounds from below the mean intersection slope of the Hodge line bundles of weight uu on it.

The path through the chapter

  1. Step 2 gets small sections from intersection numbers by Moriwaki and Yuan, and the reverse bound by Hilbert-Samuel and Zhang's successive minima.
  2. Step 3 gets the absolute Siegel lemma, and from it SlopeBoundSt, in place of a Bost slope inequality.
  3. Step 4 computes intersection numbers on the tower. The Chowla-Selberg formula gives the term L′/L(1,χd)L'/L(1, \chi_d).
  4. Step 5 turns the intersection slope into a volume slope, again by Moriwaki and Yuan, and so proves DeepStR.

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