Wiki
Wiki

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 log⁡log⁡y\log\log y, in its Siegel–Walfisz form. The latter is used as stated in Exercise 64 of Tao's 2014 Notes 2: for each fixed A>0A>0, the von Mangoldt sum in a reduced class modulo q≤log⁡Atq\le\log^A t is t/φ(q)+O(texp⁡(−cAlog⁡t))t/\varphi(q)+O(t\exp(-c_A\sqrt{\log t})). 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\delta>0 and 0<η<1/40<\eta<1/4, put y=x1/2−ηy=x^{1/2-\eta}, and consider cofactors 2≤a<y2\le a<y, so that every member of S1(x)S_1(x) is aPaP with a prime P>x1/2+ηP>x^{1/2+\eta}. For large xx each such cofactor has s(a)≥δa/2s(a)\ge\delta a/2. For a≠a′a\ne a' write

g=(s(a),s(a′)),h=σ(a′)−σ(a),β=s(a′)/g,λ=s(a)/g.g=(s(a),s(a')),\qquad h=\sigma(a')-\sigma(a),\qquad \beta=s(a')/g,\qquad \lambda=s(a)/g .

The pair is eligible if h≠0h\ne0, g∣hg\mid h, both forms P=u+βtP=u+\beta t, P′=v+λtP'=v+\lambda t are primitive, and ω(2)≤1\omega(2)\le1. The uniform sieve argument gives N(a,a′)≪ηxg Sx(a,a′)/(a s(a′)log⁡2x)N(a,a')\ll_\eta xg\,\mathfrak S_x(a,a')/(a\,s(a')\log^2x) for eligible pairs and shows that the other pairs with a≠a′a\ne a' have no solutions.

This page works with a trimmed form of G1. A set B\mathcal B of cofactors is removed first. The inputs aP≤xaP\le x with a∈Ba\in\mathcal B number at most (4x/log⁡x)∑a∈B, a<y1/a(4x/\log x)\sum_{a\in\mathcal B,\,a<y}1/a for large xx, because x/a>x1/2x/a>x^{1/2} and π(t)≤2t/log⁡t\pi(t)\le2t/\log t for large tt. So a set with ∑a∈B, a<y1/a≤ε′log⁡y\sum_{a\in\mathcal B,\,a<y}1/a\le\varepsilon'\log y removes at most 2ε′x2\varepsilon'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′)(a,a') be eligible and let pp be a prime. Put e1=vp(s(a))e_1=v_p(s(a)), e2=vp(s(a′))e_2=v_p(s(a')), e=min⁡(e1,e2)=vp(g)e=\min(e_1,e_2)=v_p(g) and f=vp(h)≥ef=v_p(h)\ge e. Then e1≠e2e_1\ne e_2 forces f=ef=e, and the factor of g Sx(a,a′)g\,\mathfrak S_x(a,a') at p≤xp\le x is

  • pe p/(p−1)p^e\,p/(p-1) if e1≠e2e_1\ne e_2;
  • pe(1−(p−1)−2)p^e\bigl(1-(p-1)^{-2}\bigr) if e1=e2e_1=e_2 and f=ef=e, which needs p>2p>2;
  • pe p/(p−1)p^e\,p/(p-1) if e1=e2e_1=e_2 and f>ef>e.

Conversely, a pair with h≠0h\ne0 and g∣hg\mid h is ineligible exactly when some prime has e1≠e2e_1\ne e_2 and f>ef>e, or when p=2p=2 has e1=e2e_1=e_2 and f=ef=e.

Proof. The forms satisfy λu−βv=h/g\lambda u-\beta v=h/g, and vp(β)=e2−ev_p(\beta)=e_2-e, vp(λ)=e1−ev_p(\lambda)=e_1-e. If e1<e2e_1<e_2, then p∣βp\mid\beta and p∤λp\nmid\lambda, so u+βt≡uu+\beta t\equiv u and λu≡h/g\lambda u\equiv h/g modulo pp. When f>ef>e this gives p∣up\mid u, so every value of the first form is divisible by pp; it is not primitive, and since p≤β<x1/2+ηp\le\beta<x^{1/2+\eta} it has no prime value in range. When f=ef=e the first form never vanishes modulo pp and the second has one root, so ω(p)=1\omega(p)=1 and the factor is (1−1/p)(1−1/p)−2=p/(p−1)(1-1/p)(1-1/p)^{-2}=p/(p-1). The case e1>e2e_1>e_2 is symmetric. If e1=e2e_1=e_2, then p∤βλp\nmid\beta\lambda and the two roots −u/β-u/\beta, −v/λ-v/\lambda coincide modulo pp exactly when p∣λu−βv=h/gp\mid\lambda u-\beta v=h/g, that is, when f>ef>e. So ω(p)=1\omega(p)=1 if f>ef>e and ω(p)=2\omega(p)=2 if f=ef=e; the latter is the inadmissible case at p=2p=2. □\square

Thus g Sx(a,a′)≤g∏p∈Tp/(p−1)g\,\mathfrak S_x(a,a')\le g\prod_{p\in T}p/(p-1), where TT is the set of primes at which the third or first case occurs. Every prime of TT divides βλ (h/g)\beta\lambda\,(h/g).

Lemma 2. If vp(σ(a))>vp(a)v_p(\sigma(a))>v_p(a) and vp(σ(a′))>vp(a′)v_p(\sigma(a'))>v_p(a'), then e1=vp(a)e_1=v_p(a), e2=vp(a′)e_2=v_p(a') and f>ef>e. Hence an eligible pair has vp(a)=vp(a′)v_p(a)=v_p(a'), and its factor at pp is exactly pvp(a)p/(p−1)p^{v_p(a)}p/(p-1).

Proof. vp(s(a))=vp(σ(a)−a)=vp(a)v_p(s(a))=v_p(\sigma(a)-a)=v_p(a), and f≥min⁡(vp(σ(a)),vp(σ(a′)))≥e+1f\ge\min(v_p(\sigma(a)),v_p(\sigma(a')))\ge e+1. Lemma 1 excludes e1≠e2e_1\ne e_2 and gives the third case. □\square

Good cofactors

Let L=log⁡log⁡yL=\log\log y and W=L/(4log⁡L)W=L/(4\log L), and fix 0<ν<1/100<\nu<1/10. For a cofactor aa put Q=P(a)Q=P(a), c=a/Qc=a/Q, Q2=P(c)Q_2=P(c) and c2=c/Q2c_2=c/Q_2, and write W(a)=∏p≤Wpvp(a)W(a)=\prod_{p\le W}p^{v_p(a)}. Call aa good if

  1. Q>yνQ>y^\nu, Q2>yνQ_2>y^\nu, Q∤cQ\nmid c and Q2∤c2Q_2\nmid c_2;
  2. vp(σ(c))>vp(c)v_p(\sigma(c))>v_p(c) for every prime p≤Wp\le W;
  3. (a,σ(a))(a,\sigma(a)) has no prime factor larger than WW.

Then a=c2Q2Qa=c_2Q_2Q with pairwise coprime factors, and condition 2 implies vp(σ(a))>vp(a)v_p(\sigma(a))>v_p(a) for p≤Wp\le W, since σ(a)=σ(c)(Q+1)\sigma(a)=\sigma(c)(Q+1) and vp(a)=vp(c)v_p(a)=v_p(c). Condition 3 has two consequences used below. If p>Wp>W divides s(a)s(a), then p∤ap\nmid a and p∤σ(a)p\nmid\sigma(a); and p∤s(c)p\nmid s(c), since otherwise p∣σ(c)p\mid\sigma(c) by s(a)=s(c)Q+σ(c)s(a)=s(c)Q+\sigma(c), hence p∣cp\mid c, and pp would divide both aa and σ(a)\sigma(a).

Lemma 0 (density of good cofactors). As y→∞y\to\infty, the cofactors 2≤a<y2\le a<y that are not good satisfy ∑1/a≤(eγν(1+log⁡(1/ν))+o(1))log⁡y\sum1/a\le\bigl(e^\gamma\nu(1+\log(1/\nu))+o(1)\bigr)\log y.

Proof. Write μ(S)=∑a∈S, a<y1/a\mu(S)=\sum_{a\in S,\,a<y}1/a, and use Euler products throughout: for a nonnegative multiplicative ff, ∑n<yf(n)/n≤∏q<y∑j≥0f(qj)q−j\sum_{n<y}f(n)/n\le\prod_{q<y}\sum_{j\ge0}f(q^j)q^{-j}.

Condition 1. The aa with P(a)≤yνP(a)\le y^\nu have μ≤∏q≤yν(1−1/q)−1=eγνlog⁡y (1+o(1))\mu\le\prod_{q\le y^\nu}(1-1/q)^{-1}=e^\gamma\nu\log y\,(1+o(1)) by Mertens' product theorem. Those with exactly one prime factor q>yνq>y^\nu are qjmq^jm with P(m)≤yνP(m)\le y^\nu, 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 q2q^2 for some prime q>yνq>y^\nu have μ≤(1+log⁡y)∑q>yνq−2=o(1)\mu\le(1+\log y)\sum_{q>y^\nu}q^{-2}=o(1). Every remaining aa satisfies condition 1.

Condition 3. The aa divisible by a prime p∈(W,L]p\in(W,L] have μ≤(1+log⁡y)∑W<p≤L1/p=o(log⁡y)\mu\le(1+\log y)\sum_{W<p\le L}1/p=o(\log y), because log⁡W=log⁡L−log⁡(4log⁡L)\log W=\log L-\log(4\log L). For a prime p>Lp>L with p∣ap\mid a and p∣σ(a)p\mid\sigma(a), either p2∣ap^2\mid a, costing (1+log⁡y)/p2(1+\log y)/p^2, or p ∥ ap\,\|\,a and some prime power qj ∥ a/pq^j\,\|\,a/p has p∣σ(qj)p\mid\sigma(q^j), costing at most (1+log⁡y)p−1∑qj<y, p∣σ(qj)q−j(1+\log y)p^{-1}\sum_{q^j<y,\,p\mid\sigma(q^j)}q^{-j}. The terms with j≥2j\ge2 have qj≥p/2q^j\ge p/2 and sum to O(p−1/2)O(p^{-1/2}). The terms with j=1j=1 have q≡−1(modp)q\equiv-1\pmod p and q≥2p−1q\ge2p-1; the cited Brun–Titchmarsh inequality and partial summation give ∑q<y, q≡−1 (p)1/q≤(2L+3)/(p−1)\sum_{q<y,\,q\equiv-1\ (p)}1/q\le(2L+3)/(p-1). Summing over p>Lp>L gives (1+log⁡y)⋅O(1/log⁡L+L−1/2)=o(log⁡y)(1+\log y)\cdot O(1/\log L+L^{-1/2})=o(\log y).

Condition 2. For aa satisfying condition 1, the aa with a given cc have weight c−1∑P(c)<Q≤y/c1/Q≤(log⁡(1/ν)+o(1))/cc^{-1}\sum_{P(c)<Q\le y/c}1/Q\le(\log(1/\nu)+o(1))/c, since P(c)>yνP(c)>y^\nu. So it suffices to show that the c<yc<y violating condition 2 have ∑1/c=o(log⁡y)\sum1/c=o(\log y). Fix a prime p≤Wp\le W, let Pp\mathcal P_p be the primes q≡−1(modp)q\equiv-1\pmod p in (W,yν](W,y^\nu], and let ω1(n)\omega_1(n) count the primes of Pp\mathcal P_p dividing nn exactly once. Each of them contributes at least 11 to vp(σ(n))v_p(\sigma(n)). So if c=pkc0c=p^kc_0 with p∤c0p\nmid c_0 violates the condition at pp, then ω1(c0)≤k\omega_1(c_0)\le k. With z=1/2z=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/qE_p=\sum_{q\in\mathcal P_p}1/q, because each q∈Ppq\in\mathcal P_p changes its Euler factor by the factor 1−1/(2q)+O(q−2)1-1/(2q)+O(q^{-2}). Hence the violations with vp(c)=kv_p(c)=k have ∑1/c≤p−k2keγlog⁡y e−Ep/2(1+o(1))\sum1/c\le p^{-k}2^ke^\gamma\log y\,e^{-E_p/2}(1+o(1)), and those with vp(c)>k0v_p(c)>k_0 have ∑1/c≤2(1+log⁡y)p−k0−1\sum1/c\le2(1+\log y)p^{-k_0-1}. By the prime number theorem for progressions to moduli at most log⁡log⁡y\log\log y, Ep≥(1−o(1))L/(p−1)≥(4−o(1))log⁡LE_p\ge(1-o(1))L/(p-1)\ge(4-o(1))\log L for p≤Wp\le W. Take the lower part of this estimate only from primes above T0=exp⁡(L2)T_0=\exp(L^2): partial summation of Siegel–Walfisz on [T0,yν][T_0,y^\nu] gives (L−2log⁡L+log⁡ν)/(p−1)+O(exp⁡(−cL))(L-2\log L+\log\nu)/(p-1)+O(\exp(-cL)), uniformly for p≤Wp\le W, which justifies the stated lower bound. Take k0=⌈2log⁡L⌉k_0=\lceil2\log L\rceil. For p=2p=2 the first bound sums over k≤k0k\le k_0 to (k0+1)e−E2/2log⁡y O(1)(k_0+1)e^{-E_2/2}\log y\,O(1), with E2≥(1−o(1))LE_2\ge(1-o(1))L; for p≥3p\ge3 it sums to at most 3eγe−Ep/2log⁡y (1+o(1))3e^\gamma e^{-E_p/2}\log y\,(1+o(1)). Summing over p≤Wp\le W gives (k0e−L/3+π(W)L−2+o(1)+2−k0)O(log⁡y)=o(log⁡y)\bigl(k_0e^{-L/3}+\pi(W)L^{-2+o(1)}+2^{-k_0}\bigr)O(\log y)=o(\log y). □\square

Compatibility

For an eligible pair of good cofactors, Lemma 2 forces W(a)=W(a′)W(a)=W(a'), and then

g Sx(a,a′)≤W(a)∏p≤Wpp−1⋅g′⋅F,F=∏p>Wp∣βλ(h/g)pp−1,g\,\mathfrak S_x(a,a')\le W(a)\prod_{p\le W}\frac p{p-1}\cdot g'\cdot F, \qquad F=\prod_{\substack{p>W\\ p\mid\beta\lambda(h/g)}}\frac p{p-1},

where g′g' is the part of gg composed of primes above WW.

Lemma 3. Let (a,a′)(a,a') be an eligible pair of good cofactors and let d≥1d\ge1 divide g′g'. Then:

  1. (s(c),d)=(c,d)=1(s(c),d)=(c,d)=1, and Q≡qc(d)(modd)Q\equiv q_c(d)\pmod d, where qc(d)≡−σ(c) s(c)−1(modd)q_c(d)\equiv-\sigma(c)\,s(c)^{-1}\pmod d; likewise for a′a'.
  2. d∣a′−ad\mid a'-a.
  3. dd divides Δ′(c;a′)=a′ s(c)+c σ(c)\Delta'(c;a')=a'\,s(c)+c\,\sigma(c).
  4. 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′)F_{c_2,a'}(Q_2)=\Delta'(c;a'), and it is nonzero modulo every prime p∣dp\mid d. Hence Q2Q_2 lies in at most 2ω(d)2^{\omega(d)} residue classes modulo the radical of dd.

Proof. Every prime of dd exceeds WW and divides s(a)s(a), so the consequences of condition 3 give the coprimality, and d∣s(a)=s(c)Q+σ(c)d\mid s(a)=s(c)Q+\sigma(c) gives the class of QQ. Item 2 follows from s(a)−s(a′)+h=a′−as(a)-s(a')+h=a'-a and d∣g∣hd\mid g\mid h. Then a′≡a=cQ≡−c σ(c)s(c)−1(modd)a'\equiv a=cQ\equiv-c\,\sigma(c)s(c)^{-1}\pmod d, which is item 3. For item 4, substitute c=c2tc=c_2t, σ(c)=σ(c2)(t+1)\sigma(c)=\sigma(c_2)(t+1) and s(c)=s(c2)t+σ(c2)s(c)=s(c_2)t+\sigma(c_2). If all three coefficients vanished modulo pp, then p∣a′s(c2)p\mid a's(c_2). If p∣a′p\mid a', then p∣σ(a′)p\mid\sigma(a') because p∣s(a′)p\mid s(a'), against condition 3 for a′a'. Otherwise p∣s(c2)p\mid s(c_2) and p∣σ(c2)p\mid\sigma(c_2), so pp divides c2∣ac_2\mid a and σ(c2)∣σ(a)\sigma(c_2)\mid\sigma(a), against condition 3 for aa. A nonzero polynomial of degree at most two has at most two roots modulo pp, and Q2Q_2 is a root modulo each p∣dp\mid d by item 3. □\square

The point of item 4 is that the congruence a≡a′(modd)a\equiv a'\pmod d costs a second prime of aa, not only its largest one. The largest prime supplies d∣s(a)d\mid s(a) and the second supplies the compatibility with a′a'.

Lemma 6 (simple roots after a negligible removal). Among good cofactors, the ones for which some prime p>Wp>W divides both s(a)s(a) and Q−Q2Q-Q_2 have total reciprocal weight

≪νlog⁡yW+y−ν/2(1+log⁡y)3=o(log⁡y).\ll_\nu \frac{\log y}{W} +y^{-\nu/2}(1+\log y)^3=o(\log y).

Call a good cofactor separated if it survives this removal. For an eligible pair of separated good cofactors and every d∣g′d\mid g', the admissible values of Q2Q_2 lie in at most 2ω(d)2^{\omega(d)} classes modulo dd, not merely modulo its radical.

Proof of the removal bound. Put c=a/Qc=a/Q, so c<y1−νc<y^{1-\nu}, and let Q2=P(c)Q_2=P(c). A prime counted in the removal satisfies

p∣T(c):=s(c)Q2+σ(c),Q≡Q2(modp).p\mid T(c):=s(c)Q_2+\sigma(c),\qquad Q\equiv Q_2\pmod p.

The positive integer T(c)T(c) is at most 2y2(1+log⁡y)2y^2(1+\log y) and has O(1+log⁡y)O(1+\log y) distinct prime factors. For p>yν/2p>y^{\nu/2}, a single residue class modulo pp, restricted to integers above yνy^\nu and at most yy, has reciprocal sum at most y−ν+(1+log⁡y)/py^{-\nu}+(1+\log y)/p. Summing this bound over p∣T(c)p\mid T(c) and then over cc with weight 1/c1/c gives the second term of the assertion. Primality is not needed for this part.

For W<p≤yν/2W<p\le y^{\nu/2} write c=c2Q2c=c_2Q_2. Multiplicativity gives

T(c)=s(c2)Q22+2σ(c2)Q2+σ(c2).T(c)=s(c_2)Q_2^2+2\sigma(c_2)Q_2+\sigma(c_2).

Since p∣s(a)p\mid s(a) and aa is good, p∤aσ(a)p\nmid a\sigma(a), and therefore p∤c2σ(c2)p\nmid c_2\sigma(c_2). The displayed polynomial is nonzero modulo pp and has at most two roots. For fixed c2,pc_2,p, Brun–Titchmarsh and partial summation bound the reciprocal sum over the allowed Q2>yνQ_2>y^\nu by Oν(1/(p−1))O_\nu(1/(p-1)). For each such Q2Q_2 the same bound applies to Q>yνQ>y^\nu in its class modulo pp. Both uses have p≤yν/2p\le y^{\nu/2}; the prime parameters are larger than p2p^2. Dropping ordering and product restrictions only increases these positive sums. The resulting bound is

Oν(1+log⁡y)∑p>W1(p−1)2≪νlog⁡yW.O_\nu(1+\log y)\sum_{p>W}\frac1{(p-1)^2} \ll_\nu \frac{\log y}{W}.

Proof of the prime-power root bound. Write A=c2A=c_2 and F(t)=FA,a′(t)F(t)=F_{A,a'}(t) as in Lemma 3. The identities a′≡AQ2Q(modd)a'\equiv A Q_2Q\pmod d and

s(a)=s(A)Q2Q+σ(A)(Q2+Q+1)≡0(modd)s(a)=s(A)Q_2Q+\sigma(A)(Q_2+Q+1)\equiv0\pmod d

give

F′(Q2)≡Aσ(A)(Q2−Q)(modd).F'(Q_2)\equiv A\sigma(A)(Q_2-Q)\pmod d.

Every factor on the right is a unit modulo dd: 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 dd. A simple root modulo pjp^j has exactly one lift modulo pj+1p^{j+1}, since F(t+pju)≡F(t)+pjuF′(t)(modpj+1)F(t+p^j u)\equiv F(t)+p^j u F'(t)\pmod{p^{j+1}}. There are at most two simple roots modulo each pp, and the Chinese remainder theorem gives at most 2ω(d)2^{\omega(d)} classes modulo dd. □\square

The extra removal costs o(x)o(x) inputs in S1(x)S_1(x) by the reciprocal-weight estimate in "Setting". It does not assume that the large-prime part of s(a)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<κ<ν/30<\kappa<\nu/3. Since g′=∑d∣g′φ(d)g'=\sum_{d\mid g'}\varphi(d), the G1 sum over eligible pairs of good cofactors is at most

∑(a,a′)W(a)∏p≤Wpp−1 Faa′∑d∣g′φ(d).\sum_{(a,a')}\frac{W(a)\prod_{p\le W}\frac p{p-1}\,F}{aa'} \sum_{d\mid g'}\varphi(d).

Call a divisor dd of g′g' accessible for the pair if max⁡(P(a),P(a′))>d1/(1−κ)\max(P(a),P(a'))>d^{1/(1-\kappa)}, and write Λacc\Lambda_{\rm acc} and Λcore\Lambda_{\rm core} for the parts of this sum over accessible and inaccessible dd.

Proposition 4. Λacc≪ν,κlog⁡2y\Lambda_{\rm acc}\ll_{\nu,\kappa}\log^2y.

Main estimate. Consider the divisors with P(a)>d1/(1−κ)P(a)>d^{1/(1-\kappa)}; the case P(a′)>d1/(1−κ)P(a')>d^{1/(1-\kappa)} is symmetric. Fix a good a′a' and $d\mid s(a')$ composed of primes above WW. By Lemma 3, the good a=c2Q2Qa=c_2Q_2Q with d∣s(a)d\mid s(a), a≡a′(modd)a\equiv a'\pmod d and Q>d1/(1−κ)Q>d^{1/(1-\kappa)} satisfy

∑1a≤∑c2≤y1c2∑Q2>yνFc2,a′(Q2)≡0 (radd)1Q2∑d1/(1−κ)<Q≤yQ≡qc(d) (d)1Q.\sum\frac1a\le\sum_{c_2\le y}\frac1{c_2} \sum_{\substack{Q_2>y^\nu\\ F_{c_2,a'}(Q_2)\equiv0\ (\mathrm{rad}\,d)}} \frac1{Q_2} \sum_{\substack{d^{1/(1-\kappa)}<Q\le y\\ Q\equiv q_c(d)\ (d)}}\frac1Q .

If (qc(d),d)>1(q_c(d),d)>1, a prime p∣dp\mid d divides σ(c)\sigma(c), and d∣s(a)d\mid s(a) forces Q=p<d1/(1−κ)Q=p<d^{1/(1-\kappa)}; so the inner class is reduced whenever it is nonempty. For t≥max⁡(yν,d1/(1−κ))t\ge\max(y^\nu,d^{1/(1-\kappa)}) we have t≥2dt\ge2d for large yy and log⁡(t/d)≥κlog⁡t\log(t/d)\ge\kappa\log t, and the cited Brun–Titchmarsh inequality gives π(t;d,b)≤2t/(κφ(d)log⁡t)\pi(t;d,b)\le2t/(\kappa\varphi(d)\log t). Partial summation from z≥yνz\ge y^\nu to Z≤yZ\le y bounds the inner sum by K1/φ(d)K_1/\varphi(d), with K1=2(1+log⁡(1/ν))/κK_1=2(1+\log(1/\nu))/\kappa.

Put r=rad dr=\mathrm{rad}\,d. The Q2>r1/(1−κ)Q_2>r^{1/(1-\kappa)} in the at most 2ω(d)2^{\omega(d)} classes contribute at most 2ω(d)K1/φ(r)2^{\omega(d)}K_1/\varphi(r) in the same way; a class containing a multiple of a prime p∣rp\mid r contains no such prime. Each class contains at most 2r2κ2r^{2\kappa} integers up to r1/(1−κ)r^{1/(1-\kappa)}, each above yνy^\nu. Therefore the aa-sum is at most

(1+log⁡y) 2ω(d)(K1φ(r)+2r2κyν)K1φ(d).(1+\log y)\,2^{\omega(d)} \Bigl(\frac{K_1}{\varphi(r)}+\frac{2r^{2\kappa}}{y^\nu}\Bigr) \frac{K_1}{\varphi(d)} .

Multiply by φ(d)\varphi(d), sum over d∣s(a′)d\mid s(a') and then over a′a' with weight 1/a′1/a'. The second term contributes at most y2κ−ν+o(1)y^{2\kappa-\nu+o(1)}, because d≤ylog⁡yd\le y\log y and ∑a′<yτ(s(a′))2/a′≤yo(1)\sum_{a'<y}\tau(s(a'))^2/a'\le y^{o(1)}. The first term contributes K12(1+log⁡y)∑a′Φ(s(a′))/a′K_1^2(1+\log y)\sum_{a'}\Phi(s(a'))/a', where

Φ(N)=∑d∣Np∣d⇒p>W2ω(d)φ(rad d)=∏pk∥Np>W(1+2kp−1)=∑e∣Nψ(e),\Phi(N)=\sum_{\substack{d\mid N\\ p\mid d\Rightarrow p>W}} \frac{2^{\omega(d)}}{\varphi(\mathrm{rad}\,d)} =\prod_{\substack{p^k\|N\\ p>W}}\Bigl(1+\frac{2k}{p-1}\Bigr) =\sum_{e\mid N}\psi(e),

with ψ\psi multiplicative, supported on integers whose primes exceed WW, and ψ(pj)=2/(p−1)\psi(p^j)=2/(p-1) for j≥1j\ge1. Swap the sums. For e≤yν/2e\le y^{\nu/2}, the good a′=c′Q′a'=c'Q' with e∣s(a′)e\mid s(a') have Q′Q' in one class modulo ee, reduced because otherwise Q′Q' would be a prime factor of ee, and Q′>yν≥e2Q'>y^\nu\ge e^2, so their weight is at most (1+log⁡y)K1′/φ(e)(1+\log y)K_1'/\varphi(e) with K1′K_1' depending only on ν\nu; and ∑eψ(e)/φ(e)≤∏p>W(1+O(p−2))\sum_e\psi(e)/\varphi(e)\le\prod_{p>W}(1+O(p^{-2})). For e>yν/2e>y^{\nu/2}, the primes Q′>yνQ'>y^\nu of one residue class modulo ee have reciprocal sum at most y−ν+(1+log⁡y)/ey^{-\nu}+(1+\log y)/e, because after the first of them the class has one element in each interval of length ee; so the weight is at most (1+log⁡y)(y−ν+(1+log⁡y)/e)(1+\log y)(y^{-\nu}+(1+\log y)/e). Since ∑e≤ylog⁡yψ(e)=yo(1)\sum_{e\le y\log y}\psi(e)=y^{o(1)} and ∑eψ(e)e−1/2≪1\sum_e\psi(e)e^{-1/2}\ll1, these ee contribute o(1)o(1). Hence ∑a′Φ(s(a′))/a′≪log⁡y\sum_{a'}\Phi(s(a'))/a'\ll\log y, and the divisors with P(a)>d1/(1−κ)P(a)>d^{1/(1-\kappa)} contribute O(log⁡2y)O(\log^2y) before the weights W(a)∏p≤Wp/(p−1)W(a)\prod_{p\le W}p/(p-1) and FF are restored.

Restoring the small-prime weight. Restrict c2c_2 and a′a' to W(c2)=W(a′)=wW(c_2)=W(a')=w; this is forced, because W(a)=W(c2)W(a)=W(c_2) when Q,Q2>WQ,Q_2>W. Writing c2=wmc_2=wm with mm free of primes up to WW, 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 Q2Q_2 and QQ do not depend on ww, and the same factor appears for a′a' in every step of the Φ\Phi estimate. So the weight w∏p≤Wp/(p−1)w\prod_{p\le W}p/(p-1) times the two factors w−1∏p≤W(1−1/p)w^{-1}\prod_{p\le W}(1-1/p), summed over WW-smooth ww, gives ∏p≤W(1−1/p)∑w1/w=1\prod_{p\le W}(1-1/p)\sum_w1/w=1 times the unweighted bound.

The singular-series weight. Pointwise, F≪log⁡log⁡yF\ll\log\log y: the integer βλh/g<y4\beta\lambda h/g<y^4 has O(log⁡y)O(\log y) prime factors, and the product of p/(p−1)p/(p-1) over the first O(log⁡y)O(\log y) primes above WW is O(log⁡log⁡y/log⁡W)O(\log\log y/\log W). This suffices wherever a power saving is available, in particular for the reductions of the core below. In the main term FF must be averaged, as follows.

Put Z0=(log⁡y)2Z_0=(\log y)^2. Primes of TT above Z0Z_0 contribute a factor 1+o(1)1+o(1), since there are O(log⁡y)O(\log y) of them. For W<p≤Z0W<p\le Z_0 let h3(p)=(p/(p−1))3−1≤7/ph_3(p)=(p/(p-1))^3-1\le7/p. Every such prime of TT divides s(a)s(a), or s(a′)s(a'), or hh while dividing neither s(a)s(a) nor s(a′)s(a'). By the arithmetic–geometric mean inequality,

F≤(1+o(1)) 13(A(a)3+A(a′)3+H3),F\le(1+o(1))\,\tfrac13\bigl(A(a)^3+A(a')^3+H^3\bigr),

where A(n)=∏p∣s(n), W<p≤Z0p/(p−1)A(n)=\prod_{p\mid s(n),\,W<p\le Z_0}p/(p-1) and H=∏p∣h, p∤s(a)s(a′), W<p≤Z0p/(p−1)H=\prod_{p\mid h,\ p\nmid s(a)s(a'),\ W<p\le Z_0}p/(p-1). Expand each cube as ∑eh3(e)\sum_eh_3(e) over squarefree ee with the indicated prime factors.

For A(a′)3A(a')^3: Φ(N)A(N)3=∑e∣Nψ3(e)\Phi(N)A(N)^3=\sum_{e\mid N}\psi_3(e) with ψ3\psi_3 multiplicative and ψ3(pj)≪1/p\psi_3(p^j)\ll1/p, and the Φ\Phi estimate applies unchanged.

For A(a)3A(a)^3: a prime p∣ep\mid e with p∤dp\nmid d puts QQ in one class modulo pp, because p∤s(c)p\nmid s(c), and p∣σ(c)p\mid\sigma(c) would force Q=p≤Z0Q=p\le Z_0. For e≤E0=yκν/16e\le E_0=y^{\kappa\nu/16}, QQ then lies in one class modulo dede, and log⁡E0≤(κ/4)log⁡Q\log E_0\le(\kappa/4)\log Q lets Brun–Titchmarsh give K2/(φ(d)φ(e))K_2/(\varphi(d)\varphi(e)) in place of K1/φ(d)K_1/\varphi(d), with K2K_2 depending on κ,ν\kappa,\nu; and ∑eh3(e)/φ(e)≪1\sum_eh_3(e)/\varphi(e)\ll1. Primes p∣ep\mid e that divide dd impose nothing new and contribute ∏p∣d(1+7/p)\prod_{p\mid d}(1+7/p), which joins Φ\Phi. For e>E0e>E_0, 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 H3H^3: a prime p∣ep\mid e divides σ(a′)−σ(a)\sigma(a')-\sigma(a) but neither s(a)s(a) nor s(a′)s(a'), so p∤dp\nmid d. If p∤σ(c)p\nmid\sigma(c), then Q≡σ(a′)σ(c)−1−1(modp)Q\equiv\sigma(a')\sigma(c)^{-1}-1\pmod p, one class, handled as for A(a)3A(a)^3. If p∣σ(c)p\mid\sigma(c), then p∣σ(a)p\mid\sigma(a), so p∣σ(a′)=σ(c′)(Q′+1)p\mid\sigma(a')=\sigma(c')(Q'+1). If moreover p∤σ(c′)p\nmid\sigma(c'), then Q′≡−1(modp)Q'\equiv-1\pmod p, one class, absorbed by the Brun–Titchmarsh step for Q′Q' in the Φ\Phi estimate. The remaining primes divide both σ(c)\sigma(c) and σ(c′)\sigma(c'), and their factors multiply to at most G(c)G(c′)G(c)G(c'), where G(n)=∏p∣σ(n), W<p≤Z0(1+7/p)1/2G(n)=\prod_{p\mid\sigma(n),\,W<p\le Z_0}(1+7/p)^{1/2}.

The weight GG has bounded mean. Since σ(c)=σ(c2)(Q2+1)\sigma(c)=\sigma(c_2)(Q_2+1), G(c)≤G(c2)∏p∣Q2+1, W<p≤Z0(1+7/p)1/2G(c)\le G(c_2)\prod_{p\mid Q_2+1,\,W<p\le Z_0}(1+7/p)^{1/2}, and the second factor expands into conditions Q2≡−1(modf)Q_2\equiv-1\pmod f, absorbed by the Brun–Titchmarsh step for Q2Q_2.

Here the simultaneous congruences can be kept throughout the sums. A prime dividing dd divides neither σ(a)\sigma(a) nor σ(a′)\sigma(a') on the good set. Thus the new moduli from HH and from Q2+1Q_2+1 are coprime to dd. On the long Q2Q_2 range in the main estimate, a modulus f≤E0f\le E_0 therefore changes its root-class bound to Oν,κ(2ω(d)/(φ(r)φ(f)))O_{\nu,\kappa}(2^{\omega(d)}/(\varphi(r)\varphi(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 rr with the class −1-1 modulo ff. The short Q2Q_2 range is already a power-saving error and can use the pointwise polylogarithmic bound for FF.

The primes assigned to a congruence on QQ multiply its original modulus dd by at most E0E_0, with the same margin. The primes assigned to Q′≡−1Q'\equiv-1 multiply the small modulus e≤yν/2e\le y^{\nu/2} in the Φ\Phi calculation by at most E0E_0. These two moduli on Q′Q' are coprime: a common prime would divide both s(a′)s(a') and σ(a′)\sigma(a'), contradicting goodness. Their product is at most Q′1/2+κ/16Q'^{1/2+\kappa/16}. All reciprocal prime sums consequently keep their uniform Brun–Titchmarsh bounds, with the additional factors 1/φ(f)1/\varphi(f) for the added moduli. Summing their nonnegative expansion coefficients converges, since each new prime contributes O(p−2)O(p^{-2}). For any added modulus above E0E_0, the same Rankin bound as for A(a)3A(a)^3 is a negative power of yy times yo(1)y^{o(1)}; pointwise polylogarithmic bounds handle the other weights. This also covers the large-ee remainder of the Φ\Phi calculation.

For c2=wmc_2=wm with mm free of primes up to WW, G(c2)≤G(w)G(m)G(c_2)\le 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)g(q)=\prod_{p\mid q+1,\,W<p\le Z_0}(1+7/p)^{1/2}=\sum_{f\mid q+1}\xi(f), where ξ\xi is multiplicative on squarefree ff with primes in (W,Z0](W,Z_0] and ξ(p)≤4/p\xi(p)\le4/p. The partial summation of Lemma 0 gives ∑q<y, q≡−1 (f)1/q≤(2L+5)/φ(f)\sum_{q<y,\,q\equiv-1\ (f)}1/q\le(2L+5)/\varphi(f) for f≤y1/2f\le y^{1/2}, and the trivial bound 2log⁡y/f2\log y/f holds for larger ff. 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′c' on the a′a'-side. Finally ∑wG(w)2/w≤(1+o(1))∏p≤W(1−1/p)−1\sum_wG(w)^2/w\le(1+o(1))\prod_{p\le W}(1-1/p)^{-1} over WW-smooth ww, because σ(pk)<pk+1\sigma(p^k)<p^{k+1} has at most (k+1)log⁡p/log⁡W(k+1)\log p/\log W prime factors above WW. So the factors G(w)2G(w)^2 cost 1+o(1)1+o(1) against ∑w1/w\sum_w1/w. Large moduli ee and ff are removed by Rankin's trick as above. Hence the main estimate holds with the weight FF, up to a constant factor depending on ν\nu and κ\kappa. □\square

The open core

The remaining part is

Λcore=∑(a,a′)W(a)∏p≤Wpp−1 Faa′∑d∣g′d1/(1−κ)≥max⁡(P(a),P(a′))φ(d),\Lambda_{\rm core} =\sum_{(a,a')}\frac{W(a)\prod_{p\le W}\frac p{p-1}\,F}{aa'} \sum_{\substack{d\mid g'\\ d^{1/(1-\kappa)}\ge\max(P(a),P(a'))}} \varphi(d),

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(log⁡y)o(\log y). We have d>yν(1−κ)d>y^{\nu(1-\kappa)}, and d≤min⁡(∣a′−a∣,s(a),s(a′))<yd\le\min(|a'-a|,s(a),s(a'))<y. When d>P(a)d>P(a), item 1 of Lemma 3 pins the largest prime of aa:

P(a) is the least positive residue of −σ(c) s(c)−1(modd),P(a)\ \text{is the least positive residue of}\ -\sigma(c)\,s(c)^{-1} \pmod d ,

and likewise for a′a'. So the core counts pairs of cofactors whose values of ss 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\kappa''>0 with 2κ+κ′′<ν2\kappa+\kappa''<\nu. Fix a′a' and d∣s(a′)d\mid s(a'). Lemma 6 puts Q2Q_2 in at most 2ω(d)2^{\omega(d)} classes modulo dd, and the primes above yνy^\nu in one class have reciprocal sum at most y−ν+(1+log⁡y)/dy^{-\nu}+(1+\log y)/d.

If Q=P(a)≥d1−κ′′Q=P(a)\ge d^{1-\kappa''}, then Q≤d1/(1−κ)Q\le d^{1/(1-\kappa)} lies in one class modulo dd, so at most 2d2κ2d^{2\kappa} values occur, each with 1/Q≤dκ′′−11/Q\le d^{\kappa''-1}. After the factor φ(d)≤d\varphi(d)\le d and the sum over c2c_2, the aa-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≤ylog⁡yy^{\nu(1-\kappa)}\le d\le y\log y, summing over d∣s(a′)d\mid s(a') and over a′a' gives y−c+o(1)y^{-c+o(1)} for some c=c(ν,κ,κ′′)>0c=c(\nu,\kappa,\kappa'')>0.

Lemma 5. Let c,c′≥2c,c'\ge2 satisfy vp(σ(c))>vp(c)v_p(\sigma(c))>v_p(c) and vp(σ(c′))>vp(c′)v_p(\sigma(c'))>v_p(c') for every prime p≤Wp\le W, let (c,σ(c))(c,\sigma(c)) and (c′,σ(c′))(c',\sigma(c')) have no prime factor above WW, and let W(c)=W(c′)W(c)=W(c'). If c≠c′c\ne c', then Δ(c,c′)=c σ(c)s(c′)−c′σ(c′)s(c)≠0\Delta(c,c')=c\,\sigma(c)s(c')-c'\sigma(c')s(c)\ne0. The hypotheses hold for c=a/P(a)c=a/P(a) and c′=a′/P(a′)c'=a'/P(a') when a,a′a,a' are good and W(a)=W(a′)W(a)=W(a').

Proof. Δ(c,c′)=0\Delta(c,c')=0 means c+c2/s(c)=c′+c′2/s(c′)c+c^2/s(c)=c'+c'^2/s(c'). The first hypothesis gives vp(s(c))=vp(c)v_p(s(c))=v_p(c) for p≤Wp\le W, and by the second no prime above WW divides both cc and s(c)s(c). So (c2,s(c))=W(c)(c^2,s(c))=W(c), and (c2/W(c))/(s(c)/W(c))(c^2/W(c))/(s(c)/W(c)) is c2/s(c)c^2/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′)s(c)/W(c)=s(c')/W(c'), and W(c)=W(a)=W(a′)=W(c′)W(c)=W(a)=W(a')=W(c') gives s(c)=s(c′)s(c)=s(c'). Since t↦t+t2/st\mapsto t+t^2/s is increasing for s>0s>0, c=c′c=c'. For good cofactors, condition 2 is the first hypothesis, condition 3 gives the second because c∣ac\mid a and σ(c)∣σ(a)\sigma(c)\mid\sigma(a), and W(c)=W(a)W(c)=W(a) because P(a)>WP(a)>W. □\square

Both largest primes below dd. If P(a),P(a′)<dP(a),P(a')<d, then each is the least positive residue of its class, so c≠c′c\ne c' (otherwise a=a′a=a'), the pair is determined by (c,c′,d)(c,c',d), and d∣Δ(c,c′)d\mid\Delta(c,c'), which follows from item 3 of Lemma 3 after multiplying by s(c′)s(c'). Lemma 5 makes Δ(c,c′)\Delta(c,c') a nonzero integer of size yO(1)y^{O(1)}, so it has yo(1)y^{o(1)} divisors. Hence the pairs with P(a)P(a′)≥d1+ϵP(a)P(a')\ge d^{1+\epsilon} contribute at most ∑c,c′(cc′)−1∑d∣Δ(c,c′)d−ϵ\sum_{c,c'}(cc')^{-1}\sum_{d\mid\Delta(c,c')}d^{-\epsilon} over d≥yν(1−κ)d\ge y^{\nu(1-\kappa)}, which is y−c+o(1)y^{-c+o(1)}. Since P(a)P(a′)>y2νP(a)P(a')>y^{2\nu}, this covers every such pair with d≤y2ν/(1+ϵ)d\le y^{2\nu/(1+\epsilon)}.

Two large primes on one side. If P(a)<dP(a)<d and P(a)P2(a)≥d1+ϵP(a)P_2(a)\ge d^{1+\epsilon}, fix a′a' and d∣s(a′)d\mid s(a') and restrict QQ and Q2Q_2 to dyadic ranges [R,2R)[R,2R) and [R2,2R2)[R_2,2R_2) with RR2≥d1+ϵ/4RR_2\ge d^{1+\epsilon}/4. Then QQ is determined by (c2,Q2)(c_2,Q_2), and Q2Q_2 takes at most 2ω(d)(R2/d+1)2^{\omega(d)}(R_2/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/2R\ge(RR_2/2)^{1/2}. After the factor φ(d)\varphi(d), the sums over c2c_2, the dyadic ranges, d∣s(a′)d\mid s(a') and a′a' give y−c+o(1)y^{-c+o(1)}. The same holds with aa and a′a' exchanged.

These parts contribute o(1)o(1), also with the weights restored: the small-prime weight as in Proposition 4, and FF through its pointwise bound F≪log⁡log⁡yF\ll\log\log y against the power savings. What remains consists of divisors exceeding P(a)1/(1−κ′′)P(a)^{1/(1-\kappa'')} and P(a′)1/(1−κ′′)P(a')^{1/(1-\kappa'')}, for which the two largest of P(a),P2(a),P(a′),P2(a′)P(a),P_2(a),P(a'),P_2(a') have product below d1+ϵd^{1+\epsilon}. Necessarily d>y2ν/(1+ϵ)d>y^{2\nu/(1+\epsilon)}. Both largest primes are least residues of their classes, determined by the rest of their cofactors. There is no restriction on the radical of dd: Lemma 6 supplies the prime-power root count for all retained pairs.

Gap G1-core. Prove Λcore≪log⁡2y\Lambda_{\rm core}\ll\log^2y for fixed small ν\nu and κ\kappa. By the reductions above it suffices to bound the remaining regime, with its weights. In a model where s(a)s(a) and s(a′)s(a') are independent of aa and a′a' modulo large dd, the inner condition has probability about d−3d^{-3}, and the core is O(y−ν/2log⁡2y)O(y^{-\nu/2}\log^2y). 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 dd, and in the core no prime of either cofactor has that range. Enumerating dd as a divisor of one value of ss and bounding the progression a′≡a(modd)a'\equiv a\pmod d trivially loses the factor dd that the condition d∣s(a′)d\mid s(a') should supply; the result is too large by about the average number of divisors of s(a)s(a) above yν/2y^{\nu/2}. The two-dimensional large sieve bounds the total variance of (a,σ(a))(a,\sigma(a)) over all residue pairs modulo dd, but that variance may sit on the diagonal residues a≡σ(a)a\equiv\sigma(a) counted here, and it reaches only dd up to about y1/2y^{1/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\Pi_W=\prod_{p\le W}p and Cδ=1+2/δC_\delta=1+2/\delta. For an eligible pair of good cofactors in Aδ(y)\mathcal A_\delta(y), let u=s(a)/gu=s(a)/g, v=s(a′)/gv=s(a')/g and H=h/gH=h/g. Then

ΠW∣H,0<∣H∣<Cδmax⁡(u,v),(uv,ΠW)=1.\Pi_W\mid H,\qquad 0<|H|<C_\delta\max(u,v),\qquad (uv,\Pi_W)=1.

In particular max⁡(u,v)>ΠW/Cδ\max(u,v)>\Pi_W/C_\delta. For every fixed KK, no such pair has max⁡(u,v)≤K\max(u,v)\le K for sufficiently large yy. This includes s(a)=s(a′)s(a)=s(a'), for which u=v=1u=v=1.

Proof. At every p≤Wp\le W, Lemma 2 gives vp(s(a))=vp(s(a′))=vp(g)v_p(s(a))=v_p(s(a'))=v_p(g) and vp(h)>vp(g)v_p(h)>v_p(g). This proves the divisibility and coprimality. Also σ(a)≤Cδs(a)\sigma(a)\le C_\delta s(a) and σ(a′)≤Cδs(a′)\sigma(a')\le C_\delta 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→∞W\to\infty, so ΠW→∞\Pi_W\to\infty. □\square

The core is a scaled collision problem at the cofactor scale. For a core divisor dd put λ=s(a)/d\lambda=s(a)/d and λ′=s(a′)/d\lambda'=s(a')/d. Then

λ′ s(a)=λ s(a′),a′≡a(mods(a)/λ),λ≤s(a)P(a)1−κ≤(1+log⁡y) aP(a)1−κ,\lambda'\,s(a)=\lambda\,s(a'),\qquad a'\equiv a\pmod{s(a)/\lambda},\qquad \lambda\le\frac{s(a)}{P(a)^{1-\kappa}}\le\frac{(1+\log y)\,a}{P(a)^{1-\kappa}},

and likewise for λ′\lambda'. These coefficients have size at most y1−ν/2y^{1-\nu/2} for large yy. Lemma 7 excludes bounded coefficients after their common factor is cancelled; in particular ordinary cofactor collisions contribute no eligible pair once yy 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=cQa=cQ and a′=c′Q′a'=c'Q' changes the scaled equality to

λ′(Q+1)s(c)−λ(Q′+1)s(c′)=λc′−λ′c.\lambda'(Q+1)s(c)-\lambda(Q'+1)s(c') =\lambda c'-\lambda'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ℓm=q\ell with ℓ≤x1/10\ell\le x^{1/10}, and a common divisor hh of s(m)s(m) and s(m′)s(m') divides ℓσ(ℓ)s(ℓ′)−ℓ′σ(ℓ′)s(ℓ)\ell\sigma(\ell)s(\ell')-\ell'\sigma(\ell')s(\ell), the analogue of Δ′\Delta' with both cofactors decomposed. That integer is smaller than 2x3/102x^{3/10} in absolute value, so a divisor h>x1/3h>x^{1/3} forces it to vanish, and the gcd properties of their Lemma 1 then force ℓ=ℓ′\ell=\ell'. For general cofactors the analogous integer has size up to about y3y^3, and no such forcing occurs.

Consequence for the large-prime class

G0, Proposition 4 and the core estimate together give, for each ε>0\varepsilon>0 and the corresponding removal of at most εx\varepsilon x inputs, CS1(x)≪δ,η,εxC_{S_1}(x)\ll_{\delta,\eta,\varepsilon}x for the remaining inputs. With the truncation argument of Theorem B this would show that for every set AA of density zero, the n≤xn\le x with s(n)∈As(n)\in A and P(n)>x1/2+ηP(n)>x^{1/2+\eta} number o(x)o(x), and hence that s−1(A)s^{-1}(A) has upper density at most 1−log⁡21-\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.