bibkey: wang2026proportions authors: Biao Wang year: 2026 title: Proportions of the non-trivial zeros of the Riemann zeta function doi: null url: https://arxiv.org/abs/2609.24167v1 claim: Historical v1 reports a spectral correction and a three-point improvement for zero proportions; v2 was withdrawn on 6 October 2026. The retained finite identities are independently checked in Section 21, whose same-kernel analytic consumer uses Lamzouri’s energy estimate and supplies no full Weil positivity or FIB-to-zeta identification. strata_touched: [] license: citation-only triage: anchor
The September spectral correction to the zero-proportion method
Version status, checked 8 October 2026. arXiv:2609.24167v2, dated 6 October 2026, is withdrawn. The author’s comments field reads: “New method is need to obtain good improvement”. The theorem and lemma numbers below refer to the preserved v1 text, and its displayed mathematical claims retain that historical status. The new Section 21 gives its own finite proof and uses Lamzouri v2 §3 for the matching analytic energy. The trmdy source note records the stronger October proportions and their explicit computational proof assumptions.
This note records the incremental interface beyond the existing golden-observer research account. The inspected primary versions are Alpöge–Furman v2, submitted 19 August 2026; Lamzouri v2, submitted 8 September; and Wang v1, submitted 21 September. These are the version dates in their arXiv histories checked on 1 October 2026; their internal PDF dates differ. This is a review of statements and selected proof interfaces, without a full independent proof audit or a new Lean build.
The finite correction stated in Wang v1
Let be a nonempty finite multiset invariant under complex conjugation, including multiplicities. For real even supported in , with and , put using Fourier phase . Let be exactly the simple real elements of , and define
Here is positive semidefinite and , with when . With counting multiplicity and counting distinct elements, Wang v1 Proposition 2.1 states
The summands in are complex squares, not squared absolute values. For the self-adjoint finite operator , where , the inner product is linear in its first argument and , the exact identities are and . The total is real and nonnegative; individual summands need not be. Dropping recovers equations (2.4)–(2.5) of Lamzouri’s Proposition 2.1.
There is a necessary dimension condition when reusing this correction. The synthesis map gives and . Their nonzero spectra agree, but , so one cannot replace by in a different ambient dimension. The proof instead transports , for which , obtaining .
What controls the correction
Lemma 3.1 bounds when there are disjoint triples of simple real points, each with the sum of its three squared pair overlaps at least , where . For the Montgomery–Taylor density and kernel,
Lemma 3.2 gives, for , and ,
For zeta, the multiset is , with multiplicities. Its simple real points are exactly the simple critical zeros. Splitting their containing interval into cells of fixed length supplies the triples. The smoothing and pair-correlation estimate in Lemma 4.1 give the matching value of for this same multiset. The order is at fixed smoothing, then smoothing tends to zero. Lamzouri’s §3 removes the original pair-correlation weight by modifying the test functions; deleting that weight without this argument would not give the required unweighted sum.
The historical v1 Theorem 1.1 states the unconditional lower limiting proportions
where and . These are the paper’s stated values. The gain comes from controlling additional overlap information of the actual configuration. It does not exclude every off-line zero.
Reuse and the remaining FIB obligation
The project already contains the AF rank–trace port from upstream commit 3635e74826a4c1fcece7d1cd2b6fa75e43a00510; a new wrapper would repeat existing mathematics. Its inverse-fourth zero-tail bounds have a different purpose from asymptotics for . The latter require joint prime/zero correlation estimates, which are not supplied by an inverse-power tail bound.
Likewise, negative rational test functions from an off-line zero are already available under the module’s explicit ZeroData interface. The missing all-zero input is an independent lower bound for the prime-side energy of the same required tests, strong enough to rule out their negative margins. The source existence, test class and approximation/tail premises must be retained when applying those interfaces. None of the three reviewed proportion papers supplies this full positivity assertion.
There is a numerical connection worth keeping in its exact scope: equals the absolute contraction rate of a three-position FIB window. Wang obtains the constant from a three-point trigonometric compatibility estimate, not from a Zeckendorf address or its seam automaton. The identity of constants supplies no map from FIB branches to the actual zeta tests or their Gram overlaps.
An invertible change of test coordinates transports both the positive Gram metric and Weil matrix to and . For an independent family, the represented operator changes by similarity, while the form’s inertia is preserved. Thus a FIB rotation or nonunitary scale used solely as a coordinate change supplies no spectral gain. Selecting genuinely new test subspaces or controlling their overlaps could add information; it requires an explicit synthesis into the actual Weil test space and estimates for that same arithmetic realization. No such FIB identification is established here.
Scope of the often quoted two-moment ceiling
AF §7.2 restricts its approximately obstruction to configuration-wise valid bandwidth-one certificates with specified moment information. Its numerical argument includes hvalid, the interval-enclosure hypothesis EnclOK, and a derivative remainder. For the displayed regularity range it obtains a bound below ; the bare decimal is not a universal ceiling for every finite Weil or FIB method. The paper says the enclosure certificate at tag v1.0 is not Lean-kernel checked, and its configuration-averaging step is on paper. No external formal project was rebuilt in this review. Higher normalized moments or even a proportion-one conclusion also leave possible finite or zero-density exceptions; full RH requires the additional all-zero control described above.
Gaussian-localized short multipliers and the quadratic certificate
R. Arun Chandru, Quadratic deformations of reflected zeta-zero forms, DOI 10.5281/zenodo.22817955, §1.1, equations (1.4)–(1.9), pp.2–3, and §7, pp.14–15, states a uniform exclusion for a specified analytic deformation. This interface is used at paper level; its arithmetic proof has not been independently audited and has no new Lean certification here.
Use an even nonnegative fixed with and support in , where . Write , , and
Choosing the earlier density as identifies its kernel with this . The finite-multiset accounting above applies to the paper’s centered dyadic multiset
retaining multiplicities. Its original simple-critical Gram matrix gives the same clipped correction ; the zero eigenvalues and its original dimension remain part of that correction.
Fix a polynomial-length exponent with , and put
The coefficients may be arbitrary complex numbers depending on . The theorem uses the entire Gaussian multiplier from equation (1.6), with center and width . Let be its reflected finite operators and the original total zero count. Set
Equation (1.7) states, without an assumption on the zeros’ real parts,
The fixed profile, support and length exponents determine ; it is uniform over the coefficient vector. Equations (1.9) and (2.8) retain the original Gram correction and count budget, and give
for all sufficiently large , all such polynomials and every , including choices of depending on . Thus this entire class of Gaussian-localized short multipliers cannot increase that compensated quadratic counting lower bound. Its negative variation supplies no positive margin for the selected Robin source.
The Gaussian localization and fixed positive gap are part of the theorem. Section 7.3 leaves longer polynomials, different localizations or energies, and bounded nonlinear trace witnesses outside this exclusion. In particular it supplies no estimate for the fourth trace discussed above. No map from this deformation to the original complete or the required prime-side energies of the FIB negative tests has been established. Those signed comparisons remain unproved.
Sharp finite blocks and the same-configuration packing bound
The FIB-ATOM foundational volume, §§15–18 gives paper derivations of the local divisor-event Gram, the complete three-point energy envelope, fractional packing of overlapping principal blocks, and a quantitative approximation condition for the actual difference-kernel realization.
The underlying trace methods are classical. Wolkowicz–Styan, Bounds for eigenvalues using traces, Linear Algebra and its Applications 29 (1980), 471–506, give the mean/variance eigenvalue bounds; see the author-hosted paper. For a three-dimensional unit-diagonal PSD Gram, their upper-bound form specializes to , with . Applying the displayed clipped function, and retaining the original dimension, yields the sharp envelope Real equicorrelation matrices attain every value on this lower boundary. The volume proves the formula directly from the two trace identities.
Hansen–Pedersen, Jensen’s trace inequality in several variables, International Journal of Mathematics 14 (2003), 667–681, Theorem 2, equation (1), supplies the relevant convex trace compression. For a coordinate projection , use the unital pair with matrices . The complement contributes , giving . This application retains ; a contraction version requiring would have the wrong hypothesis. Consequently, nonnegative weights satisfying give when the actual three-point energies satisfy . Maximizing the last expression is a finite linear program for one fixed Gram. These are explicit finite specializations of the cited trace methods.
For Wang’s already displayed , one has , hence . The larger linear window therefore leaves that numerical input unchanged. Any improved asymptotic zero proportion requires a stronger lower bound for the normalized packing value of the same actual simple-critical configuration, together with its matching energy estimate.
The modular source also imposes a realization condition. Its Gram is rank two, whereas every Gram on distinct real points from a nonzero absolutely continuous Fourier density is strictly positive definite. The volume proves a positive approximation cost when a density lower bound and a distinguished-pair separation are fixed, and proves that the cost can tend to zero when the separation is removed. The arithmetic local model has not supplied those actual-zero approximation certificates.
Finally, the cyclic pair Gram of the two triplet wheels is identical at every modulus. All powers of that same matrix remain identical even where arithmetic three-point correlations differ. A higher spectral moment therefore requires a proved identification with the intended arithmetic observable. The separate cubic-theta comparison is recorded in the fixed-half-plane source note.
本仓对原三点证书的解析推论
This derivation retains Wang’s original kernel and supplies an explicit lower bound for the normalized packing value discussed above. Convex compression, consecutive-point averaging, and shifted-block counting are existing methods; the calculation below specializes them to Wang’s displayed three-point certificate. It is not a claim of a new general method or of the best current zero proportion. The stronger multi-point consumer in §19 of the main volume uses a different profile and matching certificate.
The imported analytic and kernel premises are Proposition 2.1 and Lemmas 3.2 and 4.1 of Biao Wang, arXiv:2609.24167v1. Consecutive-point, frame, and shifted-block methods also appear in the ainta manuscript and the later refined deduction. These sources supply the provenance of the averaging mechanism; the closed-form envelope and arithmetic evaluation below specialize it to Wang’s displayed certificate.
1. Source premises and notation
Put Wang’s real even probability density and Fourier kernel are Its three-point certificate states, for , Define , with For a unit-diagonal Gram block of off-diagonal energy at least , the finite spectral inequality gives .
The smooth densities supplied by Wang, with real and even, satisfy For their Fourier kernels ,
2. The exact lower convex envelope
Let The greatest convex minorant of on is It is nonnegative and decreasing.
To prove this, scale and set . Then The tangent condition , after division by the nonzero factor , becomes whose positive solution is . Define For , so has its unique maximum at . Hence the line through tangent to at lies below everywhere. The line joins with matching first derivative in a region where , proving convexity. Any other convex minorant is bounded above, on , by the chord connecting its endpoint values, which in turn is bounded above by this line; on , it is bounded above by . This proves maximality.
3. Exact finite span estimate
Let , , lie in an interval of length at most , and let . Put . For the consecutive triple spans one has Each point belongs to at most three such blocks. Convex compression, applied with weight , together with (1), therefore gives The middle step is Jensen’s inequality for ; the last uses that is decreasing. For retain the trivial bound ; do not evaluate the displayed quotient.
The same argument applies to the smooth kernel with a uniform error. Equation (2) implies that the sum of the three squared off-diagonal entries changes by at most . Thus each smooth triple has Consequently, This estimate is uniform over all real point configurations, including arbitrarily large triple spans. It is therefore legitimate to fix , take the zero-height limit, and only afterwards send .
4. The actual zero-counting consumer
Write For the actual multiset let , , and . Its simple real points occupy an interval of length at most For each fixed smooth source kernel the imported inequalities are and The squared energy is the source’s full complex-multiset energy. It is not the Frobenius energy of the simple-real-point Gram.
The baseline follows by discarding ; it ensures . Along any subsequence with , and Therefore (3) and (6), after , then , give the pressure For , the finite counting inequality yields There is exactly one satisfying equality. Indeed, and , so is strictly increasing. Also , , and , which ensure a sign change before one. Thus For the distinct-zero bound, apply its own finite inequality along a subsequence realizing its lower limit. Every accumulation point of is at least ; monotonicity of then gives One must not replace this argument by an unsupported finite relation between the distinct count and the actual simple count.
5. A strict rational improvement requiring no decimal root
The following elementary bounds are sufficient: For the first, write , Alternating-series estimates give and Thus and . For , use , since .
Since is increasing in and , and decreasing in , The exact difference in the last inequality is In particular, under the source premises, This is an explicit improvement of Wang v1’s particular fixed-cell consumer, not a new best bound after the later multi-point developments.
6. General span-envelope statement
For one fixed Gram kernel, fix integers and . Suppose every consecutive -point block of span has , where is decreasing. If is any nonnegative, decreasing, convex minorant of , then The proof is the same: weight each consecutive block by , and note that the sum of their spans is at most . For , retain without evaluating the displayed quotient.
When the same analytic source has baseline , this yields the pressure and , subject to the same approximation requirements. Nonnegativity and monotonic decrease of imply that is nondecreasing.
For the following comparison only, take to be the greatest convex minorant of . It weakly dominates every standard fixed-cell pigeonhole guarantee using that same local certificate. For each , the function is a decreasing convex minorant of . Hence After multiplication by and substitution , this is precisely the comparison with This comparison concerns the standard guarantee obtained from the number of cells. It does not assert dominance over a cell argument supplied with additional information about the actual distribution of points.
All these averaging identities are structural tools. Better current multi-point certificates, coupling their pressure correctly, and verifying the actual analytic interface are separate tasks. None of these proportion estimates proves RH.
The independently proved elementary consumer in Section 21
Section 21 of the finite-structure volume proves, for arbitrary real , Its two-dimensional circle-vector proof is independent of the historical v1 estimate . The constant is sharp when the parameter is allowed to vary, as the example , shows. No sharpness assertion is made for the fixed Montgomery–Taylor parameter. The proof also supplies the stated all-point and nonnegative-weight extensions.
The connection to the original kernel is the directly integrated identity Thus, for and , The identity holds at its removable singularities by continuity. This is a bound for the same specified kernel; an arbitrary probability-density Fourier kernel need not satisfy it.
The finite counting step is reproved in Section 21.6 using the self-adjoint reflected operator, its positive-inertia budget, and the scalar threshold function with . An additional primary formulation is Knausgård, arXiv:2610.08965v1, Lemma 2.1 and equation (5.1), with threshold . The proof keeps the original simple-real Gram dimension and obtains both finite counting inequalities displayed earlier in this note.
The actual energy estimate comes directly from Lamzouri v2, Lemma 3.2 and equations (3.3)–(3.4). It uses , with , , and convergence to in . The two fixed test functions and its second derivative give the unweighted complex-square energy after cancellation of the pair-correlation weight. For each fixed smoothing parameter, the energy divided by tends to , and as the smoothing is removed. These are the explicit analytic premises of the new consumer. Wang v1’s status is historical context for the finite estimate, rather than an additional unresolved premise of this proof.
Let be any accumulation point of the simple-critical ratio . Section 21 combines fixed-size consecutive windows, their exact point-use cost, and the order followed by smoothing removal to obtain Its unique threshold satisfies Consequently the paper-level consumer gives a simple-critical lower bound under the matching analytic input. Its distinct-zero consequence is , using a subsequence for the distinct count itself. The strict gain uses rational inequalities, independently of the displayed decimal root. The finite proof uses no local interval enumeration, and no new Lean verification is claimed here.
The updated comparison in the trmdy note records both the earlier nine-point conditional consumers and Knausgård’s stronger October preprint, with its fixed source revision and theorem-specific native_decide assumptions. The elementary Section 21 number is lower than those simple-critical figures. Its proof that three points are optimal concerns only the specified uniform-numerator, support-line, sliding-window family. It supplies no global priority result, no upper limit on other geometric methods, and no control of every zero required for RH.