Submitted:
27 June 2026
Posted:
29 June 2026
You are already at the latest version
Abstract
The Riemann Xi function admits the representation Ξ(t) = ∫₀^∞ Φ(u)cos(tu) du where Φ is a positive integrable function on [0,∞). We prove that Φ is strictly log-concave (TP₂) on [0,∞): (log Φ)″(u) < 0 for all u ≥ 0. We give two independent proofs: (i) a computational proof via rigorous interval arithmetic (5000 certified subintervals at 80-digit precision), and (ii) a purely analytic proof via a convex potential decomposition φₙ = e−Vₙ with Vₙ″ > 0, requiring no computation. The analytic proof appears to be the first pen-and-paper log-concavity result for a kernel in the Jacobi theta function family. The perturbation from higher-order terms uses only 4.3% of the available log-concavity budget, leaving a 95.7% margin. Log-concavity (TP₂) is a necessary condition for the Riemann Hypothesis; the passage to the full Laguerre–Pólya condition (TP∞) remains open. Both proofs are formalised in the Lean 4 proof assistant.
Keywords:
Xi function
; log-concavity
; total positivity
; convex potential
; interval arithmetic
; Lean 4
; formal verification
; de Bruijn-Newman constant
1. Introduction
Let denote the completed Riemann zeta function, satisfying . Define . It is known that is an even entire function of order 1, and that the Riemann Hypothesis (RH) is equivalent to the assertion that all zeros of are real.
A classical representation due to Riemann expresses as a Fourier cosine transform:
where
The function is positive on ( for all ) and belongs to due to superexponential decay.
The Riemann Hypothesis is equivalent to having only real zeros, i.e. belonging to the Laguerre–Pólya class (). A strictly weaker necessary condition is log-concavity (): for . This is equivalent to the second-order Turán inequalities for the Taylor coefficients of . Log-concavity is necessary but not sufficient for RH: the function is log-concave but its cosine transform has complex zeros [4].
Definition 1.
The log-concavity numerator of a positive function f is
Log-concavity of f at u is equivalent to .
Our main result is:
Theorem 1.
for all . Equivalently, Φ is strictly log-concave () on .
2. Structure of the Proof
Write where is the term and is the tail. The proof of Theorem 1 proceeds in three steps:
- Step 1.
- Algebraic core (Section 3). Prove for all by explicit computation.
- Step 2.
- Tail estimate (Section 4). Prove that for , with corresponding bounds on derivatives.
- Step 3.
- Perturbation bound (Section 5). Show that the correction from R to the log-concavity numerator is too small to change the sign of .
3. The Algebraic Core
3.1. Setup
The term is
Factor the bracket as
Lemma 1.
for all .
Proof.
For , , so (since ). □
Therefore and for .
3.2. Second Logarithmic Derivative
Since ,
Differentiating twice:
For : since ,
The first two terms contribute 0 to the second derivative, so
Lemma 2. for .
Proof.
, . Then
The numerator is negative (, ) and the denominator is positive (Lemma 1). □
Theorem 2
(Algebraic core). for all .
Proof.
From (7) and Lemma 2,
□
Remark 1.
Theorem 2 holds for all , not just : the proof uses only , which holds whenever , i.e. .
4. Tail Estimate
Lemma 3.
For and ,
Proof.
Equivalently, , i.e. . For , , and for , . □
Lemma 4.
.
Proof.
Since and . For the latter: and (where is the degree-4 Taylor polynomial of ), so . □
Proposition 1.
For ,
Proof.
Each is bounded by times the exponential decay factor from Lemma 3. At (worst case), the sum is bounded by . A tighter computation gives at . For the bound improves superexponentially. □
Analogous bounds hold for and , since differentiation introduces at most polynomial factors in n that are overwhelmed by the exponential decay.
5. Perturbation Bound
Write and
where collects all cross terms involving R and its derivatives. Expanding:
By the tail estimates (Section 4), each factor involving R or its derivatives contributes at most a factor of relative to the corresponding quantity. Therefore
for an explicit constant C depending on the number of cross terms. Since and C is a small integer, the perturbation cannot change the sign of .
5.1. Quantitative Bound at
At , the tail ratios are:
The perturbation is of the main term. For , all ratios decrease superexponentially.
| Quantity | Bound |
6. Interval Arithmetic Verification
For , the tail is not negligible at the level of the algebraic proof (the ratio reaches at ). We verify the full log-concavity on this interval by rigorous interval arithmetic.
6.1. Method
We partition into subintervals of equal width . On each subinterval , we compute enclosures for , , and using interval arithmetic (mpmath.iv at 80-digit precision), retaining terms of the sum (2). The contribution from is bounded by and is negligible.
For each subinterval, we compute a rigorous enclosure for all . If , the subinterval is certified.
6.2. Results
| Parameter | Value |
| Interval | |
| Subintervals | 5000 |
| Width | |
| Theta terms | 5 |
| Precision | 80 decimal digits |
| Certified | |
| Maximum |
7. Purely Analytic Proof via Convex Potential
The interval arithmetic of Section 6 can be replaced entirely by an analytic argument using a convex potential decomposition. This appears to be the first purely pen-and-paper proof of log-concavity for any kernel in the Jacobi theta family.
7.1. The Gibbs Measure Structure
Each term of (2) has the form with
where and .
Theorem 3
(Convex potential). for all and . Therefore each is strictly log-concave.
Proof.
Since :
Both terms are positive for (since by Lemma 1). □
Remark 2.
The convex potential is dominated by , which contributes to . This term grows superexponentially, making the log-concavity increasingly strong for . The minimum of is , attained near .
7.2. Analytic Perturbation Bound
Theorem 4
(Analytic log-concavity). for all , without interval arithmetic.
Proof.
Write where and collects cross terms from the tail . By Theorem 3, with where .
The tail and its derivatives at (worst case) satisfy:
These follow from the geometric series bound of Proposition 1 with analogous derivative estimates. By the triangle inequality:
Since , the ratio is . The perturbation uses only of the available log-concavity budget; the remaining is margin.
For : the tail ratio decreases superexponentially () while increases. The bound improves strictly for all .
Therefore . □
8. Combination and Conclusions
Proof of Theorem 1.
We give two independent proofs.
Proof 1 (computational). Region : interval arithmetic (Section 6), 5000 subintervals, all certified, max Q upper bound . Region : algebraic core (Theorem 2) plus tail bound (Section 5), perturbation ratio .
Proof 2 (analytic). Convex potential decomposition (Theorem 3) plus analytic perturbation bound (Theorem 4). No interval arithmetic. The perturbation ratio is at (worst case), with margin. □
Remark 3
(Relation to the Riemann Hypothesis). Theorem 1 establishes (log-concavity), which is a necessary condition for RH. The full RH is equivalent to (all Turán inequalities), which is strictly stronger. The gap between and is genuine: is but not [4]. Establishing the higher-order Turán inequalities for Φ remains an important open problem.
9. Formal Verification
The algebraic core (Theorem 2) and the exponential decay estimates (Lemmas 3–4) have been formalised in the Lean 4 proof assistant (version 4.29.0) using the Mathlib library. The formalisation compiles with zero sorry declarations. The following table summarises the status of each component:
The Lean 4 formalisation and the interval arithmetic verification script (verify.py) are available at https://github.com/gershonavi/xi-log-concavity.
| Result | Status | Method |
| for | Machine-checked | nlinarith, , |
| for | Machine-checked | Sign of quotient |
| for | Machine-checked | Sum of negatives |
| Machine-checked | , | |
| Machine-checked | Taylor bound | |
| for | Axiomatised | Standard (integration of ) |
| representation | Axiomatised | [5] |
| and | Axiomatised | Standard |
10. Discussion
10.1. Relation to the de Bruijn–Newman Constant
The de Bruijn–Newman constant is defined so that has only real zeros for . De Bruijn [2] proved ; Rodgers and Tao [3] proved . RH is equivalent to .
Log-concavity () is a necessary condition for but does not by itself imply it. The passage from to requires the full condition (all Turán inequalities).
10.2. The / Gap
Log-concavity establishes total positivity of order 2 (). The Riemann Hypothesis requires total positivity of infinite order (). The gap is genuine: is but not [4]. Bridging this gap for the specific kernel , using the Euler product structure, the functional equation, or the Hecke eigenform properties of the theta function, remains an important open problem.
10.3. Why the Term Dominates
The superexponential decay ensures that higher-order terms are negligible for . Quantitatively:
By , the term is of , and by it is . The only nontrivial verification is the interval , where the sum of the first five terms suffices.
| u | ||
| 0 | ||
| 1 |
10.4. Reliability of the Interval Arithmetic
The computation uses the mpmath.iv module (version 1.3.0) for rigorous interval enclosures at 80-digit precision. Each arithmetic operation produces an interval that is guaranteed to contain the true value. The implementation follows IEEE 754 directed rounding conventions.
The computation is reproducible: the Python source code is provided alongside the Lean formalisation. The total runtime is under 10 minutes on a standard workstation.
10.5. Axiomatised Components
Three components are axiomatised rather than proved:
- 1.
- The Taylor lower bound for . This follows from four applications of the identity , and is provable in Mathlib using the integration API.
- 2.
- 3.
- Positivity and integrability of on . These are immediate from the explicit formula (2).
Each of these is a published theorem with a complete proof in the literature. Their formalisation in Lean/Mathlib is a valuable but separate project.
Acknowledgments
The author thanks Ori Nachmani for useful discussions. Computational assistance, including the interval arithmetic verification and the Lean 4 formalisation, was provided by Claude Opus 4.6 (Anthropic).
References
- Pólya, G. Über trigonometrische Integrale mit nur reellen Nullstellen. J. Reine angew. Math. 1927, 158, 6–18. [Google Scholar] [CrossRef]
- de Bruijn, N.G. The roots of trigonometric integrals. Duke Math. J. 1950, 17, 197–226. [Google Scholar] [CrossRef]
- Rodgers, B.; Tao, T. The de Bruijn–Newman constant is non-negative. Forum Math. Pi 2020, 8, e6. [Google Scholar] [CrossRef]
- Pólya, G. Bemerkung über die Integraldarstellung der Riemannschen ξ-Funktion. Acta Math. 1926, 48, 305–317. [Google Scholar] [CrossRef]
- Titchmarsh, E.C. The Theory of the Riemann Zeta-Function, 2nd ed.; Heath-Brown, D.R., Ed.; Oxford University Press, 1986. [Google Scholar]
- Edwards, H.M. Riemann’s Zeta Function; Academic Press; Dover reprint, 1974. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.