In this article, we study the form factor for zeros of Dirichlet L-functions, pairing zeros of the same L-function and then averaging over primitive characters modulo a prime conductor. Unconditionally, we show for ∣α∣<1 that the form factor agrees with the random matrix prediction from the Circular Unitary Ensemble (CUE). Under GRH and the Hardy--Littlewood twin primes conjecture, we extend this agreement to ∣α∣<2. For ∣α∣≥1, we prove that the CUE prediction is equivalent to Hooley's conjecture for the variance of primes in arithmetic progressions with prime moduli. We also explore applications of these form-factor results to the simplicity of zeros.
Primarily human-written textHuman understanding: all parts
Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnloglogn for every n>5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγloglogn+eγ(2+τ)/logn for every n≥N120569, where Nk is the k-th primorial and τ=2+γ−log(4π); for Nk this inequality reads c(pk)<E(pk). Let N be a colossally abundant number, let q=pk be the largest prime not exceeding the number ξ(N) associated with N by Nicolas, and write Δ(N)=log(σ(N)/N)−γ−logloglogN. For logq≥31 we prove unconditionally that 1.317/(qlog2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlogq)≤3.973/(qlog2q). Consequently, the second inequality for Nk implies Δ(N)<−0.654/(qlogq). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every Nk with e31≤pk≤X, then Robin's inequality holds for every n>5040 with logn≤X(1−log−3X)−logX. A computation over the primes up to X=100,000,008,765,439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.6377. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.11485 of Morrill and Platt.
Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
In this paper, we improve the uniform zero-free bound for the Quasi-Riemann Hypothesis
and obtain the half-plane
LK (s,ω) ̸= 0 (Re s>B∗ = 0.8733458561067185768...)
for every continuous unitary Hecke character ω over every number field K, with the possible
norm-character pole permitted. We prove joint moment estimates for inverse and ordinary
character sums and apply them to zero detection and the averaged Mellin numerator. The proof
uses the earlier number-field theta and moment theorems and the unitary estimates of Hu and
Gao. The same half-plane holds for finite-dimensional continuous unitary Weil representations,
with pole orders equal to the multiplicities of their norm-character constituents. We determine
B∗ asanalgebraicnumberofdegreenineandastheinfimumofthespecifiedpositivecomparison,
allowing unequal ordinary moments and variable comparison lengths.
A mix of human-written and AI-generated textHuman understanding: some partsRiemann Zeta Functionquasi Riemann Hypothesiszero-free half-planes
The Polymath project reduced upper bounds for the de Bruijn--Newman constant Λ to three verifiable hypotheses: the Riemann hypothesis up to height X/2, a zero-free region for Ht0 to the right of X, and a barrier at X. With the verification of the Riemann hypothesis up to 3⋅1012 by Platt and Trudgian, this gave Λ≤0.2. The bottleneck is the zero-free region, which Polymath established with Euler-product mollifiers. We replace the Euler product by a mollifier ∑d≤Dλdd−s∗ whose weights are chosen by solving an ℓ1-regression problem, so that any choice of weights still yields a valid lower bound. At the same height X≈6⋅1012 and t0=0.155, y0=0.2, the lower bound for the mollified sum improves from −0.12 (our Lemma~\ref{lem:moll} evaluated with the Euler mollifier on the primes up to 13) to +0.05 with D=120; with D=240 it is still +0.04 at t0=0.154. We cover all x≥X by a short chunking argument together with a tail estimate, verify the barrier with Polymath's Taylor scheme, and obtain \[ \Lambda\le 0.174 . \] The certificates are computer-assisted. They use Arb ball arithmetic for all transcendental functions and outward-rounded floating-point arithmetic for the large sums. The code, the weights and the logs are included, and the certificate was reproduced on a second platform. We also report that at this height the weights we found with D=240 do not reach 0.173, and we compare with Polymath's table of conditional results. We do not prove the Riemann hypothesis.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 20 pages, 3 figures. The ancillary scripts are those of the original part (ancillary zip in the part folder). Part 33 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly Part 13. Renumbered 2 Nov 2026; mathematics unchanged. The paper states once, in its discussion, that it does not prove the Riemann hypothesis.
A mix of human-written and AI-generated textHuman understanding: all partsArb interval arithmeticRiemann xi-functioncomputer-assisted proofde Bruijn-Newman constantheat flowmollifier
Let R(x)=π(x;3,2)−π(x;3,1) be the Chebyshev race between the two prime lanes 6k∓1 (the prime 2 counted, by the congruence 2≡−1 mod 3, in the 6k−1 lane). We study the race as an \emph{energy} and establish three things (the energy law uses two estimates imported from the ζ case; see Proposition~\ref{prop:cramer}). First, an elementary ledger identity: the entire bias of the race is the bookkeeping of prime squares, which all land in the lane 6k+1; subtracting the ledger 21π(x) turns a walk with \emph{zero} sign changes up to 108 into one with 15,329 (21,329 if every passage between D>0 and D≤0 at a prime is counted). Second, the mean energy of the normalized race signal e(u)=e−u/2ψ(eu,χ3) admits an explicit unconditional lower bound for its upper limit, which we call the floor, \[ \limsup_{U\to\infty}\frac1U\int_0^U e(u)^2\,du\;\ge\;\kappa_3 :=\sum_{\rho}\frac{1}{\rho(1-\rho)} =\log\frac3\pi-\gamma_E+2\,\frac{L'}{L}(1,\chi_3) =0.113229969857\ldots, \] the sum running over the nontrivial zeros of L(s,χ3) with multiplicity, and the limit exists and attains the floor if and only if the Riemann hypothesis holds for L(s,χ3) with all zeros simple. The constant is known: under GRH it is the variance of the limiting distribution of Rubinstein and Sarnak for (logx/x)R(x) (four times smaller than in their normalization E(x;3,2)−E(x;3,1)), and its closed form is that of Fiorilli and Martin (there under GRH); it is also the variance Vχ of Part~37, on the 6k±1 race, where the prime-square mechanism of the bias is identified; what is added here is the unconditional floor with its equality case and exponential-growth law, the ledger correction of the counting race, and the exact measurement. The constant κ3 is the exact analogue, for the prime race, of the B\'aez-Duarte constant 2+γE−log4π of the Nyman--Beurling criterion. Third, we measure: from all prime powers up to 108, by exact piecewise integration, the cumulative mean energy is 0.1201 at x=108 and lies 4 to 12% above κ3 for 104≤x≤108. This is consistent with the theorem and does not test it: the floor is a statement about an upper limit, obtained from the dichotomy between GRH and its failure, and means over single decades fall below κ3 (0.102 on [104,105], 0.113 on [107,108]). The second-order term is (mean−κ3)⋅U≈0.11 (between 0.09 and 0.13), the race analogue of the second-order constant K=2.5124797… of the prime energy. The proofs of the energy law transplant the C2 energy law for ζ to L(s,χ3), where the absence of a pole simplifies every step.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 12 pages, 1 figures. Ancillary scripts in ancillary/ reproduce the computations. Part 38 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly the standalone note 'The energy of the Chebyshev race' (revised 1 Nov 2026). Renumbered 2 Nov 2026; mathematics unchanged. The paper states once, in its discussion, that it does not prove the Riemann hypothesis.
A mix of human-written and AI-generated textHuman understanding: all partsChebyshev's biasDirichlet L-function of conductor 3Generalized Riemann Hypothesisenergyprime race
Restrict the archimedean part of Weil's quadratic form, for ζ or for a primitive real Dirichlet L-function of conductor q and parity κ, to test functions supported in an interval of length a, and let n+(a) be the number of its positive directions, the directions that the pole and the primes must absorb. A Szeg\H{o}-type argument gives n+(a)=t0a/π+o(a), where t0 is the zero of ϑ′. We observe that the form is Λ−ψκ(−Δ) with ψκ a complete Bernstein function (proved) and, using the boundary phase of Kaleta, Kwa\'snicki and Ma{\l}ecki, we state, as a conjecture, the asymptotic law \[ n_+(a)=\Big\lfloor\frac{t_0a}\pi+\frac{2\varpi_\kappa(t_0)}\pi\Big\rfloor , \] with an explicit phase ϖκ that depends only on the parity, the conductor entering only through t0. We test it in seven cases, ζ and χ−3,χ−4,χ5,χ−7,χ8,χ−8. On the finest mesh the shifts of the jumps m=2,…,12 bracket the prediction 2ϖκ(t0)/π, which ranges from 0.18 to 0.59, to within 1 to 3⋅10−3 for the characters and 3⋅10−2 for ζ. A second, independent implementation extrapolates in the mesh on three to nine jumps per case; the extrapolated shifts lie above the prediction by 0.2 to 2.3⋅10−4 in every case, a one-sided offset of the size of the extrapolation error, which we have checked to be a bias in one case only. The first jump is an exception, and for ζ the shift reaches its limit only after about ten jumps. A smoothed count removes the integer part and leaves ``degree plus constant'' with the boundary phase as constant; on a circle the constant is carried by the end points and cancels between an arc and its complement; and treating −logq as a degree, q↔1/q acts on the band edge as t0↦4π2/t0 to leading order, with ζ at the self-dual point t0≈2π. We record what the law implies for the signature of Weil's form and where it stands with respect to the Riemann--Roch formulas for SpecZ. The law is a conjecture supported by these computations. The Bernstein structure is proved here; the first-order count is quoted from Part~14 and its proof is not repeated.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 9 pages, 1 figure; Part 16 of the 47-part book-series Cross-Energy of Dirichlet Partial Sums (Parts 0-46), block III (The margin and the constant B-hat); formerly a standalone note (v1.0). Part 0 is the guide.
A mix of human-written and AI-generated textHuman understanding: all partsDirichletRiemann--Siegel theta functionWeil's quadratic formarchimedean place
\sloppy We study the \emph{Caceres Prime Function} \[ \C(s)=\sum_{n\ge 2}\frac{a(n)}{n^{s}},\qquad a(n)=\sum_{p^k\,\|\,n}\frac{\log p}{\sqrt{p^{k}}}, \] the Dirichlet series of the additive function that weights each prime factor p of n by logp divided by the square root of the exact power of p dividing n. \emph{Structure.} We prove that $\C=\zeta\K$, where the \emph{prime kernel}, $\K(s)=\sum_p\log p\,(1-p^{-s})/(p^{s+1/2}-1)$, is an exact telescoping series of shifted derivatives of the Prime Zeta function. So $\K$ is meromorphic in ℜs>−41, and the line ℜs=−41 is a natural boundary. Every zero 21+iγ of ζ produces two singular points of $\K$, at iγ and iγ/2, which are poles unless 2γ is again an ordinate with twice the multiplicity (respectively γ/2 an ordinate with half the multiplicity, for iγ/2); the exponent 21 is the normalization that puts both families on the imaginary axis. More precisely, $\K(s)=-\frac{\zeta'}\zeta(s+\frac12)+\frac{\zeta'}\zeta(2s+\frac12)-\frac1{12s}+H(s)$, with H holomorphic in a neighbourhood of ℜs≥0. \emph{RH criteria.} RH is equivalent to the holomorphy of $\K(s)-\frac1{s-1/2}+\frac1{2(s-1/4)}$ in ℜs>0. It is also equivalent to a bound O(xε), or even a one-sided bound, for the remainder Rb of the kernel's partial sums. Both are exact reformulations of RH, not proofs. \emph{Mean value and explicit formula.} Unconditionally, $\sum_{n\le x}a(n)=\K(1)x+2\zeta(\frac12)\sqrt x+O(\sqrt x\,e^{-c_\ast\sqrt{\log x}})$, with the explicit bound 5.51x for the error after the first term when x≥106. Under RH, the Riesz mean of a has an explicit formula in which every zero contributes the pure phases xiγ and xiγ/2 at constant amplitude. \emph{The Ces\`aro margin.} The kernel is Suzuki's one-variable margin M seen at two scales. Unconditionally, Rb(x)=α(x)−α(x)+o(1), where α is the slope of the margin. Under RH, the kernel's Riesz margin is M(N)−2M(N). Its fluctuation has energy 2(logξ)′′(21), reduced by 2γ−2 for every pair of ordinates with γ′=2γ; the near pair γ14≈2γ4 is visible in the data. \emph{Zeros of $\C$.} A computer-assisted proof shows that $\C$ has a zero near 1.379+8.639i, in the half-plane of absolute convergence, and Bohr's theory gives ≫T such zeros up to height T. So $\C$ is not an L-function. The theorems are proved here, except that Section~\ref{sec:margin} uses the formula for the margin and the almost periodicity of the slope from Part~11. Uncertified computations are labelled as numerical observations.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 26 pages, 7 figures. Part 10 of a series of forty-seven on the cross-energy of Dirichlet partial sums (book edition of 2 November 2026, block II: Primes and Euler products; Part 0 is the guide, Part 1 the plan). Formerly a standalone note ("The Caceres Prime Function", October 2026); in the book it builds on Part 9 (the prime zeta function), Part 1 (the C-transform) and Part 11 (the Cesaro margin), and is used by Parts 11 and 37. All theorems are proved; uncertified computations are labelled as numerical observations. The ancillary archive (core.py, explicit.py, zeros.py, step*, rigor_meanvalue.py, rigor_rouche.py, ctransform.py, laplace.py, bridge_M*.py, variogram.py, slope_b.py) is the one of the standalone note, Caceres_Prime_Function_ancillary.zip.
A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; Cesaro; Mobius; Landau; Nyman; Dirichlet; Weil; Davenport
We show that smoothing the zeros of the Riemann Ξ-function makes it easy to establish positivity properties that are otherwise hard (as they are equivalent to the Riemann hypothesis). Specifically, we smooth each zero with a small density centered at it, and then test the impact of this smoothing on complete monotonicity (CM) of the heat sum H(t)=∑ρe−tzρ2 over the zeros 21+izρ. A sufficiently wide density quickly implies CM of the smoothed heat sum. We bound the width (i.e., half-variance) the density needs using increasingly precise facts about the zeros. If we only use that they lie in the critical strip, half-variance 1/8 suffices; the primes lower this width to π2/288; and zeros verified through height T further lower it to π2/(8log2T) asymptotically. Ultimately, however, smoothing seems to be of limited utility: despite the CM result, the smoothed reciprocal laws of Ξ are not even log-concave, unlike the unsmoothed ones.
A mix of human-written and AI-generated textHuman understanding: some partsGaussian smoothingPolya frequencyRiemann Xicomplete monotonicitygeneralized Laguerre inequalitieslog-concavityzeta zeros
We study isolation in the full sequence of nontrivial zeros of the Riemann zeta function with positive ordinate, counted with multiplicity. For every fixed 0<c≤10−5, we prove unconditionally that the lower limiting proportion of zeros whose two neighboring gaps both exceed 2πc/logX is at least 0.672468. Here X is the common height cutoff and the neighbors are taken from the infinite sequence. This refines Lamzouri's small-fixed-gap bound 0.6552….
We retain his isolation argument and the Montgomery–Taylor kernel, while replacing the linear cost of horizontal displacement by a certified majorant with a positive threshold. Young's shifted mollified second moment bounds the corresponding truncated displacement moment. We supply the boundary and global-height arguments and obtain a gap loss 6π2c2 uniform under the required smoothing. A fixed interval-arithmetic certificate completes the numerical estimate. The result is asymptotic and gives no effective first height.
Author comments: This submission corresponds to version v0.4 of the preprint available on Zenodo:
https://doi.org/10.5281/zenodo.24126375
The author understands the research question, the historical context, and the meaning of the claimed result. However, the detailed analytic arguments and computer-assisted numerical certification have not been independently verified or fully understood by the author.
The mathematical development, internal proof checking, and manuscript preparation relied substantially on AI assistance, primarily GPT and Claude, with supplementary input from Gemini.
The Zenodo record includes the full manuscript, LaTeX source, numerical certificate, and reproducibility materials. The manuscript has not undergone independent human peer review.
Primarily AI-generated textHuman understanding: no partsIsolated zerosMollifiersPair correlationRiemann Zeta Function
Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer
For the shifted Riemann xi-function, we prove the large-radius boundary limit of Suzuki's arithmetic canonical system. The proof applies to every positive shift for which the reflected quotient is pole-free in the upper half-plane and the two entire functions have no common zero. It therefore applies unconditionally to shifts at least one half, including Suzuki's original range greater than one. We give the weak-kernel construction needed at the smaller shifts, two integral identities for its positive determinant ratio, and decay estimates faster than every fixed exponential in logarithmic radius. The hypotheses on the shift are retained throughout.
Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer
We prove that the closed Báez–Duarte subspace of the Mellin step space is exactly the common kernel of the derivative evaluations prescribed by the zeros of the Riemann zeta function in Res>1/2, with their multiplicities. No finiteness or sparsity assumption on this zero set is required. The proof combines a uniform fractional regularity estimate for Mellin transforms of step functions with a comparison obtained by reflecting zeros in a shifted vertical line. These estimates produce a holomorphic Hardy-space family whose membership in the Báez–Duarte subspace continues from large positive shifts to every sufficiently small positive shift. A uniformly bounded weak limit then gives the synthesis theorem.
We report on a Lean 4 formalization of Theorem 2 of Dudek, 2015, as numbered in arXiv v2, which states that if the Riemann hypothesis is true, then for every real x≥2 there is a prime in the interval (x−(4/π)xlogx,x]. In the formalization, Theorem 2 is proved assuming the Riemann hypothesis and one cited explicit zero-counting bound of Hasanalizade, Shen and Wong, arXiv:2107.06506. Four cited inputs of the printed proof are replaced in the formal proof. The two that carry the argument are these: first, the prime power contribution ψ−θ is required only across the moving window (x−h,x+h] and is proved outright in Lean by an elementary counting argument with no cited input and without assuming the Riemann hypothesis; second, the sum over nontrivial zeros is bounded from the cited Hasanalizade, Shen and Wong zero count for T≥70 by trading slack between the head and tail sums at the split point T=2x/h. The Riemann hypothesis is open and this note makes no progress on it.
Author comments: 11 pages. Version 2 of the note, first deposit on Hexagon.
Primarily AI-generated textHuman understanding: some partsLean 4Riemann Hypothesisexplicit number theoryformal verificationprime gaps
Summing the primes one after another and taking logarithms gives an increasing sequence of real numbers, σm=logSpm with SN=1+∑p≤Np, which becomes exponentially dense. The ordinates γn of the zeros of the Riemann zeta function fall on this grid with tiny errors: 1.4⋅10−3 at the first zero, 2.4⋅10−7 at the fifth, 3⋅10−17 at the twentieth.
Part I explains why. The cell of the grid containing a height t has width (1+o(1))te−t/2 (Step Theorem), and every real t>log3 has a node above it within that width, by an argument going back to Bertrand's postulate (Covering Theorem). The precision observed at the zeros is therefore the resolution of the grid, and the same precision holds at every height (Genericity Principle). We compute the first-crossing primes Nn with certification up to n=20 and test, in a protocol fixed before the computation, whether the zeros sit closer to the nodes than a generic height. Neither the mean distance to the nearest node (0.246 against 0.250, p=0.92) nor the distribution of the position within the cell (Kolmogorov–Smirnov, p=0.79) departs detectably from the generic case, and an integer grid used as control behaves in the same way. We also correct the half-exponent law by a factor t′/t.
Part II shows where the zeros are actually visible. They are not in the position of the nodes but in the ripple: the deviation of the grid from its mean curve B(x)=1+li(x2)−li(4). This ripple is a sum of pure oscillations, one per zero; its spectrum shows a peak at each of the first 13 ordinates, with the amplitude predicted by the explicit formula. Under RH the ripple has size e−t/4 on the grid, much larger than the cell e−t/2, and RH is equivalent to this decay rate. The ripple is not centred: on [103,108] the sum of the primes stays below li(x2) for about 97% of logarithmic time, and it first exceeds it at x=109. We place this in a one-parameter family of prime races, ∑p≤xpa against li(xa+1), and prove that under RH the normalized error has mean −1/(2a+1), coming from the squares of the primes. Under RH and LI the limiting logarithmic density of the set where the race is ahead is given by a Rubinstein–Sarnak formula; it moves from 2.6⋅10−7 (counting the primes, a=0) to 0.06 (summing them, a=1) and tends to 1/2 as a→∞, at the rate 21−δa∼1/(2πAlog(A/2π)) with A=a+21. At a=−1/2 the bias becomes the 21loglogx of the weighted counting functions of Aoki and Koyama. All theorems are formalized in Lean 4, with the classical results they use as explicit hypotheses.
A mix of human-written and AI-generated textHuman understanding: some partsChebyshev biasLean 4Riemann zerosexplicit formulaprime races
Let γn<γn+1 be consecutive ordinates of zeros of ζ(21+it) with normalized gap sn. We study the derivatives Z′(γn), Z′(γn+1) of Hardy's function at close pairs. For the circular unitary ensemble we prove that the conditional variance of log∣Λ′(θ1)∣−log∣Λ′(θ2)∣ at adjacent eigenangles with normalized gap s satisfies Var=cNs2(1+o(1)) as s→0, with the exact value cN=15π2(1−N24), so that c∞=π2/15, which we call the Singh constant. The proof reduces the problem through a Cayley transform to the Hua ensemble and closes it with two loop equations. We state a conditional theorem transferring the constant to the zeta function under the Riemann Hypothesis, a local GUE hypothesis and a tail bound, and we formulate a conjecture on the size of Z′ at close pairs. Numerical evidence from Odlyzko's tables up to zero number 1022 agrees with the predictions. This paper is a revised and expanded version of the Zenodo record doi:10.5281/zenodo.23899228.
Author comments: v2: Section 1 now lists fourteen Singh Lemmas, each labeled proved (6, 8, 45), conditional (7, 27, 42, 44, 46, 48, 54, 67) or numerical (5, 51, 57). The unitary pi^2/15 constant and Hua moments are credited as known results, Lemma 20 is credited to Soundararajan and Milinovich, and method credits and an explicit transfer hypothesis for Lemma 67 are added.
A mix of human-written and AI-generated textHuman understanding: all partsHardy Z-functionRiemann Zeta Functioncircular unitary ensemblerandom matrix theoryzero spacing
In this paper, we obtain a zero-free half-plane $\Rea s>B_2$ for every finite-order Hecke L-function over every number field, where
\[
B_2=\frac{777-\sqrt{1081}}{852}
=0.873381966613207519929\ldots.
\]
We adapt selected character-sum estimates and finite moment inductions to ideal-character sums over arbitrary number fields and restore ordinary sixth powers. Two finite moment inductions give an ordinary product estimate with length condition n1+n2+2z≤M for sufficiently fine original prime factors. Applying this estimate to zero detection and the averaged numerator in the cubic-theta comparison gives the stated boundary. We determine the exact infimum of the resulting comparison system and verify its scalar inequalities by rational Bernstein bounds. The proof uses the earlier theta, moment and continuation theorems over number fields.
A mix of human-written and AI-generated textHuman understanding: some partsHecke L-functionRiemann Zeta Functionquasi Riemann Hypothesis
Let K be a number field of degree n and absolute discriminant DK. We give a direct arithmetic proof that every real zero β∈(0,1) of ζK satisfies
\[
(1-\beta)\{\log D_K+n\log(2n)+6n+1\}\geq\frac1{1370}.
\]
The bound is explicit for arbitrary varying fields, including nonnormal fields, and gives (1−β)logDK≫1/log(2n) for $K\ne\Q$. Exceptional-zero exclusion over each fixed base field was obtained by Banks and, independently, Frei--Kai. The proof here combines OpenAI's determinant method, Masser's zero estimate as used by Kerr, and Banks' selected-embedding calculation. The resulting bound is expressed directly in the degree and discriminant of K, without introducing those of its normal closure.
Stronger nonvanishing conclusions follow from recent half-plane results and positivity. The contribution here is an arithmetic proof with fully displayed dependence on the varying field, using neither those half-plane results nor earlier zero-exclusion results for real Dirichlet L-functions or Hecke characters.
A mix of human-written and AI-generated textHuman understanding: some partsLandau--Siegel zerosNumber fields
The subsets of {1}∪{p≤N} reach every integer between 0 and their total, by Bertrand's postulate, so deciding whether a target is a subset sum of the primes is trivial. Counting the solutions is not: the count carries the arithmetic of the primes. We study the generating function FN(z)=Π(1+zw) on the unit circle and follow one object, the arc at a rational a/q, through three settings.
For the primes, the centre of the arc a/q rises above the sea of the minor arcs exactly when q=2k(k≥2) or q=2pj, with excess Λ(q/2)/φ(q), and the neighbourhoods of all the other arcs are bounded uniformly in q; Theorem E gives the expansion arc by arc. The height of an arc is a race of the primes modulo q with weights log∣cos(πra/q)∣. By Landau's theorem a one-sided bound on it is equivalent to GRH for the even characters it sees, unconditionally at q=8, 10 and 14, where the zero-free segments it needs are certified; at q=14 the race changes sign infinitely often. The principal arc carries ζ in the centre and width of its Gaussian.
For arbitrary weights, the arcs become the decision rule of a Subset Sum solver that reads them on the original weights and ends with a meet-in-the-middle filtered by a random residue class. Every answer it returns is verified. The dummy weights of HURS explain why the reading is exact: they blur the counts by a flat window, and the blur is invertible on counts, though not on reachable sets. On random weights of b bits the method has rigorous guarantees, in time 2b/2+o(b) and, with the filter, 2b/3+o(b), resting on a local limit theorem uniform in the size of the weights and on a concentration bound for signed subset sums. Finally, the solver is read inside a general theory of constraint propagation, in which every network factors as T=Tcomp∘Tstruct.
A mix of human-written and AI-generated textHuman understanding: some partsDirichlet L-functionsGRHSubset Sumcircle methodconstraint propagationlocal limit theoremmeet-in-the-middleprime races
We prove that the Hankel kernel Φ(x+y), where Φ is the Jacobi theta kernel whose cosine transform is the Riemann Ξ-function, is strictly reverse-regular through order four. The order is sharp: an interval enclosure of the fifth Hankel–Wronskian at t=10−2 shows failure at order five. The third-order condition is Csordas's conjecture that s′2−ss′′ is strictly log-concave for s(t)=Φ(t). The proof reduces the kernel minors to Wronskian signs and establishes the signs by exact polynomial estimates for t≥1 and interval arithmetic on [0,1]. The fourth-order sign also yields three positive iterates of s↦s′2−ss′′, the triple Turán inequalities for the normalized Taylor coefficients of Ξ, and quartic integral inequalities for Ξ.
A mix of human-written and AI-generated textHuman understanding: some partsCsordas-VargaJacobi theta functionRiemann Xisign regularitytotal positivity
Let χ be a real primitive Dirichlet character of conductor N ≥ 3 and parity k ∈ {0,1}. Let Λ(s,χ) = (N/π)^{(s+k)/2} Γ((s+k)/2) L(s,χ) be its completed L-function, and let H^χ_t(z) = ∫_0^∞ e^{tu²} Φ_χ(u) cos(zu) du be the de Bruijn–Newman heat flow of Λ(·,χ), normalised so that H^χ_0(z) = (1/8) Λ(1/2 + iz/2, χ). We give a proof, checked by the Lean 4 kernel, that for every such χ and every t ≥ 9/32 all zeros of H^χ_t are real. Equivalently, the generalised de Bruijn–Newman constant satisfies Λ_χ ≤ 9/32.
The mathematics is not new, and we say exactly whose it is. De Bruijn's strip-contraction theorem (1950) gives Λ_χ ≤ D²/2 whenever the zeros of H^χ_0 lie in |Im z| ≤ D. Freire, González-Riquelme, Muñoz, Poblete and Salinas observed (arXiv:2610.27343, Remarks 3.1 and 3.4) that the zero-free half-plane Re s > 7/8 for Dirichlet L-functions asserted by OpenAI would give D = 3/4, and hence Λ_χ ≤ 9/32. What this paper adds is a complete formal proof of that composition. For conductors up to 400, FGMPS's unconditional bounds are stronger for 136 of the 242 characters; what is new is that 9/32, for every conductor, is a kernel-checked theorem.
OpenAI's half-plane enters as their own kernel-checked Lean theorem. Every other step is proved in Lean on top of Mathlib: de Bruijn's theorem for a general class of kernels, the identification of the theta integral with Mathlib's completed L-function, and Gauss's sign theorem for real primitive characters. The final theorem depends only on the axioms propext, Classical.choice and Quot.sound. In local, unsandboxed replays five checkers accept it: Lean's kernel (run twice), nanoda, and the con-leche/con-ron pair. All five reject a deliberately unsound control. A sandboxed Comparator run against a separately written challenge also accepts it. That run was made by another agent session, and the auditor reproduced its solution export byte for byte.
The result rests on OpenAI's Lean proof, whose accompanying manuscript is unrefereed. It is not progress on the Generalised Riemann Hypothesis, which is the statement Λ_χ ≤ 0. A short, separable section records two companion results for ζ that use no OpenAI code, Λ ≤ 225/512 and ψ(x) = x + O_ε(x^{31/32+ε}), both from Cureton and Thorner's half-plane Re s > 31/32.
Code, verification records and archive: https://github.com/DrMurphyIsIn/real-dirichlet-dbn-lean (release v1.0.0); DOI 10.5281/zenodo.23840082.
Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγ⋅n⋅loglogn for every n>5040, and Nicolas' criterion states that it holds if and only if c(q)=log(q#/φ(q#))−γ−loglogθ(q)>0 for every prime q, where q# is the primorial of q and θ is the Chebyshev function. Let N be a colossally abundant number, let ξ(N) be the real number associated with N by Nicolas, and let q be the largest prime not exceeding ξ(N). Writing Δ(N)=log(σ(N)/N)−γ−logloglogN, we prove without any hypothesis that, whenever logq≥31, 1.353/(qlog2q)≤Δ(N)−c(q)+22/(qlogq)≤3.970/(qlog2q). The range logq≥31 contains the prime q of every colossally abundant counterexample, in accordance with the author's result that the largest prime factor of the least counterexample exceeds e31.018. Thus the functions Δ(N) and c(q) differ by 22/(qlogq) up to an explicit error of order 1/(qlog2q). This comparison is two-sided, but it is not an equivalence between Robin's inequality at N and Nicolas' inequality at q: it does not decide Robin's inequality at N when c(q)qlogq lies between 22(1−1.4035/logq) and 22(1−0.4787/logq). As consequences, every colossally abundant counterexample to Robin's inequality yields a prime q with c(q)>2.70/(qlogq); conversely, every prime q with logq≥31 and c(q)>22(1−0.4787/logq)/(qlogq) yields a colossally abundant counterexample, which gives a derivation of Robin's known theorem on colossally abundant counterexamples from Nicolas' oscillation theorem; and under the Riemann Hypothesis every colossally abundant number with logq≥31 satisfies Δ(N)<−0.654/(qlogq), in accordance with the constant 2(2−1) of Ramanujan's bound. For superabundant counterexamples, using the exponent bound of Nazardonyavi and Yakubovich, which gives logn≥ψ(pk) for the largest prime factor pk, we prove c(pk)>0.9991/(pklogpk), a bound that applies to the least counterexample, which is superabundant, and we show that the least colossally abundant number not smaller than the least counterexample n is itself a counterexample N with logN−logξ(N)≤logn.
Author comments: In the revised version we emphasize that Theorem 1.1 is unconditional. Nicolas’ estimates in [20] are proved under RH and, under RH, give a narrower interval than ours (Remark 3.5). Since a counterexample to Robin’s inequality exists only if RH is false, an estimate that assumes RH cannot be applied to one, whereas Theorem 1.1 applies to every colossally abundant number with log q ≥ 31. This is what Corollaries 4.2–4.4 use.
This paper collects, with uniform notation, a month of new results around one way of looking at the Riemann hypothesis (RH): as the statement that explicitly computable margins stay on one side of explicit constants for ever. Part I studies the Cesaro margin M(N) between a smooth curve and the weighted prime sum 2*sum_{q<N} Lambda(q) q^{-1/2} log(N/q): RH is equivalent to M(N) >= 0 for all large N (a theorem of Suzuki), and we verify 0 < M(N) < 0.18484 for every real 1 < N <= 2.15*10^29, with explicit unconditional bounds beyond; the margin is analyzed as a walk of the primes against a curve, as an energy, and as a one-sided mean: RH holds if and only if a weighted mean of the prime-counting error stays below -B = -(1 + gamma/2 - (1/2) log 4pi) for ever. Part II dissects the Mobius side of the same coin: an exact positive-definite variance identity for sum_{d<=D} mu(d)({x/d}-1/2), empirically Gaussian statistics, and an exact anatomy of the fourth moment — the conductor-1 orbit decouples, the cross term moves only at composite squarefree conductors, two of its four sectors are O(D log^4 D) unconditionally, and an empirical jump law, first refuted, is proved exactly in its sector. Part III shows that 2B is the Baez-Duarte constant of the Nyman-Beurling criterion and recomputes the Nyman-Beurling distances from scratch through Vasyunin's cotangent formula: d_N^2 log N reaches 0.0461 against 2B = 0.04619, with no zero of zeta used anywhere in the computation. Part IV distils the author's twenty-two-part study of the cross-energy of consecutive Dirichlet partial sums: the trichotomy that singles out the critical line as the trace of the pole, the energy law (the mean energy of the prime-counting error is >= 2B unconditionally, with equality if and only if RH holds with simple zeros), the energy slope as a truncated Weil functional exact in the primes, the functional reflection that reproduces Hardy's function from the integers, and the systematic Davenport-Heilbronn and Beurling controls. Part V states precisely what none of this can do: a no-go theorem shows that weights indistinguishable from the primes' to q^(delta-1/2) satisfy every averaged statement here and still carry an off-line zero, so the exact identity Lambda = mu * log must enter beyond its first moments. The paper opens with a list of its twenty-two original contributions and a matching statement of what is due to others. We do not prove the Riemann hypothesis, and no statement in this paper should be read as progress towards it beyond what it literally says.
A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; Cesaro; Mobius; Landau; Nyman; Dirichlet; Weil; Davenport
For N>1 let C(N)=2∑n<NΛ(n)n−1/2log(N/n) and let M(N)=R(N)−C(N), where R(N)=8N−5.3721834logN−7.4013354+O(N−5/2) is explicit. By a theorem of Suzuki, the Riemann hypothesis (RH) holds if and only if M(N)≥0 for all large N, and then 0≤M(N)≤4(logξ)′′(21)=0.18484. We prove, with computer assistance, that this two-sided inequality holds for every real 1<N≤2.15⋅1029: up to 1010 from the primes with correctly rounded arithmetic, and beyond from the first 4520 zeros, certified with ball arithmetic, together with the verification of RH to 3⋅1012 and an explicit zero-density estimate. The same ingredients give, for every N and without any hypothesis, −E(N)≤M(N)≤0.18484+E(N) with E(N) explicit and E(1020)<3⋅10−5. We describe the local minima of M exactly, through the slope α(x)=∑n≤xΛ(n)n−1/2−2x+2c0. Under RH the margin is the variogram of α, and RH is equivalent to ∫1Xα2dx/x=Xo(1). Without any hypothesis we prove an energy identity, which expresses the energy of the slope as a C-transform of the margin against the prime measure, and a lower bound for the mean energy that is attained exactly under RH with simple zeros. We then show what such arguments cannot do. Positive weights within qδ−1/2 of Λ(q)q−1/2 satisfy the energy identity, the prime number theorem and Chebyshev's identity up to x1/2+δ, yet carry an off-line zero. So the structural inputs listed do not suffice, and a proof along these lines has to use Λ=μ∗log exactly. Carrying that identity through the slope, α is numerically, to within 1% in the range tested, a M\"obius-weighted sawtooth, and the exact argument reduces to a type~I sum of μ against the fractional parts of x/d, which is RH again.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 36 pages, 10 figures; ancillary scripts reproduce the computations; Part 11 of the 47-part book-series Cross-Energy of Dirichlet Partial Sums (Parts 0-46), block III (The margin and the constant B-hat); formerly a standalone note; a public version is the Hexagon preprint hexagon:2610.00661v1. Part 0 is the guide. The paper states the Riemann-hypothesis caveat once (2 Nov 2026: removed from the abstract and from a remark).
A mix of human-written and AI-generated textHuman understanding: all partsRiemann hypothesis; explicit formula; Weil positivity; Riesz; ball arithmetic
In this paper, we obtain a zero-free half-plane Re(s) > B_ex for every finite-order Hecke L-function over every number field, where B_ex = 0.87407284766682790777... is an explicitly defined algebraic number of degree four. The proof refines the cubic-theta comparison in two parts. In Part I, we require sufficient prime-product length for length restoration and fix the short side of the equal-product comparison rectangle at 1/4. Direct and complementary Poisson estimates give an amplified Gauss norm with an additional prime product. Its separate applications to the numerator and the counting detector, combined with contour displacement and successive moment bounds, give the intermediate boundary B′ = 0.87422125049290208328....
In Part II, complete prime removal is permitted even when a positive length excess remains. The no-prime moment estimate then controls the resulting ordinary sums, and the comparison rectangle’s short side may vary. These changes remove the coupled condition on the remaining prime length and enlarge the allowed norm widths. The improved detector count and numerator estimate give successive proved bounds converging to B_ex. We prove optimality for this specified direct, detector and fourth-moment comparison system, retaining its geometric length inequality while allowing the sum of the length exponents to vary. Both parts use the established theta, moment and continuation results of the earlier QRH papers and their general-field formulation.
A mix of human-written and AI-generated textHuman understanding: some partsHecke L-functionsRiemann Zeta Functionquasi Riemann Hypothesis
We prove strict log-concavity of the positive functions Θ and Λ with one-sided and bilateral Laplace transforms 1/ξ(21+s) and 1/Ξ, respectively, where Ξ(z)=ξ(21+iz). For either function, log-concavity is the Pólya frequency property of order two (PF2). Without assuming RH, but using known zero verification through height 3⋅1012, we further prove that Λ is a PF function of order ten (PF10). We also prove local PF positivity for Θ: for each fixed order, the ordered minors of Θ(x−y) are positive when all differences xi−yj are sufficiently small and positive. Additionally, we prove the generalized Laguerre inequalities: if RH holds up to height T>1/2, then Ln[Ξ](x)≥0 for every n≥0 and ∣x∣≤T−1/2; the case n=1 is due to Csordas, Ruttan and Varga (1991).
A mix of human-written and AI-generated textHuman understanding: all partsPolya frequencyRiemann Xicomplete monotonicitygeneralized Laguerrelog-concavity
Abstract
We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat
flow attached to the Riemann ξ-function. For the classical kernel Φ and the family
Ht(z) = Z ∞
0
e
tu2
Φ(u) cos(zu) du, Ft(w) = Ht(i
√
w) = X
n≥0
qn(t)w
n
,
we prove the exact evolution laws
∂tFt = 2F
′
t + 4wF′′
t
, q(m)
n
(t) = (2n + 2m)!
(2n)! qn+m(t).
The coefficients have positive integral representations and the transformed entire function
has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)),
derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state
carefully the strict consecutive-minor criterion needed to pass from these minors to total
positivity. In particular, for this coefficient family the real-zero condition is equivalent to
strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that
selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion.
We also correct the multiplicity bookkeeping for the squared-variable map and record a
Chebyshev convolution identity without attributing to it an unjustified duplication of zeros.
The paper proves no new unconditional upper bound for the de Bruijn–Newman constant
and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact
identities and to isolate the remaining quantitative problem
Primarily human-written textHuman understanding: all partsRiemann ξ-function; de Bruijn–Newman constant; heat flow
We give a normalization-consistent coefficient formulation of the de Bruijn–Newman heat
flow attached to the Riemann ξ-function. For the classical kernel Φ and the family
Ht(z) = Z ∞
0
e
tu2
Φ(u) cos(zu) du, Ft(w) = Ht(i
√
w) = X
n≥0
qn(t)w
n
,
we prove the exact evolution laws
∂tFt = 2F
′
t + 4wF′′
t
, q(m)
n
(t) = (2n + 2m)!
(2n)! qn+m(t).
The coefficients have positive integral representations and the transformed entire function
has order at most 1/2. We relate the zeros of Ft to the Pólya–frequency property of (qn(t)),
derive the rectangular Jacobi–Trudi identity for the consecutive Toeplitz minors, and state
carefully the strict consecutive-minor criterion needed to pass from these minors to total
positivity. In particular, for this coefficient family the real-zero condition is equivalent to
strict positivity of every consecutive minor Dt(n, r), not merely to nonnegativity of that
selected family. This distinction avoids an invalid use of a weak version of Fekete’s criterion.
We also correct the multiplicity bookkeeping for the squared-variable map and record a
Chebyshev convolution identity without attributing to it an unjustified duplication of zeros.
The paper proves no new unconditional upper bound for the de Bruijn–Newman constant
and no proof of the Riemann hypothesis; its purpose is to provide an auditable set of exact
Primarily human-written textHuman understanding: all partsRiemann ξ-function; de Bruijn–Newman
Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγ⋅n⋅loglogn for every n>5040. Let n′ be the squarefree kernel of n, pk its largest prime factor, and d=eγ/ζ(2)≈1.08276. We prove that Robin's inequality holds for every n>5040 with d⋅loglogn′≤loglogn, and for every n>5040 whose prime factors are all below (logn)1/d, and that both results remain valid with d replaced by 1.016. Our main results concern superabundant numbers, among which there are infinitely many counterexamples to Robin's inequality if the Riemann Hypothesis is false. Using the classical error term in the prime number theorem, we show that every superabundant counterexample satisfies loglogn−logpk<C⋅exp(−clogpk) for absolute constants C,c>0. Since the least counterexample satisfies logn>pk, we deduce that the Riemann Hypothesis is true if there are constants c>0 and 0<α<2 with c≥0.0562/31.032−α, and a threshold N≤101013.11485, such that loglogn−logpk≥c/logα(pk) for every superabundant number n>N with logn>pk. We also give explicit versions of these bounds: every counterexample satisfies pk1.000002>logn, and every superabundant counterexample satisfies −0.010101/(loglogn)3<loglogn−logpk<0.056201/(loglogn)2. An enumeration of the superabundant numbers up to 1040 shows that only 3 of the 244 exceeding 5040 satisfy e0.0562>1+(loglogn−logpk)⋅log2(pk), namely those with pk>logn, the largest of which is 10685862914126400. Testing the hypothesis of the sufficient condition on the same range, we find that all 168 superabundant numbers between 10685862914126400 and 1040 satisfy loglogn−logpk>0, and that for each α∈{1,2,3,4,5} the minimum of (loglogn−logpk)⋅logα(pk) over them is positive, ranging from 0.0223 for α=1 to 6.19 for α=5, and is attained at the same superabundant number, whose largest prime factor is 59.
This work establishes a novel structural connection between the Riemann Hypothesis and Young's Lattice through partition-indexed harmonic numbers and the Generalized Assembly Theorem. We establish a new family of equivalences for the conjecture, define the partition-based harmonic numbers Hnλ, and reformulate the Riemann Hypothesis as the Young's Lattice equivalence: ∑k∈Nλ⊢kλ!Hnλak>∑d∣nd for every n∈N, where λ⊢k denotes a partition of k, λ! is the partition factorial, and ak=k1+⋯+k21 or ak=log(k+1). We then prove the Generalized Assembly Theorem, which shows that the assembly sum Snm=∑k=1n∑λ∈℘kk+m−1Hnλ equals n for every excess parameter m−1, providing a systematic framework to analyze divisor bounds through the branch decomposition of the partition-indexed series. The resulting structure yields an exact, non-asymptotic realization of the divisors of n. Finally, we propose and explore a hierarchical expansion connecting the exponential of the Euler--Mascheroni constant, eγ, to Multiple Zeta Values under Abel summability. eγ=1+∑a≥2a!1∑m≥0(−1)mζA(a+m)+∑a,b≥2a!b!1∑m,n≥0(−1)m+nζA(a+m,b+n)+⋯
Primarily human-written textHuman understanding: all parts
Let Xi(t)=xi(1/2+it) be the Riemann xi-function on the critical
line, Xi(t)=sum_{k>=0}(-1)^k c_k t^{2k} its even Taylor expansion,
and D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} the associated Toeplitz
minors. Writing G(z)=sum_{k>=0}c_k z^k and beta_j=-1/z_j for the
zeros of G, the dual Jacobi-Trudi identity gives
D(n,r)=c_0^r s_{(r^n)}(beta), the Schur function of the rectangular
partition (r^n) in the alphabet beta.
Positivity of D(n,r) for all n>=0 and all r>=1 is equivalent to the
Riemann hypothesis (RH) by the Schoenberg-Edrei characterisation of
Polya frequency sequences; for each fixed r, the inequalities
D(n,r)>=0 are a necessary condition, and for r=2 they hold
unconditionally. A previous paper of the author proved that every
level r<=43 is blind: the minors D(n,r) stay positive even in the
presence of non-real zeros. The mechanism there was the two-variable
Chebyshev criterion U_k(cos theta)>0 iff (k+1)theta<pi, together
with the uniform bound theta<=theta_max=2 arctan(1/(2 gamma_1))
=0.07071826...
The present paper shows that the bound 43 is not the truth but an
artefact of ignoring two structural features of the true alphabet.
First, the evenness Xi(-t)=Xi(t) forces every zero of G to occur
with multiplicity two in beta, so the relevant constituent is not
U_r but the self-convolution
W_r = sum_{i=0}^{r} U_i(cos theta) U_{r-i}(cos theta),
with generating function
sum_{r>=0} W_r z^r = 1/(1-2z cos theta + z^2)^2.
We prove the identity W_r = (1/2) U'_{r+1}(cos theta) and the
pole-free sign criterion of Lemma (sign), and we show that W_r>0
for all r<=61 while W_62<0: the convolution of the Chebyshev
sequence against itself smooths away the sign change that occurs at
U_44, pushing the threshold from 43 to 61. Secondly, the zeros on
the critical line contribute a positive real sub-alphabet whose
complete symmetric functions h_i(X)>0 convolve with the violating
part, h_r(X union Y)=sum_{i+j=r} h_i(X) h_j(Y), pushing the
threshold further.
Main theorem (proved). For every r<=61 and every n=1, and
regardless of whether RH is true, D(1,r)>0. Consequently the first
61 levels of the Turan hierarchy are blind on the shift-1 row.
High-precision computation of the full rectangular Schur functions
s_{(r^n)}(beta) on the true alphabet (truncated at N critical-line
zeros) shows that the first discriminating order is r*=69 at shift
n=1 and n=3, so that all orders r<=68 are blind; the value is stable
under truncation (N=45,60,80 all give 69). A scaling law
r* ~ 1.5 pi/theta is observed across two and a half decades of the
violating offset. At shift n=2 no negative minor was found for any
r<=400, suggesting a qualitatively stronger phenomenon. The number
61 is proved; the number 68 is numerical, and the Status section
separates the two without ambiguity. No claim of a proof of RH is
made.
Primarily human-written textHuman understanding: all partsRiemann zeta function / xi-function / Turan inequalities /
Ramanujan proved that π(x)2<logxexπ(x/e) for all sufficiently large x. Let NR be the least integer such that this holds for every real x≥NR. Dudek and Platt showed that the Riemann hypothesis implies NR=38,358,837,683. We prove that NR=38,358,837,683. To our knowledge, this is the first determination of NR without assuming the Riemann hypothesis.
The proof uses the zero-free half-plane Res>7/8 of a recent OpenAI preprint. Its main statement for ζ is formalized in Lean 4 and has been rebuilt independently; its written proof has not been peer reviewed. The deduction is our Theorem B: if ζ(s)=0 for Res>0.945092, then NR=38,358,837,683. The proof of Theorem B uses only refereed inputs, together with Bhattacharjee's correction of a theorem of Büthe.
Relying only on the peer-reviewed literature, and on preprints where stated, we also prove the following by rigorous computer-assisted interval arithmetic.
(A) The inequality holds for 38,358,837,683≤x≤e753.98. The previous range ended at e103.
(C) It holds for x≥e3035.01. This replaces Axler's threshold e3158.442, whose proof applies a lemma of Dudek and Platt in a case where that lemma's proof is defective.
(B′, D) Either of the following also suffices: a zero-free region β≤1−1/(1.7373log∣γ∣) above height 3⋅1012, or RH verified to height 4.1602⋅1014. We tabulate the trade-off between the two.
(E) Arguments that use only non-negativity, analytic continuation and the poles up to height T cannot go beyond e754.40 when T=3⋅1012. So (A) is optimal among such arguments to within 0.41 in logx.
Building on Bhattacharjee's discovery that the constant E2 in Büthe's Theorem 1 lacks a factor log(3c), we show that the affected rows of the Broadbent–Kadiri–Lumley–Ng–Wilk table inherit the error, by 1.3–2.2% after re-optimization. We also trace the consequences in the literature.
Primarily AI-generated textHuman understanding: all partsChebyshev functionRamanujan's inequalitycomputer-assisted proofexplicit estimatesinterval arithmeticprime-counting functionzero-density estimateszero-free half-planezero-free region
Assuming the Generalized Riemann Hypothesis, the explicit formula for the L-function of an elliptic curve E/Q bounds the analytic rank of E in terms of the traces a_p for p < e^(2L), for any admissible test function supported on a window [-L,L]. In rank computations this test function is usually fixed in advance, typically to a Fejer-type kernel; optimising it for an individual L-function goes back to Booker, and an earlier test on quadratic twists of rank about 7 found the gain to be small. We choose, for each individual curve, the test function that minimises the resulting bound within a finite-dimensional space supported on [-L,L], certify the result, and measure the gain systematically, up to the current record curves. The minimiser is the solution of a linear system with the Gram matrix of the Weil quadratic form of E, and the optimal bound equals the reciprocal of the corresponding reproducing kernel at the central point, which we call the radix Riemanniana of E. Because the Fejer-type kernel lies in this space, the optimised bound is never weaker. We certify every bound with ball arithmetic, check the prime-side evaluation against the zero side computed independently from the zeros of L(E,s), and benchmark against the fixed kernel on 1642 curves from Cremona's tables, 2500 curves from the Stein-Watkins database and a set of curves with conductors up to 3*10^16. Depending on the sample and on the stopping criterion, the number of primes required to pin down the analytic rank decreases by 8-23% in aggregate. For individual curves of large conductor the decrease ranges from 0% to 43%. Within each sample the gain is largest at rank 0 and decreases with the rank; it grows again, and by a much larger factor, in the regime of large rank and large conductor where the computation is most expensive. On the smallest-conductor curves of rank 28-31 in the ICARM leaderboard the optimised kernel needs 84-85% fewer primes to certify the rank. For the current record, the rank-32 curve #4239 of Elkies, Klagsbrun and Li, it certifies r_an<=32 under GRH with 2.53*10^9 primes - the first upper bound for this curve - and hence r_an=32 under GRH and BSD, while the fixed kernel, certified at L=12.40 with 2 481 819 193 primes, is still 0.39 above the target. On all 395 leaderboard curves of rank 24-31, with primes below 10^10, the optimised kernel certifies r_an<= r on 379 curves and the fixed kernel on 372; where both succeed the fixed kernel needs a median of 4.0 times as many primes. We validate the fixed-kernel baseline by reproducing every published value of Bober and of Klagsbrun, Sherman and Weigandt with an independent implementation.
Primarily human-written textHuman understanding: all parts
Gonek, Hughes and Keating factored ζ≈PXZX, an Euler product times a product over the zeros. We use an exact form ζ=EX∗ZX, EX∗ a smoothed Euler factor, and for $\re s_0>\frac12$ study the Euler--Caceres bound BX(s0)=21log∫∣ZX(21+it)∣2Ps0(t)dt−log∣ZX(s0)∣, Ps0 the Poisson kernel. It is the off-line Blaschke term of the Poisson--Jensen formula at s0, independent of X, plus a positive Jensen gap. Under RH, (logX)BX(s0)→∑γκm(γ)Ps0(γ), with universal constants κm for multiplicity m (κ1=1.8279…). Hence, for any single s0, RH holds if and only if BX(s0)=O(1/logX), and RH with simple zeros if and only if (logX)BX(s0) tends to an explicit number (0.040186… at s0=2). If $\Theta=\sup\re\rho>\frac12$, Landau's theorem in the variable logX gives BX(s0)=Ω+(XΘ−21−ε) for $\re s_0>1$, attained or not, so RH holds iff BX(s0)≪Xε at one point. Unconditionally, BX(s0)=O(X/logX) for $\re s_0>1$, and the off-line term at s0=2 is below 2.3⋅10−12. Under RH we identify the second-order term up to an interaction of the wells (known only to be o(logX)), related heuristically to Montgomery's pair correlation; it is governed by the gaps between zeros, and under a small-gap hypothesis the law holds with error O(loglogX/logX). We give a function-field model where the bound holds, and controls (a Beurling system with the zeros of ζ and a zero at 0.6, the Davenport--Heilbronn function) suggesting that a proof must couple the Euler product with the functional equation. Numerically the bound follows the law, stays below the floor 0.0386 of Dirichlet-polynomial mollifiers at the centre s0=1, and grows for the Davenport--Heilbronn function and for a planted off-line zero. We do not prove RH.
Author comments: Supersedes hexagon:2610.00343 (An Euler-product mollifier for the Jensen moment of zeta and an energy criterion for the Riemann hypothesis), whose theorems are here in the same or a stronger form. Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). Version 2. 52 pages, 8 figures, 18 tables; ancillary Python scripts reproduce the tables and figures. Part 18 of the book-series Cross-Energy of Dirichlet Partial Sums (thirty-eight parts, Parts 0-46; block IV: Weil positivity; Part 0 is the guide); formerly Part 11 (renumbered 2 Nov 2026). We do not prove the Riemann hypothesis.
A mix of human-written and AI-generated textHuman understanding: all partsBeurling primesDavenport-Heilbronn functionEuler productJensen formulaPoisson-Jensen formulaRiemann Hypothesisexplicit formulamollifier
Let Ξ(t)=ξ(1/2+it) denote the Riemann ξ-function in the
critical-line parametrisation, let Ξ(t)=Σ_{k≥0}(-1)^k c_k t^{2k} be
its even Taylor expansion at the origin, and let
D(n,r)=det[c_{n+i-j}]_{i,j=0}^{r-1} be the associated Toeplitz minors.
By the Schoenberg--Edrei characterisation of Pólya frequency
sequences, positivity of D(n,r) for all n≥0 and all r≥1 is equivalent
to the Riemann hypothesis (RH); for each fixed r the inequalities
D(n,r)≥0 supply a necessary condition for RH, and for r=2 they were
proved unconditionally by Csordas, Norfolk and Varga, so that the
second level of the resulting hierarchy is not discriminating. We show
that this failure of discrimination persists far beyond level 2, and
we determine the range over which it does so: every level r≤43 is
non-discriminating.
Parametrising the zeros of the generating function G(z)=Σ_{k≥0}c_k z^k
by β_j=-1/z_j, the dual Jacobi--Trudi identity yields the exact
identity D(n,r)=c_0^r s_{(r^n)}(β), where s_{(r^n)} denotes the Schur
function of the rectangular partition (r^n) in the alphabet β. A zero
of ζ off the critical line contributes to β a conjugate pair
ρ e^{±iθ} whose argument θ coincides with the vertical angle of the
corresponding violating pair, whereas zeros on the critical line
contribute positive real variables. For an alphabet of cardinality two
we prove the closed form
s_{(a,b)}(ρ e^{iθ}, ρ e^{-iθ}) = ρ^{a+b} sin((a+1-b)θ)/sin θ
= ρ^{a+b} U_{a-b}(cos θ),
where U_k is the Chebyshev polynomial of the second kind; the sign is
therefore governed by the criterion U_k(cos θ)>0 if and only if
(k+1)θ<π.
Through the coproduct expansion s_λ(X⊔Y)=Σ_μ s_μ(X)s_{λ/μ}(Y), the
Littlewood--Richardson expansion s_{λ/μ}=Σ_ν c^λ_{μν}s_ν of each skew
factor, and the positivity of Schur functions on positive real
alphabets, the sign analysis reduces to two-variable constituents.
Since c^λ_{μν}>0 forces ν⊆λ=(r^n), the index k=ν_1-ν_2 of each
constituent is bounded by the number of columns r and is independent
of the shift n. All constituents then have the same sign, so no
cancellation occurs. The same bound persists for an alphabet
containing several conjugate pairs: iterating the coproduct over the
pairs and using the fact that the entry 1 occurs at most once in each
column of a semistandard tableau bounds every constituent index by
ν_1≤r, independently of the number of pairs. This yields the
following result.
Blind Zone Theorem. Let the alphabet contain any number of violating
pairs, each subtending a vertical angle at most θ_max, and suppose
θ_max<π/(r+1). Then every minor D(n,r') with r'≤r is strictly
positive, notwithstanding the presence of non-real zeros.
The critical strip together with γ_1=14.134725141... forces
θ≤θ_max=2 arctan(1/(2γ_1))=0.07071826... radians, whence
π/θ_max=44.424...; consequently every order r≤43 is
non-discriminating: for all n≥0 and all r≤43 the minor D(n,r) is
positive if RH fails and non-negative if RH holds, so no minor of
order r≤43 can certify either the truth or the falsity of RH. The
bound is on the order r and not on the shift n; the corresponding
n-based assertion is false, and the mechanism responsible is exhibited
in the remarks section. The threshold is established for an arbitrary
number of violating pairs; the case of several pairs is settled in the
coproduct section and requires no separation condition on the moduli
and no bound on the number of pairs. No claim of a proof of the
Riemann hypothesis is made.
Primarily human-written textHuman understanding: all parts1 Riemann zeta function 2 xi-function 3 Turan inequalities 4 Toeplitz minors
Let Xi(t) = xi(1/2 + it) be the Riemann Xi-function, let
Xi(t) = sum_{k>=0} (-1)^k c_k t^{2k} be its even Taylor
expansion at the origin, and let D(n,r) = det[c_{n+i-j}]
(i,j = 0..r-1) be the Toeplitz minors whose positivity for
all n >= 0, r >= 1 is equivalent to the Riemann Hypothesis
(RH). We prove a sharp and quantitative obstruction in the
resulting hierarchy of criteria.
Parametrising the zeros of G(z) = sum c_k z^k by
beta_j = -1/z_j, we establish by the dual Jacobi-Trudi
identity the exact identity D(n,r) = s_{(r^n)}(beta), the
Schur function of the rectangular partition (r^n) in the
variables beta. A zero of zeta off the critical line
contributes to beta a conjugate pair rho e^{+-i theta} whose
angle theta is exactly the vertical angle of the violating
pair of zeros, while zeros on the critical line contribute
positive real variables. For two variables we prove the
closed form
s_{(a,b)}(rho e^{i theta}, rho e^{-i theta})
= rho^{a+b} sin((a+1-b) theta) / sin theta
= rho^{a+b} U_{a-b}(cos theta),
U_k being the Chebyshev polynomial of the second kind, so
that the sign is governed by the classical criterion
U_k(cos theta) > 0 if and only if (k+1) theta < pi.
Since a Schur function in two variables can be expanded
through the coproduct s_lambda(X sqcup Y) = sum_mu s_mu(X)
s_{lambda/mu}(Y), and since s_mu(X) > 0 for positive real X,
positivity reduces to the two-variable factors, whose index
k = a - b is bounded by the number of columns r, not by the
shift n. This yields:
Blind Zone Theorem. If a violating pair subtends a vertical
angle theta < pi/(r+1), then every Toeplitz minor D(n,r')
with r' <= r is strictly positive, notwithstanding the
presence of non-real zeros.
The critical strip together with gamma_1 = 14.134725141...
forces theta <= theta_max = 2 arctan(1/(2 gamma_1)) =
0.07071826... rad, whence pi/theta_max = 44.424... and
therefore every order r <= 43 is completely
non-discriminating.
We emphasise that the exponential bound is on the order r
and not on the shift n; we exhibit the mechanism and show
the contrary n-based bound is false. We also record the
refutation of a "universal covering law" previously
conjectured by the author, and a floating-point artefact
that nearly produced a false refutation of the main theorem.
No claim of a proof of RH is made.
A mix of human-written and AI-generated textHuman understanding: all partsChebyshev polynomialsRiemann Zeta FunctionSchur functionsToeplitz minorsTuran inequalitiesblind zonetotal positivityxi-function
We study adjoining a half-bandwidth signed cubic trace and a spectral count ladder to a bandwidth-one trace/Frobenius model motivated by zeta-zero certificates. In a finite circle model with mass N = 64, flat windows, and explicit budget centers, we prove exact absorption over the full atom-only class: the augmented and baseline optima agree for both the distinct-count and simple-fraction objectives. Three explicitly specified integer-marked grid columns attain the lower bounds. Their mixing weights are defined algebraically, and an Arb certificate proves all strict feasibility and inertia inequalities. The witness satisfies the ladder at every positive threshold, not just on a finite threshold grid. We also give the exact conjugate-pair spectrum, the isolated-block cubic identity, grid Parseval, and the sharp conditional spectral-capacity constant 2 sqrt(2). The result is a finite model theorem, not an unconditional statement about zeta zeros. Version 2 corrects an infeasible witness, a cubic-tolerance mismatch, and an incorrect rationality claim in version 1. Global absorption in the pair-containing or pinned classes remains unproved; equality on a searched column dictionary and heuristic pricing do not establish it.
Primarily AI-generated textHuman understanding: some parts
Haglund introduced the partial sums ΞN=∑n≤NΦn of Riemann's expansion of the Ξ-function in incomplete gamma functions and conjectured that for every N the zeros of ΞN in the closed first quadrant, listed by increasing real part, have nondecreasing imaginary parts. The conjecture implies the Riemann hypothesis; Haglund's computations supported a weak form of it for N≤10. We show that the conjecture is false for N=27: Ξ27 has a real zero in (3144.8946,3144.8947) and a non-real zero z0=3143.2206824215…+0.3152587993…i in the first quadrant, whose real part is smaller. The weak form fails as well. Both facts are certified twice, independently, in interval arithmetic (Arb ball arithmetic; outward-rounded intervals with proved truncation bounds), and z0 is enclosed in a square of half-width 10−48. The same violation occurs at N=24 for the companion approximants ξN=ΞN+cN. The failure has a mechanism: on the critical line ΞN<Ξ<ξN, so the real zeros of ΞN lie in positive lobes of Ξ that rise above a positive level, and a low lobe followed by a higher one near the height 4(N+1)2, where the approximant departs from Ξ, can leave a non-real zero below real zeros. The same structure shows that the number of positive real zeros of ΞN, counted with multiplicity, is odd, and that x2ΞN(x) tends to a negative limit on the real axis for every N.
Primarily AI-generated textHuman understanding: some parts
Let Λ be the de Bruijn--Newman constant; the Riemann hypothesis (RH) is equivalent to Λ≤0, and Rodgers and Tao proved Λ≥0. We ask how small Λ can be if ζ has a zero 21+δ+iγ with δ>0. Using de Bruijn's strip, the zero dynamics of the Polymath project, and an explicit local zero count for the deformations Hτ that we prove here, we show, with no further hypothesis, that such a zero forces \[ \Lambda\ \ge\ \frac{\delta^2}{70\,\log\gamma\,\log\log\gamma}, \] the numerical steps of the proof are certified in ball arithmetic. This is an implication from a hypothetical zero: under RH it says nothing, and the only unconditional lower bound for Λ remains Λ≥0. The proof bounds Λ, not the survival time of the given zero. For a single pair, the interaction term of the exact equation for its imaginary part is, at τ=0, the energy slope ∂σlog∣ξ∣ of the other zeros at the zero itself; under local isolation and regular spacing the bound becomes linear in δ. In an exact polynomial model, a pair over a cluster of K real zeros (K even) is absorbed at 2δ2/(K+1), and clusters of the size the unconditional zero count allows keep the rate at δ2/logγ in the simulated dynamics; this suggests that a linear bound needs a local count not known even under RH. On the 21 off-line zeros of the Davenport--Heilbronn function with δ>0.005 and height below 800, freezing the energy slope predicts the survival time to within 7%, and we show by a computer-assisted argument that its constant satisfies 0.228<Λf≤3.125. Finally, we prove a heat-flow Landau formula for fixed n and 0<t≤21: under the flow the memory of a prime decays like p−(t/4)log(γ/2πp) and rotates, while composite numbers acquire a memory governed by a deformed von Mangoldt function Λt, which is positive for prime powers, for all squarefree n, and for small t when n has two prime factors (numerically in all cases tested); the main term dominates when 4tlogn<1.
Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 40 pages, 6 figures. Ancillary scripts: those of the original part (ancillary zip in the part folder) and, for Section 9, Caceres_CE32_ancillary_front32a.zip. Part 35 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly Part 15. Renumbered 2 Nov 2026. v2 (2 Nov 2026): new Section 9, exact cluster absorption (Hermite model, Proposition 9.1) and the barrier for a linear bound; abstract updated. The paper states once, in its discussion, that it does not prove the Riemann hypothesis.
Primarily human-written textHuman understanding: all partsC2 FunctionDirichlet SumsRiemann Zeta Function
Recent work on Artin's primitive root conjecture establishes a zero-free half-plane Res>1−10−6 for finite-order Hecke L-functions over cyclotomic fields containing e2πi/12. Following their strategy, we prove that if K is any number field, then the Dedekind zeta function ζK(s) does not vanish in the half-plane Res>31/32. As a corollary, the L-function of any finite-order Hecke character defined over K also does not vanish in the half-plane Res>31/32, wherever it is holomorphic. These results were proved and formalized in Lean using AxiomProver. Compared to the work on Artin's primitive root conjecture, the hardest part was the formalization of the work of Kazhdan and Patterson on metaplectic forms in order to accommodate all number fields.
A mix of human-written and AI-generated textHuman understanding: some partsDedekind zeta functionHecke characterL-functionnumber field
This record identifies published conclusions formerly obtained under RH or GRH whose proofs require only a fixed zero-free half-plane for Dirichlet L-functions, with further applications of finite-order Hecke L-functions over Q(−3). The input is the 7/8 theorem stated in the recent OpenAI manuscript claiming to prove the quasi-Riemann Hypothesis. We give the uniform analytic deductions explicitly and distinguish them from previously established algebraic and combinatorial results used in the proofs. An accompanying audit records the source verification and rejected candidates. No theorem about all number-field or automorphic L-functions is inferred from the Dirichlet statement; the pure cubic and cubic-nonresidue applications separately identify the precise fixed-field Hecke input.
Primarily AI-generated textHuman understanding: no partsRiemann Hypothesis
Let X_n(s) denote the sum of k^(-s) for k from 1 to n, and define the cross energy C_2(n,s) as |X_n(s)|^2 − |X_(n−1)(s)|^2 − n^(−2σ). At every point of the critical strip, the limit of C_2(n,s) is 1/(1/4 + t^2), zero, or positive infinity, according as σ = 1/2, σ > 1/2, or σ < 1/2. This trichotomy reflects the pole at s = 1. On the critical line, the associated helix has a natural orientation whose signed radius is Hardy’s Z(t), and the zeros of the truncated functions spiral toward the zeros of the Riemann zeta function at rate n^(−β).
We prove that the mean energy of the normalized error E(u) in the prime number theorem equals the sum, over zeros ρ, of the limits of C_2(n,ρ), with values in [0,∞]. This energy is at least 2 + γ₀ − log(4π), with equality if and only if the Riemann hypothesis (RH) holds and all zeros are simple. An unconditional local formulation expresses the energy in a Gaussian window as a double sum over zeros. We also study the pointwise inequality S(σ,t) = ∂/∂σ log|ξ(σ + it)| > 0, which is equivalent to RH. An off-line pair reduces S precisely inside a disc; at abscissa σ, the failure set up to height T has measure at most N(σ,T + 1). Moreover, S is Weil’s functional evaluated at a Poisson kernel, and its truncation admits an exact finite expression involving primes up to e^L.
We test each criterion against the Davenport–Heilbronn function, which has zeros off the critical line, and against its Euler-product counterpart L(s,χ) modulo 5. The former violates each criterion as predicted, whereas the latter behaves like the zeta function. For zeta, primes up to 10^8 yield a mean energy of 0.0453, compared with 0.0462. Assuming RH, simple zeros, and a spacing condition, we determine the next-order term in the energy: the integral from 1 to X of (ψ(x) − x)^2/x^2 dx equals C_B log X + K + Φ(log X) + o(1), where K = 2.5125… and Φ describes almost-periodic interference between pairs of zeros. Prime data up to 10^7 track this term with correlation 0.999; random models of primes and of the Möbius function μ carry 20 to 150 times more energy.
On the circle associated with the Euler factor of a prime p, the zeros favor angles near π, and near π + arg χ(p) for L(s,χ). Restoring the endpoint term (1/2)N^(−s), we prove, with explicit constants, that zeros of the truncations converge to zeros ρ of zeta along helices with radius |ρ| N^(−β−1)/(12|ζ′(ρ)|). For the Davenport–Heilbronn function, the convergence rates for the two zeros in an off-line pair differ by 2(β − 1/2). Finally, Weil’s form, using two windows at the endpoints of its support, detects an isolated zero at β = 1/2 + δ and height γ using prime powers up to (C log γ)^(1/δ). The corresponding positivity holds for zeta up to 3 × 10^6 but fails for a random multiplicative model. We do not prove the Riemann hypothesis.
A mix of human-written and AI-generated textHuman understanding: all partsC2 FunctionDirichlet SumsRiemann Zeta Function
Let P(a,q) denote the least prime congruent to a modulo q, where (a,q)=1.
We give a computer-assisted proof that P(a,q)≪q3.99, improving the exponent 5
of Xylouris. More precisely, P(a,q)<q3.99 for every sufficiently large q, uniformly
in a.
The main new ingredient is a graded near-density estimate for zeros of Dirichlet
L-functions, a weighted form of Heath-Brown's Lemma~12.1 of the kind he asked for in 1992. We
combine it with the zero-location estimates and far-density method of Heath-Brown and Xylouris.
The second novelty is the scale of the case analysis. Heath-Brown and Xylouris closed their final
case analyses with 14 and 21 main cases, each by a chain of inequalities evaluated in floating
point. In this paper, with the help of advanced AI models, we can push this much further. The middle range of the first zero is divided into 4453 root cases and 4788
terminal cases, each closed by its own linear program. On 4,196,879 threshold boxes these
programs give 29,397,336 linear relaxations, and exact integer certificates for all of them
bound the normalized zero sum strictly below~1. Exceptional
zeros and the remaining exterior range are treated separately. This case analysis is a kind of
systematic brute force enabled by AI: an analysis of this size, with parameters tuned to each case,
would be very laborious or nearly impossible to carry out by hand, and it lets the new estimate be
applied separately in each case.
The near-density lemma, certificate soundness, and a conditional passage from a certified
case to a prime are formalized in Lean, assuming published analytic inputs and specified
facts about zeros (PALOMAR-2026-10-01-000020 v1).
Primarily AI-generated textHuman understanding: some parts