Matching works

10 works

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 38: The energy of the Chebyshev race: an explicit unconditional floor for the prime race between the lanes 6k±16k\pm1

Contributed by Pedro Caceres

Let R(x)=π(x;3,2)−π(x;3,1)R(x)=\pi(x;3,2)-\pi(x;3,1) be the Chebyshev race between the two prime lanes 6k∓16k\mp1 (the prime 22 counted, by the congruence 2≡−12\equiv-1 mod 33, in the 6k−16k-1 lane). We study the race as an \emph{energy} and establish three things (the energy law uses two estimates imported from the ζ\zeta 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+16k+1; subtracting the ledger 12π(x)\tfrac12\pi(\sqrt x) turns a walk with \emph{zero} sign changes up to 10810^8 into one with 15,32915{,}329 (21,32921{,}329 if every passage between D>0D>0 and D≤0D\le0 at a prime is counted). Second, the mean energy of the normalized race signal e(u)=e−u/2ψ(eu,χ3)e(u)=e^{-u/2}\psi(e^u,\chi_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)L(s,\chi_3) with multiplicity, and the limit exists and attains the floor if and only if the Riemann hypothesis holds for L(s,χ3)L(s,\chi_3) with all zeros simple. The constant is known: under GRH it is the variance of the limiting distribution of Rubinstein and Sarnak for (log⁡x/x)R(x)(\log x/\sqrt x)R(x) (four times smaller than in their normalization E(x;3,2)−E(x;3,1)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χV_\chi of Part~37, on the 6k±16k\pm1 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\kappa_3 is the exact analogue, for the prime race, of the B\'aez-Duarte constant 2+γE−log⁡4π2+\gamma_E-\log4\pi of the Nyman--Beurling criterion. Third, we measure: from all prime powers up to 10810^8, by exact piecewise integration, the cumulative mean energy is 0.12010.1201 at x=108x=10^8 and lies 44 to 12%12\% above κ3\kappa_3 for 104≤x≤10810^4\le x\le10^8. 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\kappa_3 (0.1020.102 on [104,105][10^4,10^5], 0.1130.113 on [107,108][10^7,10^8]). The second-order term is (mean−κ3)⋅U≈0.11(\text{mean}-\kappa_3)\cdot U\approx0.11 (between 0.090.09 and 0.130.13), the race analogue of the second-order constant K=2.5124797…K=2.5124797\ldots of the prime energy. The proofs of the energy law transplant the C2C_2 energy law for ζ\zeta to L(s,χ3)L(s,\chi_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
Nov 12, 202612 pages
PDFView work

math.NT — Number Theory

Cross-Energy of Dirichlet Partial Sums. Part 37: The 6k±16k\pm1 race: sieve structure, Chebyshev's bias and a GRH-equivalent inequality

Contributed by Pedro Caceres

Every prime p>3p>3 is 6k+16k+1 or 6k−16k-1. We collect what can be proved about the two resulting sequences and add three results. The races are those modulo 33 (the prime 22 counts for the class 22); the race modulo 66 differs by that one prime. (i) In the weighting n−1/2log⁡(N/n)n^{-1/2}\log(N/n) of the Ces\`aro margin, the race between the prime powers ≡2\equiv2 and ≡1(mod3)\equiv1\pmod3 is an exact identity. The 6k−16k-1 side leads by 2L′L(12,χ−3)log⁡N−12ψ′(34)=1.1320log⁡N−1.27092\frac{L'}L(\frac12,\chi_{-3})\log N-\frac12\psi'(\frac34)=1.1320\log N-1.2709 plus the margin Mχ(N)M_\chi(N) of L(s,χ−3)L(s,\chi_{-3}). The generalized Riemann hypothesis (GRH) for L(s,χ−3)L(s,\chi_{-3}) is equivalent to Mχ≥0M_\chi\ge0 for all large NN, and under GRH the weighted race is never lost after N=2N=2. This is a criterion of the type of Hardy--Littlewood and Landau (1918) for Chebyshev's assertion, here with the Ces\`aro weight and with explicit constants. (ii) We verify 0.1024≤Mχ(N)≤0.35490.1024\le M_\chi(N)\le0.3549 for 2≤N≤2272\le N\le2^{27}, inside the window [0,0.4536][0,0.4536] that GRH predicts. We also check the formula against the first 271271 zeros of L(s,χ−3)L(s,\chi_{-3}). (iii) For the unweighted race, the bias is 1/Vχ=2.971/\sqrt{V_\chi}=2.97 standard deviations, with Vχ=∑ρ1ρ(1−ρ)=0.113230V_\chi=\sum_\rho\frac1{\rho(1-\rho)}=0.113230 (equal to ∑ρ∣ρ∣−2\sum_\rho|\rho|^{-2} under GRH); under GRH and linear independence, a recomputation with 271271 zeros gives the density 0.999060.99906, in agreement with the 0.99900.9990 of Rubinstein and Sarnak. Along the way we prove the sieve characterization of 6k±16k\pm1 and of twin primes, explain why Legendre-type counting cannot give the error term, compare twin primes and Goldbach representations modulo 66 with the Hardy--Littlewood predictions, and prove the formula for gcd⁡p(p2n−1)\gcd_p(p^{2n}-1) (the sequence 24,240,504,480,…24,240,504,480,\dots). Version~2 adds the generating function 12[ζ6(s)2±L(s,χ6)2]\frac12[\zeta_6(s)^2\pm L(s,\chi_6)^2] of the three forms 6xy±x±y6xy\pm x\pm y, and a duality theorem: averaged over the zeros of ζ\zeta, the cross-energy C2(N,12,γ)\mathcal C_2(N,\frac12,\gamma) of Part~1 returns log⁡N/N\log N/N; averaged over the zeros of L(s,χ−3)L(s,\chi_{-3}) it returns 1N∑d∣Nχ−3(d)Λ(d)\frac1N\sum_{d\mid N}\chi_{-3}(d)\Lambda(d); and M\"obius inversion separates the primes of the two lanes. Version~3 makes this exact at finite height and without RH: with a Gaussian weight on the zeros, the cross-energy satisfies an explicit formula whose pole term is C2\mathcal C_2 itself at s=0s=0, whose prime term is log⁡N\log N exactly plus a nonnegative remainder from the near coincidences nj≈Nnj\approx N, and which returns every prime power up to 6060 from the 15171517 zeros below 20002000. Nothing here proves RH, GRH, or the twin prime or Goldbach conjectures.

Author comments: Revised 10 Nov 2026 after external examination (see CHANGES_v2.md). 25 pages, 11 figures; version 3 (2 November 2026) adds Section 11.3, an exact explicit formula for the cross-energy at finite height (unconditional), with a term-by-term explanation of how C_2 hears the primes through the zeros; version 2 added Section 11, the cross-energy as a two-way detector. Ancillary scripts in ancillary/ reproduce the computations. Part 37 of the book-series Cross-Energy of Dirichlet Partial Sums (47 parts, Parts 0-46); formerly the standalone note 'The 6k±1 race'. Renumbered 2 Nov 2026; version 2 adds Section 11. 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 partsCesàro marginChebyshev's biasDirichlet L-function of conductor 3primes 6k±1sieve
Nov 12, 202625 pages
PDFView work

math.NT — Number Theory

Every real primitive Dirichlet L-function has de Bruijn–Newman constant at most 9/32: a kernel-checked proof in Lean 4

Contributed by Peter W. Murphy, MD

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.

Primarily AI-generated textHuman understanding: some partsDirichlet L-functionsGauss sumsLean 4Mathlibde Bruijn-Newman constantformal verification
Nov 02, 202625 pages
PDFView work

math.NT — Number Theory

Exceptional zeros of Hecke LL-functions

Contributed by Christopher Frei, Wataru Kai

We prove that Hecke LL-functions have no exceptional zeros. We do so by generalising a variant due to Kerr of the proof by OpenAI in the case of Dirichlet LL-functions. v2: Added a reference to independent concurrent work by Banks.

Primarily human-written textHuman understanding: all partsHecke L-functionsLandau--Siegel zerosexceptional zeros
Oct 22, 20269 pages
PDFView work

math.NT — Number Theory

An explicit elementary proof of no Landau--Siegel zeros

Contributed by Victor Z. Guo

We give an elementary proof of the absence of Landau--Siegel zeros with the explicit constant c=1/100c=1/100. For every primitive quadratic Dirichlet character χ\chi of conductor q≥3q\ge3, each real zero β∈(0,1)\beta\in(0,1) of L(s,χ)L(s,\chi) satisfies (1−β)log⁡q>c(1-\beta)\log q>c. The proof combines integer coefficient counting, polynomial congruences, a paired-tail hyperbola estimate, and a logarithmically weighted comparison of positive sums. All required constants are explicit, and one choice of parameters covers every conductor. The argument uses elementary arithmetic and real summation and integration, without separate zero computations for small conductors.

A mix of human-written and AI-generated textHuman understanding: all partsFrobenius congruencesLandau--Siegel zeroselementary methodsexplicit estimatesquadratic characters
Oct 22, 202617 pages
PDFView work

math.NT — Number Theory

Small algebraic integers and Frobenius prime sums

Contributed by Scott Kominers

The determinant argument in recent proofs of Landau–Siegel zero exclusion compares the size of a nonzero integer with its divisibility by inert primes. We observe that the same comparison applies to every Frobenius class in a finite Galois extension of Q\mathbb{Q}, bounding its weighted prime count in terms of the supply of small algebraic integers. For each fixed field, the resulting height bound implies a weighted Chebotarev theorem whose only analytic inputs are the elementary Chebyshev and Mertens estimates. In the quadratic case there are only two Frobenius classes, so the lower bound obtained by complementation remains uniform in the conductor; this recovers Landau–Siegel zero exclusion.

A mix of human-written and AI-generated textHuman understanding: all partsChebotarev density theoremFrobenius congruenceGalois extensionGeometry of numbersLandau–Siegel zeroWronskianinterpolation determinant
Oct 22, 20268 pages
PDFView work

math.NT — Number Theory

A Frobenius determinant proof of the non-existence of Landau–Siegel zeros

Contributed by Roelof van Dijk

We give a variant of the OpenAI proof [1] of the non-existence of Landau–Siegel zeros, following the simplifications of Kerr [2], Green [3] and Barreto [4]. The Frobenius congruence proves both divisibility and nonvanishing of the determinant. Reduction modulo the largest inert prime below the cutoff reduces nonvanishing to a polynomial root count, replacing resultants and Wronskians. The argument was discovered in discussions with GPT-6 Astra and Opus 5.5 and the new arguments should be attributed to these models.

A mix of human-written and AI-generated textHuman understanding: no parts
Oct 20, 20266 pages
PDFView work

math.NT — Number Theory

On Landau--Siegel zeros

Contributed by Ben Green

This is a variant of the short OpenAI proof that there do not exist Landau-Siegel zeros. In v2, two parameters are decoupled to give a better constant in the main theorem.

Primarily human-written textHuman understanding: all parts
Oct 17, 20265 pages
PDFView work

math.NT — Number Theory

The Pólya–Vinogradov inequality with log log q for every character

Contributed by Deep Bhattacharjee, Ushashi Bhattacharya

Let χ\chi be a primitive Dirichlet character modulo q≥3q\ge3 and let M(χ)M(\chi) be the largest modulus of a partial sum ∑n≤xχ(n)\sum_{n\le x}\chi(n). The P\'olya--Vinogradov inequality bounds M(χ)M(\chi) by a constant times qlog⁡q\sqrt q\log q. Paley showed that qlog⁡log⁡q\sqrt q\log\log q is the most that can be hoped for, and Montgomery and Vaughan proved that this is the truth if the generalised Riemann hypothesis holds. Without any hypothesis we prove that M(χ)≤Cqlog⁡log⁡qM(\chi)\le C\sqrt q\log\log q for every primitive character χ\chi to every modulus q≥3q\ge3, with an absolute constant CC, and that ∣L′/L(1,χ)∣≤Clog⁡log⁡q|L'/L(1,\chi)|\le C\log\log q for every nonprincipal character. We also prove, from the elementary bounds of Chebyshev alone, that for every ε>0\varepsilon>0 there is a constant CεC_\varepsilon such that at most qεq^{\varepsilon} of the primitive characters modulo qq have M(χ)>Cεqlog⁡log⁡qM(\chi)>C_\varepsilon\sqrt q\log\log q, and at most qεq^{\varepsilon} of the nonprincipal characters have ∣L′/L(1,χ)∣>Cεlog⁡log⁡q|L'/L(1,\chi)|>C_\varepsilon\log\log q. The proof has two parts. The first is a transfer theorem for a single character: if θ<1\theta<1 is fixed and the LL-functions of the twists χψ\chi\psi of χ\chi by the characters ψ\psi of the moduli up to (log⁡q)16(\log q)^{16} have no zero in the rectangle ℜs>θ\Re s>\theta, ∣ℑs∣≤5q2|\Im s|\le5q^2, then M(χ)≤Cθqlog⁡log⁡qM(\chi)\le C_\theta\sqrt q\log\log q. It is proved by a contour shift for Riesz means of prime sums, a dissection of the circle into major and minor arcs, and a weak form of the Montgomery--Vaughan bound for exponential sums with multiplicative coefficients, which we prove with Selberg's sieve as the only arithmetic input. The second part counts the characters that fail the hypothesis of the transfer theorem by a zero-density theorem in the manner of Ingham and Montgomery, which bounds the number of zeros of all LL-functions to a modulus in such a rectangle by a power of the modulus that tends to zero as θ\theta tends to one. The same transfer theorem shows that a zero-free half-plane ℜs>θ\Re s>\theta for all Dirichlet LL-functions gives the bound for every character, and such a half-plane exists: OpenAI has proved that every Dirichlet LL-function, and every finite-order Hecke LL-function over Q(−3)\mathbb Q(\sqrt{-3}), has no zero with ℜs>11/12\Re s>11/12, by a mean square of twisted M\"obius sums over the Eisenstein integers, two Poisson summations, the transformation of Kubota's cubic theta function and the quadratic large sieve. Their proof is reproduced in full in a second appendix, with credit to them, so that the paper is complete in itself: the zero-density theorem is proved in the first appendix with explicit constants, and every statement of the paper is proved in the text.

A mix of human-written and AI-generated textHuman understanding: some partsEuler--Kronecker constantsP\'olya--Vinogradov inequalitySelberg sievecharacter sumszero-free regions
Oct 16, 202651 pages
PDFView work

math.NT — Number Theory

Linnik's constant is at most 3.993.99

Contributed by Eric Naslund

Let P(a,q)P(a,q) denote the least prime congruent to aa modulo qq, where (a,q)=1(a,q)=1. We give a computer-assisted proof that P(a,q)≪q3.99P(a,q)\ll q^{3.99}, improving the exponent 55 of Xylouris. More precisely, P(a,q)<q3.99P(a,q)<q^{3.99} for every sufficiently large qq, uniformly in aa. The main new ingredient is a graded near-density estimate for zeros of Dirichlet LL-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 1414 and 2121 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 44534453 root cases and 47884788 terminal cases, each closed by its own linear program. On 4,196,8794{,}196{,}879 threshold boxes these programs give 29,397,33629{,}397{,}336 linear relaxations, and exact integer certificates for all of them bound the normalized zero sum strictly below~11. 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
Oct 02, 202680 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations