- The paper proves that, for every fixed 0<α<1, at least 67.25% of zeros in a mesoscopic shrinking window are simple critical-line zeros, while 83.63% occupy distinct zero points overall.
- It combines low-height zero counts, zero-density estimates, finite Gabor-frame compression of Weil’s form, family moments, and an inertia-based rank–trace inequality without assuming the generalized Riemann hypothesis.
- The results apply to averages over all nonprincipal characters modulo a prime q, with approximately q(log q)^(1−α)/(2π) zeros in the window, while the endpoint α=1 remains unresolved because key error terms and the sampled dimension no longer diminish or diverge.
The setting and the main theorem
This paper establishes unconditional lower bounds for the proportion of simple and distinct zeros of Dirichlet L-functions in a height window that shrinks to zero in absolute terms while containing a diverging number of local mean spacings. Fix 0<α<1, let q→∞ through odd primes, put Q=logq, and consider the interval I=(Q−α,2Q−α]. In the normalized coordinate x=Qγ/(2π), this interval has length ≍Q1−α, so it contains ≍(logq)1−α mean spacings even though its physical ordinates tend to zero. Averaging without weights over the q−2 nonprincipal characters modulo q, the paper proves three family-level statements (2608.16034):
- 0<α<10, where 0<α<11 counts all nontrivial zeros in 0<α<12 with multiplicity;
- 0<α<13 and 0<α<14, where 0<α<15 counts simple critical-line zeros and 0<α<16 counts distinct critical-line zero points;
- 0<α<17, where 0<α<18 counts all distinct zero points with no location restriction.
The constants are
0<α<19
Two features distinguish these results from prior work on simple zeros of Dirichlet q→∞0-functions, such as pair-correlation and Levinson-type treatments [Chandee–Lee–Liu–Radziwiłł 2014; Conrey–Iwaniec–Soundararajan 2013; Wu 2016; Sono 2025]. First, they are unconditional: no generalized Riemann hypothesis is assumed anywhere. Second, they hold at shrinking height, a regime where classical low-lying techniques do not directly apply because the window is far below any fixed positive ordinate. The bounds are averaged over the full character family of one prime modulus; no assertion about an individual character follows.
Method overview
The proof combines four inputs, each established separately before assembly:
Denominator and exceptional set. The paper uses the Hiary–Zhao symmetric counting formula, averaged argument bound (q→∞1 for q→∞2), and zero-density estimate. An endpoint-safe extraction lemma shifts both endpoints of q→∞3 by a small q→∞4 chosen to avoid all zero ordinates, so no half-weight convention is needed. Family symmetry under q→∞5 then identifies the positive-ordinate count with half the symmetric count, yielding q→∞6. The two normalized remainders are q→∞7 and q→∞8, both vanishing precisely for fixed q→∞9 — this is where the restriction Q=logq0 first enters quantitatively.
A "bad" character is one possessing a zero with Q=logq1 and Q=logq2. Applying the Hiary–Zhao density estimate over logarithmically spaced shells in the real part, with the interval-length factor kept outside the power of Q=logq3, gives Q=logq4. This deletion bound is sharp enough that exceptional characters contribute negligibly to every subsequent ratio.
Gabor compression of Weil's form. For a smooth compactly supported window Q=logq5 with Q=logq6, the paper builds a finite Gabor frame: translates Q=logq7 on a lattice of spacing Q=logq8, restricted to centres Q=logq9 in a slightly shrunken interior I=(Q−α,2Q−α]0, giving dimension I=(Q−α,2Q−α]1. The matrix I=(Q−α,2Q−α]2 is the polarized Weil form evaluated on these test functions. A Poisson summation argument shows that the infinite lattice reproduces I=(Q−α,2Q−α]3 exactly (only the zero dual mode survives, since I=(Q−α,2Q−α]4), and finite-centre replacement errors are controlled by Schwartz decay envelopes plus exact character orthogonality, which holds because the prime cutoff I=(Q−α,2Q−α]5.
First and second moments. The first moment evaluates cleanly:
I=(Q−α,2Q−α]6
The prime side of the second moment splits into four orthogonality classes. Ratio terms force I=(Q−α,2Q−α]7 and produce the weighted sum I=(Q−α,2Q−α]8, evaluated via explicit PNT estimates (Johnston–Yang) as I=(Q−α,2Q−α]9, where x=Qγ/(2π)0. Same-sign terms require x=Qγ/(2π)1 with x=Qγ/(2π)2; the oscillatory integral over the common translate is bounded by x=Qγ/(2π)3, killing them. Mixed archimedean–prime terms vanish by full-family orthogonality, and principal-character bookkeeping terms are x=Qγ/(2π)4. The result is
x=Qγ/(2π)5
Inertia certificate and exterior tail. On the zero side, a critical-line zero of multiplicity x=Qγ/(2π)6 contributes a rank-one positive block x=Qγ/(2π)7, while an off-line functional-equation orbit contributes a Hermitian block with Sylvester index x=Qγ/(2π)8. A self-contained rank–trace inequality — proved via a Ky Fan prefix inequality and eigenvalue-by-eigenvalue comparison — yields, for x=Qγ/(2π)9,
≍Q1−α0
with the same bound serving distinct critical-line points. The exterior zero contribution ≍Q1−α1 (ordinates outside ≍Q1−α2) is removed in trace norm using individual Fourier decay of the sampled vectors: for good characters, ≍Q1−α3 for any preassigned ≍Q1−α4, with the near-line regime requiring ≍Q1−α5 and the far-line regime exploiting goodness via ≍Q1−α6. One fixed integer Schwartz order ≍Q1−α7 satisfies both tail conditions simultaneously because ≍Q1−α8 is fixed.
Variational optimization and the Montgomery–Taylor constant
The certificate coefficient depends on the window only through ≍Q1−α9. With ≍(logq)1−α0, minimizing ≍(logq)1−α1 leads to the Euler equation ≍(logq)1−α2, whose even solution is ≍(logq)1−α3. Global optimality follows from the identity ≍(logq)1−α4 for zero-mean ≍(logq)1−α5 together with an internal Dirichlet Wirtinger inequality, giving strict conditional convexity for ≍(logq)1−α6. Since ≍(logq)1−α7 is not compactly supported, admissibility is restored by smooth cutoffs converging to it. This yields
≍(logq)1−α8
and taking ≍(logq)1−α9 after the fixed-q−20 statement gives q−21 — the classical Montgomery–Taylor constant, here arising from a finite Gabor window rather than pair correlation. The distinct-point bound q−22 requires no new analysis; it is the exact combinatorial consequence that a multiple critical-line point contributes once to q−23 but its orbit contributes two points to q−24.
Limitations and open questions
The paper is explicit about the boundary of its method. All error estimates depend on the fixed auxiliary data, and none is uniform as q−25, q−26, or q−27; these limits are taken only after the corresponding fixed-parameter liminf is proved. The endpoint q−28 fails for structural reasons: the main family scale drops to q−29, so the q0 averaged-argument remainder and several normalized q1 moment errors cease to be little-oh; moreover the sampled dimension q2 no longer diverges, and the near-line shell estimate loses decay regardless of how large the fixed Schwartz order q3 is taken. The authors state plainly that their analysis neither proves nor disproves a corresponding fixed-normalized-window theorem at q4. Two further caveats bear on interpretation: the results are purely family-level, and the proof relies on the Hiary–Zhao low-height input and density estimate as external hypotheses, so any refinement of those estimates would propagate directly into this framework.
Conclusion
For every fixed q5, the mesoscopic window q6 contains q7 zeros of the prime-modulus Dirichlet family counted with multiplicity, of which at least the fraction q8 are simple critical-line zeros (and the same fraction of multiplicity-normalized mass sits at distinct critical-line points), while at least q9 of the mass sits at distinct zero points overall. The argument is unconditional, combines a low-height count and zero-density deletion with finite Gabor moments, trace-norm localization, and an inertia-based rank–trace certificate, and leaves the endpoint 0<α<100 as a clearly delineated open boundary of the method.