Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Rough-integer densities and the Buchstab identity


This page reconstructs Lemma 7.4 of the weighted-dilation manuscript for the extraction of primes 2u-1, as part of the elementary estimates of the smooth-successor route. The formulation and use of the estimates follow OpenAI; the densities and minimum-coordinate identity are classical Buchstab rough-number estimates (A. Buchstab, Mat. Sbornik 2(44) (1937), 1239–1246). The derivation and the range checks below are Plasma AI's. The E3 examination has a distinct PASS grade, examined on 2026-10-16 UTC, accepting refutation-failed at its stated classical-premise and parameter scopes. The grade retains the original-source reading limits and, for the weighted E3 consumer consequence, its Type II/P hypothesis. Notation is that of the proxy-discrepancy page: cells C=(Y,eΔY]C=(Y,e^\Delta Y] with Δ=L−S\Delta=L^{-S}, R(C)R(C) the number of WW-rough integers in CC, and cI(C)c_I(C) the proxy constant of a test II.

The densities

For w>γ>0w>\gamma>0 put Dγ(w)=∑l≥1Tl(γ,w)D_\gamma(w)=\sum_{l\ge1}T_l(\gamma,w), where T1(γ,w)=1/wT_1(\gamma,w)=1/w and, for l≥2l\ge2, with s(t)=t1+⋯+tl−1s(t)=t_1+\cdots+t_{l-1},

Tl(γ,w)=1l!∫Ωl(γ,w)1w−s(t)∏i<ldtiti,Ωl(γ,w)={t∈Rl−1:ti≥γ, s(t)≤w−γ}.T_l(\gamma,w)=\frac1{l!}\int_{\Omega_l(\gamma,w)}\frac1{w-s(t)} \prod_{i<l}\frac{dt_i}{t_i},\qquad \Omega_l(\gamma,w)=\{t\in\mathbb R^{l-1}:t_i\ge\gamma,\ s(t)\le w-\gamma\}.

This is the manuscript's (7.15). TlT_l vanishes unless lγ≤wl\gamma\le w, so the sum is finite. Writing tl=w−s(t)t_l=w-s(t), the ll-th term is 1/l!1/l! times the integral of ∏i≤lti−1\prod_{i\le l}t_i^{-1} over {t∈Rl:ti≥γ, ∑ti=w}\{t\in\mathbb R^l:t_i\ge\gamma,\ \sum t_i=w\} against dt1⋯dtl−1dt_1\cdots dt_{l-1}: ordered lists of ll prime logarithms, scaled by LL, with sum ww.

As a cross-check that the arguments below do not use, $D_\gamma(w)= \omega(w/\gamma)/\gamma$ for Buchstab's function ω\omega; for 2γ≤w≤3γ2\gamma\le w\le3\gamma both sides equal (1+log⁡(w/γ−1))/w(1+\log(w/\gamma-1))/w.

Continuity. For fixed b,ε>0b,\varepsilon>0 and wmax⁡w_{\max}, DD is jointly continuous on the compact set $K(b,\varepsilon,w_{\max})={(\gamma,w):\gamma\ge b,
\gamma+\varepsilon\le w\le w_{\max}}$, thresholds w=lγw=l\gamma included. Indeed only l≤wmax⁡/bl\le w_{\max}/b occur. On Ωl(γ,w)\Omega_l(\gamma,w) the integrand is at most b−lb^{-l}, since ti≥γt_i\ge\gamma and w−s(t)≥γw-s(t)\ge\gamma, and Ωl(γ,w)⊂[b,wmax⁡]l−1\Omega_l(\gamma,w)\subset[b,w_{\max}]^{l-1}. As (γ′,w′)→(γ,w)(\gamma',w')\to(\gamma,w) the integrand on Ωl(γ′,w′)\Omega_l(\gamma',w') converges to that on Ωl(γ,w)\Omega_l(\gamma,w) at every point off the hyperplanes ti=γt_i=\gamma and s(t)=w−γs(t)=w-\gamma, a null set, so dominated convergence gives continuity of each TlT_l; at w=lγw=l\gamma the domain shrinks to a point and Tl→0T_l\to0.

Counts in short cells

Fix the precision S≥1S\ge1, as in every consumed application. The prime number theorem with error OA(y(log⁡y)−A)O_A(y(\log y)^{-A}), used with A=S+2A=S+2, gives uniformly for yy with log⁡y≥c0L\log y\ge c_0L, c0>0c_0>0 fixed,

π(eΔy)−π(y)=Δylog⁡y(1+O(L−1)).\pi(e^\Delta y)-\pi(y)=\frac{\Delta y}{\log y}\bigl(1+O(L^{-1})\bigr).

The balanced prime proxy (7.16). Let 0<κ<1/500<\kappa<1/50. A cell meeting Bκ=[x1/2−2κ,x1/2+2κ]\mathcal B_\kappa=[x^{1/2-2\kappa},x^{1/2+2\kappa}] has w=log⁡Y/L∈[0.46−o(1),0.54]w=\log Y/L\in[0.46-o(1),0.54], so by the display and item 1 of the proxy-discrepancy proposition

cpr(C)=π(eΔY)−π(Y)R(C)=1+o(1)wL V(W)≤3LV(W)c_{\rm pr}(C)=\frac{\pi(e^\Delta Y)-\pi(Y)}{R(C)}=\frac{1+o(1)}{wL\,V(W)} \le\frac3{LV(W)}

for x≥x0(κ,S)x\ge x_0(\kappa,S). The constant 33 is absolute: it does not depend on κ\kappa or SS, which affect only x0x_0. This is the uniformity that the balanced constant CbalC_{\rm bal} of the extraction requires.

Rough counts (7.20). Fix b,ε>0b,\varepsilon>0 and wmax⁡w_{\max}. Uniformly for cells C=(Y,eΔY]C=(Y,e^\Delta Y] and exponents γ\gamma with (γ,log⁡Y/L)∈K(b,ε,wmax⁡)(\gamma,\log Y/L)\in K(b,\varepsilon,w_{\max}),

Nγ(C)=#{m∈C:P−(m)>xγ}≤(Dγ(w)+o(1))ΔYL,w=log⁡YL.N_\gamma(C)=\#\{m\in C:P^-(m)>x^\gamma\}\le\bigl(D_\gamma(w)+o(1)\bigr) \frac{\Delta Y}L,\qquad w=\frac{\log Y}L .

Proof. The integers of CC divisible by p2p^2 for some prime p>xγp>x^\gamma number at most ∑p>xγeΔY/p2≤3Yx−b=o(ΔY/L)\sum_{p>x^\gamma}e^\Delta Y/p^2\le3Yx^{-b}=o(\Delta Y/L). A squarefree m∈Cm\in C with P−(m)>xγP^-(m)>x^\gamma is a product of $l\le l_{\max}= \lfloor(w_{\max}+1)/b\rfloor$ distinct primes above xγx^\gamma, and its l!l! orderings give it total weight one when each ordered list carries weight 1/l!1/l!. Dropping distinctness only adds lists, so the squarefree count is at most ∑l≤lmax⁡Nl/l!\sum_{l\le l_{\max}}\mathcal N_l/l!, where Nl\mathcal N_l counts ordered ll-tuples of primes above xγx^\gamma with product in CC.

For l=1l=1, every prime of CC exceeds xγx^\gamma because w≥γ+εw\ge\gamma+\varepsilon, so N1=(1+O(L−1))ΔY/(wL)\mathcal N_1=(1+O(L^{-1}))\Delta Y/(wL), the term T1T_1. For l≥2l\ge2 fix p1,…,pl−1p_1,\dots,p_{l-1} with product QQ and ti=log⁡pi/Lt_i=\log p_i/L. A last prime exists only if eΔY/Q>xγe^\Delta Y/Q>x^\gamma, that is s(t)<w−γ+Δ/Ls(t)<w-\gamma+\Delta/L; then log⁡(Y/Q)=L(w−s(t))≥bL/2\log(Y/Q)=L(w-s(t))\ge bL/2, and the last prime lies in (Y/Q,eΔY/Q](Y/Q,e^\Delta Y/Q]. Dropping its lower cutoff and using the display,

Nl≤(1+O(L−1))ΔYL∫φ dμ⊗(l−1),φ(t)=1s(t)<w−γ+Δ/Lw−s(t),μ=∑xγ<p≤xwmax⁡1p δlog⁡p/L.\mathcal N_l\le\bigl(1+O(L^{-1})\bigr)\frac{\Delta Y}L \int\varphi\,d\mu^{\otimes(l-1)},\qquad \varphi(t)=\frac{\mathbf 1_{s(t)<w-\gamma+\Delta/L}}{w-s(t)},\qquad \mu=\sum_{x^\gamma<p\le x^{w_{\max}}}\frac1p\,\delta_{\log p/L}.

It remains to compare μ⊗(l−1)\mu^{\otimes(l-1)} with ν⊗(l−1)\nu^{\otimes(l-1)}, where ν=dt/t\nu=dt/t. By Mertens' estimate ∑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), every interval satisfies μ((a,a′])=ν((a,a′])+O(1/(bL))\mu((a,a'])=\nu((a,a'])+O(1/(bL)) for γ≤a<a′≤wmax⁡\gamma\le a<a'\le w_{\max}. Fix η>0\eta>0 and cover (γ,wmax⁡]l−1(\gamma,w_{\max}]^{l-1} by the cubes ∏i(γ+kiη,γ+(ki+1)η]\prod_i(\gamma+k_i\eta,\gamma+(k_i+1)\eta], truncating the last interval in each coordinate at wmax⁡w_{\max}. There are at most Nη=(wmax⁡/η+1)l−1N_\eta=(w_{\max}/\eta+1)^{l-1} of them. Each cube has μ⊗\mu^{\otimes}-measure equal to its ν⊗\nu^{\otimes}-measure up to Oη,b,l(1/L)O_{\eta,b,l}(1/L). Replace φ\varphi, which is at most 2/b2/b, by its supremum φ+\varphi^+ on each cube. Then

∫φ dμ⊗≤∫φ+dν⊗+Oη,b,l,wmax⁡(L−1).\int\varphi\,d\mu^{\otimes}\le\int\varphi^+d\nu^{\otimes} +O_{\eta,b,l,w_{\max}}(L^{-1}).

On cubes inside {s<w−γ+Δ/L}\{s<w-\gamma+\Delta/L\} the oscillation of 1/(w−s)1/(w-s) is at most 4(l−1)η/b24(l-1)\eta/b^2. The cubes meeting the hyperplane s=w−γ+Δ/Ls=w-\gamma+\Delta/L lie in a slab of width 2(l−1)η2(l-1)\eta, whose ν⊗\nu^{\otimes}-measure is Ob,l,wmax⁡(η)O_{b,l,w_{\max}}(\eta). The faces ti=γt_i=\gamma are cube faces, so they cause no boundary error. Finally the strip w−γ≤s<w−γ+Δ/Lw-\gamma\le s<w-\gamma+\Delta/L has ν⊗\nu^{\otimes}-measure Ob,l,wmax⁡(Δ/L)O_{b,l,w_{\max}}(\Delta/L). Hence

∫φ dμ⊗(l−1)≤l! Tl(γ,w)+O(η)+oη(1),\int\varphi\,d\mu^{\otimes(l-1)}\le l!\,T_l(\gamma,w)+O(\eta)+o_\eta(1),

uniformly on K(b,ε,wmax⁡)K(b,\varepsilon,w_{\max}). Here the constant in O(η)O(\eta) depends only on b,l,wmax⁡b,l,w_{\max}, and the oη(1)o_\eta(1) tends to zero uniformly once η\eta and SS have been fixed. For any desired error first choose a fixed η\eta, then let xx grow; this proves a uniform o(1)o(1) without interchanging the choices of SS and xx. □\square

The cofactor bound (7.17). Let b1≤γ<γ′≤1/2−κb_1\le\gamma<\gamma'\le1/2-\kappa be a bin. Suppose CC contains an integer m=N/pm=N/p with x≤N≤5xx\le N\le5x and pp a prime in (xγ,xγ′](x^\gamma,x^{\gamma'}]. With a=log⁡p/L∈(γ,γ′]a=\log p/L\in(\gamma,\gamma'],

w=log⁡YL=1−a+O(L−1),w−γ≥1−2γ′−O(L−1)≥2κ−O(L−1),w≤1−b1+log⁡5L≤1w=\frac{\log Y}L=1-a+O(L^{-1}),\qquad w-\gamma\ge1-2\gamma'-O(L^{-1}) \ge2\kappa-O(L^{-1}),\qquad w\le1-b_1+\frac{\log5}L\le1

for all sufficiently large xx. Thus (γ,w)(\gamma,w) lies in the compact set K(b1,κ,1)K(b_1,\kappa,1), where the rough-count bound holds uniformly and DD is uniformly continuous. Dividing by R(C)=(1+o(1))ΔYV(W)R(C)=(1+o(1))\Delta YV(W),

cγ(C)≤Dγ(w)+o(1)LV(W)≤sup⁡γ≤a≤γ′Dγ(1−a)+o(1)LV(W),c_\gamma(C)\le\frac{D_\gamma(w)+o(1)}{LV(W)} \le\frac{\sup_{\gamma\le a\le\gamma'}D_\gamma(1-a)+o(1)}{LV(W)},

uniformly over all such cells. This is (7.17) exactly at the consumed range. The only property of N=2u−1N=2u-1 used is x≤N≤5xx\le N\le5x, which also holds for 2u+12u+1; the change of sign moves ww by O(1/L)O(1/L) and does not change the rough-integer density or its prime-factor cutoff. No density at w=γw=\gamma is used: on the consumed range w−γ≥2κ+o(1)w-\gamma\ge2\kappa+o(1), with b1b_1 and κ\kappa fixed before xx.

The minimum-coordinate identity (7.18)

Identity. For 0<b1<1/20<b_1<1/2,

∫b11/2Dα(1−α)dαα=Db1(1)−1,\int_{b_1}^{1/2}D_\alpha(1-\alpha)\frac{d\alpha}\alpha=D_{b_1}(1)-1,

with the integrand at α=1/2\alpha=1/2 read as its left limit 22; for 1/3<α<1/21/3<\alpha<1/2 only T1T_1 survives and Dα(1−α)=1/(1−α)D_\alpha(1-\alpha)=1/(1-\alpha).

Proof. T1(b1,1)=1T_1(b_1,1)=1. For l≥2l\ge2 write Tl(b1,1)T_l(b_1,1) on the simplex Σl={t∈Rl:ti≥b1, ∑ti=1}\Sigma_l=\{t\in\mathbb R^l:t_i\ge b_1,\ \sum t_i=1\} with the measure 1l!∏i≤lti−1 dt1⋯dtl−1\frac1{l!}\prod_{i\le l}t_i^{-1}\,dt_1\cdots dt_{l-1}. This measure is invariant under all permutations of the ll coordinates: the density is symmetric, a transposition of two of t1,…,tl−1t_1,\dots,t_{l-1} has Jacobian −1-1, and the transposition of tjt_j with tl=1−∑i<ltit_l=1-\sum_{i<l}t_i replaces tjt_j by 1−∑i<lti1-\sum_{i<l}t_i, a linear change with determinant −1-1. Off a null set exactly one coordinate is minimal; by symmetry,

Tl(b1,1)=ll!∫Σl∩{t1<ti, 2≤i≤l}∏i≤l1ti dt1⋯dtl−1.T_l(b_1,1)=\frac l{l!}\int_{\Sigma_l\cap\{t_1<t_i,\ 2\le i\le l\}} \prod_{i\le l}\frac1{t_i}\,dt_1\cdots dt_{l-1}.

Put α=t1\alpha=t_1. Two coordinates are at least α\alpha and sum to at most one, so b1≤α≤1/2b_1\le\alpha\le1/2. For fixed α\alpha, the remaining t2,…,tl−1t_2,\dots,t_{l-1} range, up to null boundaries, over Ωl−1(α,1−α)\Omega_{l-1}(\alpha,1-\alpha), with integrand (1−α−∑2≤i<lti)−1∏2≤i<lti−1(1-\alpha-\sum_{2\le i<l}t_i)^{-1}\prod_{2\le i<l}t_i^{-1}; for l=2l=2 the inner integral is the value (1−α)−1(1-\alpha)^{-1}. Since l/l!=1/(l−1)!l/l!=1/(l-1)!, Tonelli's theorem gives

Tl(b1,1)=∫b11/2Tl−1(α,1−α)dαα.T_l(b_1,1)=\int_{b_1}^{1/2}T_{l-1}(\alpha,1-\alpha)\frac{d\alpha}\alpha .

Summing the finitely many l≥2l\ge2 proves the identity. □\square

The term 11 is the one-prime contribution to Db1(1)D_{b_1}(1); the integral is the composite part, organized by the least prime factor.

The bound (7.19)

Bound. There are absolute b0,c′>0b_0,c'>0 such that for 0<b1≤b00<b_1\le b_0,

Db1(1)≤e−γEb1(1+c′e−1/(20b1)).D_{b_1}(1)\le\frac{e^{-\gamma_E}}{b_1}\bigl(1+c'e^{-1/(20b_1)}\bigr).

Lower count. Let Φ(x)=#{x<m≤2x:P−(m)>xb1}\Phi(x)=\#\{x<m\le2x:P^-(m)>x^{b_1}\}. Every mm with Ω(m)=l\Omega(m)=l has at most l!l! ordered prime factorizations, so ordered lists of primes above xb1x^{b_1} with product in (x,2x](x,2x], each with weight 1/l!1/l!, give every integer total weight at most one, repetitions included. Fix η′>0\eta'>0. The case l=1l=1 gives π(2x)−π(x)=(1+o(1))x/L\pi(2x)-\pi(x)=(1+o(1))x/L. For l≥2l\ge2 restrict the first l−1l-1 primes to ti>b1t_i>b_1 and s(t)<1−b1−η′s(t)<1-b_1-\eta' and sum the last prime over (x/Q,2x/Q](x/Q,2x/Q]; it is then automatically above xb1+η′x^{b_1+\eta'}, and the prime number theorem gives (1+O(L−1))x/(QL(1−s(t)))(1+O(L^{-1}))x/(QL(1-s(t))) of them. The same cube comparison, with infima on cubes in place of suprema, gives

lim inf⁡x→∞LxΦ(x)≥1+∑l≥21l!∫Ωl(b1,1)∩{s<1−b1−η′}11−s(t)∏i<ldtiti→η′→0Db1(1)\liminf_{x\to\infty}\frac Lx\Phi(x)\ge1+\sum_{l\ge2}\frac1{l!} \int_{\Omega_l(b_1,1)\cap\{s<1-b_1-\eta'\}}\frac1{1-s(t)}\prod_{i<l} \frac{dt_i}{t_i}\xrightarrow[\eta'\to0]{}D_{b_1}(1)

by monotone convergence.

Upper count. The fourth instance of the block sieve, at z=xb1z=x^{b_1} with g(p)=1/pg(p)=1/p and h=2⌊1/(40b1)⌋h=2\lfloor1/(40b_1)\rfloor, gives Φ(x)≤xV(xb1)(1+c1e2e−1/(20b1))+x1/5+2b1\Phi(x)\le xV(x^{b_1})(1+c_1e^2e^{-1/(20b_1)})+x^{1/5+2b_1} once h≥h0h\ge h_0, which fixes b0b_0. By Mertens, LV(xb1)→e−γE/b1LV(x^{b_1})\to e^{-\gamma_E}/b_1, and the remainder is o(x/L)o(x/L).

Combining, $D_{b_1}(1)\le\liminf L\Phi(x)/x\le\limsup L\Phi(x)/x\le (e^{-\gamma_E}/b_1)(1+c'e^{-1/(20b_1)})$ with c′=c1e2c'=c_1e^2. □\square

The bound is a statement about a fixed number, obtained from two ordinary counts; no unrestricted pointwise density theorem is imported.

The mesh step

The extraction sums the bin constants sup⁡γ≤a≤γ′Dγ(1−a)log⁡(γ′/γ)\sup_{\gamma\le a\le\gamma'}D_\gamma(1-a)\log(\gamma'/\gamma). On {(γ,a):b1≤γ≤a≤1/2−κ}\{(\gamma,a):b_1\le\gamma\le a\le1/2-\kappa\} the map (γ,a)↦Dγ(1−a)(\gamma,a)\mapsto D_\gamma(1-a) is uniformly continuous, since there 1−a−γ≥2κ1-a-\gamma\ge2\kappa; let ω\omega be its modulus. For a partition of [b1,1/2−κ][b_1,1/2-\kappa] of mesh at most δ0\delta_0, every α\alpha and aa in the bin [γ,γ′][\gamma,\gamma'] satisfy Dγ(1−a)≤Dα(1−α)+ω(2δ0)D_\gamma(1-a)\le D_\alpha(1-\alpha)+\omega(2\delta_0). Integrating against dα/αd\alpha/\alpha over each bin and summing,

∑binssup⁡γ≤a≤γ′Dγ(1−a)log⁡γ′γ≤∫b11/2−κDα(1−α)dαα+ω(2δ0)log⁡12b1.\sum_{\rm bins}\sup_{\gamma\le a\le\gamma'}D_\gamma(1-a)\log\frac{\gamma'}\gamma \le\int_{b_1}^{1/2-\kappa}D_\alpha(1-\alpha)\frac{d\alpha}\alpha +\omega(2\delta_0)\log\frac1{2b_1}.

A fixed mesh makes the last term at most 1/101/10, as the extraction requires. The bins then remove at most SXAL{Db1(1)−1+110+o(1)}\frac{\mathfrak SX_A}L\{D_{b_1}(1)-1+\frac1{10}+o(1)\} by the identity, while the preliminary sieve retains at least SXAL{e−γEb1(1−O(e−1/(20b1)))+o(1)}\frac{\mathfrak SX_A}L\{\frac{e^{-\gamma_E}}{b_1}(1-O(e^{-1/(20b_1)}))+o(1)\}. By (7.19) the difference is at least SXAL{1−110−O(b1−1e−1/(20b1))+o(1)}\frac{\mathfrak SX_A}L\{1-\frac1{10}-O(b_1^{-1}e^{-1/(20b_1)})+o(1)\}, as on the extraction page.