Wiki
Wiki

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 π(y)=Li(y)+OA(y(log⁡y)−A)\pi(y)=\mathrm{Li}(y)+O_A(y(\log y)^{-A}) for every fixed A>0A>0; see Terence Tao, 254A, Notes 2, Corollary 39 and Exercise 40. It is used for prime counts in cells of relative length L−SL^{-S} with A=S+2A=S+2, chosen after SS; 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, ∑p≤y1/p=log⁡log⁡y+M+O(1/log⁡y)\sum_{p\le y}1/p=\log\log y+M+O(1/\log y) and ∏p≤y(1−1/p)∼e−γE/log⁡y\prod_{p\le y}(1-1/p)\sim e^{-\gamma_E}/\log y; see Tao, 254A, Notes 1, Theorems 15 and 26. The Chebyshev bound ∑y<p≤2y1/p≪1/log⁡y\sum_{y<p\le2y}1/p\ll1/\log y, for y≥2y\ge2, follows already from π(2y)/y≪1/log⁡y\pi(2y)/y\ll1/\log y.
  • The Siegel–Walfisz theorem (the manuscript's Theorem 2.2): for fixed A,CA,C, uniformly for (a,r)=1(a,r)=1 and r≤(log⁡y)Cr\le(\log y)^C, π(y;r,a)=Li(y)/φ(r)+OA,C(y(log⁡y)−A)\pi(y;r,a)=\mathrm{Li}(y)/\varphi(r)+O_{A,C}(y(\log y)^{-A}), 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 HH, $\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 [exp⁡(Lc),xC0][\exp(L^c),x^{C_0}], every nonprincipal character of modulus at most LBL^B, primitive or not, and every twist up to LBL^B.

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 k≥0k\ge0,

∑n≤Yτ(n)kn≤∏p≤Y∑a≥0(a+1)kpa≤∏p≤Y(1+2kp+ckp2)≪k(log⁡2Y)2k,\sum_{n\le Y}\frac{\tau(n)^k}n\le\prod_{p\le Y}\sum_{a\ge0}\frac{(a+1)^k}{p^a} \le\prod_{p\le Y}\Bigl(1+\frac{2^k}p+\frac{c_k}{p^2}\Bigr)\ll_k(\log2Y)^{2^k},

by unique factorization and Mertens, and ∑n≤Yτ(n)k≤Y∑n≤Yτ(n)k/n\sum_{n\le Y}\tau(n)^k\le Y\sum_{n\le Y}\tau(n)^k/n. The consumed forms follow by Cauchy's inequality: ∑u≤2xτ(u)τ(2u−1)≪xLO(1)\sum_{u\le2x}\tau(u)\tau(2u-1)\ll xL^{O(1)} in the Type II absolute bound, ∑v≪xτ(v)τ(v+1)3≪xLO(1)\sum_{v\ll x}\tau(v)\tau(v+1)^3\ll xL^{O(1)} in its diagonal, the endpoint square sums with τ(z∗)4\tau(z_*)^4 in its separation step, and ∑r≍Ub(r)2≪ULO(1)\sum_{r\asymp U}b(r)^2\ll UL^{O(1)} for the Type I coefficients 0≤b(r)≤LO(1)τ(r)0\le b(r)\le L^{O(1)}\tau(r). The exponents depend only on kk and the fixed coefficient bounds, never on later precisions.

Fourier separation (the manuscript's Lemma 2.8). Let FF be smooth on Rb\mathbb R^b, bb fixed, supported in a fixed box, with jj-th derivatives Oj(LC(j+1))O_j(L^{C(j+1)}), with C≥1C\ge1 after enlargement if necessary. Integrating by parts jj times, ∣F^(ξ)∣≪jLC(j+1)(1+∣ξ∣)−j|\widehat F(\xi)|\ll_jL^{C(j+1)}(1+|\xi|)^{-j}. With j=b+1j=b+1 this gives ∫∣F^∣≪LC(b+2)\int|\widehat F|\ll L^{C(b+2)}, and for C′=2CC'=2C,

∫∣ξ∣>LC′∣F^(ξ)∣ dξ≪jLC(j+1)−C′(j−b)=L−Cj+C(2b+1),\int_{|\xi|>L^{C'}}|\widehat F(\xi)|\,d\xi\ll_jL^{C(j+1)-C'(j-b)} =L^{-Cj+C(2b+1)},

which is at most L−AL^{-A} once j≥2b+1+A/Cj\ge2b+1+A/C. So C′C' is fixed before the desired saving AA, as the Type II page requires. For a fixed smooth Ψ\Psi on [1,2][1,2], Mellin inversion $\Psi(y)=\frac1{2\pi}\int\widetilde\Psi(\tau) y^{i\tau}d\tau$ with Ψ~\widetilde\Psi the Fourier transform of Ψ∘exp⁡\Psi\circ\exp has ∫∣Ψ~∣<∞\int|\widetilde\Psi|<\infty; 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 hh-sum below. For the balanced-box remainders let d3(n)=#{(a,b,c)∈N3:abc=n}d_3(n)=\#\{(a,b,c)\in\mathbb N^3:abc=n\}. At each prime power d3(pa)=(a+22)≥3d_3(p^a)=\binom{a+2}{2}\ge3 for a≥1a\ge1, hence 3ω(n)≤d3(n)3^{\omega(n)}\le d_3(n) and

∑n≤D3ω(n)≤∑ab≤D⌊Dab⌋≤D(∑a≤D1a)2≤D(1+log⁡D)2.\sum_{n\le D}3^{\omega(n)}\le\sum_{ab\le D}\left\lfloor\frac D{ab}\right\rfloor \le D\left(\sum_{a\le D}\frac1a\right)^2 \le D(1+\log D)^2.

In particular both ∑d≤Dν(d)/d\sum_{d\le D}\nu(d)/d and D−1∑d≤Dν(d)D^{-1}\sum_{d\le D}\nu(d) are O(D(1+log⁡D)2)O(D(1+\log D)^2) whenever 0≤ν(d)≤d 3ω(d)0\le\nu(d)\le d\,3^{\omega(d)}, 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 ϑ<1/2\vartheta<1/2 and D>0D>0. After extracting the first slot p∈Q0p\in\mathcal Q_0 of band 00, A(u)=∑pr=ub(r)A(u)=\sum_{pr=u}b(r) with 0≤b(r)≤Lcbτ(r)0\le b(r)\le L^{c_b}\tau(r), cbc_b depending only on the candidate. As Q0⊂[xc1s′,xc2s′]\mathcal Q_0\subset[x^{c_1s'},x^{c_2s'}] and c2s′<1/4c_2s'<1/4, every contributing dyad pair p≍Pp\asymp P, r≍Ur\asymp U has PU≍xPU\asymp x and xa0≪P,U≪x1−a0x^{a_0}\ll P,U\ll x^{1-a_0} with a0=c1s′a_0=c_1s'. A nonprincipal character modulo squarefree odd d=hfd=hf is the primitive χ∗ mod f>1\chi^*\bmod f>1 together with coprimality to hh, and φ(d)=φ(h)φ(f)\varphi(d)=\varphi(h)\varphi(f).

Fix c′c' large enough, in terms of the early candidate choices, that the divisor moments give both ∑r≍Ub(r)≪ULc′\sum_{r\asymp U}b(r)\ll UL^{c'} and ∑r≍Ub(r)2≪ULc′\sum_{r\asymp U}b(r)^2\ll UL^{c'}. The parameter c′c' precedes D,C′D,C' and all proxy choices.

Large conductors. For R/2<f≤RR/2<f\le R with R>LC′R>L^{C'}, separate Ψ(pr/x)\Psi(pr/x) by Mellin inversion. For each τ\tau put ap=1(p,h)=1piτa_p=\mathbf 1_{(p,h)=1}p^{i\tau} on the dyad and br′=b(r)1(r,h)=1riτb'_r=b(r)\mathbf 1_{(r,h)=1}r^{i\tau}. Since 1/φ(f)≤(2/R)f/φ(f)1/\varphi(f)\le(2/R)f/\varphi(f), Cauchy's inequality and the large sieve give

∑R/2<f≤R1φ(f)∑χ mod f∗∣∑papχ(p)∣∣∑rbr′χ(r)∣≪1R((P+1+R2)P⋅(U+1+R2)ULc′)1/2,\sum_{R/2<f\le R}\frac1{\varphi(f)}\sum^*_{\chi\bmod f} \Bigl|\sum_pa_p\chi(p)\Bigr|\Bigl|\sum_rb'_r\chi(r)\Bigr| \ll\frac1R\bigl((P+1+R^2)P\cdot(U+1+R^2)UL^{c'}\bigr)^{1/2},

with c′c' from the divisor moments. With PU≍xPU\asymp x this is ≪xLc′/2(R−1+P−1/2+U−1/2+R/x)\ll xL^{c'/2}(R^{-1}+P^{-1/2}+U^{-1/2}+R/\sqrt x). Summing over the O(L)O(L) dyadic R∈(LC′,xϑ]R\in(L^{C'},x^\vartheta], over squarefree h≤xϑh\le x^\vartheta with weight 1/φ(h)1/\varphi(h) (total O(L)O(L)), over the O(L2)O(L^2) dyad pairs and over τ\tau against ∣Ψ~∣|\widetilde\Psi| gives xLc′/2+4(L−C′+x−a0/2+xϑ−1/2)xL^{c'/2+4}(L^{-C'}+x^{-a_0/2}+x^{\vartheta-1/2}). Choose C′≥D+c′/2+4C'\ge D+c'/2+4; the restrictions (f,h)=1(f,h)=1 and squarefreeness of ff were dropped only to enlarge a sum of absolute values. Keeping hh squarefree makes its O(L)O(L) mass precisely the elementary sum proved above.

Small conductors. For 1<f≤LC′1<f\le L^{C'}, fix hh, χ∗\chi^* and rr. The primes p∣hp\mid h in Q0\mathcal Q_0 are at most ϑ/a0+1\vartheta/a_0+1 in number and cost ∑rb(r)≪x1−a0Lc′\sum_rb(r)\ll x^{1-a_0}L^{c'} per dyad pair. For the rest, partial summation against y↦Ψ(yr/x)y\mapsto\Psi(yr/x) on the dyad, whose total variation is O(1)O(1) including the two cutoffs, and the bound ∑p≤yχ∗(p)≪KyL−K\sum_{p\le y}\chi^*(p)\ll_KyL^{-K} give OK(PL−K)O_K(PL^{-K}). For completeness, log⁡y≍L\log y\asymp L at these endpoints, so f≤LC′≤(log⁡y)2C′+1f\le L^{C'}\le(\log y)^{2C'+1} eventually. Apply Siegel–Walfisz with accuracy K+C′+2K+C'+2 and sum over at most f≤LC′f\le L^{C'} reduced classes; the nonprincipal main terms cancel and the resulting bound is stronger than OK(yL−K)O_K(yL^{-K}). Thus the loss from residue classes is included. Summing over rr, the φ(f)\varphi(f) characters with weight 1/φ(f)1/\varphi(f), f≤LC′f\le L^{C'}, hh and dyads gives ≪xLc′+C′+3−K+x1−a0Lc′+C′+3\ll xL^{c'+C'+3-K}+x^{1-a_0}L^{c'+C'+3}. Choose K≥D+c′+C′+3K\ge D+c'+C'+3 after C′C'.

For the principal character, replacing its coprimality-restricted mass by XAX_A costs at most

XAmax⁡u≤2x, A(u)>0∑l∣u1l−1∑d′≤xμ2(d′)φ(d′)≪XALlog⁡LL−20L≪XAL−18.X_A\max_{u\le2x,\ A(u)>0} \sum_{l\mid u}\frac1{l-1} \sum_{d'\le x}\frac{\mu^2(d')}{\varphi(d')} \ll X_A\frac{L}{\log L}L^{-20}L \ll X_AL^{-18}.

Here ll is prime, every such ll is at least L20L^{20}, and the divisor sum over d′d' bounds the original sum with (d′,l)=1(d',l)=1 dropped. With the nonprincipal estimates this proves the Type I bound ∑d≤xϑ∣r(d)∣≪xL−D+XAL−18\sum_{d\le x^\vartheta}|r(d)|\ll xL^{-D}+X_AL^{-18} for odd squarefree dd. The order is DD, then C′C', then the Siegel–Walfisz exponent KK; none depends on κ\kappa beyond ϑ=1/2−κ/2<1/2\vartheta=1/2-\kappa/2<1/2, and none on SS.

Consumption by step

StepInputsParameters
Type II, absolute bounds and diagonaldivisor momentsk≤6k\le6
Type II, splitting and separationFourier separationb≤3b\le3, frequencies LO(1)L^{O(1)}
Type IMertens, Mellin, large sieve, divisor moments, Siegel–Walfiszϑ<1/2\vartheta<1/2, R≤xϑR\le x^\vartheta
Preliminary sieveblock sieve, Type I, Mertensz=xb1z=x^{b_1}, h=2⌊1/(40b1)⌋h=2\lfloor1/(40b_1)\rfloor
Proxy discrepancyblock sieve, Siegel–Walfiszz=Wz=W, h=2⌈T2⌉h=2\lceil T^2\rceil, r,∣t∣≤LBr,\lvert t\rvert\le L^B
Densities and (7.19)prime number theorem, Mertens, block sieveA=S+2A=S+2; z=xb1z=x^{b_1}
Composite subtractionType II, (7.17), block sieve, Type Iz=Wz=W, products below x1/2−κ+o(1)x^{1/2-\kappa+o(1)}
Balanced box(7.16), block sieve, lattice counts, candidate massh=2h=2, z=xθz=x^\theta
Candidate and final countprime number theorem, Mertens, Chebyshevband 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.