Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This is an author-recorded argument by Plasma AI for the gap G1 of the
canonical collision sketch.
It is outside the independent examination of Theorems A and B. It computes
the local factors of the large-prime class exactly and bounds every part of
the G1 average except one regime of large common divisors, which it states
as an open estimate. Constants are not computed explicitly; the section
"Standing" lists exactly what is proved and what is open.
The external inputs are the Brun–Titchmarsh inequality, used in the form of
Montgomery and Vaughan's Theorem 3.9 with its error-free sharpening, valid for intervals of length at least twice the modulus
and read at statement depth; Mertens' theorems; and, in Lemma 0, the prime
number theorem for progressions to moduli at most loglogy, in its
Siegel–Walfisz form. The latter is used as stated in
Exercise 64 of Tao's 2014 Notes 2:
for each fixed A>0, the von Mangoldt sum in a reduced class modulo
q≤logAt is t/φ(q)+O(texp(−cAlogt)).
This statement was read; its proof was not re-examined here. No numerical
effectivity of its constants is required.
Setting
Use the notation of the canonical sketch. Fix δ>0 and
0<η<1/4, put y=x1/2−η, and consider cofactors 2≤a<y, so
that every member of S1(x) is aP with a prime P>x1/2+η. For large
x each such cofactor has s(a)≥δa/2. For a=a′ write
g=(s(a),s(a′)),h=σ(a′)−σ(a),β=s(a′)/g,λ=s(a)/g.
The pair is eligible if h=0, g∣h, both forms P=u+βt,
P′=v+λt are primitive, and ω(2)≤1. The
uniform sieve argument gives
N(a,a′)≪ηxgSx(a,a′)/(as(a′)log2x) for eligible
pairs and shows that the other pairs with a=a′ have no solutions.
This page works with a trimmed form of G1. A set B of cofactors
is removed first. The inputs aP≤x with a∈B number at most
(4x/logx)∑a∈B,a<y1/a for large x, because
x/a>x1/2 and π(t)≤2t/logt for large t. So a set with
∑a∈B,a<y1/a≤ε′logy removes at most
2ε′x inputs. This suffices for statement 3 of Theorem B and
for the large-prime conclusion below. It does not prove G1 as stated for
every cofactor.
Exact local factors
Lemma 1. Let (a,a′) be eligible and let p be a prime. Put
e1=vp(s(a)), e2=vp(s(a′)), e=min(e1,e2)=vp(g) and
f=vp(h)≥e. Then e1=e2 forces f=e, and the factor of
gSx(a,a′) at p≤x is
pep/(p−1) if e1=e2;
pe(1−(p−1)−2) if e1=e2 and f=e, which needs p>2;
pep/(p−1) if e1=e2 and f>e.
Conversely, a pair with h=0 and g∣h is ineligible exactly when some
prime has e1=e2 and f>e, or when p=2 has e1=e2 and f=e.
Proof. The forms satisfy λu−βv=h/g, and
vp(β)=e2−e, vp(λ)=e1−e. If e1<e2, then p∣β
and p∤λ, so u+βt≡u and λu≡h/g
modulo p. When f>e this gives p∣u, so every value of the first
form is divisible by p; it is not primitive, and since
p≤β<x1/2+η it has no prime value in range. When f=e the
first form never vanishes modulo p and the second has one root, so
ω(p)=1 and the factor is (1−1/p)(1−1/p)−2=p/(p−1). The case
e1>e2 is symmetric. If e1=e2, then p∤βλ and the two
roots −u/β, −v/λ coincide modulo p exactly when
p∣λu−βv=h/g, that is, when f>e. So ω(p)=1 if
f>e and ω(p)=2 if f=e; the latter is the inadmissible case at
p=2. □
Thus gSx(a,a′)≤g∏p∈Tp/(p−1), where T is the
set of primes at which the third or first case occurs. Every prime of T
divides βλ(h/g).
Lemma 2. If vp(σ(a))>vp(a) and vp(σ(a′))>vp(a′), then
e1=vp(a), e2=vp(a′) and f>e. Hence an eligible pair has
vp(a)=vp(a′), and its factor at p is exactly pvp(a)p/(p−1).
Proof.vp(s(a))=vp(σ(a)−a)=vp(a), and
f≥min(vp(σ(a)),vp(σ(a′)))≥e+1. Lemma 1 excludes
e1=e2 and gives the third case. □
Good cofactors
Let L=loglogy and W=L/(4logL), and fix 0<ν<1/10. For a cofactor
a put Q=P(a), c=a/Q, Q2=P(c) and c2=c/Q2, and write
W(a)=∏p≤Wpvp(a). Call agood if
Q>yν, Q2>yν, Q∤c and Q2∤c2;
vp(σ(c))>vp(c) for every prime p≤W;
(a,σ(a)) has no prime factor larger than W.
Then a=c2Q2Q with pairwise coprime factors, and condition 2 implies
vp(σ(a))>vp(a) for p≤W, since σ(a)=σ(c)(Q+1) and
vp(a)=vp(c). Condition 3 has two consequences used below. If p>W
divides s(a), then p∤a and p∤σ(a); and p∤s(c),
since otherwise p∣σ(c) by s(a)=s(c)Q+σ(c), hence p∣c,
and p would divide both a and σ(a).
Lemma 0 (density of good cofactors). As y→∞, the cofactors
2≤a<y that are not good satisfy
∑1/a≤(eγν(1+log(1/ν))+o(1))logy.
Proof. Write μ(S)=∑a∈S,a<y1/a, and use Euler products
throughout: for a nonnegative multiplicative f,
∑n<yf(n)/n≤∏q<y∑j≥0f(qj)q−j.
Condition 1. The a with P(a)≤yν have
μ≤∏q≤yν(1−1/q)−1=eγνlogy(1+o(1)) by
Mertens' product theorem. Those with exactly one prime factor q>yν
are qjm with P(m)≤yν, so
$\mu\le\sum_{y^\nu<q\le y,,j\ge1}q^{-j}\cdot e^\gamma\nu\log y,(1+o(1))
=e^\gamma\nu(\log(1/\nu)+o(1))\log y$. Those divisible by q2 for some
prime q>yν have μ≤(1+logy)∑q>yνq−2=o(1). Every
remaining a satisfies condition 1.
Condition 3. The a divisible by a prime p∈(W,L] have
μ≤(1+logy)∑W<p≤L1/p=o(logy), because
logW=logL−log(4logL). For a prime p>L with p∣a and
p∣σ(a), either p2∣a, costing (1+logy)/p2, or
p∥a and some prime power qj∥a/p has p∣σ(qj),
costing at most (1+logy)p−1∑qj<y,p∣σ(qj)q−j.
The terms with j≥2 have qj≥p/2 and sum to O(p−1/2). The
terms with j=1 have q≡−1(modp) and q≥2p−1; the cited
Brun–Titchmarsh inequality and partial summation give
∑q<y,q≡−1(p)1/q≤(2L+3)/(p−1). Summing over p>L gives
(1+logy)⋅O(1/logL+L−1/2)=o(logy).
Condition 2. For a satisfying condition 1, the a with a given c have
weight c−1∑P(c)<Q≤y/c1/Q≤(log(1/ν)+o(1))/c, since
P(c)>yν. So it suffices to show that the c<y violating condition 2
have ∑1/c=o(logy). Fix a prime p≤W, let Pp be the
primes q≡−1(modp) in (W,yν], and let ω1(n) count the
primes of Pp dividing n exactly once. Each of them contributes
at least 1 to vp(σ(n)). So if c=pkc0 with p∤c0
violates the condition at p, then ω1(c0)≤k. With
z=1/2, the Euler product bound and Mertens' product theorem give
$\sum_{n<y}z^{\omega_1(n)}/n\le e^\gamma\log y,
\exp(-E_p/2+O(1/W))(1+o(1))$, where Ep=∑q∈Pp1/q,
because each q∈Pp changes its Euler factor by the factor
1−1/(2q)+O(q−2). Hence the violations with vp(c)=k have
∑1/c≤p−k2keγlogye−Ep/2(1+o(1)), and those with
vp(c)>k0 have ∑1/c≤2(1+logy)p−k0−1. By the prime number
theorem for progressions to moduli at most loglogy,
Ep≥(1−o(1))L/(p−1)≥(4−o(1))logL for p≤W. Take
the lower part of this estimate only from primes above T0=exp(L2):
partial summation of Siegel–Walfisz on [T0,yν] gives
(L−2logL+logν)/(p−1)+O(exp(−cL)), uniformly for p≤W,
which justifies the stated lower bound. Take
k0=⌈2logL⌉. For p=2 the first bound sums over k≤k0
to (k0+1)e−E2/2logyO(1), with E2≥(1−o(1))L; for p≥3 it
sums to at most 3eγe−Ep/2logy(1+o(1)). Summing over
p≤W gives
(k0e−L/3+π(W)L−2+o(1)+2−k0)O(logy)=o(logy).
□
Compatibility
For an eligible pair of good cofactors, Lemma 2 forces W(a)=W(a′), and
then
where g′ is the part of g composed of primes above W.
Lemma 3. Let (a,a′) be an eligible pair of good cofactors and let
d≥1 divide g′. Then:
(s(c),d)=(c,d)=1, and Q≡qc(d)(modd), where
qc(d)≡−σ(c)s(c)−1(modd); likewise for a′.
d∣a′−a.
d divides Δ′(c;a′)=a′s(c)+cσ(c).
The polynomial $F_{c_2,a'}(t)=c_2\sigma(c_2)t^2+(c_2\sigma(c_2)+a's(c_2))t
+a'\sigma(c_2)$ satisfies Fc2,a′(Q2)=Δ′(c;a′), and it is
nonzero modulo every prime p∣d. Hence Q2 lies in at most
2ω(d) residue classes modulo the radical of d.
Proof. Every prime of d exceeds W and divides s(a), so the
consequences of condition 3 give the coprimality, and
d∣s(a)=s(c)Q+σ(c) gives the class of Q. Item 2 follows from
s(a)−s(a′)+h=a′−a and d∣g∣h. Then
a′≡a=cQ≡−cσ(c)s(c)−1(modd), which is item 3. For
item 4, substitute c=c2t, σ(c)=σ(c2)(t+1) and
s(c)=s(c2)t+σ(c2). If all three coefficients vanished modulo p,
then p∣a′s(c2). If p∣a′, then p∣σ(a′) because
p∣s(a′), against condition 3 for a′. Otherwise p∣s(c2) and
p∣σ(c2), so p divides c2∣a and
σ(c2)∣σ(a), against condition 3 for a. A nonzero
polynomial of degree at most two has at most two roots modulo p, and
Q2 is a root modulo each p∣d by item 3. □
The point of item 4 is that the congruence a≡a′(modd) costs a
second prime of a, not only its largest one. The largest prime supplies
d∣s(a) and the second supplies the compatibility with a′.
Lemma 6 (simple roots after a negligible removal). Among good
cofactors, the ones for which some prime p>W divides both s(a) and
Q−Q2 have total reciprocal weight
≪νWlogy+y−ν/2(1+logy)3=o(logy).
Call a good cofactor separated if it survives this removal. For an
eligible pair of separated good cofactors and every d∣g′, the
admissible values of Q2 lie in at most 2ω(d) classes modulo
d, not merely modulo its radical.
Proof of the removal bound. Put c=a/Q, so c<y1−ν, and let
Q2=P(c). A prime counted in the removal satisfies
p∣T(c):=s(c)Q2+σ(c),Q≡Q2(modp).
The positive integer T(c) is at most 2y2(1+logy) and has
O(1+logy) distinct prime factors. For p>yν/2, a single
residue class modulo p, restricted to integers above yν and at
most y, has reciprocal sum at most
y−ν+(1+logy)/p. Summing this bound over p∣T(c) and then
over c with weight 1/c gives the second term of the assertion.
Primality is not needed for this part.
For W<p≤yν/2 write c=c2Q2. Multiplicativity gives
T(c)=s(c2)Q22+2σ(c2)Q2+σ(c2).
Since p∣s(a) and a is good, p∤aσ(a), and therefore
p∤c2σ(c2). The displayed polynomial is nonzero modulo p
and has at most two roots. For fixed c2,p, Brun–Titchmarsh and partial
summation bound the reciprocal sum over the allowed Q2>yν by
Oν(1/(p−1)). For each such Q2 the same bound applies to
Q>yν in its class modulo p. Both uses have
p≤yν/2; the prime parameters are larger than p2.
Dropping ordering and product restrictions only increases these positive
sums. The resulting bound is
Oν(1+logy)p>W∑(p−1)21≪νWlogy.
Proof of the prime-power root bound. Write A=c2 and
F(t)=FA,a′(t) as in Lemma 3. The identities
a′≡AQ2Q(modd) and
s(a)=s(A)Q2Q+σ(A)(Q2+Q+1)≡0(modd)
give
F′(Q2)≡Aσ(A)(Q2−Q)(modd).
Every factor on the right is a unit modulo d: the first two by
goodness, and the last by separation. Thus every root that can represent
a retained cofactor is simple modulo each prime dividing d. A simple
root modulo pj has exactly one lift modulo pj+1, since
F(t+pju)≡F(t)+pjuF′(t)(modpj+1). There are at most two
simple roots modulo each p, and the Chinese remainder theorem gives
at most 2ω(d) classes modulo d. □
The extra removal costs o(x) inputs in S1(x) by the reciprocal-weight
estimate in "Setting". It does not assume that the large-prime part of
s(a) is squarefree or cubefree. Proposition 4 below holds for all good
cofactors; the subsequent reductions of its remaining core use the
separated subset.
The accessible divisors
Fix 0<κ<ν/3. Since g′=∑d∣g′φ(d), the G1 sum over
eligible pairs of good cofactors is at most
(a,a′)∑aa′W(a)∏p≤Wp−1pFd∣g′∑φ(d).
Call a divisor d of g′accessible for the pair if
max(P(a),P(a′))>d1/(1−κ), and write Λacc and
Λcore for the parts of this sum over accessible and
inaccessible d.
Proposition 4.Λacc≪ν,κlog2y.
Main estimate. Consider the divisors with P(a)>d1/(1−κ); the
case P(a′)>d1/(1−κ) is symmetric. Fix a good a′ and $d\mid
s(a')$ composed of primes above W. By Lemma 3, the good a=c2Q2Q with
d∣s(a), a≡a′(modd) and Q>d1/(1−κ) satisfy
If (qc(d),d)>1, a prime p∣d divides σ(c), and
d∣s(a) forces Q=p<d1/(1−κ); so the inner class is reduced
whenever it is nonempty. For t≥max(yν,d1/(1−κ)) we have
t≥2d for large y and log(t/d)≥κlogt, and the cited
Brun–Titchmarsh inequality gives
π(t;d,b)≤2t/(κφ(d)logt). Partial summation from
z≥yν to Z≤y bounds the inner sum by K1/φ(d), with
K1=2(1+log(1/ν))/κ.
Put r=radd. The Q2>r1/(1−κ) in the at most
2ω(d) classes contribute at most 2ω(d)K1/φ(r) in
the same way; a class containing a multiple of a prime p∣r contains no
such prime. Each class contains at most 2r2κ integers up to
r1/(1−κ), each above yν. Therefore the a-sum is at most
(1+logy)2ω(d)(φ(r)K1+yν2r2κ)φ(d)K1.
Multiply by φ(d), sum over d∣s(a′) and then over a′ with
weight 1/a′. The second term contributes at most
y2κ−ν+o(1), because d≤ylogy and
∑a′<yτ(s(a′))2/a′≤yo(1). The first term contributes
K12(1+logy)∑a′Φ(s(a′))/a′, where
with ψ multiplicative, supported on integers whose primes exceed W,
and ψ(pj)=2/(p−1) for j≥1. Swap the sums. For e≤yν/2,
the good a′=c′Q′ with e∣s(a′) have Q′ in one class modulo e,
reduced because otherwise Q′ would be a prime factor of e, and
Q′>yν≥e2, so their weight is at most
(1+logy)K1′/φ(e) with K1′ depending only on ν; and
∑eψ(e)/φ(e)≤∏p>W(1+O(p−2)). For e>yν/2,
the primes Q′>yν of one residue class modulo e have reciprocal sum
at most y−ν+(1+logy)/e, because after the first of them the class
has one element in each interval of length e; so the weight is at most
(1+logy)(y−ν+(1+logy)/e). Since
∑e≤ylogyψ(e)=yo(1) and
∑eψ(e)e−1/2≪1, these e contribute o(1). Hence
∑a′Φ(s(a′))/a′≪logy, and the divisors with
P(a)>d1/(1−κ) contribute O(log2y) before the weights
W(a)∏p≤Wp/(p−1) and F are restored.
Restoring the small-prime weight. Restrict c2 and a′ to
W(c2)=W(a′)=w; this is forced, because W(a)=W(c2) when Q,Q2>W.
Writing c2=wm with m free of primes up to W, the Euler product and
Mertens' product theorem give
$\sum_{c_2<y,,W(c_2)=w}1/c_2\le w^{-1}\prod_{W<q<y}(1-1/q)^{-1}
=w^{-1}e^\gamma\log y\prod_{p\le W}(1-1/p),(1+o(1))$. The bounds for
Q2 and Q do not depend on w, and the same factor appears for a′
in every step of the Φ estimate. So the weight
w∏p≤Wp/(p−1) times the two factors w−1∏p≤W(1−1/p),
summed over W-smooth w, gives
∏p≤W(1−1/p)∑w1/w=1 times the unweighted bound.
The singular-series weight. Pointwise, F≪loglogy: the integer
βλh/g<y4 has O(logy) prime factors, and the product of
p/(p−1) over the first O(logy) primes above W is
O(loglogy/logW). This suffices wherever a power saving is
available, in particular for the reductions of the core below. In the main
term F must be averaged, as follows.
Put Z0=(logy)2. Primes of T above Z0 contribute a factor
1+o(1), since there are O(logy) of them. For W<p≤Z0 let
h3(p)=(p/(p−1))3−1≤7/p. Every such prime of T divides s(a), or
s(a′), or h while dividing neither s(a) nor s(a′). By the
arithmetic–geometric mean inequality,
F≤(1+o(1))31(A(a)3+A(a′)3+H3),
where A(n)=∏p∣s(n),W<p≤Z0p/(p−1) and
H=∏p∣h,p∤s(a)s(a′),W<p≤Z0p/(p−1). Expand each cube
as ∑eh3(e) over squarefree e with the indicated prime factors.
For A(a′)3: Φ(N)A(N)3=∑e∣Nψ3(e) with ψ3
multiplicative and ψ3(pj)≪1/p, and the Φ estimate applies
unchanged.
For A(a)3: a prime p∣e with p∤d puts Q in one class
modulo p, because p∤s(c), and p∣σ(c) would force
Q=p≤Z0. For e≤E0=yκν/16, Q then lies in one class
modulo de, and logE0≤(κ/4)logQ lets Brun–Titchmarsh give
K2/(φ(d)φ(e)) in place of K1/φ(d), with K2
depending on κ,ν; and ∑eh3(e)/φ(e)≪1. Primes
p∣e that divide d impose nothing new and contribute
∏p∣d(1+7/p), which joins Φ. For e>E0, Rankin's trick
gives $\sum_{e\mid s(a),,e>E_0}h_3(e)\le E_0^{-1/2}\prod_{p\le
Z_0}(1+7p^{-1/2})=y^{-\kappa\nu/32+o(1)}$.
For H3: a prime p∣e divides σ(a′)−σ(a) but neither
s(a) nor s(a′), so p∤d. If p∤σ(c), then
Q≡σ(a′)σ(c)−1−1(modp), one class, handled as for
A(a)3. If p∣σ(c), then p∣σ(a), so
p∣σ(a′)=σ(c′)(Q′+1). If moreover p∤σ(c′), then
Q′≡−1(modp), one class, absorbed by the Brun–Titchmarsh step for
Q′ in the Φ estimate. The remaining primes divide both
σ(c) and σ(c′), and their factors multiply to at most
G(c)G(c′), where G(n)=∏p∣σ(n),W<p≤Z0(1+7/p)1/2.
The weight G has bounded mean. Since σ(c)=σ(c2)(Q2+1),
G(c)≤G(c2)∏p∣Q2+1,W<p≤Z0(1+7/p)1/2, and the
second factor expands into conditions Q2≡−1(modf), absorbed by the
Brun–Titchmarsh step for Q2.
Here the simultaneous congruences can be kept throughout the sums. A
prime dividing d divides neither σ(a) nor σ(a′) on the
good set. Thus the new moduli from H and from Q2+1 are coprime to
d. On the long Q2 range in the main estimate, a modulus f≤E0
therefore changes its root-class bound to
Oν,κ(2ω(d)/(φ(r)φ(f))).
Indeed
$rf\le Q_2^{1-\kappa}y^{\kappa\nu/16}
\le Q_2^{1-15\kappa/16}$, and the Chinese remainder theorem combines
the polynomial roots modulo r with the class −1 modulo f.
The short Q2 range is already a power-saving error and can use the
pointwise polylogarithmic bound for F.
The primes assigned to a congruence on Q multiply its original
modulus d by at most E0, with the same margin. The primes assigned
to Q′≡−1 multiply the small modulus
e≤yν/2 in the Φ calculation by at most E0.
These two moduli on Q′ are coprime: a common prime would divide both
s(a′) and σ(a′), contradicting goodness. Their product is at
most Q′1/2+κ/16. All reciprocal prime sums consequently keep
their uniform Brun–Titchmarsh bounds, with the additional factors
1/φ(f) for the added moduli. Summing their nonnegative expansion
coefficients converges, since each new prime contributes O(p−2).
For any added modulus above E0, the same Rankin bound as for
A(a)3 is a negative power of y times yo(1); pointwise
polylogarithmic bounds handle the other weights. This also covers the
large-e remainder of the Φ calculation.
For c2=wm with m free of primes up to
W, G(c2)≤G(w)G(m), and the Euler product gives
$\sum_{m<y}G(m)/m\le\prod_{W<q<y}(1-1/q)^{-1}
\exp\bigl(\sum_q(g(q)-1)/q+O(1/W)\bigr)$ with
g(q)=∏p∣q+1,W<p≤Z0(1+7/p)1/2=∑f∣q+1ξ(f),
where ξ is multiplicative on squarefree f with primes in (W,Z0]
and ξ(p)≤4/p. The partial summation of Lemma 0 gives
∑q<y,q≡−1(f)1/q≤(2L+5)/φ(f) for f≤y1/2,
and the trivial bound 2logy/f holds for larger f. Hence
$\sum_q(g(q)-1)/q\le(2L+5)\sum_{f>1}\xi(f)/\varphi(f)+o(1)
=O(L/(W\log W))=O(1)$. The same applies to c′ on the a′-side. Finally
∑wG(w)2/w≤(1+o(1))∏p≤W(1−1/p)−1 over W-smooth w,
because σ(pk)<pk+1 has at most (k+1)logp/logW prime factors
above W. So the factors G(w)2 cost 1+o(1) against ∑w1/w.
Large moduli e and f are removed by Rankin's trick as above. Hence the
main estimate holds with the weight F, up to a constant factor depending
on ν and κ. □
Here and throughout this section the sum is restricted to eligible pairs
of separated good cofactors. The discarded reciprocal weight is still
at most the bound in Lemma 0 plus o(logy).
We have d>yν(1−κ), and
d≤min(∣a′−a∣,s(a),s(a′))<y. When d>P(a), item 1 of Lemma 3 pins the
largest prime of a:
P(a)is the least positive residue of−σ(c)s(c)−1(modd),
and likewise for a′. So the core counts pairs of cofactors whose values
of s share a divisor that also divides their difference and is nearly as
large as every prime factor of either cofactor; when it exceeds them, each
largest prime is a least residue of a modular fraction formed from the rest
of its cofactor.
A narrower core. Fix κ′′>0 with 2κ+κ′′<ν.
Fix a′ and d∣s(a′). Lemma 6 puts Q2 in at most
2ω(d) classes modulo d, and the primes above yν in one
class have reciprocal sum at most y−ν+(1+logy)/d.
If Q=P(a)≥d1−κ′′, then Q≤d1/(1−κ) lies in one
class modulo d, so at most 2d2κ values occur, each with
1/Q≤dκ′′−1. After the factor φ(d)≤d and the sum over
c2, the a-sum is at most
$(1+\log y)2^{\omega(d)+1}d^{2\kappa+\kappa''}
(y^{-\nu}+(1+\log y)d^{-1})$.
Since yν(1−κ)≤d≤ylogy, summing over d∣s(a′) and
over a′ gives y−c+o(1) for some c=c(ν,κ,κ′′)>0.
Lemma 5. Let c,c′≥2 satisfy vp(σ(c))>vp(c) and
vp(σ(c′))>vp(c′) for every prime p≤W, let (c,σ(c)) and
(c′,σ(c′)) have no prime factor above W, and let W(c)=W(c′). If
c=c′, then Δ(c,c′)=cσ(c)s(c′)−c′σ(c′)s(c)=0. The
hypotheses hold for c=a/P(a) and c′=a′/P(a′) when a,a′ are good and
W(a)=W(a′).
Proof.Δ(c,c′)=0 means c+c2/s(c)=c′+c′2/s(c′). The first
hypothesis gives vp(s(c))=vp(c) for p≤W, and by the second no prime
above W divides both c and s(c). So (c2,s(c))=W(c), and
(c2/W(c))/(s(c)/W(c)) is c2/s(c) in lowest terms. Two rationals that
differ by an integer have the same reduced denominator, so
s(c)/W(c)=s(c′)/W(c′), and W(c)=W(a)=W(a′)=W(c′) gives s(c)=s(c′).
Since t↦t+t2/s is increasing for s>0, c=c′. For good
cofactors, condition 2 is the first hypothesis, condition 3 gives the
second because c∣a and σ(c)∣σ(a), and W(c)=W(a)
because P(a)>W. □
Both largest primes below d. If P(a),P(a′)<d, then each is the
least positive residue of its class, so c=c′ (otherwise a=a′), the
pair is determined by (c,c′,d), and d∣Δ(c,c′), which follows
from item 3 of Lemma 3 after multiplying by s(c′). Lemma 5 makes
Δ(c,c′) a nonzero integer of size yO(1), so it has yo(1)
divisors. Hence the pairs with P(a)P(a′)≥d1+ϵ contribute at
most ∑c,c′(cc′)−1∑d∣Δ(c,c′)d−ϵ over
d≥yν(1−κ), which is y−c+o(1). Since
P(a)P(a′)>y2ν, this covers every such pair with
d≤y2ν/(1+ϵ).
Two large primes on one side. If P(a)<d and
P(a)P2(a)≥d1+ϵ, fix a′
and d∣s(a′) and restrict Q and Q2 to dyadic ranges [R,2R) and
[R2,2R2) with RR2≥d1+ϵ/4. Then Q is determined by
(c2,Q2), and Q2 takes at most 2ω(d)(R2/d+1) values, so
$\sum1/(QQ_2)\le2^{\omega(d)}(1/(dR)+1/(RR_2))\le2^{\omega(d)+3}
d^{-1-\epsilon/2}$, using R≥(RR2/2)1/2. After the factor φ(d),
the sums over c2, the dyadic ranges, d∣s(a′) and a′ give
y−c+o(1). The same holds with a and a′ exchanged.
These parts contribute o(1), also with the weights restored: the
small-prime weight as in Proposition 4, and F through its pointwise bound
F≪loglogy against the power savings. What remains consists of
divisors exceeding P(a)1/(1−κ′′) and
P(a′)1/(1−κ′′), for which the two largest of
P(a),P2(a),P(a′),P2(a′) have product below d1+ϵ.
Necessarily d>y2ν/(1+ϵ). Both largest primes are least
residues of their classes, determined by the rest of their cofactors.
There is no restriction on the radical of d: Lemma 6 supplies the
prime-power root count for all retained pairs.
Gap G1-core. Prove Λcore≪log2y for fixed small
ν and κ. By the reductions above it suffices to bound the
remaining regime, with its weights. In a model where s(a) and s(a′) are independent of
a and a′ modulo large d, the inner condition has probability about
d−3, and the core is O(y−ν/2log2y). No such independence is
proved. The estimate is therefore expected but unknown: it is supported only
by that model, and no source read here supplies it.
The tools above stop exactly here. Brun–Titchmarsh needs a free prime whose
range exceeds the modulus d, and in the core no prime of either cofactor
has that range. Enumerating d as a divisor of one value of s and
bounding the progression a′≡a(modd) trivially loses the factor
d that the condition d∣s(a′) should supply; the result is too large
by about the average number of divisors of s(a) above yν/2. The
two-dimensional large sieve bounds the
total variance of (a,σ(a)) over all residue pairs modulo d, but
that variance may sit on the diagonal residues a≡σ(a) counted
here, and it reaches only d up to about y1/2. A proof must show
that these least residues fall in short initial intervals no more often
than their length predicts, on average over the pairs.
Lemma 7 (separation of bounded reduced ratios). Put
ΠW=∏p≤Wp and Cδ=1+2/δ. For an eligible pair of
good cofactors in Aδ(y), let
u=s(a)/g, v=s(a′)/g and H=h/g. Then
ΠW∣H,0<∣H∣<Cδmax(u,v),(uv,ΠW)=1.
In particular max(u,v)>ΠW/Cδ. For every fixed K, no such
pair has max(u,v)≤K for sufficiently large y. This includes
s(a)=s(a′), for which u=v=1.
Proof. At every p≤W, Lemma 2 gives
vp(s(a))=vp(s(a′))=vp(g) and vp(h)>vp(g). This proves the
divisibility and coprimality. Also
σ(a)≤Cδs(a) and
σ(a′)≤Cδs(a′), while both divisor sums are positive.
Consequently
$0<|h|<\max(\sigma(a),\sigma(a'))\le
C_\delta g\max(u,v)$. Finally W→∞, so ΠW→∞.
□
The core is a scaled collision problem at the cofactor scale. For a core divisor
d put λ=s(a)/d and λ′=s(a′)/d. Then
and likewise for λ′. These coefficients have size at most
y1−ν/2 for large y. Lemma 7 excludes bounded coefficients after
their common factor is cancelled; in particular ordinary cofactor
collisions contribute no eligible pair once y is large. An induction
using only ordinary fiber sizes therefore has no supplied bridge to this
core. It needs a bound for the displayed weighted scaled collisions with
unbounded reduced coefficients and with the extra congruence retained.
Removing the largest prime does not close that induction by itself:
substitution of a=cQ and a′=c′Q′ changes the scaled equality to
λ′(Q+1)s(c)−λ(Q′+1)s(c′)=λc′−λ′c.
The right side need not vanish, and the new coefficients depend on the
removed primes. Thus the zero-right-side scaled equality alone is not an
invariant induction hypothesis. A successful descent must control these
affine equations, their congruence constraints and their summed weights;
no contracting recurrence is established here.
Luca and Pomerance avoid this regime in the proof of their
positive-density range theorem
(15-page preprint, Section 3.1). Their cofactors are m=qℓ with
ℓ≤x1/10, and a common divisor h of s(m) and s(m′) divides
ℓσ(ℓ)s(ℓ′)−ℓ′σ(ℓ′)s(ℓ), the analogue of
Δ′ with both cofactors decomposed. That integer is smaller than
2x3/10 in absolute value, so a divisor h>x1/3 forces it to
vanish, and the gcd properties of their Lemma 1 then force ℓ=ℓ′.
For general cofactors the analogous integer has size up to about y3,
and no such forcing occurs.
Consequence for the large-prime class
G0, Proposition 4 and the core estimate together give, for each
ε>0 and the corresponding removal of at most εx
inputs, CS1(x)≪δ,η,εx for the remaining
inputs. With the truncation argument of Theorem B this would show that for
every set A of density zero, the n≤x with s(n)∈A and
P(n)>x1/2+η number o(x), and hence that s−1(A) has upper
density at most 1−log2. This conclusion is conditional on Gap
G1-core; it is not proved here.
Standing
Proved here, author-recorded: Lemmas 0, 1, 2, 3, 5, 6 and 7; Proposition 4,
including both weights; and the stated reductions of the core on
separated good cofactors. Constants were not computed explicitly; each step records the
inequality it uses.
Open: Gap G1-core in the remaining large-modulus regime. Nothing on this page is
independently reviewed, and the trimmed estimate it targets is not G1 as
stated for every cofactor.