High points of a random model of the Riemann-zeta function and Gaussian multiplicative chaos
Pith reviewed 2026-05-25 19:12 UTC · model grok-4.3
The pith
The normalized total mass of high points a linear order below the maximum in a random model of the Riemann zeta function converges almost surely to Gaussian multiplicative chaos of the approximating process times a random function.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We show that the total mass of points which are a linear order below the maximum divided by their expectation converges almost surely to the Gaussian multiplicative chaos of the approximating Gaussian process times a random function.
What carries the argument
Gaussian multiplicative chaos of the approximating Gaussian process, obtained via second-moment calculations and branching approximation.
If this is right
- The distribution of high points follows the same multiplicative structure as Gaussian multiplicative chaos.
- The second-moment method plus branching controls the total mass at all scales linearly below the maximum.
- Almost-sure convergence holds for the normalized mass, not merely in probability.
Where Pith is reading between the lines
- The result supplies a concrete bridge between the zeta-model extremes and the theory of log-correlated Gaussian fields.
- It suggests that similar mass-convergence statements could be checked for other log-correlated models with the same branching structure.
Load-bearing premise
The random model is the same as in the cited earlier works and the known convergence of the model to Gaussian multiplicative chaos holds without additional restrictions that would break the second-moment or branching arguments.
What would settle it
A direct computation or simulation in which the ratio of the total mass to its expectation fails to approach the predicted Gaussian multiplicative chaos limit times a random factor would falsify the claim.
read the original abstract
We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass of points which are a linear order below the maximum divided by their expectation converges almost surely to the Gaussian multiplicative chaos of the approximating Gaussian process times a random function. We use the second moment method together with a branching approximation to establish this convergence.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies the total mass of high points in a random model of the Riemann zeta function, identical to the model in [8] and [2]. Building on the convergence to Gaussian multiplicative chaos (GMC) established in [14], it claims that the total mass of points a linear order below the maximum, normalized by expectation, converges almost surely to the GMC of the approximating Gaussian process multiplied by a random function. The proof combines the second moment method with a branching approximation.
Significance. If the result holds, it refines the GMC picture for near-extreme points in this zeta model by establishing an almost-sure statement rather than convergence in probability. This strengthens links between random zeta models and GMC theory, and the second-moment-plus-branching strategy is a standard tool that here yields a stronger mode of convergence. The manuscript ships no machine-checked proofs or reproducible code, but the claim is falsifiable via the stated normalization.
major comments (2)
- [Abstract] Abstract and introduction: the argument states that GMC convergence from [14] transfers directly so that the second-moment method and branching approximation yield a.s. convergence, but no explicit verification is given that the covariance structure of the approximating process matches [14] exactly; any additional long-range dependence would invalidate the second-moment bound used for the a.s. conclusion.
- [Proof of main theorem (branching section)] The branching approximation step: the manuscript invokes a branching comparison to upgrade convergence in probability (from [14]) to a.s. convergence, yet it is not shown that the branching process remains sufficiently independent of the GMC measure constructed in [14]; without this, the second-moment calculation may only control the expectation and not the a.s. limit.
minor comments (1)
- [Main statement] Notation for the random function multiplier is introduced without an explicit definition or reference to its measurability with respect to the GMC sigma-algebra.
Simulated Author's Rebuttal
We thank the referee for the careful reading and the detailed comments. We address the two major points below and will revise the manuscript to improve clarity on the points raised.
read point-by-point responses
-
Referee: [Abstract] Abstract and introduction: the argument states that GMC convergence from [14] transfers directly so that the second-moment method and branching approximation yield a.s. convergence, but no explicit verification is given that the covariance structure of the approximating process matches [14] exactly; any additional long-range dependence would invalidate the second-moment bound used for the a.s. conclusion.
Authors: The model in the manuscript is defined identically to the one in [14] (see the introduction and Section 2). The covariance of the approximating Gaussian process is therefore the same by construction. We agree that an explicit sentence confirming the match and the absence of extra long-range terms would remove any ambiguity for the second-moment bound. This will be added in the revised introduction and at the start of the proof section. revision: yes
-
Referee: [Proof of main theorem (branching section)] The branching approximation step: the manuscript invokes a branching comparison to upgrade convergence in probability (from [14]) to a.s. convergence, yet it is not shown that the branching process remains sufficiently independent of the GMC measure constructed in [14]; without this, the second-moment calculation may only control the expectation and not the a.s. limit.
Authors: The branching approximation is built from the same underlying field but applied after the GMC convergence on a coarser scale; the second-moment calculation is performed conditionally on the GMC measure, which controls the dependence. We accept that the current write-up does not spell out this conditional independence explicitly enough. In the revision we will add a short paragraph in the branching section that records the measurability and the conditional second-moment bound, thereby justifying the a.s. upgrade. revision: yes
Circularity Check
No circularity; builds on independent prior GMC convergence result
full rationale
The paper states it uses the same model as [8] and [2] and builds on GMC convergence proved in [14] to establish a new almost-sure convergence result for normalized high-point mass via second-moment method and branching approximation. No equations or steps reduce by construction to fitted inputs, self-definitions, or unverified self-citations. The cited convergence in [14] is treated as an external established fact providing independent support for the model, with the new claim extending it to high points without the derivation collapsing to its own inputs. This matches the common case of self-contained extension of prior results.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We use the second moment method together with a branching approximation to establish this convergence... increments Y_k(x) ... branching point x ∧ x' ... Brownian bridge
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
M_α = lim ∫ M_α,N(dx) a.s. ... Gaussian multiplicative chaos
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
- [1]
- [2]
-
[3]
M. D. Bramson. Convergence of solutions of the Kolmogoro v equation to travelling waves.Mem. Amer . Math. Soc., 44(285):iv+190, 1983
work page 1983
-
[4]
R. Chhaibi, J. Najnudel, and A. Nikeghbali. The circular unitary ensemble and the Riemann zeta func- tion: the microscopic landscape and a new approach to ratios . Invent. Math., 207(1):23–113, 2017
work page 2017
-
[5]
B. Duplantier, R. Rhodes, S. Sheffield, and V . V argas. Critical Gaussian multiplicative chaos: Conver- gence of the derivative martingale. Ann. Probab., 42(5):1769–1808, 2014
work page 2014
-
[6]
Y . V . Fyodorov and J. P . Keating. Freezing transitions an d extreme values: random matrix theory, ζ( 1 2 + it) and disordered landscapes. Philos. Trans. R. Soc. A , 372(20120503):1–32, 2014
work page 2014
- [7]
-
[8]
A. J. Harper. A note on the maximum of the Riemann zeta func tion, and log-correlated random vari- ables. Preprint, pages 1–26, 2013. arXiv:1304.0677
work page internal anchor Pith review Pith/arXiv arXiv 2013
-
[9]
J.-P . Kahane. Sur le chaos multiplicatif. Ann. Sci. Math. Qu ´ebec, 9(2):105–150, 1985
work page 1985
-
[10]
H. L. Montgomery and R. C. V aughan. Multiplicative number theory. I. Classical theory , volume 97 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 2007
work page 2007
- [11]
-
[12]
R. Rhodes and V . V argas. Gaussian multiplicative chaos and applications: a review. Probab. Surv., 11:315–392, 2014
work page 2014
-
[13]
R. Robert and V . V argas. Gaussian multiplicative chaos revisited. Ann. Probab., 38(2):605–631, 2010
work page 2010
-
[14]
Multiplicative chaos measures for a random model of the Riemann zeta function
E. Saksman and C. Webb. Multiplicative chaos measures f or a random model of the Riemann zeta function. arXiv e-prints, page arXiv:1604.08378, Apr 2016
work page internal anchor Pith review Pith/arXiv arXiv 2016
-
[15]
The Riemann zeta function and Gaussian multiplicative chaos: statistics on the critical line
E. Saksman and C. Webb. The Riemann zeta function and Gau ssian multiplicative chaos: statistics on the critical line. arXiv e-prints, page arXiv:1609.00027, Aug 2016. L.-P. A RGUIN , D EPARTMENT OF MATHEMATICS , B ARUCH COLLEGE AND GRADUATE CENTER CITY UNIVERSITY OF NEW YORK , N EW YORK , N EW YORK 10010, USA E-mail address: louis-pierre.arguin@baruch.cu...
work page internal anchor Pith review Pith/arXiv arXiv 2016
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.