riemann

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

The window bound VWin

To read the window bound, you need primitive Dirichlet characters and subfields of cyclotomic fields, Galois cohomology with its duality theorems, and the automorphy results that feed the counts.

The window bound proves VWin from the row hypothesis Row0b. For each primitive Dirichlet character ψ\psi, VWin bounds a weighted sum of lengths of Tate-Shafarevich groups of ℚl/ℤl(−e)\mathbb{Q}_l/\mathbb{Z}_l(-e) over abelian fields cut out by ψ\psi and two auxiliary primes. The top of the proof packs named results into records. The bottom splits each length into three parts and bounds them case by case.

Read first

The new objects

  • VWin says: for each primitive character ψ\psi, each small ε\varepsilon and each pair of primes q≡3(mod8)q \equiv 3 \pmod 8, d≡7(mod16)d \equiv 7 \pmod{16} of a given size, there is a window of xx in which, for each field with IsChiField, the sum ∑llog⁡l∑elen⁡Ш\sum_l \log l \sum_e \operatorname{len} \text{Ш} is finite and at most exp⁡(12xε)\exp(\tfrac12 x^{\varepsilon}).
  • OpenImageCondition is a record with one field, the row.
  • BaseChangeIsobaricN says: over a CM field EE with E/E+E/E^+ unramified at all finite places, each automorphic representation of the unitary group UnU_n has a base change of automorphic representations to an isobaric sum on GLn\mathrm{GL}_n. baseChangeN proves it.
  • LiteratureCMHypothesis, LiteratureRankNHypothesis and HypothesesH' are records of named results. A theorem of the code fills each field.
  • LemmaK bounds log⁡#H2(L,ℤl(e+1))\log \#H^2(L, \mathbb{Z}_l(e+1)) in the degree and the discriminant of LL, for LL totally complex with the ll-th roots of unity (the 4th if l=2l = 2).
  • A host is a character, an exponent and two primes, with a modulus NN. For each case of the odd prime ll, a count bounds a Selmer-type length, by (lNe)C(lNe)^C in cases II, III and V and by 00 in case Z; case I bounds a weighted sum.

The path through the chapter

  1. vwin_of_row and automorphic_window_of_inputs wrap the row and add base change.
  2. v_window_of_depth_zero_residual_bc_cm packs four records. Only here does the row enter the count.
  3. The main fork proves LemmaK and the counts: case I by the Kato Euler system, cases II and III by symplectic automorphy in dimension 4, case V by unitary automorphy in dimension 3.
  4. ThmBab bounds the part at l=2l = 2 and the cyclotomic layers, from LemmaK, the two dualities and the Ferrero-Washington theorem. ThmBcFree bounds the minus part.
  5. The counts give the bound ThmHV on the plus part. The last step adds the three parts and checks the bound exp⁡(12xε)\exp(\tfrac12 x^{\varepsilon}).

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