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±1 at all: it concerns
ordinary integers in the factor ranges.
Setting
Write L=logx, T=logL, W=exp(L), V(y)=∏p≤y(1−1/p).
Fix 0<b1<1/10, 0<κ<1/50 and a finite set Γ of exponents
γ∈[b1,1/2−κ), the left ends of the extraction's bins. The tests
are
Iγ(m)=1P−(m)>xγ(γ∈Γ),Ipr(m)=1m prime.
The ambient range is A=[xb1/4,x1−b1/4]. Every factor range
used by the extraction lies inside it for large x: the cofactors of the
unbalanced bins lie in [x1/2+κ,4x1−b1], the balanced primes in
Bκ=[x1/2−2κ,x1/2+2κ], and a fixed
enlargement of every Type II dyad with xb1/3≤U≤x1−b1/3 is also
inside A.
Fix a precision S>0 and put Δ=ΔL=L−S. The cells are
Ck=(ekΔ,e(k+1)Δ], k∈Z; for a cell meeting
A write C=(Y,eΔY], so Y≥xb1/4e−Δ. There
are at most LS+1+2 such cells. Put
The counts are full-cell counts. A restriction to an interval K is applied
afterwards: the extraction uses α=(I−BI)1K.
The target is (DB) of the
Type II page, the
manuscript's (5.4): for every interval J⊂[1,x2], every Dirichlet
character χ of modulus at most LB, principal and imprimitive ones
included, and every real ∣t∣≤LB,
m∈J∑mαmχ(m)mit≤L−B.
Statement
Proposition (proxy discrepancy). Fix b1,κ,Γ as above.
Uniformly for the cells meeting A,
R(C)=(eΔ−1)YV(W)(1+O(e−2T2))+O(xo(1))∼ΔYV(W); in
particular R(C)>0 for large x.
Once the denominators are positive as in item 1, 0≤cI(C)≤1
for every test and every such cell. Hence 0≤BI≤1 and
BI(m)=0 unless P−(m)>W. The difference
α=(I−BI)1K has ∣αm∣≤1 and the same support
property. The numerical bound 1 is independent of S; the threshold
for positivity may depend on the fixed S.
For every fixed B≥1 and every fixed S≥2B+2 (in particular for the
extraction's choice S>2B+3) there is x0 such that for x≥x0 the
sequence α=(I−BI)1K satisfies (DB)
simultaneously for every test, every interval K⊂A, every
interval J⊂[1,x2], every character of modulus at most LB and
every ∣t∣≤LB.
The threshold x0 depends on b1,κ,Γ,B and S. In particular,
the coefficient bound and support condition supplied to Type II are
independent of S, although the proxies themselves and their intermediate
error estimates depend on it. Thus S can be fixed after the discrepancy
exponent B 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], C0≥1, B>0 and
A>0. For every nonprincipal character χ of modulus r≤LB, every
real ∣t∣≤LB and every interval I⊂[exp(Lc),xC0],
p∈I∑pχ(p)pit≪c,C0,B,AL−A.
Proof. For y≥exp(Lc) the modulus satisfies r≤(logy)B/c. The
Siegel–Walfisz theorem (the manuscript's Theorem 2.2) gives, for every fixed
K, uniformly in (a,r)=1,
π(y;r,a)=Li(y)/φ(r)+OK(y(logy)−K). A prime dividing
r has χ(p)=0, so summing against χ(a) over the reduced classes
cancels the main terms and gives
Aχ(y)=∑p≤yχ(p)≪KLBy(logy)−K. For I with ends
y1<y2, partial summation against yit−1 gives boundary terms
OK(LBL−cK) and an integral at most
(1+∣t∣)∫y1∞∣Aχ(y)∣y−2dy≪KL2BL−c(K−1). Take
cK≥A+2B+c. The argument is uniform in both ends and holds for an empty
interval, and it uses no primitivity. □
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=1, J′=C and h=2⌈T2⌉: the objects are the
integers of C, g(p)=1/p for p≤W, X=eΔY−Y and ∣r(d)∣≤1.
This gives the displayed formula with error term at most
DW=W4h+2=exp(O(T2L))=xo(1). Since
ΔYV(W)≥xb1/4L−S/O(L), the main term dominates.
Item 2. For γ∈Γ and large x, xγ≥xb1>W, so
Iγ(m)=1 implies P−(m)>W. A prime m in a cell meeting A
exceeds Y≥xb1/4/e>W. So the numerator of cI(C) counts a subset of
the integers counted by R(C).
Item 3, reduction. Fix a test I, intervals K and J, a character
χmodr with r≤LB, and ∣t∣≤LB. Put J0=J∩K, an interval
inside A, and
Σ=m∈J0∑(I(m)−BI(m))χ(m)mit−1.
All bounds below are uniform in these data. Every prime factor of r is at
most LB<W, so (m,r)=1 whenever P−(m)>W, which holds on the support of
I−BI.
Principal characters. Here χ(m)=1 on the support, so
Σ=∑m∈J0(I(m)−BI(m))mit−1. The cells meeting J0 are
consecutive; all except at most the first and the last lie inside J0. On a
cell C⊂J0 the unweighted sum of I−BI is
∑CI−cI(C)R(C)=0, so its contribution is
Since ∑m∈C∣I−BI∣≤2R(C)≤2#(C∩Z)≤2((eΔ−1)Y+1)
and eΔ−1≤2Δ, a full cell contributes
O((1+∣t∣)Δ(Δ+x−b1/4)) with an absolute constant. Over at most
LS+1+2 cells the total is
O((1+∣t∣)L(Δ+x−b1/4))=O(LB+1−S), since
x−b1/4≤Δ eventually for fixed S. Each of the
two partial cells contributes at most
∑m∈C(I+BI)/m≤2R(C)/Y≤4Δ+2ex−b1/4. With S≥2B+2,
∣Σ∣≪L−B−1+x−b1/4.
Nonprincipal characters: the actual tests. For Ipr,
∑m∈J0Ipr(m)χ(m)mit−1=∑p∈J0χ(p)pit−1,
and J0⊂[exp(L1/2),x] for large x; the lemma above with
A=B+2 bounds it by O(L−B−2). For Iγ, every m∈J0 with
P−(m)>xγ factors uniquely as m=p1⋯pl with
xγ<p1≤⋯≤pl, and l≤1/γ≤1/b1 because m≤x.
Repeated primes are included. Fix l and primes
xγ<p1≤⋯≤pl−1, with product Q (Q=1 when l=1). The
admissible last primes are the primes of
IQ=[pl−1,∞)∩(xγ,∞)∩{y:Qy∈J0},
with p0=1; this is one interval inside (xγ,x]. By complete
multiplicativity,
As xγ≥exp(L1/2) for large x, the lemma with c=1/2, C0=1
bounds every inner sum by O(L−A) uniformly in Q. The outer weights
satisfy ∑1/Q≤(∑xb1<p≤x1/p)l−1≤(log(1/b1)+1)l−1 by
Mertens' estimate. Taking A=B+2, the actual test contributes
Ob1(L−B−2).
Nonprincipal characters: the proxy. Fix a cell C=(Y,eΔY] meeting
J0 and put J′=C∩J0. For y∈J′ let Jy′=J′∩(−∞,y] and
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 a, and χ is
nonprincipal, so it cancels:
∣F(y)∣≤c1e−h∣J′∣V(W)+φ(r)DW.
Partial summation on J′⊂(Y,eΔY] against mit−1 gives
The first term is smaller than every fixed power of L because
e−2T2=L−2T; the second is x−b1/4+o(1) times a fixed power of L.
Conclusion. In all cases ∣Σ∣≤L−B for x≥x0, with x0
depending only on b1,κ,Γ,B,S and the Siegel–Walfisz constants.
Since J0=J∩K, this is (DB) for α=(I−BI)1K.
□
Uniformity checks
Restrictions.K may cut cells anywhere; at most two cut cells meet
J∩K, and they enter only through absolute bounds. The proxy is not
rescaled on a cut cell. The proof covers every interval K⊂A,
which contains every restriction the extraction makes.
Characters. Principal characters of every modulus up to LB act as
the constant 1 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.
The order of B and S. The coefficient bound ∣αm∣≤1, the
support condition and the admissible K are fixed before S; the losses
LS+1 from the number of cells meet savings e−2T2 and
x−b1/4+o(1) that beat every fixed power of L, and the principal case
needs only S≥2B+2. No relation between S and B feeds back into the
Type II coefficient bound.