Wiki
Wiki

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

Updated

Proxy discrepancy under interval restrictions


This page reconstructs Lemma 7.3 of the weighted-dilation manuscript at the factor ranges consumed by the extraction of primes 2u-1. It belongs to the elementary estimates of the smooth-successor route. The lemma and its method are OpenAI's; the derivation, the explicit uniformity and the error accounting are Plasma AI's. The E2 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. The lemma does not involve 2u±12u\pm1 at all: it concerns ordinary integers in the factor ranges.

Setting

Write L=log⁡xL=\log x, T=log⁡LT=\log L, W=exp⁡(L)W=\exp(\sqrt L), V(y)=∏p≤y(1−1/p)V(y)=\prod_{p\le y}(1-1/p). Fix 0<b1<1/100<b_1<1/10, 0<κ<1/500<\kappa<1/50 and a finite set Γ\Gamma of exponents γ∈[b1,1/2−κ)\gamma\in[b_1,1/2-\kappa), the left ends of the extraction's bins. The tests are

Iγ(m)=1P−(m)>xγ (γ∈Γ),Ipr(m)=1m prime.I_\gamma(m)=\mathbf 1_{P^-(m)>x^\gamma}\ (\gamma\in\Gamma),\qquad I_{\rm pr}(m)=\mathbf 1_{m\text{ prime}} .

The ambient range is A=[xb1/4,x1−b1/4]\mathcal A=[x^{b_1/4},x^{1-b_1/4}]. Every factor range used by the extraction lies inside it for large xx: the cofactors of the unbalanced bins lie in [x1/2+κ,4x1−b1][x^{1/2+\kappa},4x^{1-b_1}], the balanced primes in Bκ=[x1/2−2κ,x1/2+2κ]\mathcal B_\kappa=[x^{1/2-2\kappa},x^{1/2+2\kappa}], and a fixed enlargement of every Type II dyad with xb1/3≤U≤x1−b1/3x^{b_1/3}\le U\le x^{1-b_1/3} is also inside A\mathcal A.

Fix a precision S>0S>0 and put Δ=ΔL=L−S\Delta=\Delta_L=L^{-S}. The cells are Ck=(ekΔ,e(k+1)Δ]C_k=(e^{k\Delta},e^{(k+1)\Delta}], k∈Zk\in\mathbb Z; for a cell meeting A\mathcal A write C=(Y,eΔY]C=(Y,e^\Delta Y], so Y≥xb1/4e−ΔY\ge x^{b_1/4}e^{-\Delta}. There are at most LS+1+2L^{S+1}+2 such cells. Put

R(C)=#{m∈C:P−(m)>W},cI(C)=∑m∈CI(m)R(C),BI(m)=cI(C) 1P−(m)>W(m∈C).R(C)=\#\{m\in C:P^-(m)>W\},\qquad c_I(C)=\frac{\sum_{m\in C}I(m)}{R(C)},\qquad B_I(m)=c_I(C)\,\mathbf 1_{P^-(m)>W}\quad(m\in C).

The counts are full-cell counts. A restriction to an interval KK is applied afterwards: the extraction uses α=(I−BI)1K\alpha=(I-B_I)\mathbf 1_K.

The target is (DB)(\mathrm D_B) of the Type II page, the manuscript's (5.4): for every interval J⊂[1,x2]J\subset[1,x^2], every Dirichlet character χ\chi of modulus at most LBL^B, principal and imprimitive ones included, and every real ∣t∣≤LB|t|\le L^B,

∣∑m∈Jαmχ(m)mitm∣≤L−B.\Bigl|\sum_{m\in J}\frac{\alpha_m\chi(m)m^{it}}m\Bigr|\le L^{-B}.

Statement

Proposition (proxy discrepancy). Fix b1,κ,Γb_1,\kappa,\Gamma as above.

  1. Uniformly for the cells meeting A\mathcal A, R(C)=(eΔ−1)YV(W)(1+O(e−2T2))+O(xo(1))∼ΔYV(W)R(C)=(e^\Delta-1)YV(W)(1+O(e^{-2T^2}))+O(x^{o(1)})\sim\Delta YV(W); in particular R(C)>0R(C)>0 for large xx.
  2. Once the denominators are positive as in item 1, 0≤cI(C)≤10\le c_I(C)\le1 for every test and every such cell. Hence 0≤BI≤10\le B_I\le1 and BI(m)=0B_I(m)=0 unless P−(m)>WP^-(m)>W. The difference α=(I−BI)1K\alpha=(I-B_I)\mathbf 1_K has ∣αm∣≤1|\alpha_m|\le1 and the same support property. The numerical bound 11 is independent of SS; the threshold for positivity may depend on the fixed SS.
  3. For every fixed B≥1B\ge1 and every fixed S≥2B+2S\ge2B+2 (in particular for the extraction's choice S>2B+3S>2B+3) there is x0x_0 such that for x≥x0x\ge x_0 the sequence α=(I−BI)1K\alpha=(I-B_I)\mathbf 1_K satisfies (DB)(\mathrm D_B) simultaneously for every test, every interval K⊂AK\subset\mathcal A, every interval J⊂[1,x2]J\subset[1,x^2], every character of modulus at most LBL^B and every ∣t∣≤LB|t|\le L^B.

The threshold x0x_0 depends on b1,κ,Γ,Bb_1,\kappa,\Gamma,B and SS. In particular, the coefficient bound and support condition supplied to Type II are independent of SS, although the proxies themselves and their intermediate error estimates depend on it. Thus SS can be fixed after the discrepancy exponent BB that premise (P) requires.

Prime sums against characters

The nonprincipal case uses one consequence of the Siegel–Walfisz theorem, the manuscript's Corollary 2.4. It is derived here.

Lemma (harmonic character sums). Fix c∈(0,1]c\in(0,1], C0≥1C_0\ge1, B>0B>0 and A>0A>0. For every nonprincipal character χ\chi of modulus r≤LBr\le L^B, every real ∣t∣≤LB|t|\le L^B and every interval I⊂[exp⁡(Lc),xC0]I\subset[\exp(L^c),x^{C_0}],

∑p∈Iχ(p)pitp≪c,C0,B,AL−A.\sum_{p\in I}\frac{\chi(p)p^{it}}p\ll_{c,C_0,B,A}L^{-A} .

Proof. For y≥exp⁡(Lc)y\ge\exp(L^c) the modulus satisfies r≤(log⁡y)B/cr\le(\log y)^{B/c}. The Siegel–Walfisz theorem (the manuscript's Theorem 2.2) gives, for every fixed KK, uniformly in (a,r)=1(a,r)=1, π(y;r,a)=Li(y)/φ(r)+OK(y(log⁡y)−K)\pi(y;r,a)=\mathrm{Li}(y)/\varphi(r)+O_K(y(\log y)^{-K}). A prime dividing rr has χ(p)=0\chi(p)=0, so summing against χ(a)\chi(a) over the reduced classes cancels the main terms and gives Aχ(y)=∑p≤yχ(p)≪KLBy(log⁡y)−KA_\chi(y)=\sum_{p\le y}\chi(p)\ll_K L^By(\log y)^{-K}. For II with ends y1<y2y_1<y_2, partial summation against yit−1y^{it-1} gives boundary terms OK(LBL−cK)O_K(L^BL^{-cK}) and an integral at most (1+∣t∣)∫y1∞∣Aχ(y)∣y−2dy≪KL2BL−c(K−1)(1+|t|)\int_{y_1}^{\infty}|A_\chi(y)|y^{-2}dy\ll_KL^{2B}L^{-c(K-1)}. Take cK≥A+2B+ccK\ge A+2B+c. The argument is uniform in both ends and holds for an empty interval, and it uses no primitivity. □\square

The constants are those of the Siegel–Walfisz theorem and need not be effective.

Proof of the proposition

Item 1. Apply the block sieve of the block-sieve page in its first instance with r=1r=1, J′=CJ'=C and h=2⌈T2⌉h=2\lceil T^2\rceil: the objects are the integers of CC, g(p)=1/pg(p)=1/p for p≤Wp\le W, X=eΔY−YX=e^\Delta Y-Y and ∣r(d)∣≤1|r(d)|\le1. This gives the displayed formula with error term at most DW=W4h+2=exp⁡(O(T2L))=xo(1)D_W=W^{4h+2}=\exp(O(T^2\sqrt L))=x^{o(1)}. Since ΔYV(W)≥xb1/4L−S/O(L)\Delta YV(W)\ge x^{b_1/4}L^{-S}/O(\sqrt L), the main term dominates.

Item 2. For γ∈Γ\gamma\in\Gamma and large xx, xγ≥xb1>Wx^\gamma\ge x^{b_1}>W, so Iγ(m)=1I_\gamma(m)=1 implies P−(m)>WP^-(m)>W. A prime mm in a cell meeting A\mathcal A exceeds Y≥xb1/4/e>WY\ge x^{b_1/4}/e>W. So the numerator of cI(C)c_I(C) counts a subset of the integers counted by R(C)R(C).

Item 3, reduction. Fix a test II, intervals KK and JJ, a character χ mod r\chi\bmod r with r≤LBr\le L^B, and ∣t∣≤LB|t|\le L^B. Put J0=J∩KJ_0=J\cap K, an interval inside A\mathcal A, and

Σ=∑m∈J0(I(m)−BI(m))χ(m)mit−1.\Sigma=\sum_{m\in J_0}(I(m)-B_I(m))\chi(m)m^{it-1}.

All bounds below are uniform in these data. Every prime factor of rr is at most LB<WL^B<W, so (m,r)=1(m,r)=1 whenever P−(m)>WP^-(m)>W, which holds on the support of I−BII-B_I.

Principal characters. Here χ(m)=1\chi(m)=1 on the support, so Σ=∑m∈J0(I(m)−BI(m))mit−1\Sigma=\sum_{m\in J_0}(I(m)-B_I(m))m^{it-1}. The cells meeting J0J_0 are consecutive; all except at most the first and the last lie inside J0J_0. On a cell C⊂J0C\subset J_0 the unweighted sum of I−BII-B_I is ∑CI−cI(C)R(C)=0\sum_CI-c_I(C)R(C)=0, so its contribution is

∑m∈C(I(m)−BI(m))(mit−1−Yit−1),∣mit−1−Yit−1∣≤(1+∣t∣)eΔ−1Y.\sum_{m\in C}(I(m)-B_I(m))(m^{it-1}-Y^{it-1}),\qquad |m^{it-1}-Y^{it-1}|\le(1+|t|)\frac{e^\Delta-1}Y .

Since ∑m∈C∣I−BI∣≤2R(C)≤2#(C∩Z)≤2((eΔ−1)Y+1)\sum_{m\in C}|I-B_I|\le2R(C)\le2\#(C\cap\mathbb Z)\le2((e^\Delta-1)Y+1) and eΔ−1≤2Δe^\Delta-1\le2\Delta, a full cell contributes O((1+∣t∣)Δ(Δ+x−b1/4))O((1+|t|)\Delta(\Delta+x^{-b_1/4})) with an absolute constant. Over at most LS+1+2L^{S+1}+2 cells the total is O((1+∣t∣)L(Δ+x−b1/4))=O(LB+1−S)O((1+|t|)L(\Delta+x^{-b_1/4}))=O(L^{B+1-S}), since x−b1/4≤Δx^{-b_1/4}\le\Delta eventually for fixed SS. Each of the two partial cells contributes at most ∑m∈C(I+BI)/m≤2R(C)/Y≤4Δ+2ex−b1/4\sum_{m\in C}(I+B_I)/m\le2R(C)/Y\le4\Delta+2ex^{-b_1/4}. With S≥2B+2S\ge2B+2,

∣Σ∣≪L−B−1+x−b1/4.|\Sigma|\ll L^{-B-1}+x^{-b_1/4}.

Nonprincipal characters: the actual tests. For IprI_{\rm pr}, ∑m∈J0Ipr(m)χ(m)mit−1=∑p∈J0χ(p)pit−1\sum_{m\in J_0}I_{\rm pr}(m)\chi(m)m^{it-1}=\sum_{p\in J_0}\chi(p)p^{it-1}, and J0⊂[exp⁡(L1/2),x]J_0\subset[\exp(L^{1/2}),x] for large xx; the lemma above with A=B+2A=B+2 bounds it by O(L−B−2)O(L^{-B-2}). For IγI_\gamma, every m∈J0m\in J_0 with P−(m)>xγP^-(m)>x^\gamma factors uniquely as m=p1⋯plm=p_1\cdots p_l with xγ<p1≤⋯≤plx^\gamma<p_1\le\cdots\le p_l, and l≤1/γ≤1/b1l\le1/\gamma\le1/b_1 because m≤xm\le x. Repeated primes are included. Fix ll and primes xγ<p1≤⋯≤pl−1x^\gamma<p_1\le\cdots\le p_{l-1}, with product QQ (Q=1Q=1 when l=1l=1). The admissible last primes are the primes of

IQ=[pl−1,∞)∩(xγ,∞)∩{y:Qy∈J0},I_Q=[p_{l-1},\infty)\cap(x^\gamma,\infty)\cap\{y:Qy\in J_0\},

with p0=1p_0=1; this is one interval inside (xγ,x](x^\gamma,x]. By complete multiplicativity,

∑m∈J0Iγ(m)χ(m)mit−1=∑l≤1/b1 ∑xγ<p1≤⋯≤pl−1χ(Q)Qit−1∑p∈IQχ(p)pit−1.\sum_{m\in J_0}I_\gamma(m)\chi(m)m^{it-1} =\sum_{l\le1/b_1}\ \sum_{x^\gamma<p_1\le\cdots\le p_{l-1}}\chi(Q)Q^{it-1} \sum_{p\in I_Q}\chi(p)p^{it-1}.

As xγ≥exp⁡(L1/2)x^\gamma\ge\exp(L^{1/2}) for large xx, the lemma with c=1/2c=1/2, C0=1C_0=1 bounds every inner sum by O(L−A)O(L^{-A}) uniformly in QQ. The outer weights satisfy ∑1/Q≤(∑xb1<p≤x1/p)l−1≤(log⁡(1/b1)+1)l−1\sum1/Q\le(\sum_{x^{b_1}<p\le x}1/p)^{l-1}\le(\log(1/b_1)+1)^{l-1} by Mertens' estimate. Taking A=B+2A=B+2, the actual test contributes Ob1(L−B−2)O_{b_1}(L^{-B-2}).

Nonprincipal characters: the proxy. Fix a cell C=(Y,eΔY]C=(Y,e^\Delta Y] meeting J0J_0 and put J′=C∩J0J'=C\cap J_0. For y∈J′y\in J' let Jy′=J′∩(−∞,y]J'_y=J'\cap(-\infty,y] and

F(y)=∑m∈Jy′1P−(m)>Wχ(m)=∑(a,r)=1χ(a) N(Jy′;a),N(J′′;a)=#{m∈J′′:m≡a (r), P−(m)>W}.F(y)=\sum_{m\in J'_y}\mathbf 1_{P^-(m)>W}\chi(m) =\sum_{(a,r)=1}\chi(a)\,N(J'_y;a),\qquad N(J'';a)=\#\{m\in J'':m\equiv a\ (r),\ P^-(m)>W\}.

The first instance of the block sieve, for the class aa and the interval Jy′J'_y, gives

N(Jy′;a)=∣Jy′∣ V(W)φ(r)(1+θac1e−h)+θa′DW,∣θa∣,∣θa′∣≤1,N(J'_y;a)=\frac{|J'_y|\,V(W)}{\varphi(r)}\bigl(1+\theta_ac_1e^{-h}\bigr) +\theta'_aD_W,\qquad|\theta_a|,|\theta'_a|\le1,

because $X\prod_{p\le W,,p\nmid r}(1-1/p)=(|J'y|/r)V(W)\prod{p\mid r}(1-1/p)^{-1}=|J'_y|V(W)/\varphi(r)$. This holds for every subinterval, however short, as an absolute-error statement; no relative asymptotic is claimed on short intervals. The main term does not depend on aa, and χ\chi is nonprincipal, so it cancels:

∣F(y)∣≤c1e−h∣J′∣V(W)+φ(r)DW.|F(y)|\le c_1e^{-h}|J'|V(W)+\varphi(r)D_W .

Partial summation on J′⊂(Y,eΔY]J'\subset(Y,e^\Delta Y] against mit−1m^{it-1} gives

∣∑m∈J′1P−(m)>Wχ(m)mit−1∣≤sup⁡y∈J′∣F(y)∣ 1+(1+∣t∣)(eΔ−1)Y≤2Y(c1e−h∣J′∣V(W)+LBDW)\Bigl|\sum_{m\in J'}\mathbf 1_{P^-(m)>W}\chi(m)m^{it-1}\Bigr| \le\sup_{y\in J'}|F(y)|\,\frac{1+(1+|t|)(e^\Delta-1)}Y \le\frac{2}{Y}\bigl(c_1e^{-h}|J'|V(W)+L^BD_W\bigr)

once (1+∣t∣)(eΔ−1)≤1(1+|t|)(e^\Delta-1)\le1, which holds for S>BS>B and large xx. Multiply by cI(C)∈[0,1]c_I(C)\in[0,1] and sum over the at most LS+1+2L^{S+1}+2 cells, using ∣J′∣≤(eΔ−1)Y+1|J'|\le(e^\Delta-1)Y+1:

∣∑m∈J0BI(m)χ(m)mit−1∣≪e−2T2LV(W)+LS+1+BDWx−b1/4≪L−B−2.\Bigl|\sum_{m\in J_0}B_I(m)\chi(m)m^{it-1}\Bigr| \ll e^{-2T^2}LV(W)+L^{S+1+B}D_Wx^{-b_1/4}\ll L^{-B-2}.

The first term is smaller than every fixed power of LL because e−2T2=L−2Te^{-2T^2}=L^{-2T}; the second is x−b1/4+o(1)x^{-b_1/4+o(1)} times a fixed power of LL.

Conclusion. In all cases ∣Σ∣≤L−B|\Sigma|\le L^{-B} for x≥x0x\ge x_0, with x0x_0 depending only on b1,κ,Γ,B,Sb_1,\kappa,\Gamma,B,S and the Siegel–Walfisz constants. Since J0=J∩KJ_0=J\cap K, this is (DB)(\mathrm D_B) for α=(I−BI)1K\alpha=(I-B_I)\mathbf 1_K. □\square

Uniformity checks

  • Restrictions. KK may cut cells anywhere; at most two cut cells meet J∩KJ\cap K, and they enter only through absolute bounds. The proxy is not rescaled on a cut cell. The proof covers every interval K⊂AK\subset\mathcal A, which contains every restriction the extraction makes.
  • Characters. Principal characters of every modulus up to LBL^B act as the constant 11 on the support. Every nonprincipal character, primitive or not, is handled by the same two arguments: the lemma above needs no primitivity, and the residue-class cancellation uses only ∑(a,r)=1χ(a)=0\sum_{(a,r)=1}\chi(a)=0.
  • The order of BB and SS. The coefficient bound ∣αm∣≤1|\alpha_m|\le1, the support condition and the admissible KK are fixed before SS; the losses LS+1L^{S+1} from the number of cells meet savings e−2T2e^{-2T^2} and x−b1/4+o(1)x^{-b_1/4+o(1)} that beat every fixed power of LL, and the principal case needs only S≥2B+2S\ge2B+2. No relation between SS and BB feeds back into the Type II coefficient bound.
  • The sign of the shift. No step involves 2u±12u\pm1.