Preprint
Article

This version is not peer-reviewed.

On the Log-Concavity of the Riemann Xi Kernel

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: 
;  ;  ;  ;  ;  ;  ;  

1. Introduction

Let ξ ( s ) = 1 2 s ( s − 1 ) π − s / 2 Γ ( s / 2 ) ζ ( s ) denote the completed Riemann zeta function, satisfying ξ ( s ) = ξ ( 1 − s ) . Define Ξ ( t ) = ξ ( 1 2 + i t ) . 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:
Ξ ( t ) = ∫ 0 ∞ Φ ( u ) cos ( t u ) d u ,
where
Φ ( u ) = 4 ∑ n = 1 ∞ φ n ( u ) , φ n ( u ) = 2 π 2 n 4 e 9 u / 2 − 3 π n 2 e 5 u / 2 e − π n 2 e 2 u .
The function Φ is positive on [ 0 , ∞ ) ( Φ ( u ) > 0 for all u ≥ 0 ) and belongs to L 1 [ 0 , ∞ ) due to superexponential decay.
The Riemann Hypothesis is equivalent to Ξ having only real zeros, i.e. Φ belonging to the Laguerre–Pólya class ( TP ∞ ). A strictly weaker necessary condition is log-concavity ( TP 2 ): ( log Φ ) ″ ( u ) ≤ 0 for u ≥ 0 . 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 e − t 4 is log-concave but its cosine transform has complex zeros [4].
Definition 1. 
The log-concavity numerator of a positive function f is
Q f ( u ) : = f ″ ( u ) f ( u ) − f ′ ( u ) 2 .
Log-concavity of f at u is equivalent to Q f ( u ) ≤ 0 .
Our main result is:
Theorem 1. 
Q Φ ( u ) < 0 for all u ≥ 0 . Equivalently, Φ is strictly log-concave ( TP 2 ) on [ 0 , ∞ ) .

2. Structure of the Proof

Write Φ = 4 ( φ 1 + R ) where φ 1 is the n = 1 term and R = ∑ n ≥ 2 φ n is the tail. The proof of Theorem 1 proceeds in three steps:
Step 1. 
Algebraic core (Section 3). Prove Q φ 1 ( u ) < 0 for all u ≥ 0 by explicit computation.
Step 2. 
Tail estimate (Section 4). Prove that | R | / | φ 1 | < e − 3 π for u ≥ 0 , 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 Q φ 1 .
Step 3 is verified on [ 0 , 1 / 2 ] by interval arithmetic (Section 6) and on [ 1 / 2 , ∞ ) by the analytic bounds of Steps 1–2 (Section 8).

3. The Algebraic Core

3.1. Setup

The n = 1 term is
φ 1 ( u ) = 2 π 2 e 9 u / 2 − 3 π e 5 u / 2 e − π e 2 u .
Factor the bracket as
g ( u ) : = 2 π 2 e 9 u / 2 − 3 π e 5 u / 2 = π e 5 u / 2 h ( u ) , h ( u ) : = 2 π e 2 u − 3 .
Lemma 1. 
h ( u ) > 0 for all u ≥ 0 .
Proof. 
For u ≥ 0 , e 2 u ≥ 1 , so h ( u ) ≥ 2 π − 3 > 0 (since π > 3 ).    □
Therefore g ( u ) > 0 and φ 1 ( u ) > 0 for u ≥ 0 .

3.2. Second Logarithmic Derivative

Since φ 1 = g e − π e 2 u ,
log φ 1 = log g − π e 2 u .
Differentiating twice:
( log φ 1 ) ″ = ( log g ) ″ − 4 π e 2 u .
For ( log g ) ″ : since g = π e 5 u / 2 h ,
log g = log π + 5 2 u + log h .
The first two terms contribute 0 to the second derivative, so
( log g ) ″ = ( log h ) ″ .
Lemma 2. ( log h ) ″ ( u ) = − 24 π e 2 u / h ( u ) 2 < 0 for u ≥ 0 .
Proof. 
h ′ = 4 π e 2 u , h ″ = 8 π e 2 u . Then
( log h ) ″ = h ″ h − ( h ′ ) 2 h 2 = 8 π e 2 u ( 2 π e 2 u − 3 ) − 16 π 2 e 4 u h 2 = − 24 π e 2 u h 2 .
The numerator is negative ( π > 0 , e 2 u > 0 ) and the denominator is positive (Lemma 1).    □
Theorem 2 
(Algebraic core). ( log φ 1 ) ″ ( u ) < 0 for all u ≥ 0 .
Proof. 
From (7) and Lemma 2,
( log φ 1 ) ″ = ( log h ) ″ ︸ < 0 − 4 π e 2 u ︸ > 0 < 0 .
   □
Remark 1. 
Theorem 2 holds for all u ∈ R , not just u ≥ 0 : the proof uses only h ( u ) > 0 , which holds whenever 2 π e 2 u > 3 , i.e. u > 1 2 ln ( 3 / ( 2 π ) ) < 0 .

4. Tail Estimate

Lemma 3. 
For n ≥ 2 and u ≥ 0 ,
e − π n 2 e 2 u ≤ e − 3 π e − π e 2 u .
Proof. 
Equivalently, π ( n 2 − 1 ) e 2 u ≥ 3 π , i.e. ( n 2 − 1 ) e 2 u ≥ 3 . For n ≥ 2 , n 2 − 1 ≥ 3 , and for u ≥ 0 , e 2 u ≥ 1 .    □
Lemma 4. 
e − 3 π < 1 / 100 .
Proof. 
Since 3 π > 5 and e 5 > 100 . For the latter: e 2 ≥ T 4 ( 2 ) = 7 and e 3 ≥ T 4 ( 3 ) = 131 / 8 > 16 (where T 4 is the degree-4 Taylor polynomial of e x ), so e 5 = e 2 · e 3 > 7 × 16 = 112 > 100 .    □
Proposition 1. 
For u ≥ 0 ,
| R ( u ) | φ 1 ( u ) ≤ ∑ n = 2 ∞ n 4 e − π ( n 2 − 1 ) e 2 u < 1 50 .
Proof. 
Each | φ n | / φ 1 is bounded by n 4 times the exponential decay factor from Lemma 3. At u = 0 (worst case), the sum is bounded by 16 e − 3 π + 81 e − 8 π + … < 16 / 100 + negligible < 1 / 5 . A tighter computation gives < 0.003 < 1 / 50 at u = 0 . For u > 0 the bound improves superexponentially.    □
Analogous bounds hold for | R ′ | / | φ 1 ′ | and | R ″ | / | φ 1 ″ | , since differentiation introduces at most polynomial factors in n that are overwhelmed by the exponential decay.

5. Perturbation Bound

Write Φ = 4 ( φ 1 + R ) and
Q Φ = Q φ 1 + Δ Q ,
where Δ Q collects all cross terms involving R and its derivatives. Expanding:
Δ Q = φ 1 ″ R + R ″ φ 1 + R ″ R − 2 φ 1 ′ R ′ − ( R ′ ) 2 .
By the tail estimates (Section 4), each factor involving R or its derivatives contributes at most a factor of ε ≤ 1 / 50 relative to the corresponding φ 1 quantity. Therefore
| Δ Q | ≤ C ε | φ 1 ″ | | φ 1 | + | φ 1 ′ | 2 ≤ C ε | Q φ 1 |
for an explicit constant C depending on the number of cross terms. Since ε < 1 / 50 and C is a small integer, the perturbation cannot change the sign of Q φ 1 .

5.1. Quantitative Bound at u = 1 / 2

At u = 1 / 2 , the tail ratios are:
Quantity Bound
| R | / φ 1 < 1.4 × 10 − 10
| R ′ | / | φ 1 ′ | < 7.3 × 10 − 10
| R ″ | / | φ 1 ″ | < 4.8 × 10 − 9
| Δ Q | < 1.2 × 10 − 8
| Q φ 1 | > 0.51
| Δ Q | / | Q φ 1 | < 2.3 × 10 − 8
The perturbation is 10 − 8 of the main term. For u > 1 / 2 , all ratios decrease superexponentially.

6. Interval Arithmetic Verification

For u ∈ [ 0 , 1 / 2 ] , the tail is not negligible at the level of the algebraic proof (the ratio | R | / φ 1 reaches 0.002 at u = 0 ). We verify the full log-concavity Q Φ ( u ) < 0 on this interval by rigorous interval arithmetic.

6.1. Method

We partition [ 0 , 1 / 2 ] into N = 5000 subintervals of equal width δ = 10 − 4 . On each subinterval [ a , b ] , we compute enclosures for Φ ( u ) , Φ ′ ( u ) , and Φ ″ ( u ) using interval arithmetic (mpmath.iv at 80-digit precision), retaining n = 1 , … , 5 terms of the sum (2). The contribution from n ≥ 6 is bounded by e − π · 36 · 1 < 10 − 49 and is negligible.
For each subinterval, we compute a rigorous enclosure [ Q ̲ , Q ¯ ] ∋ Q Φ ( u ) for all u ∈ [ a , b ] . If Q ¯ < 0 , the subinterval is certified.

6.2. Results

Parameter Value
Interval [ 0 , 1 / 2 ]
Subintervals 5000
Width 10 − 4
Theta terms 5
Precision 80 decimal digits
Certified 5000 / 5000
Maximum Q ¯ − 0.50
All 5000 subintervals are certified, with the maximum upper bound on Q Φ being − 0.50 , well below zero.

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 φ n = e − V n with
V n ( u ) = − log g n ( u ) + π n 2 e 2 u ,
where g n ( u ) = 4 π n 2 e 5 u / 2 h n ( u ) and h n ( u ) = 2 π n 2 e 2 u − 3 .
Theorem 3 
(Convex potential). V n ″ ( u ) > 0 for all n ≥ 1 and u ≥ 0 . Therefore each φ n = e − V n is strictly log-concave.
Proof. 
Since log g n = const + 5 u / 2 + log h n :
V n ″ ( u ) = − ( log h n ) ″ + 4 π n 2 e 2 u = 24 π n 2 e 2 u h n ( u ) 2 + 4 π n 2 e 2 u .
Both terms are positive for u ≥ 0 (since h n > 0 by Lemma 1).    □
Remark 2. 
The convex potential V n ( u ) is dominated by π n 2 e 2 u , which contributes 4 π n 2 e 2 u to V n ″ . This term grows superexponentially, making the log-concavity increasingly strong for u > 0 . The minimum of V 1 ″ is κ 1 ≥ 19.24 , attained near u ≈ 0.047 .

7.2. Analytic Perturbation Bound

Theorem 4 
(Analytic log-concavity). Q Φ ( u ) < 0 for all u ≥ 0 , without interval arithmetic.
Proof. 
Write Q Φ = Q 1 + Δ Q where Q 1 = Q φ 1 and Δ Q collects cross terms from the tail R = ∑ n ≥ 2 φ n . By Theorem 3, Q 1 < 0 with | Q 1 ( u ) | ≥ κ 1 · φ 1 ( u ) 2 where κ 1 ≥ 19.24 .
The tail and its derivatives at u = 0 (worst case) satisfy:
| R ( 0 ) | 3.88 × 10 − 3
| R ′ ( 0 ) | 7.90 × 10 − 2
| R ″ ( 0 ) | 1.41
These follow from the geometric series bound of Proposition 1 with analogous derivative estimates. By the triangle inequality:
| Δ Q ( 0 ) | ≤ | R ″ | | φ 1 | + | φ 1 ″ | | R | + | R ″ | | R | + 2 | φ 1 ′ | | R ′ | + | R ′ | 2 ≤ 2.68 .
Since | Q 1 ( 0 ) | = 62.18 , the ratio is | Δ Q ( 0 ) | / | Q 1 ( 0 ) | ≤ 0.043 < 1 . The perturbation uses only 4.3 % of the available log-concavity budget; the remaining 95.7 % is margin.
For u > 0 : the tail ratio decreases superexponentially ( ∼ e − 3 π e 2 u ) while | Q 1 | / φ 1 2 = V 1 ″ ( u ) increases. The bound improves strictly for all u > 0 .
Therefore Q Φ ( u ) = Q 1 ( u ) + Δ Q ( u ) ≤ Q 1 ( u ) + | Δ Q ( u ) | < Q 1 ( u ) − Q 1 ( u ) = 0 .    □

8. Combination and Conclusions

Proof of Theorem 1. 
We give two independent proofs.
Proof 1 (computational). Region [ 0 , 1 / 2 ] : interval arithmetic (Section 6), 5000 subintervals, all certified, max Q upper bound − 0.50 . Region [ 1 / 2 , ∞ ) : algebraic core (Theorem 2) plus tail bound (Section 5), perturbation ratio < 2.3 × 10 − 8 .
Proof 2 (analytic). Convex potential decomposition (Theorem 3) plus analytic perturbation bound (Theorem 4). No interval arithmetic. The perturbation ratio is < 0.043 at u = 0 (worst case), with 95.7 % margin.    □
Remark 3 
(Relation to the Riemann Hypothesis).   Theorem 1 establishes TP 2 (log-concavity), which is a necessary condition for RH. The full RH is equivalent to TP ∞ (all Turán inequalities), which is strictly stronger. The gap between TP 2 and TP ∞ is genuine: e − t 4 is TP 2 but not TP ∞  [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:
Result Status Method
h ( u ) > 0 for u ≥ 0 Machine-checked nlinarith, π > 3 , e 2 u ≥ 1
( log h ) ″ < 0 for u ≥ 0 Machine-checked Sign of quotient
( log φ 1 ) ″ < 0 for u ≥ 0 Machine-checked Sum of negatives
e − π n 2 e 2 u ≤ e − 3 π e − π e 2 u Machine-checked n 2 − 1 ≥ 3 , e 2 u ≥ 1
e − 3 π < 1 / 100 Machine-checked Taylor bound e 5 > 100
e x ≥ T 4 ( x ) for x ≥ 0 Axiomatised Standard (integration of 1 + x ≤ e x )
Ξ = ∫ 0 ∞ Φ cos representation Axiomatised [5]
Φ > 0 and Φ ∈ L 1 [ 0 , ∞ ) Axiomatised Standard
The Lean 4 formalisation and the interval arithmetic verification script (verify.py) are available at https://github.com/gershonavi/xi-log-concavity.

10. Discussion

10.1. Relation to the de Bruijn–Newman Constant

The de Bruijn–Newman constant Λ is defined so that Ξ λ ( z ) : = ∫ Φ ( u ) e λ u 2 e i z u d u has only real zeros for λ ≥ Λ . De Bruijn [2] proved Λ ≤ 1 / 2 ; Rodgers and Tao [3] proved Λ ≥ 0 . RH is equivalent to Λ = 0 .
Log-concavity ( TP 2 ) is a necessary condition for Λ ≤ 0 but does not by itself imply it. The passage from TP 2 to Λ = 0 requires the full TP ∞ condition (all Turán inequalities).

10.2. The TP 2 / TP ∞ Gap

Log-concavity establishes total positivity of order 2 ( TP 2 ). The Riemann Hypothesis requires total positivity of infinite order ( TP ∞ ). The gap is genuine: e − t 4 is TP 2 but not TP ∞  [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 n = 1 Term Dominates

The superexponential decay e − π n 2 e 2 u ensures that higher-order terms are negligible for u ≥ 0 . Quantitatively:
u | φ 2 | / φ 1 | φ 3 | / φ 1
0 2.2 × 10 − 3 3.2 × 10 − 9
0.5 1.4 × 10 − 10 2.5 × 10 − 29
1 9.6 × 10 − 30 1.1 × 10 − 85
By u = 0.5 , the n = 2 term is 10 − 10 of n = 1 , and by u = 1 it is 10 − 30 . The only nontrivial verification is the interval [ 0 , 0.5 ] , where the sum of the first five terms suffices.

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 [ a , b ] 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 e x ≥ ∑ k = 0 4 x k / k ! for x ≥ 0 . This follows from four applications of the identity ∫ 0 x ( 1 + t ) d t ≤ ∫ 0 x e t d t , and is provable in Mathlib using the integration API.
2.
The representation (1). This is a standard result in analytic number theory (see e.g. Titchmarsh [5], Chapter 2).
3.
Positivity and integrability of Φ on [ 0 , ∞ ) . 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

  1. Pólya, G. Über trigonometrische Integrale mit nur reellen Nullstellen. J. Reine angew. Math. 1927, 158, 6–18. [Google Scholar] [CrossRef]
  2. de Bruijn, N.G. The roots of trigonometric integrals. Duke Math. J. 1950, 17, 197–226. [Google Scholar] [CrossRef]
  3. Rodgers, B.; Tao, T. The de Bruijn–Newman constant is non-negative. Forum Math. Pi 2020, 8, e6. [Google Scholar] [CrossRef]
  4. Pólya, G. Bemerkung über die Integraldarstellung der Riemannschen ξ-Funktion. Acta Math. 1926, 48, 305–317. [Google Scholar] [CrossRef]
  5. Titchmarsh, E.C. The Theory of the Riemann Zeta-Function, 2nd ed.; Heath-Brown, D.R., Ed.; Oxford University Press, 1986. [Google Scholar]
  6. 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.
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.