<?xml-model href='http://www.tei-c.org/release/xml/tei/custom/schema/relaxng/tei_all.rng' schematypens='http://relaxng.org/ns/structure/1.0'?><TEI xmlns="http://www.tei-c.org/ns/1.0">
	<teiHeader>
		<fileDesc>
			<titleStmt><title level='a'>THE DE BRUIJN–NEWMAN CONSTANT IS NON-NEGATIVE</title></titleStmt>
			<publicationStmt>
				<publisher></publisher>
				<date>01/01/2020</date>
			</publicationStmt>
			<sourceDesc>
				<bibl> 
					<idno type="par_id">10186590</idno>
					<idno type="doi">10.1017/fmp.2020.6</idno>
					<title level='j'>Forum of Mathematics, Pi</title>
<idno>2050-5086</idno>
<biblScope unit="volume">8</biblScope>
<biblScope unit="issue"></biblScope>					

					<author>BRAD RODGERS</author><author>TERENCE TAO</author>
				</bibl>
			</sourceDesc>
		</fileDesc>
		<profileDesc>
			<abstract><ab><![CDATA[For each                                                                  $t\in \mathbb{R}$                                            , we define the entire function                                                                  $$\begin{eqnarray}H_{t}(z):=\int _{0}^{\infty }e^{tu^{2}}\unicode[STIX]{x1D6F7}(u)\cos (zu)\,du,\end{eqnarray}$$                                            where                                                                  $\unicode[STIX]{x1D6F7}$                                            is the super-exponentially decaying function                                                                  $$\begin{eqnarray}\unicode[STIX]{x1D6F7}(u):=\mathop{\sum }_{n=1}^{\infty }(2\unicode[STIX]{x1D70B}^{2}n^{4}e^{9u}-3\unicode[STIX]{x1D70B}n^{2}e^{5u})\exp (-\unicode[STIX]{x1D70B}n^{2}e^{4u}).\end{eqnarray}$$                                            Newman showed that there exists a finite constant                                                                  $\unicode[STIX]{x1D6EC}$                                            (the              de Bruijn–Newman constant              ) such that the zeros of                                                                  $H_{t}$                                            are all real precisely when                                                                  $t\geqslant \unicode[STIX]{x1D6EC}$                                            . The Riemann hypothesis is equivalent to the assertion                                                                  $\unicode[STIX]{x1D6EC}\leqslant 0$                                            , and Newman conjectured the complementary bound                                                                  $\unicode[STIX]{x1D6EC}\geqslant 0$                                            . In this paper, we establish Newman’s conjecture. The argument proceeds by assuming for contradiction that                                                                  $\unicode[STIX]{x1D6EC}<0$                                            and then analyzing the dynamics of zeros of                                                                  $H_{t}$                                            (building on the work of Csordas, Smith and Varga) to obtain increasingly strong control on the zeros of                                                                  $H_{t}$                                            in the range                                                                  $\unicode[STIX]{x1D6EC}<t\leqslant 0$                                            , until one establishes that the zeros of                                                                  $H_{0}$                                            are in local equilibrium, in the sense that they locally behave (on average) as if they were equally spaced in an arithmetic progression, with gaps staying close to the global average gap size. But this latter claim is inconsistent with the known results about the local distribution of zeros of the Riemann zeta function, such as the pair correlation estimates of Montgomery.]]></ab></abstract>
		</profileDesc>
	</teiHeader>
	<text><body xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Let H 0 : C &#8594; C denote the function</p><p>where &#958; denotes the Riemann xi function</p><p>and &#950; is the Riemann zeta function. Then H 0 is an entire even function with functional equation H 0 (z) = H 0 (z), and the Riemann hypothesis is equivalent to the assertion that all the zeros of H 0 are real. It is a classical fact (see <ref type="bibr">[29, page 255]</ref>) that H 0 has the Fourier representation</p><p>where &#934; is the super-exponentially decaying function</p><p>The sum defining &#934;(u) converges absolutely for negative u also. From Poisson summation, one can verify that &#934; satisfies the functional equation &#934;(u) = &#934;(-u) (that is, &#934; is even).</p><p>De Bruijn <ref type="bibr">[4]</ref> introduced the more general family of functions H t : C &#8594; C for t &#8712; R by the formula</p><p>As noted in <ref type="bibr">[11,</ref> page 114], one can view H t as the evolution of H 0 under the backward heat equation &#8706; t H t (z) = -&#8706; zz H t (z). As with H 0 , each of the H t is an entire even function with functional equation H t (z) = H t (z). From results of P&#243;lya <ref type="bibr">[20]</ref>, it is known that if H t has purely real zeros for some t, then H t has purely real zeros for all t &gt; t. De Bruijn showed that the zeros of H t are purely real for t 1/2. Strengthening these results, Newman <ref type="bibr">[17]</ref> showed that there is an absolute constant -&#8734; &lt; &#923; 1/2, now known as the De Bruijn-Newman constant, with the property that H t has purely real zeros if and only if t &#923;. The Riemann hypothesis is then clearly equivalent to the upper bound &#923; 0. Newman conjectured the complementary lower bound &#923; 0 and noted that this terms of use, available at <ref type="url">https://www.cambridge.org/core/terms</ref>. <ref type="url">https://doi.org/10.1017/fmp.2020.6</ref> Downloaded from <ref type="url">https://www.cambridge.org/core</ref>. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core</p><p>The De Bruijn-Newman constant is non-negative conjecture asserts that if the Riemann hypothesis is true, it is only 'barely so'. As progress towards this conjecture, several lower bounds on &#923; were established; see Table <ref type="table">1</ref>.</p><p>Table <ref type="table">1</ref>. Previous lower bounds on &#923;. Dates listed are publication dates. The final four results use the method of Csordas, Smith and Varga <ref type="bibr">[11]</ref>. Csordas-Smith-Varga 1994 <ref type="bibr">[11]</ref> -5.895 &#215; 10 - 9  Csordas-Odlyzko-Smith-Varga 1993 [9] -2.63 &#215; 10 - 9  Odlyzko 2000 [19] -1.15 &#215; 10 - 11  Saouter-Gourdon-Demichel 2011 <ref type="bibr">[23]</ref> We also mention that the upper bound &#923; 1/2 of de Bruijn <ref type="bibr">[4]</ref> was sharpened slightly by Ki, Kim and Lee <ref type="bibr">[13]</ref> to &#923; &lt; 1/2. (In press: this bound has recently been improved to &#923; 0.22 in <ref type="bibr">[21]</ref>.) See also <ref type="bibr">[5,</ref><ref type="bibr">25]</ref> on work on variants of Newman's conjecture and <ref type="bibr">[3,</ref><ref type="bibr">Ch. 5</ref>] for a survey.</p><p>The main result of this paper is to affirmatively settle Newman's conjecture: THEOREM 1. One has &#923; 0.</p><p>We now discuss the methods of the proof. Starting from the work of Csordas-Smith-Varga <ref type="bibr">[11]</ref>, the best lower bounds on &#923; were obtained by exploiting the following repulsion phenomenon: if &#923; was significantly less than zero, then adjacent zeros of H 0 (or of the Riemann &#958; function) cannot be too close to each other (as compared with the other nearby zeros). See <ref type="bibr">[11,</ref>  <ref type="bibr">Theorem 1]</ref> for a precise statement. In particular, a negative value of &#923; gives limitations on the quality of 'Lehmer pairs' <ref type="bibr">[14]</ref>, which roughly speaking refer to pairs of adjacent zeros of the Riemann zeta function that are significantly closer to each other than the average spacing of zeros at that level. The lower bounds on &#923; in <ref type="bibr">[9,</ref><ref type="bibr">11,</ref><ref type="bibr">19,</ref><ref type="bibr">23]</ref> then follow from numerically locating Lehmer pairs of increasingly high quality. (See also <ref type="bibr">[26]</ref> for a refinement of the Lehmer pair concept used in the above papers.)</p><p>In principle, one could settle Newman's conjecture by producing an infinite sequence of Lehmer pairs of arbitrarily high quality. As suggested in <ref type="bibr">[19]</ref>, we were able to achieve this under the Gaussian Unitary Ensemble (GUE) hypothesis on the asymptotic distribution of zeros of the Riemann zeta function; we do not detail this computation here as it is superseded by our main result. (A sketch of the argument may be found at terrytao.wordpress.com/2018/01/20.) However, without the GUE hypothesis, the known upper bounds on narrow gaps between zeros (for example, <ref type="bibr">[7]</ref>) do not appear to be sufficient to make this strategy work, even if one assumes the Riemann hypothesis (which one can do for Theorem 1 without loss of generality). Instead, we return to the analysis in <ref type="bibr">[11]</ref> and strengthen the repulsion phenomenon to a relaxation to local equilibrium phenomenon: if &#923; is negative, then the zeros of H 0 are not only repelled from each other but will nearly always be arranged locally as an approximate arithmetic progression, with the gaps between zero mostly staying very close to the global average gap that is given by the Riemann-von Mangoldt formula. (To illustrate the equilibrium nature of arithmetic progressions under backward heat flow, consider the entire functions F t (z) := e tu 2 cos(zu) for some fixed real u &gt; 0. These functions all have zeros on the arithmetic progression { To obtain the local relaxation to equilibrium under the hypothesis that &#923; &lt; 0 requires a sequence of steps in which we obtain increasingly strong control on the distribution of zeros of H t for &#923; &lt; t 0 (actually for technical reasons, we will need to move t away from &#923; as the argument progresses, restricting instead to ranges such as &#923;/2 t 0 or &#923;/4 t 0). The first step is to obtain Riemann-von Mangoldt type formulae for the number of zeros of H t in an interval such as [0, T ] or [T, T + &#945;], where T 2 and 0 &lt; &#945; o(T ). When t = 0, we can obtain asymptotics of T 4&#960; log T 4&#960; -T 4&#960; + O(log T ) and &#945; 4&#960; log T +o(log T ) by the classical Riemann-von Mangoldt formula and a result of Littlewood, respectively; this gives good control on the zeros down to length scales &#945; 1. For &#923; &lt; t &lt; 0, we were only able to obtain the weaker bounds of T 4&#960; log T 4&#960; -T 4&#960; + O(log 2 T ) and &#945; 4&#960; log T + o(log 2 T ), respectively, down to length scales &#945; log T , but it turns out that these bounds still (barely) suffice for our arguments; see Section 3. A key input in the proof of the Riemann-von Mangoldt type formula will be some upper and lower bounds for H t (x -i y) when y is comparable to log x; see Lemma 4 for a precise statement. The main tool used to prove these bounds is the saddle point method, in which various contour integrals are shifted until they resemble the integral for the gamma function, to which the Stirling approximation may be applied.</p><p>It was shown in <ref type="bibr">[11]</ref> that in the region &#923; &lt; t 0, the zeros x j (t) of H t are simple, and furthermore evolve according to the system of ordinary differential terms of use, available at <ref type="url">https://www.cambridge.org/core/terms</ref>. <ref type="url">https://doi.org/10.1017/fmp.2020.6</ref> Downloaded from <ref type="url">https://www.cambridge.org/core</ref>. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core</p><p>The De Bruijn-Newman constant is non-negative equations (ODEs)</p><p>see Theorem 11 for a more precise statement. One can view this equation as describing the dynamics of a system of 'particles' x j , in which every pair of particles x j , x k experiences a repulsion that is inversely proportional to their separation. (We caution however that the dynamics here are not Newtonian in nature since <ref type="bibr">(5)</ref> prescribes the velocity &#8706; t x k of each particle rather than the acceleration &#8706; 2 t x k . Nevertheless we found the physical analogy to be helpful in locating the arguments used in this paper.) By refining the analysis in <ref type="bibr">[11]</ref>, we can obtain a more quantitative lower bound on the gap x j+1 (t) -x j (t) between adjacent 'particles' (zeros), in particular establishing a bound of the form log 1 x j+1 (t) -x j (t) log 2 j log log j for all large j in the range &#923;/2 t 0; see Proposition 13 for a more precise statement. While far from optimal, this bound almost allows one to define the Hamiltonian H(t) := j,k: j =k log 1</p><p>, although in practice we will have to apply some spatial cutoffs in j, k to make this series absolutely convergent. For the sake of this informal overview, we ignore this cutoff issue for now. The significance of this quantity is that system (5) can (formally, at least) be viewed as the gradient flow for the Hamiltonian H(t). In particular, there is a formal monotonicity formula</p><p>where the energy E(t) is defined as</p><p>Again, in practice, one needs to apply spatial cutoffs to j, k to make this quantity finite, and one then has to treat various error terms arising from this cutoff, which among other things 'renormalizes' the summands 1 |x j (t)-x k (t)| 2 so that the renormalized energy vanishes when the zeros are arranged in the equilibrium state of an arithmetic progression; we ignore these issues for the current discussion. A further formal calculation indicates that E(t) is monotone nonincreasing in time (so that H(t) is formally convex in time, as one would expect for the gradient flow of a convex Hamiltonian). Exploiting (a variant terms of use, available at <ref type="url">https://www.cambridge.org/core/terms</ref>. <ref type="url">https://doi.org/10.1017/fmp.2020.6</ref> Downloaded from <ref type="url">https://www.cambridge.org/core</ref>. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core of) equation ( <ref type="formula">6</ref>), we are able to control integrated energies that resemble the quantities 0 &#923;/2 E(t) dt; see first the weak preliminary integrated energy bound in Proposition 15 and then the final integrated energy bound in Theorem 17. By exploiting local monotonicity properties of the energy (and using a pigeonholing argument of Bourgain <ref type="bibr">[2]</ref>), we can then obtain good control (a truncated version) of the energy E(t) at time t = 0, which intuitively reflects the assertion that the 'particles' x j (t) are close to local equilibrium at time t = 0. This implies that the zeros of the Riemann zeta function behave locally like an arithmetic progression on the average. However, this can be ruled out by the existing results on the local distribution of zeros, such as pair correlation estimates of Montgomery <ref type="bibr">[15]</ref>. As it turns out, it will be convenient to make use of a closely related estimate of Conrey, Ghosh, Goldston, Gonek and Heath-Brown <ref type="bibr">[6]</ref>.</p><p>It may be possible to use the methods of this paper to also address the generalized Newman conjecture introduced in <ref type="bibr">[25]</ref>, but we do not pursue this direction here. REMARK 2. It is interesting to compare this with the results in [13, Theorem 1.14], which show that regardless of the value of &#923;, the zeros of H t will be spaced like an arithmetic progression on average for any positive t. REMARK 3. In press: We note that in forthcoming work, Alex Dobner has found a proof that &#923; 0, which avoids the heat equation approach we have used here. Dobner's approach instead relies on a Riemann-Siegel type approximation for H t in order to demonstrate the existence of zeros off the critical line. There is also some very intriguing numerical work of Rudolph Dwars (see the comments to terrytao.wordpress.com/2018/12/28) that suggests that many of the zeros of H t , t &lt; 0 away from the critical line organize around deterministic curves.</p><p>1.1. Notation. Throughout the rest of the paper, we will assume for the sake of contradiction that Newman's conjecture fails:</p><p>In particular, this implies the Riemann hypothesis (which, as mentioned previously, is equivalent to the assertion &#923; 0).</p><p>We will have a number of logarithmic factors appearing in our upper bounds. for several of these bounds. We also use the standard branch of the complex logarithm, with imaginary part in the interval (-&#960;, &#960;], and the standard branch z 1/2 := exp( 1 2 log z) of the square root, defined using the standard branch of the complex logarithm.</p><p>Let &#923; &lt; t 0; then the zeros of H t are all real and symmetric around the origin. It is a result of Csordas, Smith and Varga <ref type="bibr">[11,</ref><ref type="bibr">Corollary 1]</ref> that the zeros are also distinct and avoid the origin. Thus we can express the zeros of H t as (x j (t)) j&#8712;Z * , where Z * := Z\{0} are the nonzero integers, 0 &lt; x 1 (t) &lt; x 2 (t) &lt; . . . , and x -j (t) = -x j (t) for all j 1. For any real numbers j -j + , we use [ j -, j + ] Z * to denote the discrete interval</p><p>We For X and Y depending on an asymptotic parameter T , we will also use the notation X Y or X = &#213;(Y ) for X Y log O (1) T in the last two sections of this paper.</p><p>Furthermore, in sums that will appear which depend on a parameter T , we say that indices j, k are nearby, and write j &#8764; T k if one has 0 &lt; | j -k| &lt; (T 2 + | j| + |k|) 0.1 . We will use a marked sum to indicate principle value summation:</p><p>In cases where there is any chance of confusion for the range of summation, we record the index being summed and use a colon to indicate its range; for example, we write j: j =k to indicate that the summation is over j, and j is to not equal k (where k is fixed outside the sum). Semicolons are used to separate additional conditions. We use the phrase for almost every t throughout this paper to denote that a relation holds for all t except a set of null Lebesgue measure.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Asymptotics of H t</head><p>In this section, we establish some upper and lower bounds on H t (z) and its logarithmic derivative H t H t (z). We will be able to obtain reasonable upper bounds in the regime where z = xi y with y = O(log + x), and obtain more precise asymptotics when y log + x (as long as the ratio y/ log + x is large enough); this will be the key input for the Riemann-von Mangoldt type asymptotics in the next section. More precisely, we show the following. LEMMA 4. Let z = xi&#954; log + x for some x 0 and 0 &#954; C, and let &#923; &lt; t 0. Then one has</p><p>(The reader is advised not to take the numerous factors of &#960; , &#8730; 2 and so on appearing in this section too seriously, as the exact numerical values of these constants are not of major significance in the rest of the arguments.) Furthermore, there is an absolute constant C &gt; 0 (not depending on C) such that if &#954; C , then one has the refinement</p><p>as well as the additional estimate</p><p>using the standard branch of the complex logarithm.</p><p>REMARK 5. With a little more effort, one could replace the hypothesis &#923; &lt; t here by -C &lt; t; in particular (in contrast to the remaining arguments in this paper), these results are nonvacuous when &#923; 0. However, we will need to assume &#923; &lt; t in the application of these estimates in the next section, particularly with regard to the proof of (49). Our proof methods also allow for a more precise version of asymptotic (8) (as one might expect given the level of precision in <ref type="bibr">(9)</ref>), but such improvements do not seem to be helpful for the rest of the arguments in this paper. In the t = 0 case, one can essentially obtain Dirichlet series expansions for 1  H 0 (z) or H 0 H 0 (z), which allow one to also obtain bounds such as <ref type="bibr">(8)</ref> or <ref type="bibr">(9)</ref> when the imaginary part of z is much smaller than log + x. However, in the t &lt; 0 case, there does not appear to be any usable series expansions for 1 H t (z) or H t H t (z) that could be used to prove <ref type="bibr">(8)</ref> or <ref type="bibr">(9)</ref>. Instead, we will prove these estimates by computing H t (z) to a high degree of accuracy, which we can only The De Bruijn-Newman constant is non-negative do when y is greater than or equal to a large multiple of log + x in order to ensure that the series expansions we have for H t (z) converge rapidly.</p><p>We begin by treating the easy case t = 0, in which we can exploit identity <ref type="bibr">(1)</ref>. We have the very crude bound</p><p>whenever &#963; 1/2 and &#964; &#8712; R (this follows for instance from <ref type="bibr">[29,</ref><ref type="bibr">Theorem 4.11]</ref>). In the region &#963; 1/4, we also have the Stirling approximation (see for example, <ref type="bibr">[1, 6.1.41]</ref>)</p><p>where we use the standard branch of the logarithm; in particular,</p><p>As arctan &#964; &#963; = &#960; 2 sgn(&#964; ) + O( &#963; &#963; +|&#964; | ), we have in particular that</p><p>. Inserting these bounds into (1) and (2), we obtain the crude upper bound</p><p>for x &#8712; R and y 0. This gives the s = 0 case of <ref type="bibr">(7)</ref>. As is well known, when &#963; 2 (say), we can improve <ref type="bibr">(10)</ref> to</p><p>and so we obtain the improvement</p><p>when y C log + x (in fact, in this case it would suffice to have y 4, say). This gives the s = 0 case of <ref type="bibr">(8)</ref>. Finally, from taking logarithmic derivatives of (1) and ( <ref type="formula">2</ref>), one has Henceforth, we address the t &lt; 0 case. We begin with the proof of the upper bound <ref type="bibr">(7)</ref>. Here it will be convenient to exploit the fundamental solution for the (backward) heat equation to relate H t with H 0 . Indeed, for any t &lt; 0, we have the classical heat equation (or Gaussian) identity</p><p>for any complex numbers z, u; replacing z, r by -z, -r and averaging, we conclude that e tu 2 cos(zu) = 1 &#8730; 4&#960; R e -r 2 /4 cos (z + r |t| 1/2 )u dr.</p><p>Multiplying by &#934;(u), integrating u from 0 to infinity and using Fubini's theorem, we conclude that</p><p>Applying <ref type="bibr">(13)</ref>, the triangle inequality and the hypothesis &#923; &lt; t 0, we conclude that</p><p>Using Since y = O C (log + x), this gives <ref type="bibr">(7)</ref>. To prove the remaining two bounds <ref type="bibr">(8)</ref> and <ref type="bibr">(9)</ref>, it is convenient to cancel off the t = 0 case that has already been established, and reduce to showing that</p><p>and</p><p>when &#954; C . To prove these estimates, the heat equation approach is less effective due to the significant oscillation present in H 0 . Instead, we will use the method of steepest descent (also known as the saddle point method) to shift contours to where the phase is stationary rather than oscillating. We allow all implied constants to depend on C. We may assume that x is larger than any specified constant C (depending on C) as the case x = O C (1) follows trivially from compactness, since the zeros of H t for t &#923; are all real, so that H t (z) is bounded away from zero in this region of interest. Now suppose that z = xi y, where y = &#954; log + x for some C &#954; C; in particular, C is large since C is. As &#934; is even, we may write (4) as</p><p>From (3) and Fubini's theorem (which can be justified when t &lt; 0), we conclude that</p><p>where I t (b, &#950; ) denotes the oscillatory integral</p><p>which is an absolutely convergent integral for t &lt; 0 whenever Re b &gt; 0.</p><p>We therefore need to obtain good asymptotics on I t (b, &#950; ) for b 1 and &#950; in the region</p><p>Observe that the phase tw 2 -be 4w + &#950; w has a stationary point at the origin when 4b = &#950; . In general, 4b will not equal &#950; ; however, for any complex number w 0 in the strip</p><p>we see from shifting the contour in <ref type="bibr">(19)</ref> to the horizontal line {w + w 0 : w &#8712; R} that we have the identity</p><p>whenever b &gt; 0 (so that be 4w 0 has a positive real part). We will thus be able to reduce to the stationary phase case 4b = &#950; if we can solve the equation</p><p>in strip <ref type="bibr">(21)</ref>. This we do in the following lemma. (One could also write w 0 explicitly in terms of the Lambert W -function as</p><p>), but we will not use this expression in this paper, and in fact will not explicitly invoke any properties of the W -function in our arguments.) LEMMA 6. If b 1 and &#950; &#8712; &#8486;, then there exists a unique w 0 = w 0 (b, &#950; ) in strip <ref type="bibr">(21)</ref> such that (23) holds. Furthermore, we have the following estimates: x exp(100 x 1/2 |t| ), then</p><p>where the superscript in the O() notation indicates that these quantities are real-valued. Proof. The function w 0 &#8594; 4be 4w 0 -2tw 0 traverses the graph {a + i( &#960; |t| 4 + 4be 2a/|t| ) : a &#8712; R} on the upper edge { a 2|t| + i &#960; 8 : a &#8712; R} of strip <ref type="bibr">(21)</ref>, while the lower edge of the strip is of course mapped to the real axis. Since |t| &#923; and C, C are large, the region &#8486; lies between these two curves, and so from the argument principle (and observing that the map w 0 &#8594; 4be 4w 0 -2tw 0 sends the line segments {-R + i&#946; : 0 &lt; &#946; &lt; &#960;/8} and {R + i&#946; : 0 &lt; &#946; &lt; &#960;/8} well to the left and right of &#950; , respectively, for R large enough), for every &#950; &#8712; &#8486;, there exists exactly one w 0 in strip <ref type="bibr">(21)</ref> such that 4be 4w 0 -2tw 0 = &#950; , which is of course equivalent to <ref type="bibr">(23)</ref>. The uniqueness implies that the holomorphic function w 0 &#8594; 4be 4w 0 -2tw 0 has a nonzero derivative at this value of w 0 . Now write &#950; = y + i x as per <ref type="bibr">(20)</ref>, and write w 0 = &#945; + i&#946; for some &#945; &#8712; R and 0 &lt; &#946; &lt; &#960;/8. Taking real and imaginary parts in <ref type="bibr">(23)</ref>, we have the system of equations 4be 4&#945; cos 4&#946; = y + 2t&#945; ( <ref type="formula">24</ref>)</p><p>To prove (i), suppose for contradiction that Re(4be 4w 0 ) &lt; 1; thus</p><p>Since t, &#946; = O(1), we see from ( <ref type="formula">25</ref>) that 4be 4&#945; sin 4&#946;</p><p>x, and hence from sin 2 4&#946; + cos 2 4&#946; = 1, we have 4be 4&#945;  x and hence (since b 1) &#945; 1 4 log + x + O(1). In particular, -2t&#945; |t| 2 log + x + O(1). Inserting this into (24) and using <ref type="bibr">(26)</ref>, one then has</p><p>which contradicts (20) since |t| &#923; and C is large. Now we show (ii). From ( <ref type="formula">25</ref>) and sin 4&#946; 1, t,</p><p>and hence on taking logarithms (and using the fact that b 1 and x is large)</p><p>On the other hand, from squaring ( <ref type="formula">24</ref>) and ( <ref type="formula">25</ref>) and summing, we have</p><p>Crudely bounding x +2t&#946; = O(x), y = O(x), b 1 and t = O(1), we conclude that e 8&#945;</p><p>x 2 + &#945; 2 , which implies that &#945; O(log + x). From the hypothesis b x exp(100 x 1/2 |t| ) and ( <ref type="formula">27</ref>), we also have &#945; -O(x 1/2 /t); thus t&#945; x 1/2 . Returning to (28) and using 2t&#946; = O(1) and y</p><p>x 1/2 , we conclude that</p><p>So on taking square roots</p><p>and hence on taking logarithms, we have the matching upper bound</p><p>to <ref type="bibr">(27)</ref>. In particular,</p><p>Inserting this and ( <ref type="formula">29</ref>) into ( <ref type="formula">24</ref>), we have</p><p>and hence (by Taylor expansion of the arc cosine function)</p><p>Finally, we prove (iii). From identity <ref type="bibr">(28)</ref> and crudely bounding y, t&#946; = O(x), we have</p><p>Under the hypothesis b &gt; x exp( x 1/2 |t| ), so that 1/|t| and x are O(b 1/10 ) (say), so both options force -&#945; 1  8 log b as claimed.</p><p>We combine the above lemma with the following asymptotic.</p><p>LEMMA 7. Let b be a complex number with Re b 1. Then</p><p>using the standard branch of the square root.</p><p>Proof. One could establish this from Laplace's method, but we will instead use the Stirling approximation <ref type="bibr">(11)</ref>. (We thank Alex Dobner for pointing out some issues in the original proof of this lemma and suggesting a repaired proof, which is reproduced here.) Writing</p><p>, where &#181; is the Gaussian probability measure</p><p>of mean zero and variance |t|/8, and applying Fubini's theorem, we obtain</p><p>Making the change of variables r = be 4w (and contour shifting or analytic continuation) and the definition</p><p>and hence</p><p>We divide the integral into regions |&#958; | 10|t| 1/2 |b| 1/2 and |&#958; | &gt; 10|t| 1/2 |b| 1/2 . By applying the Stirling approximation, the integral over the first region becomes</p><p>Note that we may assume that |b| is sufficiently large so that |&#958; | &lt; |b|/2 in this region (the small |b| case of the lemma follows trivially from compactness), and so we have 1</p><p>|b| . Substituting these expressions into the integrand, we get</p><p>and now the integral evaluates to 1 + O( 1 |b| ). Thus it will suffice to establish the tail bound</p><p>By applying the triangle inequality and bounding the integrand with </p><p>(say), and the claim follows.</p><p>From the above two lemmas and ( <ref type="formula">22</ref>), we have the asymptotic</p><p>for any b 1 and &#950; &#8712; &#8486;, where w 0 = w 0 (b, &#950; ) is the quantity in Lemma 6. Now we can control sum <ref type="bibr">(18)</ref>. As before, we assume that z = xi y, where y = &#954; log + x for some C &#954; C. From ( <ref type="formula">18</ref>), one has</p><p>where Q t,n is the quantity</p><p>We first consider the estimation of Q n in the main case when n is not too huge, in the sense that n x exp 100</p><p>In this case, if we apply Lemma 6(ii) with &#950; = 9 + y + i x and b = &#960;n 2 , we have that the quantity w 0 = w 0,t,n arising in that lemma obeys the asymptotics</p><p>which when combined with <ref type="bibr">(23)</ref> gives</p><p>In particular, the factor 1  &#8730; be 4w 0</p><p>and thus by (31),</p><p>where we have again used <ref type="bibr">(23)</ref>. From (34) (and using t = O(1) and y = O C (log + x) to bound some small error terms), we can calculate the quantity Re</p><p>and thus on cancelling and gathering terms, we obtain</p><p>where J t = J t (x) and K t,n = K t,n (x) are the positive quantities</p><p>and</p><p>A similar computation gives</p><p>In particular, we have the upper bound</p><p>for 1 n x exp(100 x 1/2 |t| ), and for n = 1, we have the refinement</p><p>x 4&#960; 9+y 4</p><p>Using the crude bound</p><p>Also, from (35), we have</p><p>Thus, to finish the proof of (8) (or ( <ref type="formula">16</ref>)), one just needs to show that the tail</p><p>. Suppose now that n &gt; x exp(100 x 1/2 |t| ). If we now apply Lemma 6(iii) with &#950; = 9 + y + i x and b = &#960;n 2 , and write w 0 = &#945; + i&#946; with 0 &lt; &#946; &lt; &#960;/8, we have that &#945; is negative with -&#945; 1  8 log n, while from (31) and ( <ref type="formula">23</ref>) (and Lemma 6(i)), we have</p><p>and similarly for I t (&#960;n 2 , 5+ y +i x). Since log n 100 </p><p>which already gives <ref type="bibr">(7)</ref>. Sending t to 0, taking absolute values, and then dividing using (36) and (35), we obtain after cancelling all the t-independent terms that</p><p>Since the ratio H t H 0 is holomorphic in the region of interest, we can thus find a holomorphic branch of log </p><p>for all T 0, where we use &#936; : R + &#8594; R to denote the function</p><p>(It is traditional to also insert the lower order term -7 8 here, but this term will not be of use in our analysis and will therefore be discarded. The factors of 4&#960; are not of particular significance and may be ignored by the reader on a first read.) For future reference, we record the derivative of &#936; as</p><p>in particular, &#936; is increasing for T &gt; 4&#960;. Applying (37) with T replaced by T + &#945; and subtracting, we conclude from the mean value theorem that</p><p>for all T 0 and 0 &#945; C for any fixed C, where the implied constants in the asymptotic notation are allowed to depend on C. Because we are assuming the Riemann hypothesis (and hence the Lindel&#246;f hypothesis), one can improve this latter bound to </p><p>n s that is valid in this region. Define the classical location &#958; j of the jth zero for j 1 to be the unique quantity in (1, +&#8734;) solving the equation</p><p>and extend this to negative j by setting &#958; -j := -&#958; j . (As with the quantity w 0 introduced in Lemma 6, one could express &#958; j explicitly in terms of the Lambert W function if desired as &#958; j = 4&#960; e exp(W ( j/e)), but we will not use this relation in this paper.) Clearly, &#958; j are increasing in j. For future reference, we record the following bounds on &#958; j .</p><p>LEMMA 8 (Spacing of the classical locations).</p><p>(i) For any j 1, one has</p><p>In particular, &#958; j j log + j and log + &#958; j log + j. (ii) For any j, k &#8712; Z * , one has</p><p>(iii) If 1 j k, then one has the more precise approximation</p><p>Of course, the implied constant in the error term in (45) can depend on the implied constants in the hypothesis j k.</p><p>Proof. If j 1, then from (38), one has</p><p>which implies that j 1/2 &#958; j j (say), which implies that log + &#958; j log + j; substituting this back into (46) yields</p><p>.</p><p>This in turn implies that log + &#958; j = (1 + o j&#8594;&#8734; (1)) log + j, and using (46) one last time gives (42). Now we obtain (ii). If j, k have opposing sign, then (44) follows from (43), so by symmetry we may assume that j, k are both positive. If j is much larger than k or vice versa, then bound (44) follows from (43) and the triangle inequality, so we may now restrict attention to the case 1 j k. Estimates (44) and (45) are trivial for j = O(1), so we may assume j to be large.</p><p>From (42), we have</p><p>and hence by the mean value theorem and (39), we have</p><p>for some T between &#958; k and &#958; j . From (43), we see that T &#958; j , and so (44) follows. Furthermore, we can conclude that</p><p>Applying (37) to T = x j (0) for some j 1, we conclude in particular that</p><p>). From (39) and the mean value theorem, we conclude that</p><p>for all j 1, and hence for all j &#8712; Z * by symmetry. (One may wish to treat the bounded case j = O(1) separately to avoid the minor issue that &#936; (T ) becomes decreasing for T &lt; 1.) In particular, from (43) and the fact that x 1 (0) &gt; 0, we conclude that x j (0) j log + &#958; j j log + j for all j 1.</p><p>In a similar vein, if 1 j &lt; k j + log + j, then from applying (41) with T = x j (0) and &#945; equal to (or slightly less than) x k (0) -x j (0), we have <ref type="bibr">(1)</ref>.</p><p>Informally, this asserts that the zeros x j (0) behave like an arithmetic progression of spacing 4&#960; log + &#958; j at spatial scales between o(1) and 1. (In fact, when combined with (47) and (45), we see that this behaviour persists for all scales between o(1) and o(&#958; j ).)</p><p>In this section, we use the asymptotics on H t obtained in the previous section to establish analogous, but weaker, bounds for the zeros x j (t) of the functions H t , in which we lose an additional logarithm factor in the error estimates. THEOREM 9 (Riemann-von Mangoldt type formulae). Let &#923; &lt; t 0, T &gt; 0, and let 0 &#945; C for some C &gt; 0. Then one has</p><p>and</p><p>The decay rate in the o T &#8594;&#8734; () error term is permitted to depend on C but is otherwise uniform in &#945;.</p><p>Repeating the previous analysis, we conclude the following.</p><p>COROLLARY 10 (Macroscopic structure of zeros). Let &#923; &lt; t 0. Then one has</p><p>for all j &#8712; Z * ; in particular,</p><p>for all j 1. We also have</p><p>Informally, this corollary asserts that the zeros x j (t) behave like an arithmetic progression of spacing 4&#960; log + &#958; j at spatial scales between o(log + &#958; j ) and o(&#958; j ). This level of spatial resolution is worse by a factor of log + &#958; j than what one can achieve for x j (0), but will still (barely) be enough for our applications. We remark that a significantly sharper estimate (with an error term of just O(1) in the analogue of (48)) is available for any fixed t &gt; 0; see <ref type="bibr">[13,</ref><ref type="bibr">Theorem 1.4</ref>]. (In press: even sharper estimates have recently been obtained in <ref type="bibr">[21,</ref><ref type="bibr">Theorem 1.5</ref>].)</p><p>We now turn to the proof of the two bounds in Theorem 9.</p><p>Proof of (48). We make use of the argument principle in exactly the same manner as in the classical proof of the Riemann-von Mangoldt formula. By perturbing T slightly if necessary, we may assume that T is not a zero of H t .</p><p>Let &#954; &gt; 0 be a sufficiently large absolute constant. Then the argument principle yields</p><p>where &#915; is the counterclockwise contour carved out by a straight line from i&#954; log + 0 = i&#954; log 2 to -i&#954; log + 0 = -i&#954; log 2, then along the curve &#915; I parameterized by xi&#954; log + x for x &#8712; [0, T ], then along the line &#915; I I from Ti&#954; log + T to T , then along the vertical line conjugate to &#915; I I and the curve conjugate to &#915; I , leading back to i log 2. As the integrand is odd, the integral along the line from i&#954; log + 0 to -i&#954; log + 0 vanishes. Using the symmetry H t (z) = H t (z), we thus have</p><p>From ( <ref type="formula">9</ref>) and (39), one sees that 1 &#960;</p><p>for z = x-i&#954; log + x on &#915; I (extending &#936; to the right half-plane using the standard branch of the logarithm), and hence by the fundamental theorem of calculus</p><p>). On the other hand, if we let &#952; be a phase so that e i&#952; H t (Ti&#954; log + T ) is real and positive, then</p><p>where m is the number of zeros of Re e i&#952; H t (z) along the contour &#915; I I , since the left-hand side is the change in arg e i&#952; H t (z) as z varies over this contour, and for each increment of &#960; in the value of arg e i&#952; H t (z), we must have that Re e i&#952; H t (z) is zero for some z. Note that the number of zeros of ReH t (z) along this contour is the same as the number of zeros of g(s) := 1 2 (e -i&#952; H t (is + T ) + e i&#952; H t (-is + T )) as s ranges along the line from 0 to &#954; log + T . Hence m is no more than the number of zeros m of g(s) in the disc of radius &#954; log + T centred at &#954; log + T . We can estimate the count m with the Jensen formula as follows. Let M be the maximum of g(s) in a disc centred at &#954; log + T of radius 2&#954; log + T . Using (7) and the conjugate symmetry of H t (z), we have</p><p>T +O(log 2 + T ) .</p><p>Since from <ref type="bibr">(8)</ref> we have g(&#954; log</p><p>T +O(log 2</p><p>+ T ) , it therefore follows from the Jensen formula (see for example, [16, Lemma 6.1]) that m log 2 + T. This induces a corresponding bound on the integral of Proof of (49). We will use a 'limiting profile argument' (also known as a 'compactness argument' or 'normal families argument'), in which one extracts and then studies a limit of suitably rescaled versions of a family of analytic functions to conclude asymptotic information about these functions. We remark that this sort of argument can also be used in a similar fashion to deduce the Lindel&#246;f hypothesis from the Riemann hypothesis: see Theorem 1 of terrytao.wordpress.com/2015/03/01.</p><p>Suppose for contradiction that this claim failed; then there exists a sequence T n &#8594; &#8734;, and bounded sequences &#923; &lt; t n 0 and 0 &#945; n C, as well as an &#949; &gt; 0, such that</p><p>for all n. By perturbing T n slightly, we may assume that H t n does not vanish at T n or T n + &#945; n . Let &#954; &gt; 0 be a sufficiently large absolute constant. By the hypothesis &#923; &lt; t n , the function H t n has no zeros in the lower half-plane. Thus we can define holomorphic functions F n on the lower half-plane by the formula</p><p>with the branch of the logarithm chosen so that F n (-i&#954;) = 0. From <ref type="bibr">(7)</ref>, we see that F n are uniformly bounded on any compact subset of the lower half-plane. Thus, by Montel's theorem (see [24, Section 3.2]), we may pass to a subsequence and assume that F n converge locally uniformly to a holomorphic function F on the lower half-plane; since F n all vanish on -i&#954;, F does also. Then by the Cauchy integral formula, the derivatives</p><p>converge locally uniformly to F . Comparing this with (9), we conclude that</p><p>whenever the imaginary part of z is sufficiently large and negative. By unique continuation, we thus have F (z) = 1 4 for all z in the lower half-plane; as F vanishes on -i&#954;, we thus have</p><p>on the lower half-plane. Since F n converges locally uniformly to F, we conclude that</p><p>54) uniformly for z in a compact subset of the lower half-plane. Similarly, since F n converges locally to F, we have</p><p>uniformly for z in a compact subset of the lower half-plane. Let &#948; &gt; 0 be a small constant. As in the proof of (48), we can use the argument principle (and a rescaling) to write</p><p>where &#915; I,n , &#915; I I,n , &#915; I I I,n trace the line segments from 0 to -i&#948;, from -i&#948; to &#945; n -i&#948; and from &#945; n -i&#948; to &#945; n , respectively. By (55), the contribution of the &#915; I I,n integral is &#945;+o n&#8594;&#8734; (1)+O(&#948;) 4&#960; log 2 + T n (we allow the decay rate in the o n&#8594;&#8734; (1) errors to depend on &#948;). Applying the Jensen formula argument used to prove (48), we see that the contribution of the &#915; I,n integral is bounded in magnitude by</p><p>where</p><p>and the phase &#952; n is chosen so that e i&#952; n H t n (T n -i&#948; log + T n ) is real and positive. Applying (54) (and the functional equation</p><p>say), and (7) (and the functional equation) otherwise, we conclude that the &#915; I,n integral is equal to</p><p>We have this similarly for the &#915; I I I,n integral. Taking &#948; to be sufficiently small and n sufficiently large, we contradict (53).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Dynamics of zeros</head><p>As remarked in Section 1, the functions H t solve a backward heat equation. As worked out in <ref type="bibr">[11]</ref>, this induces a corresponding dynamics on the zeros x j of H t . THEOREM 11 (Dynamics of zeros). For &#923; &lt; t 0, the zeros x j (t) depend in a continuously differentiable fashion on t for each j, with the equations of motion</p><p>for k &#8712; Z * and &#923; &lt; t 0, where recall that the tick denotes principal value summation over j &#8712; Z * (which will converge thanks to (50) and ( <ref type="formula">43</ref>)).</p><p>Proof. This follows from <ref type="bibr">[11,</ref><ref type="bibr">Lemma 2.4</ref>] (the continuity of the derivative following for instance from [11, Lemma 2.1]).</p><p>Informally, ODE (56) indicates that the zeros x k (t) will repel each other as one goes forward in time. On the other hand, if x k (t) are arranged (locally, at least) in an arithmetic progression, then ODE (56) suggests that the zeros will be in equilibrium. If x k are not arranged in an arithmetic progression, and instead have some fluctuation in the spacing between zeros, then heuristically ODE (56) suggests that the zeros would move away from the more densely spaced regions and towards more sparsely spaced regions, thus converging towards the equilibrium of an arithmetic progression. This is the intuition behind the convergence to local equilibrium mentioned in Section 1.</p><p>One can estimate the speed of this local convergence to equilibrium by the following heuristic calculation. Consider the zeros in a region [T, T +&#945;] of space, where T &gt; 0 is large and &#945; is reasonably small (for example, &#945; = O(log + T )). From Theorem 9 (or (43) and ( <ref type="formula">50</ref>)), we see that we expect about &#945; 4&#960; log T zeros in this interval, with an average spacing of 4&#960; log + T . Suppose for the sake of informal discussion that there is some moderate fluctuation in this spacing, for instance, suppose that the left half of the interval contains about 1.5 &#945; 8&#960; log T zeros and the right half contains only about 0.5 &#945; 8&#960; log + T zeros. Then a back of the envelope calculation suggests that for x k (t) near the middle of this interval, the right-hand side of (56) would be positive and have magnitude</p><p>Since the length of the interval is &#945;, one may then predict that the time needed to relax to equilibrium is about &#945;/ log + T . Since we can evolve the flow for time |&#923;| 1, one would expect to attain equilibrium at the final time t = 0 if the initial length scale &#945; of the fluctuation obeys the bound &#945; = o T &#8594;&#8734; (log + T ). Happily, this upper bound is precisely what asymptotic (52) gives, so we heuristically expect to (barely) be able to establish local equilibrium at time t = 0.</p><p>Of course, one has to make this intuition more precise. Our strategy for doing so involves exploiting the formal gradient flow structure of ODE (56). (This strategy was loosely inspired by the work of Erd&#337;s, Schlein and Yau <ref type="bibr">[12]</ref> exploiting the Hamiltonian structure of Dyson Brownian motion to obtain local convergence to equilibrium since the equations for Dyson Brownian motion resemble that in (56) but with an additional Brownian motion term. Indeed, Dyson Brownian motion is the diffusion related to the Gibbs measure 1  Z e -&#946;H for the Hamiltonian studied here.) Indeed, one may formally write (56) as the gradient flow</p><p>where H is the formal 'Hamiltonian' H((x j ) j&#8712;Z * ) := j,k&#8712;Z * : j =k log 1</p><p>, where we ignore for this nonrigorous discussion the fact that the series defining H is not absolutely convergent. The Hamiltonian is convex, so one expects the quantity H(t) := H((x j (t)) j&#8712;Z * ) = j,k&#8712;Z * : j =k H jk (t)</p><p>to be decreasing and convex in time, and for the state (x j (t)) j&#8712;Z * to converge to a critical point of the Hamiltonian, where</p><p>denotes the Hamiltonian interaction between x j (t) and x k (t). Indeed, a formal calculation using (56) yields the identity</p><p>where E is the 'energy'</p><p>denotes the 'interaction energy' between x k (t) and x k (t), and we once again ignore the issue that the series is not absolutely convergent. A further formal calculation using (56) again eventually yields</p><p>suggesting that H(t) and E(t) are decreasing and that H(t) is convex, as claimed.</p><p>In order to deal with the divergence of the infinite series appearing above, we will need to truncate the Hamiltonian and energy before differentiating them. The following lemma records some of the identities that arise when doing such truncations.</p><p>LEMMA 12 (Identities). For brevity, we suppress explicit dependence on the time parameter t &#8712; (&#923;, 0]. Let K &#8834; Z * be a finite set of some cardinality |K |. All summation indices such as i, j, k are assumed to lie in Z * .</p><p>(i) (Dynamics of a gap, cf. [11, Lemma 2.4]) If j, k &#8712; Z * are distinct, then</p><p>.</p><p>(ii) (Cross-energy inequality, cf. [11, Lemma 2.5]) One has</p><p>in the weak sense that k&#8712;K ; j &#8712;K E jk (t 2 ) -E jk (t 1 ) -</p><p>(iv) (Virial identity) One has</p><p>(The terminology here is in analogy with the virial identity in N -body classical gravitational physics; see for example, [27, Exercise 1.48].)</p><p>A key point in identities (iii), (iv) and (v) is that if one ignores the 'cross terms' involving interactions between indices in K (representing some 'local subsystem' of particles) and indices outside of K (representing the 'environment' that subsystem interacts with), the right-hand side has a definite sign (negative in the case of (iii) and (v) and positive in the case of (iv)). This gives a number of useful 'monotonicity formulae' as long as cross terms are under control. As discussed above, many of these various monotonicity formulae reflect the formal convexity properties of the Hamiltonian H. With more effort, one can obtain a precise formula for the defect in the inequality in (ii); see <ref type="bibr">[11,</ref><ref type="bibr">Lemma 2.5]</ref>.</p><p>Proof. From (56), one has</p><p>which gives (i). Note that the series is now absolutely convergent thanks to (43) and ( <ref type="formula">50</ref>). Now we prove (ii). By monotone convergence, it suffices to show that</p><p>for all &#923; &lt; t 1 t 2 0 and all sufficiently large R. By the fundamental theorem of calculus, it suffices to show that</p><p>We can expand the left-hand side as</p><p>and so it will suffice to show that</p><p>If R is large enough that [-R, R] Z * contains k, we can split this sum into three parts, depending on whether</p><p>The contribution of the case i &#8712; K can be rewritten as</p><p>after symmetrizing in k and k , which is clearly non-negative. Similarly the contribution of the case i &#8712;</p><p>which is also clearly non-negative. Finally, for i &#8712; [-R, R] Z * , all summands are already non-negative. This gives (ii).</p><p>For (iii), we can similarly expand the left-hand side as</p><p>which by (i) becomes</p><p>To prove (iii), it thus suffices to establish the identity</p><p>The left-hand side expands as</p><p>.</p><p>The final sum can be rewritten as</p><p>The denominator is a Vandermonde determinant and is totally antisymmetric in k, k , k , k . All the monomials appearing in the numerator disappear upon antisymmetrization, so the final sum vanishes. To conclude the proof of (iii), it suffices to show that</p><p>The difference between the left-hand and right-hand sides can be written as</p><p>The denominator is totally symmetric in k, k , k , while the numerator symmetrizes to zero, giving the claim. Now we prove (iv). The left-hand side expands as</p><p>which by (i) becomes</p><p>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>It will thus suffice to show that</head><p>But the left-hand side can be written as</p><p>The denominator is totally antisymmetric in k, k , k . The numerator antisymmetrizes to -(</p><p>Finally we prove (v). The left-hand side expands as</p><p>It thus suffices to show that the expression</p><p>vanishes. But the summand antisymmetrizes to zero, giving the claim.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">A weak bound on gaps</head><p>In order to analyse (truncated versions of) the Hamiltonian H(t) = j =k H jk (t), we will need some upper bounds on the individual terms H jk (t). It was shown in <ref type="bibr">[11,</ref> Corollary 1] that these quantities are finite (that is, the zeros are simple) when &#923; &lt; t 0. It turns out that by refining the analysis in <ref type="bibr">[11]</ref> (and by narrowing the range of times t to the region &#923;/2 t 0), one can establish a more quantitative lower bound.</p><p>PROPOSITION 13 (Lower bound on gaps). For any j &#8712; Z * and any &#923;/2 t 0, one has max</p><p>The bound in (59) is probably not optimal, but for our application any bound that grows more slowly than (say) | j| 0.1 as j &#8594; &#8734; would suffice.</p><p>To prove this proposition, we first need the following variant of a result in <ref type="bibr">[11]</ref>.</p><p>LEMMA 14. Let K be a finite subset of Z * of cardinality |K | 2, and let &#923;/2 t 0.</p><p>.</p><p>Informally, this lemma asserts that the gaps within K cannot be too small, unless there is also a small gap between an element of K and an element outside of K . The strategy will be to iterate this observation to show that a very small gap will therefore propagate until it contradicts (52).</p><p>Proof. Let A = A(t) and B = B(t) denote the functions</p><p>The function A(t) is continuously differentiable. The corresponding claim for B(t) is not obvious; however, the sum defining B(t) is uniformly convergent (thanks to (51)) and hence B(t) is at least continuous. From Lemma 12(ii), we have the lower bound</p><p>(cf. <ref type="bibr">[11,</ref><ref type="bibr">Lemma 2.5]</ref>) in the weak sense for &#923; &lt; t 0. In particular, if there exists a time &#923; &lt; t -&lt; t such that sup</p><p>which rearranges as</p><p>.</p><p>By continuity, we conclude that B(t ) cannot attain or exceed the value 2B(t) anywhere in the interval (-&#923;, t] &#8745; (t -1 8B(t) , t), that is to say that</p><p>By hypothesis, this is a range of size at least</p><p>.</p><p>On the other hand, for t in the above range, we see from Lemma 12(iv) that</p><p>and hence by Gronwall's inequality, one has</p><p>giving the claim. Now we fix a time &#923;/2 t 0 and drop the dependence on t. For any finite set</p><p>and so from the above lemma, we have</p><p>In particular, if &#948;(K ) c|K | -5/2 for a sufficiently small absolute constant c &gt; 0, then we have</p><p>and hence by the pigeonhole principle, there exists k &#8712; K such that</p><p>From ( <ref type="formula">52</ref>) and (58), we have We conclude that if &#948;(K ) c|K | -3 for a sufficiently small c &gt; 0, then there exists k &#8712; K such that</p><p>or equivalently min</p><p>and thus (assuming that &#948;(K ) c|K | -3 ) we have</p><p>In either case, we call K an enlargement of K . Now we can prove Proposition 13. By symmetry, we may assume j is positive. We can also assume j is large, as the claim follows from compactness for bounded j. As before, we suppress the dependence on t. It thus suffices to show that log 1</p><p>(log 2 j) log log j for large positive j. By iterating (60) at most log j times starting from the interval K 1 := [ j, j + 1] Z * , we can find a sequence</p><p>+ &#958; j with the following properties:</p><p>Since |K i | r + 1 log 2 + &#958; j log 2 j and k +,i j + r j, we have from property (i) that &#948;(K i+1 ) j log 2 j&#948;(K i )</p><p>for all 1 i &lt; r , and hence &#948;(K r ) exp(O(log 2 j log log j))&#948;(K 1 ).</p><p>On the other hand, from property (ii), using the bound |K r | r + 1 log 2 &#958; j in the first case and (52) and the pigeonhole principle in the second case, we have &#948;(K r ) log -6 &#958; j log -6 j.</p><p>Combining the two estimates, we obtain the claim.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">A weak bound on integrated energy</head><p>In addition to truncations of the Hamiltonian, we will also need to control truncations of the energy j =k E jk (t). Although Proposition 13 provides some control on the summands here, it is too weak for our purposes (being of worse than polynomial growth in j, k), and we will need the following integrated bound that, while still weak, is at least of polynomial growth.</p><p>PROPOSITION 15 (Weak bound on integrated energy). Let J &gt; 0. Then</p><p>We will use this bound to justify an interchange of a derivative and an infinite series summation in the next section.</p><p>Proof. We may take J to be large, as the claim is trivial for J in the compact region J = O(1). For any discrete interval I , let Q I denote the quantity</p><p>From (52), we have a crude lower bound</p><p>while from Proposition 13 we have an extremely crude upper bound</p><p>The ratio between Q [0.5J,3J ] Z * and Q [J,2J ] Z * is thus less than (1+ J -0.1 ) 0.5J/J 0.1 . By the pigeonhole principle, we can then therefore find an interval</p><p>where K := [J --J 0.1 , J + + J 0.1 ] Z * is a slight enlargement of K . Next, we apply Lemma 12(v) and use the fundamental theorem of calculus to obtain the identity</p><p>dt.</p><p>From Proposition 13, the left-hand side is O(J 2 log O(1) J ); thus</p><p>dt.</p><p>Using ab a 2 + b 2 , we thus have</p><p>Using (52), the contribution to the integral of those j outside of K may be crudely bounded by O(J 2 log O(1) J ) (in fact, one can improve this bound to O(J log O(1) J ) if desired, although this will not help us significantly here). The contribution of those j inside K may be bounded by</p><p>thanks to (61). We conclude that</p><p>, and the claim follows.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Strong control on integrated energy</head><p>As discussed previously, the strategy to establish convergence to local equilibrium is to study (a suitable variant of) the formal Hamiltonian</p><p>terms of use, available at <ref type="url">https://www.cambridge.org/core/terms</ref>. <ref type="url">https://doi.org/10.1017/fmp.2020.6</ref> Downloaded from <ref type="url">https://www.cambridge.org/core</ref>. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core and its derivatives, with the intention of controlling (suitable variants of) integrated energies such as 0 &#923;/4 j,k&#8712;Z * : j =k E jk (t) dt.</p><p>Unfortunately, even with the bound just obtained in Proposition 13, the above expression is far from being absolutely convergent. To address this issue, we need to mollify and renormalize the Hamiltonian and the energy in a number of ways. We renormalize the inverse square function x &#8594; 1 |x| 2 for x = 0 that appears in the definition of the energy interactions E jk (t) by introducing the modified potential</p><p>x 2 is convex, V is non-negative, and one can verify the asymptotics</p><p>(62) For any distinct j, k and any &#923;/2 t 0, we define the renormalization</p><p>of the interaction energy E jk (t); we observe that</p><p>For any discrete interval I &#8834; Z * , we define the renormalized energy</p><p>this is clearly a non-negative quantity that is nondecreasing in I . It can also be simplified up to negligible error as follows.</p><p>LEMMA 16. If I = [I -, I + ] Z * is a discrete interval and &#923;/2 t 0, then</p><p>Proof. By symmetry and the triangle inequality, we may assume without loss of generality that 0 I -I + ; we may then assume that I + is large, as the claim is trivial for I + in the compact region I + = O(1). By (63), it suffices to show that j,k&#8712;I : j =k</p><p>We may desymmetrize the left-hand side as</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>By (50), it thus suffices to show that</head><p>Consider the inner sum k&#8712;I : k = j 1 (&#958; k -&#958; j ) 3 . From (44), we see that the contribution to this inner sum of those k with |k -j|</p><p>. For the remaining range |k -j| &lt;<ref type="foot">foot_1</ref> 2 j, we can use (45) to estimate</p><p>and so on summing we obtain</p><p>As k &#8594; 1 k-j is odd around j, the sum on the right-hand side can be estimated as O( THEOREM 17. For any T &gt; 0, one has</p><p>The remainder of this section is devoted to a proof of Theorem 17. The claim is trivial for T in any compact region T = O(1), so we may assume without loss of generality that T is large. Recall the notation X Y or X = &#213;(Y ) for X Y log O (1) T introduced in the notation section of the paper; this will be convenient to use in the argument that follows. (Typically, when we use this notation, we will also have some sort of power gain T -c that will safely absorb all the log O(1) T factors.) Let &#968; T : Z * &#8594; R + be the weight function</p><p>This is a smooth positive weight that is mostly localized to the region j = O(T log T ) and fairly rapidly decaying away from this region. We introduce the smoothly truncated renormalized energy</p><p>for &#923;/2 t 0. This is clearly non-negative, and from Proposition 15, (66), (62) and Fubini's theorem, we see that &#7868;T is absolutely integrable in time (in particular, it is finite for almost every &#923;/2 t 0). Since E jk are non-negative, we see from (66) that to prove (65) it will suffice to show that 0</p><p>We have an analogue of Lemma 16.</p><p>LEMMA 18. For almost every &#923;/2 t 0, one has</p><p>Proof. For almost every t, one sees from Proposition 15, (66) and Fubini's theorem (and (51)) that the series</p><p>is absolutely convergent. Thus, by Fubini's theorem and (63), it will suffice to show that j,k&#8712;Z * :</p><p>We may desymmetrize the left-hand side (again using Fubini's theorem) as</p><p>and so it will suffice to establish the bound</p><p>As in the proof of Lemma 16, we see from (44) that the contribution of those k with |k -j| 1 2 j is acceptable. For the remaining range |k -j| &lt; 1 2 j, we again use (45) to estimate</p><p>and similarly</p><p>and the claim follows by direct computation using the fact that k &#8594; 1 k-j is odd around j.</p><p>Recall that two indices j, k &#8712; Z * are said to be nearby, and we write j</p><p>This is clearly a symmetric relation.</p><p>Next, for &#923;/2 t 0, we define the smoothly truncated renormalized Hamiltonian</p><p>From (66), Proposition 13 and (45), we see that the sum here is absolutely convergent for every &#923;/2 t 0. We can also express it in terms of nonnegative quantities plus a small error, in a manner similar to Lemma 18, as follows. We first introduce the renormalization</p><p>of the logarithm function x &#8594; log 1 |x| ; this is a convex non-negative function on R\{0} that vanishes precisely when |x| = 1 and obeys the asymptotics</p><p>(70) For any &#923;/2 t 0 and distinct j, k &#8712; Z * , we define the normalization</p><p>of the Hamiltonian interaction H jk (t); this is symmetric in j, k and non-negative, vanishing precisely when x k (t) -x j (t) = &#958; k -&#958; j .</p><p>LEMMA 19. For every &#923;/2 t 0, one has</p><p>Proof. From (71), one has</p><p>so by (69) it suffices to show that j,k&#8712;Z * : j&#8764; T k</p><p>Note from (43), (45), ( <ref type="formula">51</ref>) and (66) that the sum here is absolutely convergent. Desymmetrizing, it suffices to show that The inner sum can be crudely bounded by &#213;(1) for all j thanks to (66) and (45). By (43), ( <ref type="formula">50</ref>) and (66), it thus suffices to show that</p><p>whenever T 0.5 | j| T 1.5 (say). For j &#8764; T k, one has &#968; T (k) = &#968; T ( j) + &#213;(T -0.8 ), and the contribution of the error term is acceptable by (45), so it suffices to show that</p><p>whenever | j| T 0.5 . But from (45), we have</p><p>As k &#8594; log &#958; j 4&#960; 1 j-k is odd around j and the set {k : j &#8764; T k} is very nearly symmetric around j, it is then easy to establish (73) as required.</p><p>In contrast to the non-normalized interaction H jk (t), the quantity Hjk (t) is well controlled when k and j are far apart.</p><p>LEMMA 20 (Long-range decay of Hjk ). Let j, k be distinct elements of Z * , and let t be in the range &#923;/2 t 0. There exists a quantity &#949;( j) that goes to zero as | j| &#8594; &#8734;, such that if |k -j| &#949;( j) -1 log 2 + &#958; j , then</p><p>, and if &#949;( j) log 2 + &#958; j |k -j| &#949;( j) -1 log 2 + &#958; j , one has the refinement</p><p>Finally, in the remaining region |k -j| &lt; &#949;( j) log </p><p>By symmetry, we can take j positive; we may also assume j to be large, as the bounded case j = O(1) may be treated by compactness. From (50), one then has</p><p>and from (44), one has</p><p>and hence</p><p>The claim then follows from (70). Next, suppose that &#949;( j) log 2 + &#958; j |k -j| &#949;( j) -1 log 2 + &#958; j . In this case, from (52) (iterated O(&#949;( j) -1 ) times) and (45), we have</p><p>while from (44) we continue to have (75), and hence</p><p>with the decay rate in the o j&#8594;&#8734; notation independent of the choice of function &#949;(). For &#949;( j) going to zero sufficiently slowly, the claim once again follows from (70). Finally, for the remaining case |k -j| &lt; &#949;( j) log 2 + &#958; j (which implies x k (t)x j (t) log 2 + j thanks to (52)), the claim follows from Proposition 13 and (70). </p><p>is moderately sized.</p><p>(ii) The quantity</p><p>is moderately sized.</p><p>(iii) For any absolute constants C, c &gt; 0, the expression</p><p>is negligible.</p><p>(iv) For any absolute constants C, c &gt; 0, the expression</p><p>We have this similarly if x i (t) are replaced by &#958; i throughout.</p><p>Proof. For brevity, we omit the explicit dependence on the time t. Also, all summation indices i, j, k are understood to range in Z * . From (44), we see that</p><p>for all j &#8712; Z * , and hence</p><p>From this and Lemma 16, we conclude (i). Using</p><p>we then obtain (ii). If instead we use</p><p>we obtain (iii) and (iv). We have this similarly if x i are replaced by &#958; i throughout.</p><p>We now have the following crucial derivative computation.</p><p>PROPOSITION 22. In the range &#923;/2 t 0, the function H T is absolutely continuous, and the derivative &#8706; t HT (t) is equal to -4 &#7868;T (t) plus negligible terms for almost all t. In other words, one has</p><p>for almost every t.</p><p>REMARK 23. This may be compared with Lemma 12(v) or indeed the formal identity (57). That the right-hand side is approximated in terms the renormalized energy, rather than just the energy, may be thought of heuristically as being a result of &#8706; t H vanishing when the zeros x j settle on an equilibrium, being spaced like the points &#958; j .</p><p>Proof. As before, we omit the explicit dependence on t, and all summation indices are understood to lie in Z * . By (56), we have</p><p>If we formally insert this into (69) and desymmetrize in j and k, we would obtain the identity</p><p>However, we need to justify the interchange of the derivative and the infinite summation. First, we use the fundamental theorem of calculus to rewrite (77) in integral form as</p><p>for any &#923;/2 t 0 0. Multiplying by &#968; T ( j)&#968; T (k), we conclude that</p><p>the dominated convergence theorem, we can interchange the outer sum and the integral as soon as we can show that the expression</p><p>dt is finite. By symmetry in j and k, it suffices to show that</p><p>is finite. But using (50) and (52), we can crudely bound</p><p>t)| (using the convention x 0 (t) = 0), so expression (79) may in turn be crudely bounded by and this will be finite thanks to Proposition 15 and (66). We conclude (after desymmetrizing in j and k) that</p><p>The above analysis also shows that the integrand is absolutely integrable in time.</p><p>From the Lebesgue differentiation theorem, we conclude that HT is absolutely continuous and that (78) holds at almost every time t.</p><p>To conclude the proof of the proposition, it will thus suffice to show that</p><p>is equal to &#7868;T plus negligible terms. We can split this expression as X 1 + X 2 + X 3 + X 4 , where</p><p>We first claim that X 4 is negligible. From (50), we have</p><p>From (44), we may crudely bound this sum by &#213;(1). By Lemma 21(iii), this shows that the contribution to X 4 of those k for which |k| T 0.9 or |k| T 1.1 (say) is negligible, so we may assume T 0.9 |k| T 1.1 . Let A 2 be a large constant. Using (44), we may write</p><p>For the first sum on the right-hand side, we use (45) (as in the proof of (74)) as well as (43) to conclude that</p><p>where the subscript in the O A notation means that the implied constant can depend on A.</p><p>Meanwhile, combining the i and -i terms and using ( <ref type="formula">43</ref>) and (44), we have</p><p>Sending A slowly to infinity, we conclude that</p><p>and the negligibility of X 4 then follows from Lemma 21(ii). Now we claim that X 2 is negligible. Thanks to the restrictions on i, j, k, we see that</p><p>and hence</p><p>symmetrizes to zero, and hence</p><p>and performing the i or j summation respectively, we conclude that</p><p>and so X 2 is negligible thanks to Lemma 21(i).</p><p>We have shown that expression (80) is equal to X 1 + X 3 plus negligible terms. A similar argument (replacing x i with &#958; i throughout) shows that the expression</p><p>is equal to X 1 + X 3 plus negligible terms, where</p><p>From Lemma 18, we see that &#7868;T is equal to</p><p>up to negligible terms. From ( <ref type="formula">43</ref>) and (44), we have</p><p>when j = k and j &#8764; T k, so the final term in (82) is negligible. Thus, to complete the proof of the proposition, it will suffice to show that expression (81) and the difference X 3 -X 3 are both negligible. Expression (81) may be rearranged as</p><p>By (44), both inner sums are &#213;(1), so the contribution of those |k| T 0.5 or |k| T 1.5 (say) is negligible. For T 0.5 &lt; |k| T 1.5 , we see from (72) that the factor j: j&#8764; T k &#968; T ( j) &#958; k -&#958; j is o T &#8594;&#8734; (log T ), and from (44) and (73) and the triangle inequality, we also see that i: i =k 1 &#958; k -&#958; i = O(log T ). Thus (81) is negligible as required.</p><p>Finally, we show that X 3 -X 3 is negligible. This quantity may be written as</p><p>Observe that if |k -j| and |k -i| are both larger than or equal to T 0.1 , then from (44) and ( <ref type="formula">50</ref>), one has</p><p>and so the contribution of this case is negligible. From the triangle inequality, we see that it is not possible for |k -j| and |k -i| to both be less than T 0.1 , so it remains to treat the components</p><p>Consider first (83). From the triangle inequality, we have | j -k| T 0.2 , and hence by (50),</p><p>By Lemma 21(ii) and (44), we may thus replace 1 x k -x j by 1 &#958; k -&#958; j at negligible cost in (83), leaving us with i, j,k: 0&lt;| j-k|&lt;(T 2 +| j|+|k|) 0.1 0&lt;|i-k|&lt;T 0.1</p><p>; |i-j|&gt;(T 2 +|i|+| j|) 0.1</p><p>up to negligible errors. But by (45) and the hypothesis |i -k| T 0.1 , one may bound</p><p>when T 0.9 |k| T 1.1 , and use the weaker bound</p><p>for all other k, so this expression is also negligible by Lemma 21(ii), (iii), (iv) (noting that &#968; T (k) and &#968; T (i) are comparable). A similar argument also handles (84).</p><p>To use Proposition 22, we need estimates that ensure &#7868;T is large when HT is large. To this end, we have the following lemma.</p><p>LEMMA 24. Let m be a natural number, and let &#923;/2 t 0. Let T &gt; 0, and let &#948; = &#948;(T ) go to zero as T &#8594; &#8734; sufficiently slowly. If HT (t) &#948;mT log 3  + T , then &#7868;T (t) &#948;2 2m T log 3 + T , where the implied constant is absolute.</p><p>Proof. As before, we suppress explicit dependence on t, and we may assume T to be large as the claim is trivial from compactness for T = O(1). From Lemma 19, we have (for &#948; decaying sufficiently slowly) that &#968; T ( j)&#968; T (k) Hjk (t) &#948;mT log 3 T.</p><p>But for j, k in this sum, we see from ( <ref type="formula">62</ref>) and (70) that</p><p>and the claim follows.</p><p>We can now shrink HT down to a reasonable size in finite time. Proof. We may take T to be large. From Proposition 22 and Lemma 24, we see that for any natural number m, and for almost every time t for which one has HT (t) &#948;mT log 3 T, one has &#8706; t HT (t) -c&#948;2 2m T log 3 T for some absolute constant c &gt; 0. In particular, if m is larger than some large absolute constant m 0 , and &#923;/2 t &#923;/4 is such that &#948;mT log 3 T HT (t) &#948;(m + 1)T log 3 T,</p><p>then it is not possible (for m 0 large enough) to have HT (t ) &#948;mT log 3 T for all t t t + c -1 2 -2m , as this would violate the fundamental theorem of calculus for absolutely continuous functions. Thus, by the intermediate value theorem, there exists t t t + c -1 2 -2m such that &#948;(m -1)T log 3 T HT (t ) &#948;mT log 3 T, and on iterating this we conclude (for m 0 large enough) that there exists t t t + 2c -1 2 -2m 0 such that HT (t ) &#948;m 0 T log 3 T.</p><p>We run this argument with t set equal to &#923;/2, and m the unique integer obeying (88), to conclude (for m 0 large enough) that there exists &#923;/2 t &#923;/4 obeying (89). (Note that this conclusion is immediate if the initial value of m was already less than m 0 .) On the other hand, from Proposition 22, we have &#8706; t HT (t) O(&#948;T log 3 T ) for almost every t t 0 if &#948; decays sufficiently slowly. The claim now follows from the fundamental theorem of calculus (absorbing m 0 into the implied constants), recalling that HT is non-negative. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="8.">Controlling the energy at time 0</head><p>In the previous section, we controlled a time average of the energy. Now, using monotonicity properties of the energy, we can in fact control energy at time zero. It remains to establish Proposition 27. We use an argument to Bourgain [2, Section 4] that combines local conservation laws (or, in this case, local monotonicity formulae) with the pigeonhole principle.</p><p>The first step is to locate a good subset of particles indexed by an interval close to [I -, I + ] that does not gain too much energy due to interactions with its environment because of the separation between these particles and the environment. From (50) and the pigeonhole principle, one can find natural numbers I - j --1 &lt; j -I -+ log 3 T I + -log 3 T j + &lt; j + + 1 I + such that x j -(t 2 ) -x j --1 (t 2 ) 1 log T (90) (say) and similarly</p><p>x j + +1 (t 2 ) -x j + (t 2 ) 1 log T .</p><p>From Lemma 12(iv) applied to K = { j --1, j -}, we have</p><p>for all t 1 t t 2 . Since t 2 -t 1 1 100 log 2 T , we conclude from the fundamental theorem of calculus and (90) that x j -(t) -x j --1 (t) 1 log T (91) for all t 1 t t 2 . Similarly</p><p>x j + +1 (t) -x j + (t)</p><p>The basic point is that because the particles x j -, . . . , x j + never get too close to the remaining particles x j , j &lt; j -and x j , j &gt; j + in the system, the total energy of the former set of particles will remain approximately conserved over short periods of time thanks to Lemma 12. More precisely, let K denote the discrete interval K := [ j -, j + ], and define the un-normalized energy</p><p>From Lemma 12, we have</p><p>for t 1 t t 2 . But from (50), ( <ref type="formula">91</ref>) and (92), we have</p><p>From the fundamental theorem of calculus, we conclude that E K (t 2 ) E K (t 1 ) + &#213;(1), which by monotonicity of E K in K implies that E I (t 2 ) E I (t 1 ) + &#213;(1).</p><p>Applying Lemma 16, we conclude that</p><p>But from (44), one has j&#8712;I \I k&#8712;I : j =k 1 (&#958; j -&#958; k ) 2 1, and Proposition 27 follows.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="9.">Contradicting pair correlation</head><p>It remains to see that Proposition 26 is in contradiction with results that are known to be the case for the points x j (0). Note in particular that</p><p>x j+1 (0) -x j (0) &#958; j+1 -&#958; j &#7868;[T log T,2T log T ] (0).</p><p>In this range using (43) and (45), we have &#958; j+1 -&#958; j &#8764; 4&#960;/ log + T , and so Proposition 26 implies that log 2 T T log T j, j+1 2T log T V</p><p>x j+1 (0) -x j (0) &#958; j+1 -&#958; j = o T &#8594;&#8734; (T log 3 T ).</p><p>By Markov's inequality (see <ref type="bibr">[28,</ref><ref type="bibr">Ch. 1]</ref>), this implies that In particular, since the points x j (0) are twice the imaginary ordinates of nontrivial zeros of the Riemann zeta function, this implies that the gaps between the zeros of the zeta function are rarely much larger or smaller than the mean spacing. But this contradicts perhaps most strikingly the results of Montgomery <ref type="bibr">[15]</ref>, who determined on the Riemann hypothesis the pair correlation measure for the zeros, measured against a class of band-limited functions. As noted by Montgomery, his result implies that a positive proportion of zeros have a spacing between them strictly smaller than the mean spacing. The proof of this claim is not written down in <ref type="bibr">[15]</ref>, but Conrey et al. prove as their main result of <ref type="bibr">[6]</ref> (using different ideas) that for any &#955; &gt; .77, there exists a constant c(&#955;) &gt; 0 such that at least a proportion c(&#955;) of j T log T satisfy x j+1 (0) -x j (0) &#955; 4&#960; log T .</p><p>This contradicts (93) and therefore the assumption that &#923; &lt; 0.</p></div><note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_0"><p>terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/fmp.2020.6 Downloaded from https://www.cambridge.org/core. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_1"><p>max(| j-I -|,|I + -j|)</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_2"><p>). Using this bound, we obtain (64). In this section, we will establish the following significant improvement to Proposition 15. terms of use, available at https://www.cambridge.org/core/terms. https://doi.org/10.1017/fmp.2020.6 Downloaded from https://www.cambridge.org/core. IP address: 107.190.7.212, on 25 Aug 2020 at 14:47:54, subject to the Cambridge Core</p></note>
		</body>
		</text>
</TEI>
