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

drafted

Statement

VWin is the proposition: for each primitive Dirichlet character ψ\psi, VWinAt ψ 401 holds.

Unfolded, VWin says the following. Let ψ\psi be a primitive Dirichlet character of conductor NψN_\psi. Let ε\varepsilon be real with 0<ε<1520 < \varepsilon < \frac{1}{52}. Let e:ℝ→ℕe : \mathbb{R} \to \mathbb{N} be a function with x2+8ε≤2e(x)≤2x2+8εfor all x≥1. x^{2 + 8\varepsilon} \le 2^{e(x)} \le 2 x^{2 + 8\varepsilon} \quad \text{for all } x \ge 1. Then there exist a real J≥1J \ge 1 and a real X0X_0 with the following property. For each real X≥X0X \ge X_0 and each pair of natural numbers (q,d)(q, d) with WinPair ε (X^(1/J)) q d, there is a real YY with X1/J≤YX^{1/J} \le Y and Y2≤XY^2 \le X, such that for each real xx with Y≤x≤Y2Y \le x \le Y^2 and each number field EE with IsChiField ψ (e x) q d E, the statement VVle(E, ⌊x401⌋, exp⁡(xε)) \mathrm{VVle}\big(E,\ \lfloor x^{401} \rfloor,\ \sqrt{\exp(x^{\varepsilon})}\big) holds.

What it means

The Lean local names are these. ψ is the character, a PChar. eps is ε\varepsilon. e is the function ee. J, X0, X, Y, x are reals. q and d are natural numbers. Ct is the exponent; VWin sets Ct = 401.

PChar. A structure with a modulus N≠0N \neq 0, a Dirichlet character χ\chi modulo NN with values in ℂ\mathbb{C}, and a proof that χ\chi is primitive.

PageN eps x e. The two inequalities x2+8ε≤2e≤2x2+8εx^{2+8\varepsilon} \le 2^{e} \le 2x^{2+8\varepsilon}. So e(x)e(x) is, up to one, (2+8ε)log⁡2x(2 + 8\varepsilon) \log_2 x.

WinPair eps Y q d. A structure with ten fields:

  • qq is prime, q≡3(mod8)q \equiv 3 \pmod 8, and 12Yε/5<log⁡q≤Yε/5\frac12 Y^{\varepsilon/5} < \log q \le Y^{\varepsilon/5};
  • dd is prime, d≡7(mod16)d \equiv 7 \pmod{16}, and 12Yε/5(log⁡Y)2<log⁡d≤Yε/5(log⁡Y)2\frac12 Y^{\varepsilon/5} (\log Y)^2 < \log d \le Y^{\varepsilon/5} (\log Y)^2;
  • q∣d+1q \mid d + 1;
  • every odd prime p≤Yε/5p \le Y^{\varepsilon/5} divides d+1d + 1.

IsChiField ψ e q d E. There are N≠0N \neq 0, a ℚ\mathbb{Q}-algebra map j:E→ℚ(ζN)j : E \to \mathbb{Q}(\zeta_N) and a primitive NN-th root of unity ζ\zeta, with 2e+2,Nψ,q,d2^{e+2}, N_\psi, q, d all dividing NN, such that the following holds. For each automorphism τ\tau of ℚ(ζN)\mathbb{Q}(\zeta_N) and each a∈ℕa \in \mathbb{N} with τ(ζ)=ζa\tau(\zeta) = \zeta^a: τ\tau fixes j(E)j(E) if and only if a≡±1(mod2e+2)a \equiv \pm 1 \pmod{2^{e+2}}, ψ(a)=1\psi(a) = 1, and the Jacobi symbols (aq)\left(\frac{a}{q}\right) and (ad)\left(\frac{a}{d}\right) are 11. So EE is the subfield of ℚ(ζN)\mathbb{Q}(\zeta_N) cut out by these four conditions.

VAt ψ eps Ct q d e x. For each number field EE with IsChiField ψ e q d E, VVle E ⌊x^Ct⌋ (√(exp(x^eps))) holds.

VVle E t B. For each algebraic closure Ω\Omega of EE and each family ld of local data LData E Ω p (one for each prime pp):

  1. for each prime pp and each 0<e<t0 < e < t, the length shaLen (ld p) e is finite;
  2. for each finite set SS of primes, ∑l∈Slog⁡l∑e=1t−1shaLen(ld l,e)≤B. \sum_{l \in S} \log l \sum_{e=1}^{t-1} \mathrm{shaLen}(ld\ l, e) \le B.

The VWin chapter reads shaLen (ld l) e as the length, as a ℤl\mathbb{Z}_l-module, of a Tate-Shafarevich group in H1H^1 with coefficients ℚl/ℤl(−e)\mathbb{Q}_l/\mathbb{Z}_l(-e). This page does not unfold LData or shaLen.

So VWin says, in short: for each primitive ψ\psi, the weighted sum of these lengths over 1≤e<⌊x401⌋1 \le e < \lfloor x^{401} \rfloor is at most exp⁡(12xε)\exp(\frac12 x^{\varepsilon}), for every field EE in the family, at every scale xx in a window [Y,Y2][Y, Y^2] that the statement may choose.

Notes

The quantifiers have this order: ψ\psi, ε\varepsilon, ee; then JJ and X0X_0; then XX, qq, dd; then YY; then xx and EE. So YY may depend on qq and dd. JJ and X0X_0 depend on ψ\psi, ε\varepsilon and the function ee.

The bound in VAt is written exp⁡(xε)\sqrt{\exp(x^\varepsilon)}. This equals exp⁡(12xε)\exp(\frac12 x^{\varepsilon}).

VVle quantifies over all families ld of local data. So the bound must hold for each choice that LData allows.

If for some XX no pair (q,d)(q, d) satisfies WinPair, the statement is empty for that XX. This page does not check how often such pairs exist.

The constants 401401, 152\frac{1}{52} and 2+8ε2 + 8\varepsilon are fixed in the code. The VWin chapter notes that their reasons belong to the part of the proof that uses VWin.

The proof of VWin from the Galois row is VWin from Row0b.

Lean

def UpperTheory.Top.VWin : Prop

The declaration is in Development/AutomorphicArithmetic/CharacterBoxes/ExistsPageN.lean, line 49. Its page has the full list of what it uses and what uses it, and a link to the source.

Uses

The proof also uses these declarations in a routine way, for example to unfold a definition or to pass an argument on: Formalism.HC.PChar, UpperTheory.Top.VWinAt.

Used by

Status

Drafted. The text follows the Lean code, but no person has checked it against the code with the rules of spec 05.7 yet. If you check it, tell us.

A model wrote the first draft (writer@claude-opus-5-5). A person checks it before its status goes up.

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