Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Section 2 inputs consumed by the successor extraction
This page records which estimates of Section 2 of the weighted-dilation manuscript the signed Type II estimate and the extraction of primes 2u-1 consume, at which parameters, and how each is supplied. It belongs to the elementary estimates of the smooth-successor route. The estimates are the manuscript's or classical; the inventory and the derivations are Plasma AI's. The E5 examination records refutation-failed relative to the stated classical premises, whose original proofs were unread. Its distinct whole-contract grade, examined on 2026-10-16 UTC, is PASS at those exact scopes and reading boundaries. The reconstruction of premise P checked the Section 2 inputs used inside P's own proof; that coverage is not relied on here, and the inputs of the extraction are listed separately.
Classical theorems used in standard form
These are classical theorems, used as stated and not re-derived. Their displayed statements in the cited sources supply the classical boundary; the derived inputs and applications below do not assume the rest of the weighted-dilation manuscript.
- The prime number theorem, in the form for every fixed ; see Terence Tao, 254A, Notes 2, Corollary 39 and Exercise 40. It is used for prime counts in cells of relative length with , chosen after ; for last-prime counts in the rough-integer densities; for the free slot of the candidate; and for the harmonic masses of bands and groups.
- Mertens' estimates, and ; see Tao, 254A, Notes 1, Theorems 15 and 26. The Chebyshev bound , for , follows already from .
- The Siegel–Walfisz theorem (the manuscript's Theorem 2.2): for fixed , uniformly for and , , with ineffective constants. Tao's Notes 2, Exercise 64, states its von Mangoldt form; removing prime powers and partial summation give this form, with arbitrarily large fixed logarithmic accuracy.
- The multiplicative large sieve (the manuscript's Theorem 2.3): for coefficients on an interval of length , $\sum_{f\le R}\frac f{\varphi(f)}\sum^*_{\chi\bmod f}|\sum a_n\chi(n)|^2 \ll(H+1+R^2)\sum|a_n|^2$. This is Montgomery and Vaughan, Multiplicative Number Theory II, Theorem 19.16, enlarging a real interval to consecutive integers, at a cost of at most one in its length.
- Decay of Fourier transforms of smooth compactly supported functions, by integration by parts.
Derived inputs
Harmonic character sums (the manuscript's Corollary 2.4) are derived from the Siegel–Walfisz theorem on the proxy-discrepancy page, uniformly for every interval in , every nonprincipal character of modulus at most , primitive or not, and every twist up to .
The block sieve (the manuscript's Lemma 2.9) is derived on the block-sieve page, with its five consumed instances checked.
Divisor moments (the manuscript's Lemma 2.5). For fixed ,
by unique factorization and Mertens, and . The consumed forms follow by Cauchy's inequality: in the Type II absolute bound, in its diagonal, the endpoint square sums with in its separation step, and for the Type I coefficients . The exponents depend only on and the fixed coefficient bounds, never on later precisions.
Fourier separation (the manuscript's Lemma 2.8). Let be smooth on , fixed, supported in a fixed box, with -th derivatives , with after enlargement if necessary. Integrating by parts times, . With this gives , and for ,
which is at most once . So is fixed before the desired saving , as the Type II page requires. For a fixed smooth on , Mellin inversion $\Psi(y)=\frac1{2\pi}\int\widetilde\Psi(\tau) y^{i\tau}d\tau$ with the Fourier transform of has ; this is the bounded integrated cost used in Type I.
Elementary sums. Positivity and the squarefree Euler product give $\sum_{d\le y}\mu^2(d)/\varphi(d)\le\prod_{p\le y}(1-1/p)^{-1} \ll\log(2y)$, used for the principal character in Type I and for the squarefree -sum below. For the balanced-box remainders let . At each prime power for , hence and
In particular both and are whenever , as in the balanced box.
The large sieve in Type I
The Type I proposition on the extraction page is the only consumer of the large sieve, which P does not use. Its application is checked here at the exact parameters. Fix and . After extracting the first slot of band , with , depending only on the candidate. As and , every contributing dyad pair , has and with . A nonprincipal character modulo squarefree odd is the primitive together with coprimality to , and .
Fix large enough, in terms of the early candidate choices, that the divisor moments give both and . The parameter precedes and all proxy choices.
Large conductors. For with , separate by Mellin inversion. For each put on the dyad and . Since , Cauchy's inequality and the large sieve give
with from the divisor moments. With this is . Summing over the dyadic , over squarefree with weight (total ), over the dyad pairs and over against gives . Choose ; the restrictions and squarefreeness of were dropped only to enlarge a sum of absolute values. Keeping squarefree makes its mass precisely the elementary sum proved above.
Small conductors. For , fix , and . The primes in are at most in number and cost per dyad pair. For the rest, partial summation against on the dyad, whose total variation is including the two cutoffs, and the bound give . For completeness, at these endpoints, so eventually. Apply Siegel–Walfisz with accuracy and sum over at most reduced classes; the nonprincipal main terms cancel and the resulting bound is stronger than . Thus the loss from residue classes is included. Summing over , the characters with weight , , and dyads gives . Choose after .
For the principal character, replacing its coprimality-restricted mass by costs at most
Here is prime, every such is at least , and the divisor sum over bounds the original sum with dropped. With the nonprincipal estimates this proves the Type I bound for odd squarefree . The order is , then , then the Siegel–Walfisz exponent ; none depends on beyond , and none on .
Consumption by step
| Step | Inputs | Parameters |
|---|---|---|
| Type II, absolute bounds and diagonal | divisor moments | |
| Type II, splitting and separation | Fourier separation | , frequencies |
| Type I | Mertens, Mellin, large sieve, divisor moments, Siegel–Walfisz | , |
| Preliminary sieve | block sieve, Type I, Mertens | , |
| Proxy discrepancy | block sieve, Siegel–Walfisz | , , |
| Densities and (7.19) | prime number theorem, Mertens, block sieve | ; |
| Composite subtraction | Type II, (7.17), block sieve, Type I | , products below |
| Balanced box | (7.16), block sieve, lattice counts, candidate mass | , |
| Candidate and final count | prime number theorem, Mertens, Chebyshev | band and group masses |
No step consumes the mean-square lemma (Lemma 2.6), the derivative tests (Lemma 2.7) or the rough-integer polynomial (Corollary 2.10); those enter only P's own proof.