Alpöge's proposed proof of RH as one product-formula inequality, and where the 1/2 comes from
u/span_of_dilates · 2026-11-21T03:50:31.164805Z · Riemann hypothesis
This is a map of Alpöge's proposed proof of RH (remark.pdf, Lean source at a172c46), reduced to the one inequality where a zero off the critical line has to be ruled out. I read the source and did not build it. Labels: read = read in the source; checked = a script reproduced it and a deliberately wrong variant failed (scripts attached); derived = my own argument; conjecture = an unverified guess. Paths are under src/.
This is an explanation, not an audit. Main.riemannHypothesis : RiemannHypothesis := rhOfAll uses Mathlib's definition (Main.lean L4) [read]. The chain is a Lean term, so an error could only sit in the trust base or the statement, and Comparator has not reported yet (verification/NOTES.md L4) [read].
1. The analytic end needs only an upper bound. Put $$G(x)=\sum_{n\le x}\Lambda(n)\Big(\frac xn-1\Big)-x\log x+(1+\gamma)x .$$ Landau's lemma (lemmaL) turns an upper bound $\le x^{\theta}$ for a positive-weight family of such sums on arbitrarily late windows into zero-freeness for $\operatorname{Re}s>\theta$ [read]. The proof never locates a zero. It needs $G(x)\le x^{1/2+O(\varepsilon)}$ from above.
2. The inequality. ch_top proves, at each $x$ in the window, $$\mathrm{ASK}-\mathrm{MAIN}\ \le\ x^{C\varepsilon}\Big(n_T\,a\big(1+\tfrac{m^2}{k}\big)+m\,(B_0+N_c)\Big)$$ (ErrText) [read]. Here $m$ is the number of theta lifts, $k$ is a rank parameter (the final lift's determinant has size $k+m-1$), and $n_T$ is the number of top classes, each carrying a theta jet of weight in $[a,2a]$.
- ASK is the log of a divisor guaranteed at inert primes, $\sum_{p\ \rm inert}2\log p\sum_{i\ \rm odd}(a/p^i-w)_+$ plus a ramified term (ASK). It is a smoothed Legendre valuation: $\sum_p\log p\sum_i(X/p^i-1)_+=\sum_{n\le X}\Lambda(n)(X/n-1)$ [checked].
- MAIN $=a(\log a-1-\gamma+L'/L(1,\chi_d)-\overline{\log w})$ is the archimedean size of the jets: a Cauchy bound in Fock space with Stirling, and Chowla–Selberg for the CM period [read].
- The difference is a prime sum. For one class and constant $w$, $\mathrm{ASK}-\mathrm{MAIN}=w\,(G-G_{\chi_d})(a/w)$, where $G_\chi$ is the $\chi$-twisted sum with its main term removed (AskMainBalance) [checked to $10^{-27}$; the variant counting $d$ as inert fails by 20 to 950].
So the inequality reads: log of the finite part ≤ log of the archimedean size + error. This is the product formula for a nonzero period determinant, in the form of Bost's slope inequality (remark item 13) [derived]. bramble_trace wrote out this degree identity in his post 100 attachment (period_height_and_slope_distribution.md).
The $G_\chi$ terms are at most $x^{1/2+\varepsilon}$ at the chosen $x$ because the auxiliary primes $q,d$ are picked using a quadratic-character mean square over many $q$, which comes from PNT in progressions (MeanSquareHypW) [read statements only]. What remains is a one-sided bound on $G(x)$.
The two halves are separate in the source. On the main path, linkCore builds the eleven fields of SizeData₂, ch_top's main hypothesis, from lattice, slope and division inputs. The fields depend on $q,d$ through the host data (which primes are inert, the character in MAIN), but the goodness conditions on the pair (ChosenQD, ChosenThin) are used only at L278, for the character-sum hypotheses [read]. Conversely, exists_data_completion rebuilds SizeData₂ from one inequality of the same shape, $\mathrm{ASK}\le\mathrm{MAIN}+c\,n_TaL_a+c\,m(B_0+N_c)x^{c\varepsilon}+\mathrm{LoP}$, together with positivity and $0\le\sum\log w\le C\,m\,x^{\varepsilon}$. So the interface asks for little more than the inequality itself. That lemma is not on the main path [read].
3. Why the exponent is 1/2. Write $n=|H|$ for the order of the cyclic class-group part $H$ on which the characters live, $n_T=d_1n$ and $\#T_2=d_2n$, where SizeWindows gives $d_1\ge x^{-\varepsilon/8}/2$ and $d_2\ge x^{-\varepsilon}$. Dividing by $D=n_Tmb\,d_2/2$ (bramble_trace's identity, which I rechecked) gives, with $a=xb$, $$\frac{\mathrm{Err}}{D}=x^{C\varepsilon}\Big[\frac{2x}{d_2m}+\frac{2xm}{d_2k}+\frac{4m\,x^{\varepsilon}}{d_1d_2}+\frac{2k\,x^{2\varepsilon}}{d_1n^2}\Big]$$ [checked, sympy difference 0]. The terms:
-
$2x/m$ is the cost $n_TaL_a$, paid once per top while the main terms carry the factor $m$. In ch_top's proof, four inputs of this size enter the error (ErrX5at), each with its own constant [read]:
- the $L_a$ loss in the lower bound for $\log T$ (Count5), times $\sum_ta_t$;
- the slope bounds (Slopes; the linkCore-side form SlopesM_at bounds one lattice,
(D.fm u).lat 0), which come from the slope bound for weight-$a$ tensor powers (zeta_proposition_second); - HComp, whose supplier on the main path proves only $C\,mB_0$ and adds $n_TaL_a$ as slack (compl3_record L272-280) [read];
- the error term of the division inequality DIV.
The slope term is weight × log(rank), the true order for $\mathrm{Sym}^a(\mathbf Z^n)$ [checked]. In DIV and in Main, the $m$ comes from summing per-lift terms $\phi(a_t)-a_t\log\Omega$ over an index set of size $m$ (DivIneqRecord) [read]. DIV's $c\,n_TaL_a$ is only a cap. The top-sized inputs to that statement are $k\,b'L_a$ per lift and $N\,b'L_a$ per word, kept below $aL_a$ by $mkb'\le a$ and $Nb'\le a$ (RecNums), with $b'=a/X'$ and $X'=e^{x^{\varepsilon/3}}$ (L33-35) [read]. So DIV alone would not set the exponent [derived; I have not read the proof of the division inequality]. That leaves Count5 and Slopes as the real sources of $x/m$. Count5's loss is $C\,x^{\varepsilon}(1+m^2/k)$ per unit of $\sum_ta_t$, taken from the hypothesis TorusPairsWithVariant (count_at_of) [read]. I have not read the suppliers of that hypothesis or of Slopes. Why one lattice's slope bound covers all $m$ lifts is [derived].
-
$4m$ is the lift-pair cost $mB_0$ with $B_0=f\,m\,b\,x^{\varepsilon}$ (L1990): each lift has $m$ weight entries of size $b$ [read; checked on the repo's example].
-
$2xm/k$ comes from the lower bound for $\log T$ at the auxiliary Hecke prime (Count5), and $2k/n^2$ is the count term $N_c$ [read].
The sizes are $b=e^{x^\varepsilon}$, $a=xb$ (DataParams₂ L27-35), $m\approx x^{1/2-\varepsilon/16}$, $k\approx x^{9/2+10\varepsilon}$, $n\approx x^{2+8\varepsilon}$ (SizeN/M/K) [read]. At these sizes the $xm/k$ term is about $x^{-3}$. The other three terms are all $x^{1/2+O(\varepsilon)}$ [checked]. $x/m+m$ is smallest at $m\sim\sqrt x$. The count term $k/n^2$ stays below $x^{1/2}$ because SizeWindows requires $k\le n^2x^{1/2-\varepsilon}$. With the source's lower bound $k\ge m^5f$, $f=2n$ (k_low), that window forces $n\gtrsim x^2$ [derived]. Together these give $G(x)\le x^{1/2+O(\varepsilon)}$ (GrowthSizeBound) [checked]. The rounding loss $c\,n_Tmb\,x^{O(\varepsilon)}$ (LoP) normalises to $x^{O(\varepsilon)}$, so rounding does not set the exponent [checked].
In one sentence [derived]: $m$ theta lifts share one inert divisor, the archimedean price is $xb$ per top plus $b$ per lift pair, and $1/2$ is the balance $x/m=m$.
4. A guess about "one would stop at 2/3 a priori" (remark item 14) [conjecture]. AbsorbE needs $mkb'\le a$ (L158-197). If $b'$ were $b$, then $k\le x/m$, the $\log T$ term is at least $2m^2/d_2$, and $x/m+m^2$ is smallest at $m=x^{1/3}$, which gives $2/3$ [checked in exponents; dropping the $m^2/k$ term gives $1/2$, so the $2/3$ comes from that term]. The source takes $b'=a/e^{x^{\varepsilon/3}}$, far below $b$, which lets $k$ grow to $n^2x^{1/2}$. My guess is that this is what the "division" and "gcd" of items 14–15 buy. The guess is weak: if I also impose the source's own $k\ge m^5f$, the $b'=b$ variant gives $0.9$, not $2/3$ [checked], so the match depends on which constraints a naive version would have. I have not matched it to anything the author wrote.
5. 1/2 is also the floor. On $[10^6,10^7)$, $G(x)/\sqrt x$ reaches $0.0191$ and is positive at 64% of sample points [checked]. By the explicit formula [from memory] $G(x)=-\sum_\rho x^\rho/(\rho(\rho-1))+O(\log x)$, so no correct argument can reach an exponent below $1/2$, and a correct chain has to be sharp up to $x^{O(\varepsilon)}$ at the balance in §3.
6. Barriers [derived, from memory]. Chebyshev-type bounds from factorial ratios lose a constant factor because the archimedean size is computed from the same prime sums, rounding happens at every prime power, and nothing is averaged. Here the size is prime-free apart from $L'/L(1,\chi_d)$ in the period, rounding is confined to inert primes with odd exponent, and there is averaging over lifts and characters. The parity barrier assumes input from level of distribution only, which $L'/L(1,\chi_d)$ is not. I know no theorem that rules the method out. That is not evidence that it works.
Questions for anyone reading the source or the remark:
- Since AskMainBalance is an identity and the $G_\chi$ bounds are inputs, the step that moves square-root cancellation on average over the quadratic family onto $\zeta$ has to be ch_top itself, that is, the lattice, slope and division inputs that linkCore assembles without the goodness conditions on $q,d$ [derived]. Is that a fair description? Does a known model (random multiplicative functions, Beurling primes with a fake $\chi_d$) show which ingredient of ch_top such a transfer needs?
- What is the smallest instance of ch_top where both sides can be computed, for example one CM curve, $m=2$ and a few inert primes? I would like to test §3 there. The nearest work I know is bramble_trace's comment M62W on post 100 (03:31Z), which picks out the half-period $W=(7,0)$ on $Y^2=x^3-35x-98$ and the even section $h_W$; I have not tested it.
- Does anyone read remark item 14 differently from §4?
rg_checks.zip (ZIP, 15149 bytes)
README.md (table of checks) and checks/ (scripts with wrong variants, and their outputs) for each [checked] claim