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
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
Every prime p>3 is 6k+1 or 6k−1. We collect what can be proved about the two resulting sequences and add three results. The races are those modulo 3 (the prime 2 counts for the class 2); the race modulo 6 differs by that one prime. (i) In the weighting n−1/2log(N/n) of the Ces\`aro margin, the race between the prime powers ≡2 and ≡1(mod3) is an exact identity. The 6k−1 side leads by 2LL′(21,χ−3)logN−21ψ′(43)=1.1320logN−1.2709 plus the margin Mχ(N) of L(s,χ−3). The generalized Riemann hypothesis (GRH) for L(s,χ−3) is equivalent to Mχ≥0 for all large N, and under GRH the weighted race is never lost after N=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.3549 for 2≤N≤227, inside the window [0,0.4536] that GRH predicts. We also check the formula against the first 271 zeros of L(s,χ−3). (iii) For the unweighted race, the bias is 1/Vχ=2.97 standard deviations, with Vχ=∑ρρ(1−ρ)1=0.113230 (equal to ∑ρ∣ρ∣−2 under GRH); under GRH and linear independence, a recomputation with 271 zeros gives the density 0.99906, in agreement with the 0.9990 of Rubinstein and Sarnak. Along the way we prove the sieve characterization of 6k±1 and of twin primes, explain why Legendre-type counting cannot give the error term, compare twin primes and Goldbach representations modulo 6 with the Hardy--Littlewood predictions, and prove the formula for gcdp(p2n−1) (the sequence 24,240,504,480,…). Version~2 adds the generating function 21[ζ6(s)2±L(s,χ6)2] of the three forms 6xy±x±y, and a duality theorem: averaged over the zeros of ζ, the cross-energy C2(N,21,γ) of Part~1 returns logN/N; averaged over the zeros of L(s,χ−3) it returns N1∑d∣Nχ−3(d)Λ(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 itself at s=0, whose prime term is logN exactly plus a nonnegative remainder from the near coincidences nj≈N, and which returns every prime power up to 60 from the 1517 zeros below 2000. 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
Theorem 1.2 of Halupczok (2013) is a Bombieri-Vinogradov type mean value theorem for the ternary Goldbach problem with one prime in an arithmetic progression and two primes in short intervals. Her proof works with residue classes amodq coprime to the modulus, as stated on p. 344 of her paper, and this convention needs to be written explicitly into the statement because the printed product and the prime sum differ at a=q=3, where the prime sum is 0 for X1>3 while the printed product is at least 9/16 for odd n. We give two closely related explicit formulations, Formulation A and Formulation B, show that Formulation A implies Formulation B, and prove both assuming two cited inputs, Hypothesis H1 and Hypothesis H2, or alternatively Theorems 2.1 and 2.3 of her paper, which follow from these two inputs. Here Hypothesis H1 is a uniform reading of a printed remark of Perelli, Pintz and Salerno, supported by a reading of the proof, and Hypothesis H2 is assembled from displays of Perelli and Pintz and is not a numbered statement. The supplement of Theorem 1.2 with a maximum over a is not covered. The later results of Halupczok's paper use only coprime residue classes and are unaffected. The main results of this note have been checked by computer.
Primarily AI-generated textHuman understanding: some parts
We further develop the theory of congruence speed for integer tetration in non-squarefree numeral systems, building on Appendix B of [M. Ripà and G. Di Pietro (2026), A compact notation for peculiar properties characterizing integer tetration, Notes on Number Theory and Discrete Mathematics, 32(3), 477–496]. For bases coprime to the radix, we establish an eventual floor-difference representation and determine the exact spectrum of attainable least periods. We construct explicit arithmetic progressions containing infinitely many prime bases with nonconstant congruence speed for every non-squarefree radix, thereby proving the coprime-infinitude conjecture posed in Appendix B. We also derive a uniform quadratic bound for the least coprime base with nonconstant congruence speed and establish exact natural densities of nonstabilizing bases, both among integers coprime to the radix and among those not divisible by its radical, together with the corresponding relative density among primes. Finally, we give necessary and sufficient conditions for the perfect-power congruence-speed identity (Equation (2.12) of the cited paper) to hold in arbitrary radices, determine the exact least eventual period when stabilization fails, and establish a separate criterion for the boundary case of the original parameter restriction.
A mix of human-written and AI-generated textHuman understanding: all partscongruence speedeventual periodicityinteger tetrationlifting-the-exponent lemmanatural densitynon-squarefree radicesp-adic valuationsprimes in arithmetic progressions
In Stadlmann's Type I/II equidistribution estimate for x^delta-smooth moduli, one of the three conditions, 64 varpi + 20 delta + 2 sigma < 1, can be replaced by 48 varpi + 18 delta + 2 sigma < 1. This weaker condition follows from the second one, 48 varpi + 16 delta + 4 sigma < 1, whenever delta <= sigma. The proof follows Stadlmann's argument and makes two changes: the length of a block in one Taylor expansion depends on the pair of shifts, and the bounds are summed over the pairs instead of being multiplied by their number. Combined with Stadlmann's general Harman-sieve construction, this gives a minorant for the primes with exponent of distribution 1/2 + 2 varpi to smooth moduli for every varpi < 7/544, instead of varpi = 0.01265. As a consequence, liminf (p_{n+m} - p_n) << e^{cm} for every c > 3.80428, and for every c > 3.80423 if a numerically computed value of the sieve deficit is used. This improves Stadlmann's exponent 3.8075.
Primarily AI-generated textHuman understanding: no partsHarman's sieveType I/II estimatesbounded gaps between primesexponent of distributionprimes in arithmetic progressionssmooth moduli
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
Building on earlier human research into the constant congruence speed of integer tetration, including Appendix B of Ripà and Di Pietro (2026), and on a lifting-the-exponent (LTE) criterion publicly presented by Alper Ferudun for OEIS A390535 and A390576, this model-generated note proposes an explicit account of nonconstant speeds in non-squarefree numeral systems. Its principal results are an eventual floor-difference representation, an exact spectrum of attainable least periods, and explicit arithmetic progressions containing infinitely many prime bases whose congruence speed never becomes constant for each non-squarefree radix. The latter supplies a proposed proof of the coprime-infinitude assertion left conjectural in Appendix B of the earlier human-authored article. We also derive bounds for the least such base and exact natural densities, both among coprime bases and among all bases not divisible by the radical of the radix, together with relative prime densities. The mathematical derivations and manuscript are primarily GPT-6-generated. Ripà supplied the theoretical setting, earlier results and specialist guidance, and subsequently examined selected deductions and historical test cases. The manuscript has not received comprehensive independent human proof verification.
Primarily AI-generated textHuman understanding: some partscongruence speedeventual periodicityinteger tetrationlifting-the-exponent lemmanatural densitynon-squarefree radicesp-adic valuationsprimes in arithmetic progressions
We show how Selberg's symmetry formulas and the recent finding that there are no Landau--Siegel zeros connect to give a radically elementary proof of Linnik's theorem on the least prime in an arithmetic progression.
A mix of human-written and AI-generated textHuman understanding: all partsLandau--Siegel zerosLinnik's theoremSelberg's symmetry formulasieve methods
We study the arithmetic of Jacobi polynomials. As applications, we prove the Mahlburg--Ono conjecture on the irreducibility and Galois
groups of the four Kaneko--Zagier families, and the Cullinan--Hajir conjecture on the Galois groups of Legendre polynomials. Other applications concern common zeros of Jacobi polynomials, harmonic functions on cones, and hyperelliptic Jacobians.
A mix of human-written and AI-generated textHuman understanding: some partsJacobi polynomialKaneko--Zagier polynomialLegendre polynomial
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, 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
Let Hm=liminfn→∞(pn+m−pn). We develop a pair-penalty refinement of a multidimensional Selberg sieve, together with explicit admissible tuples and interval-arithmetic evaluations. A mixed prime–divisor asymptotic is derived from distribution on triply densely divisible moduli. Combining it with the numerical certificates gives H2≤19,844, H3≤1,357,780, H4≤82,234,788, and H5≤4,830,355,416. The proof combines truncated marginal estimates, support-loss bounds for signed trial functions, a trace-preserving auxiliary sieve for prime pairs, and exact modular certificates. Exact finite data, interval enclosures, and reproducibility code accompany the manuscript.
Author comments: Updated manuscript dated 6 November 2026, with a pair-penalty refinement and improved bounds for H_2 through H_5.
Primarily AI-generated textHuman understanding: some parts
Contributed by Deep Bhattacharjee, Ushashi Bhattacharya
Let χ be a primitive Dirichlet character modulo q≥3 and let M(χ) be the largest modulus of a partial sum ∑n≤xχ(n). The P\'olya--Vinogradov inequality bounds M(χ) by a constant times qlogq. Paley showed that qloglogq 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(χ)≤Cqloglogq for every primitive character χ to every modulus q≥3, with an absolute constant C, and that ∣L′/L(1,χ)∣≤Cloglogq for every nonprincipal character. We also prove, from the elementary bounds of Chebyshev alone, that for every ε>0 there is a constant Cε such that at most qε of the primitive characters modulo q have M(χ)>Cεqloglogq, and at most qε of the nonprincipal characters have ∣L′/L(1,χ)∣>Cεloglogq. The proof has two parts. The first is a transfer theorem for a single character: if θ<1 is fixed and the L-functions of the twists χψ of χ by the characters ψ of the moduli up to (logq)16 have no zero in the rectangle ℜs>θ, ∣ℑs∣≤5q2, then M(χ)≤Cθqloglogq. 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 L-functions to a modulus in such a rectangle by a power of the modulus that tends to zero as θ tends to one. The same transfer theorem shows that a zero-free half-plane ℜs>θ for all Dirichlet L-functions gives the bound for every character, and such a half-plane exists: OpenAI has proved that every Dirichlet L-function, and every finite-order Hecke L-function over Q(−3), has no zero with ℜ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
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