diff fdc0cce..78b8f82 weighted_dilation_totient_fibers_v2.txt
diff --git a/weighted_dilation_totient_fibers_v2.txt b/weighted_dilation_totient_fibers_v2.txt
index bc81240..0a2e6ab 100644
--- a/weighted_dilation_totient_fibers_v2.txt
+++ b/weighted_dilation_totient_fibers_v2.txt
@@ -2138,3 +2138,2195 @@ changing any kernel parameter, any A_0, or the exponent C_1.
This completes the proof of Theorem 7.1: the ideal norm bound (7.1) holds
with the constants chosen in (7.26), (7.27), (7.28) and (7.30), and with m
and C_1 depending only on E_id and on the fixed data of section 5.1.
+
+
+8. LIFTED SHIFTED CORRELATIONS
+
+
+We keep the prime groups P_g and their notation from sections 5-7. So the
+small groups sit in [exp(L^a), exp(L^b)], the big groups are intervals of
+primes in [exp(L^c), exp(L^d)], with 0 < a < b < c < d < 0.47. All groups
+are disjoint, their harmonic masses V_g lie in [v_-, v_+], and each kind
+has between c_0 T and C_0 T groups. The parameters q in (0,1) and ell >= 1
+are fixed. Write P = union_g P_g and let n_* be the P-free part of n.
+
+
+8.1 THE MARKED WEIGHTS AND ENDPOINTS.
+
+For a vector t = (t_g)_g of nonnegative integers, define the marked weight
+
+ W_t(n) = q^(omega(n) - sum_g t_g) prod_g ((omega_g(n))_t_g / V_g^(t_g)),
+ (8.1)
+
+where (y)_t = y(y-1)...(y-t+1). The falling factorial counts ordered lists
+of distinct group primes dividing n. For a function b on these lists,
+
+ W_t^b(n) = q^(omega(n) - sum_g t_g) prod_g V_g^(-t_g) (8.2)
+ sum over ((p_(g,1),...,p_(g,t_g)) : distinct in each group,
+ p_(g,j) in P_g, p_(g,j) | n) of b((p_(g,j))).
+
+An empty admissible-list set gives value zero. Write W_ell when all
+t_g = ell. For every fixed t_max,
+
+ sup_(max t_g <= t_max) |W_t^b(n)| <= ||b||_infty L^(C(t_max)) (8.3)
+
+because q^(y-t) (y)_t / V_g^t has a bounded sup over integers y >= t,
+uniformly for t <= t_max, and there are O(T) groups.
+
+An ENDPOINT is a function invariant under multiplication by P-integers,
+of the form
+
+ F_0(n) = sum_(mpr = n_*) alpha_m chi_0(m) m^(i sigma_0) (8.4)
+ 1_(p in I_p, P^-(p) > W) p^(i sigma_1) c_r.
+
+Here |alpha_m|, |c_r| <= L^C, alpha_m = 0 unless P^-(m) > W, I_p is an
+interval in [x^tau, x^eta] with fixed 0 < tau < eta < 1/4, chi_0 is a
+Dirichlet character of modulus at most L^C, and |sigma_0|, |sigma_1| <=
+L^C. The variable p is an integer, not asserted prime. The sequences may
+depend on x, and all parameters may differ at the two endpoints. Since
+W = exp(sqrt L) exceeds every group prime, m and p are P-free for large x.
+
+We impose the DISCREPANCY CONDITION on the alpha sequence of at least the
+first endpoint:
+
+ | sum over m in I of alpha_m chi(m) m^(iu) / m | <= L^(-B) (8.5)
+
+for every interval I in [1, x^2], every Dirichlet character of modulus at
+most L^B, and every real u with |u| <= L^B. Principal and imprimitive
+characters are included. An existing interval restriction on alpha is
+part of the sequence.
+
+
+THEOREM 8.1 (lifted shift cancellation). Fix all the group and endpoint
+bounds above, fix D_0 and C > 0, and a fixed compact interval
+[c_Psi, C_Psi] in (0, infinity). Suppose 0 < |k| <= L^C is an integer,
+x L^(-C) <= Z <= x L^C, |a_1|, |a_2| <= L^C, and Psi is supported in the
+stated interval with ||Psi^(j)||_infty <<_j L^(C(j+1)) for every j >= 0.
+There is a fixed B, depending only on these data and on D_0, such that
+(8.5) implies
+
+ sum over z > 0, z + k > 0 of
+ (Psi(z/Z)/z) z^(ia_1) (z+k)^(ia_2)
+ conj(F_0(z)) G_0(z+k) W_ell(z) W_ell(z+k) (8.6)
+ << L^(-D_0).
+
+The bound is uniform over the indicated sequences, intervals, characters,
+frequencies, and cutoffs. It also holds when the discrepancy-bearing
+endpoint or its coefficients have been conjugated.
+
+Conjugating on the right is harmless: conjugate (8.5) and replace chi by
+conj(chi), u by -u. Products with extra characters and bounded power
+twists are covered by increasing B. We prove (8.6) in the next seven
+subsections.
+
+
+8.2 THE PHYSICAL LIFT AND REMOVAL OF SHARED LABELS.
+
+Take the raw pattern and the signed comparison patterns of Theorem 7.1.
+Write m_probe for the fixed probe bound of that theorem; the letter m in
+(8.4) denotes an integer factor, not a probe count. As in the physical
+construction, M = J + ell, the edge product is D, and the positions are
+n and n' = n + k D. Insert into the physical pairing the root weight
+Psi(n/(ZD))/n, the edge phase D^(-i(a_1+a_2)), and the mark-independent
+vectors
+
+ f(n, p) = n^(-ia_1) F_0(n) q^((omega(n) - Ms)/2), (8.7)
+ g(n', p') = (n')^(ia_2) G_0(n') q^((omega(n') - Ms)/2).
+
+Our pairing is conjugate-linear in its first entry, so the integrand
+contains n^(ia_1) conj(F_0(n)) at the source and (n')^(ia_2) G_0(n') at
+the target. Every factor involving D is inside the slot symmetrisations.
+
+On the support, n = ZD times x^o(1) and n'/n = 1 + O(L^C/Z). A partition
+into at most O(L) dyads n = X plus restriction of the other endpoint to
+an interval of length O(X) therefore suffices.
+
+Step 1: the endpoint norm bound. On a physical state omega(n) >= Ms, so
+the damping in (8.7) is at most one. There are at most tau(n_*)^2 ordered
+factorizations in (8.4), so |F_0(n)| <= L^(2C) tau(n_*)^2. Fix an
+ordered physical list S' of M distinct labels per group, with product
+P(S'). For P(S') | n, one has n_* | n/P(S'), hence
+
+ sum over n = X, P(S') | n of tau(n_*)^4 (8.8)
+ <= sum over v = X/P(S') of tau(v)^4
+ << (X/P(S')) L^(C_5).
+
+Here P(S') <= exp(O_J(T L^d)) = x^o(1), so the v-interval still has
+positive power length. Moreover
+
+ sum over S' of (1/P(S')) prod_g V_g^(-M)
+ <= prod_g (sum_(p in P_g) 1/(p V_g))^M = 1. (8.9)
+
+So both endpoint vectors have norm at most X^(1/2) L^(C_6) in the
+physical state measure, with C_6 independent of J and of the probe count.
+Also |F_0(n)| <= exp(O(sqrt L)): an integer of size x^O(1) has O(sqrt L)
+prime factors above W, with multiplicity, hence at most 2^(O(sqrt L))
+choices of the rough divisors m, p. The vectors are independent of the
+selected marks.
+
+Step 2: logarithmic Fourier inversion. Let Phi(u) = Psi(e^u). Then
+
+ Psi(n/(ZD)) = (1/(2 pi)) int_R hat_Phi(v) (n/Z)^(iv) D^(-iv) dv. (8.10)
+
+The derivative hypotheses give an L^O(1) integral norm, and, for any
+fixed large C_7, the tails |v| > L^(C_7) have arbitrarily large negative
+log powers. The cutoff exponent C_7 may be fixed from the derivative
+bounds: more integrations by parts increases the saving without
+increasing C_7.
+
+On the dyad, multiply the first vector by X/n and by (n/Z)^(-iv) and
+divide the pairing by X. The conjugation in the pairing supplies
+(n/Z)^(iv). The required ideal frequency is zeta = -a_1 - a_2 - v. By
+Corollary 5.3 and Theorem 7.1 the entire residual pairing is bounded by
+L^(-D_1) for any prescribed D_1, after choosing the transfer target
+first, then the ideal family, then J. The norm exponent just proved
+makes this ordering possible. The discarded Fourier tails obey the same
+conclusion by Lemma 5.1; their accuracy may be chosen after the absolute
+comparison costs are known. All these apply to the sum of patterns,
+with their signs.
+
+Step 3: per pattern, after the lift. In group g write c_g for its
+free-slot count and s_(R,g) = J - c_g for its shared-slot count; so
+t_g = ell + c_g. Let D_R, D_C be the products of the shared and free
+labels, so D = D_R D_C. This partition is by ROLE, not by size; the
+earlier D = D_S D_B partition is by size. Set n = D_R w, n' = D_R w',
+so w' = w + k D_C. The physical state and target-list normalizations
+in group g are
+
+ V_g^(-M-t_g) = V_g^(-s_(R,g) - 2 t_g), M + t_g = s_(R,g) + 2 t_g. (8.11)
+
+The factor 1/D_R from 1/n changes each shared-label sum into a draw of
+mass 1/(p V_g) and leaves V_g^(-t_g) at each endpoint for its unshared
+lists. Away from shared overlaps,
+
+ omega_g(D_R w) - M = omega_g(w) - t_g. (8.12)
+
+The graph damping and that in (8.7) supply the full power of q at each
+endpoint. Invariance of F_0 gives F_0(D_R w) = F_0(w); and the phases
+become
+
+ (D_R w)^(ia_1) (D_R w')^(ia_2) (D_R D_C)^(-i(a_1+a_2))
+ = (w/D_C)^(ia_1) (w'/D_C)^(ia_2). (8.13)
+
+The coefficient K_nu of a comparison uses the free labels and the
+designated unshared big labels, and uses no shared labels. Its
+dependence therefore survives the shared-harmonic summation.
+
+Step 4: error bounds from the exclusions. For fixed w, w', D_C and any
+earlier shared draws, only O_J(L) values are forbidden to a new shared
+draw (endpoint prime divisors, free labels, previous shared labels).
+Each atom has mass at most v_-^(-1) exp(-L^a). The O_J(T) draws have
+excluded total probability L^(O_J(1)) exp(-L^a).
+
+For distinct shared values the exact identity is
+
+ omega(D_R w) - Ms = omega(w) - sum_g t_g - #{p : p | D_R, p | w}. (8.14)
+
+Bounding actual overlap terms by the unrestricted marked sum costs at
+most q^(-2Ms) = L^(O_J(1)) in damping. Unshared divisors still divide
+w, w', and their count cannot increase. By (8.3), endpoint
+Cauchy-Schwarz, and divisor moments, their remaining absolute harmonic
+average is L^O(1). So shared exclusions cost L^(O_J(1)) exp(-L^a).
+
+Step 5: the free-label ban. Once shared overlaps are excluded, the
+remaining ban excludes free labels from the unshared endpoint mark
+lists. Every excluded configuration thus has a free prime p' dividing
+an endpoint. Since p' | D_C, both p' | w and p' | w'; so it suffices to
+bound all such multiples. On w = Y_0 = Z D_C, put w = p' v and
+w' = p' (v + k D_C/p'). Invariance and Cauchy-Schwarz give
+
+ sum over w = Y_0, p' | w of |F_0(w) G_0(w + k D_C)| / w
+ << L^O(1) / Y_0 (8.15)
+ ( sum over v = Y_0/p' of tau(v)^4 )^(1/2)
+ ( sum over v = Y_0/p' of tau(v + k D_C/p')^4 )^(1/2)
+ << L^O(1) / p'.
+
+Both shifted ranges lie in positive intervals of length O(Y_0/p'), and
+Y_0/p' = x^(1+o(1)). The mark weights, coefficients, and total pattern
+costs are fixed log powers, so summing over the free slots makes this
+error negligible too. This is an AVERAGED bound over multiples of p',
+not a restriction on the arbitrary coefficients.
+
+Step 6: the stripped form per pattern. Up to errors smaller than every
+fixed negative log power, each pattern contributes
+
+ E_free sum over w > 0, w' = w + k D_C > 0 of (8.16)
+ (Psi(w/(Z D_C))/w) (w/D_C)^(ia_1) (w'/D_C)^(ia_2)
+ conj(F_0(w)) G_0(w') W_t(w) W_t(w') E_marks(K_nu).
+
+The outer expectation uses independent free-label laws mu_g. Conditional
+on these labels and the positions, the inner expectation uses
+independent uniform ordered unshared lists at each endpoint; its term is
+zero if either list set is empty. The raw pattern has D_C = 1 and
+t_g = ell, so it is exactly the sum in (8.6). What remains is to bound
+every comparison term.
+
+
+8.3 COMPARISON SHIFTS AND THEIR MAJOR ARCS.
+
+Expand a comparison coefficient from Lemma 7.6 by its two logarithmic
+cells and its two characters. Its factors on the free products D_A, D_B
+separate, and the remaining factors are bounded weights on big unshared
+marks at the two endpoints. Cell normalizations, the number of terms,
+and the integral costs are fixed log powers, independent of J. Let H'
+be the product of the lower size endpoints of the two cells; then
+D_A D_B = H' up to e^h, and
+
+ H' >= exp(L^c), H' <= exp(O(m_probe T L^d)), Y = Z H' = x^(1+o(1)). (8.17)
+
+Insert smooth size cutoffs at w, w' = Y, separate Psi(w/(Z D_A D_B))
+logarithmically, and include Y/w in the first cutoff. Up to a factor of
+1/Y and fixed log-power costs, every resulting term has the form
+
+ E_(D_A, D_B) b_1(D_A) b_2(D_B)
+ sum over w of conj(U(w)) V(w + k D_A D_B), (8.18)
+
+with |b_1|, |b_2| <= 1, each supported on its cell. Each endpoint
+sequence is its invariant endpoint times a smooth cutoff at Y, a power
+w^(iv) with |v| <= L^O(1), and a weight W_t^b(w). The extra mark
+function uses only big labels. In particular
+
+ sum over w of |U(w)|^2 + |V(w)|^2 << Y L^(C_8). (8.19)
+
+All the frequency and cutoff bounds here are fixed before B.
+
+The endpoint sequences are now independent of the free products. Fourier
+inversion isolates the weighted shift average as a multiplier; bilinear
+cancellation handles it away from small rational frequencies; endpoint
+Fourier energy handles the rest. Put hat_F(theta) = sum over w of
+F(w) e(theta w) on R/Z. The multiplier in (8.18) is
+
+ M(theta) = E b_1(D_A) b_2(D_B) e(-k theta D_A D_B). (8.20)
+
+Claim: for every fixed desired saving D_2, M is O(L^(-D_2)) outside the
+MAJOR ARCS
+
+ Mset = union_(1 <= r <= L^(C_arc)) union_(u mod r) (8.21)
+ { theta : dist_R/Z(theta, u/r) <= L^(C_arc)/H' },
+
+if C_arc is large enough. To verify the coefficient hypothesis of Lemma
+7.4, collapse a free product of size U_0 to integer weights rho(n).
+Each group contributes at most m_probe slots. Unique factorization
+bounds the multiplicity at n by prod_g(m_probe!), and the V_g
+normalizations cost another fixed constant per slot. So rho(n) <=
+L^O(1)/n and sum_n rho(n) = 1; for bounded tests,
+
+ sum over n = U_0 of |b(n) rho(n)|^2 << L^O(1)/U_0. (8.22)
+
+Both free products are nonempty and each contains a big prime, so both
+sizes exceed every fixed power of L.
+
+Put Q_D = floor(H'/L^(C')). Dirichlet approximation to k theta gives a
+reduced u'/r' with r' <= Q_D and |k theta - u'/r'| <= 1/(r' Q_D) <=
+(r')^(-2), where 1/(r' Q_D) << L^(C')/(r' H'). If r' <= L^(C'),
+division by k places theta on one of the arcs of (8.21) after increasing
+C_arc; reduction can only decrease the denominator. Otherwise
+L^(C') < r' << H'/L^(C'). The integer bilinear estimate of Lemma 7.4
+then saves any prescribed log power by increasing C'. Parseval and
+(8.19) handle the complementary contribution, including its 1/Y.
+
+Put H = H'/L^(C_arc). On each arc it suffices to prove, for every fixed
+A > 0,
+
+ int over |beta| <= 1/H of |hat_U(u/r + beta)|^2 d beta <<_A Y L^(-A).
+
+ (8.23)
+
+Indeed |M| <= 1, and Cauchy-Schwarz with (8.19) gives L^(-A/2 + C_8/2)
+per arc after division by Y. There are at most L^(2 C_arc + O(1)) arcs.
+We establish (8.23) with A chosen after all these costs. Its proof uses
+three features of the first endpoint: one small prime can be extracted
+from its ordered marks, every factorization contains the long
+rough-integer factor in (8.4), and the alpha coefficients satisfy (8.5).
+
+
+8.4 ONE SMALL MARK AND THE RATIONAL CHARACTER EXPANSION.
+
+Choose any small group g_s and a designated slot among its t_(g_s) =
+ell >= 1 ordered marks. The endpoint mark weight is independent of the
+small labels. Whenever no prime of P_(g_s) has its square dividing w,
+removal of the prime in this slot gives the exact identity
+
+ W_t^b(w) = sum over p_s in P_(g_s), p_s | w of
+ (1/V_(g_s)) W_(t - e_(g_s))^b(w/p_s). (8.24)
+
+Removing the designated slot is a bijection of the ordered lists; both
+omega_(g_s) and t_(g_s) decrease by one. There is therefore no extra
+factorial or damping factor. Both sides, even on the exceptional
+integers, are L^O(1) by (8.3) and omega_(g_s)(w) = O(L). Since
+w_* | w/p_s^2 on a square multiple, the squared norm of the error after
+multiplication by F_0 is at most
+
+ L^O(1) sum over p_s in P_(g_s) of sum over w = Y, p_s^2 | w of
+ tau(w_*)^4
+ << Y L^O(1) sum over p_s in P_(g_s) of p_s^(-2)
+ << Y L^O(1) e^(-L^a). (8.25)
+
+Every Y/p_s^2 = x^(1+o(1)). Parseval makes this error negligible in
+(8.23).
+
+After (8.24), combine the remaining P-part with the residual factor of
+(8.4). The full integer factorization is w = m p_s p r, with residual
+coefficient c_(r_*) W_(t - e_(g_s))^b(r). This identity uses that m and
+p have no group factors. The residual coefficient is a function of r
+alone, bounded by L^O(1).
+
+All of m, p_s, p are units modulo the arc denominator r_0 <= L^(C_arc).
+Separate residual factors by d_0 = gcd(r, r_0), put q_0 = r_0/d_0. On
+units modulo q_0 the exact finite character expansion is
+
+ e(uv/q_0) = sum over chi mod q_0 of c_(u,q_0)(chi) chi(v), (8.26)
+ c_(u,q_0)(chi) = (1/phi(q_0))
+ sum over v mod q_0, gcd(v,q_0)=1 of
+ e(uv/q_0) conj(chi(v)).
+
+Each coefficient has modulus at most one. Use this with
+v = m p_s p (r/d_0); the condition gcd(r, r_0) = d_0 guarantees that v is
+a unit modulo q_0. The factors chi(r/d_0) and the gcd restriction are
+absorbed into the residual coefficient. Every character modulo the
+actual quotient is included, so principal and imprimitive components
+survive. The number of divisors and characters is a fixed log power,
+and products with chi_0 have polylogarithmic modulus.
+
+It now suffices to prove the local energy bound at zero for sequences
+
+ a_w = Psi_1(w/Y) w^(iv_1)
+ sum over mp_s p r = w of alpha_m chi_m(m) m^(i sigma_0) (8.27)
+ b_s(p_s) 1_(p in I_p, P^-(p) > W) chi_p(p) p^(i sigma_1) d_r,
+
+with p_s in P_(g_s), |b_s| << 1, |d_r| <= L^O(1), all characters and
+frequencies bounded by fixed log powers, and Psi_1 of the same smooth
+size support as above. Fixed-order divisor moments give sum_w |a_w|^2
+<< Y L^O(1).
+
+
+8.5 FROM LOCAL FOURIER ENERGY TO A MELLIN INTEGRAL.
+
+We record the scale conversion explicitly. Choose a smooth nonnegative K
+of integral one, supported in a fixed neighborhood of zero small enough
+that |hat_K(xi)| >= 1/2 for |xi| <= 1, using the Fourier convention with
+e(-xi u). Plancherel on R gives
+
+ int over |beta| <= 1/H of |hat_a(beta)|^2 d beta (8.28)
+ << H^(-2) int over R of |sum over w of a_w K((w-v)/H)|^2 dv.
+
+Only v = Y contributes. Keep the integral on this range when replacing
+K by K(v log(w/v)/H); no estimate near v = 0 is used. On the union of
+the two kernels' supports within this range,
+
+ |w - v| << H, and their arguments differ by O(H/Y).
+
+So, by Cauchy-Schwarz over O(H) integers and then integrating the centers
+allowed for each w, the squared norm of the error in (8.28) is at most
+
+ << (H/Y)^2 sum over w of |a_w|^2, (8.29)
+
+which is smaller than Y L^(-A) for every fixed A, since H = x^o(1) and
+Y = x^(1+o(1)).
+
+Set h = H/Y and P(t) = sum over w of a_w w^(it). With v = Ye^u,
+logarithmic Fourier inversion gives
+
+ sum over w of a_w K(v log(w/v)/H) = (h/(2 pi)) (8.30)
+ int over R of e^(-u) hat_K(h e^(-u) t/(2 pi)) v^(-it) P(t) dt.
+
+Insert a smooth compactly supported rho(u) equal to one on the required
+range. The Fourier transform in u of rho(u) e^(-u)
+hat_K(h e^(-u) t/(2 pi)), denoted A(s, t), satisfies, for every fixed j,
+
+ |A(s, t)| <<_j (1+|s|)^(-2) (1+|ht|)^(-j). (8.31)
+
+Two integrations by parts in u prove this, since hat_K is Schwartz and u
+stays in a fixed compact interval. Fourier-expand in u, apply Minkowski
+in s, and Plancherel in u for each s. As dv << Y du, the normalization
+is H^(-2) Y h^2 = Y^(-1). Replacing j by a larger integer gives
+
+ int over |beta| <= 1/H of |hat_a(beta)|^2 d beta (8.32)
+ <<_j Y^(-1) int over R of (1+|ht|)^(-j) |P(t)|^2 dt
+ + (H/Y)^2 sum over w of |a_w|^2.
+
+By Lemma 4.2 (mean squares), for every dyadic time scale T' >= 1,
+
+ Y^(-2) int over T' <= |t| <= 2T' of |P(t)|^2 dt
+ << (1 + T'/Y) L^(C_9). (8.33)
+
+So the portion |t| > L/h in (8.32) is O(Y L^(-A)) after choosing j large
+enough. For the remaining portion split the four factor variables in
+(8.27) into dyads. There are O(L^4) boxes, and only those whose joint
+size is comparable to Y contribute. Write
+
+ P(t)/Y = sum over w of (1/w) ((w/Y) Psi_1(w/Y)) w^(i(t+v_1)) (8.34)
+ sum over mp_s p r = w of (the four coefficients).
+
+Fourier-separate the parenthesized cutoff in log coordinates: its
+integral cost is a fixed log power, and truncating at a fixed log-power
+frequency loses an arbitrary saving. The tails are bounded by the
+preceding mean values. The frequency shifts enlarge |t| <= L/h to
+|t| <= 2L/h, because 1/h exceeds every fixed log power. We have reduced
+to
+
+ int over |t| <= 2L/h of |P_s(t) P_l(t) R(t)|^2 dt << L^(-A'), (8.35)
+
+for every prescribed fixed A', on each retained box, where
+
+ P_s(t) = sum over p_s = P of b_s(p_s) p_s^(-1 + it), (8.36)
+ P_l(t) = sum over p = P', p in I_p, P^-(p) > W of
+ chi_p(p) p^(-1 + i sigma_1 + it),
+ R(t) = ( sum over m = M_0 of alpha_m chi_m(m)
+ m^(-1 + i sigma_0 + it) )
+ ( sum over r = R_0 of d_r r^(-1 + it) ).
+
+Here and below dyads may be intersected with their existing support. We
+have
+
+ e^(L^a)/2 <= P <= e^(L^b), x^tau/2 <= P' <= x^eta,
+ P M_0 P' R_0 = Y. (8.37)
+
+For any subproduct of these four polynomials, collapse its coefficients
+to sum over n = U of c_n n^(it). Fixed-order divisor moments give
+
+ sum over n of |c_n|^2 << L^(C_10)/U. (8.38)
+
+The marked-group coefficient count was already absorbed by (8.3), not by
+a growing divisor order. Individually all these polynomials are also
+L^O(1) in absolute value by their harmonic sums.
+
+The remaining integral has three regimes. Most times are controlled by
+the small-prime polynomial P_s: where |P_s(t)| is a small negative power
+of L, the ordinary mean square of P_l R, of joint size Y/P, suffices.
+The exceptional times occupy only Y^o(1) unit intervals. On these, at
+large times, P_l is small by oscillation over its long rough-integer
+range; a sparse mean square for R makes that saving sufficient. For |t|
+bounded by a fixed power of L, the m factor in R is small by the
+original discrepancy hypothesis (8.5).
+
+
+8.6 EXCEPTIONAL TIMES AND A SPARSE MEAN SQUARE.
+
+The split into ordinary and exceptional times, followed by high
+prime-polynomial moments and a sparse mean-square estimate, follows the
+method of Matomaki and Radziwill; compare Section 2.1 and Section 4,
+Lemmas 8-9 of Matomaki-Radziwill 2016. The specific estimates needed
+here are proved below; no short-interval theorem is invoked.
+
+Fix a large constant A_s and let E = {t : |t| <= 2L/h, |P_s(t)| >
+L^(-A_s)}. Outside E, the indicated gain and the mean square of P_l R,
+of joint size Y/P, give closure. That mean square's length exceeds the
+time range, since
+
+ (Y/P) / (2L/h) = H/(2 L P) -> infinity, (8.39)
+
+by b < c and (8.17). So this part of (8.35) is O(L^(-2A_s + C_11)).
+
+The next two lemmas use the standard prime-polynomial moment arguments;
+compare Soundararajan 2009, Lemma 3 and its proof. The dependence on
+the growing power is explicit.
+
+LEMMA 8.5 (number of exceptional unit intervals). The set E meets at
+most
+
+ exp(O(L^b + L^(1-a) log L)) = Y^o(1) (8.40)
+
+intervals [j, j+1], uniformly in the bounded coefficients b_s.
+
+PROOF. Choose a point of E in each occupied interval; split the interval
+indices into three residue classes to obtain separated points. Put j_0 =
+floor(log Y / log(2P)). The polynomial P_s(t)^(j_0) has indices at most
+Y and coefficient-square sum at most
+
+ j_0! (sum over p_s = P of |b_s(p_s)|^2 p_s^(-2))^(j_0)
+ <= j_0! (C/P)^(j_0). (8.41)
+
+Indeed an integer has at most j_0! ordered representations as a product
+of j_0 primes; Cauchy-Schwarz on each fiber proves this even with
+repeated primes.
+
+For a polynomial Q(t) = sum over n <= Y of c_n n^(it) and unit-separated
+points in [-O(Y), O(Y)], the unit-interval Sobolev inequality and
+bounded overlap give
+
+ sum over j of |Q(t_j)|^2 (8.42)
+ << int over -O(Y) to O(Y) of (|Q(t)|^2 + |Q'(t)|^2) dt
+ << Y (log(2Y))^O(1) sum over n of |c_n|^2.
+
+The last step uses Lemma 4.2. Differentiation multiplies a coefficient
+by i log n, so the constants are independent of j_0. The range 2L/h is
+o(Y). If N_E is the number of occupied intervals,
+
+ N_E << Y L^O(1) j_0! (C L^(2A_s)/P)^(j_0). (8.43)
+
+Now j_0 = O(L^(1-a)) and log Y - j_0 log P = O(L^b + j_0) by the
+definition with 2P. Taking logarithms and using log(j_0!) <=
+j_0 log j_0 proves (8.40). [End]
+
+LEMMA 8.6 (sparse residual mean square). For the occupied unit intervals
+I_j of Lemma 8.5,
+
+ sum over j of sup_(t in I_j) |R(t)|^2 << L^(C_12). (8.44)
+
+PROOF. The collapsed residual size is U = Y/(P P') >= Y^(1-eta-o(1)) >
+Y^0.6 for large x, and its coefficient-square sum is L^O(1)/U by (8.38).
+
+On a containing integer interval n = U the Gram kernel satisfies,
+uniformly for |z| << Y,
+
+ |sum over n = U of n^(iz)| << U/(1+|z|) + Y^(1/2). (8.45)
+
+For |z| < 1 this is trivial. For 1 <= |z| <= cU with small fixed c,
+the phase z log n/(2 pi) has monotone first derivative of magnitude
+comparable to |z|/U and less than 1/2; Lemma 4.3 gives O(U/|z|). For
+cU < |z| << Y the second-derivative test gives O(|z|^(1/2) +
+U |z|^(-1/2)) = O(Y^(1/2)).
+
+Choose a maximum point of |R| in each closed I_j and again split the
+indices into three residue classes; in each class the points are at
+least unit separated. For R = Y^o(1) such points, the absolute row sums
+of their Gram matrix are at most
+
+ C (U log(2Y) + R Y^(1/2)) << U log(2Y). (8.46)
+
+The first term follows by grouping distances into unit intervals; the
+second is absorbed by U > Y^0.6. Schur's bound on this Gram matrix,
+applied to the map (c_n) -> (sum_n c_n n^(it_j))_j, gives
+
+ sum over j of |R(t_j)|^2 << U log(2Y) sum over n of |c_n|^2
+ << L^O(1). (8.47)
+
+Summing the three classes proves (8.44), including the suprema. [End]
+
+
+8.7 CANCELLATION OF THE LONG ROUGH-INTEGER FACTOR.
+
+The following estimate explains why every endpoint must carry a
+rough-integer factor of positive power length.
+
+LEMMA 8.7 (long rough-integer polynomial). Fix tau > 0, eta < 1/4,
+C > 0, A > 0. Let x^tau/2 <= P' <= x^eta, J' an interval in [P', 2P'],
+and chi a character of modulus at most L^C. If |sigma| <= L^C, then for
+a sufficiently large fixed B_0, uniformly when L^(B_0) <= |t| and
+|t + sigma| <= x^2,
+
+ | sum over n in J', P^-(n) > W of chi(n) n^(-1 + i(t+sigma)) |
+ << L^(-A). (8.48)
+
+The constant B_0 may depend on C, A, tau, eta.
+
+PROOF. Set h_s = 2 ceil(T^2) and
+D = W^(4 h_s + 2) = exp(O(sqrt L T^2)) = x^o(1). By Corollary 4.6 there
+is a polynomial U(n) = sum_(d | n) lambda_d >= 1_(P^-(n) > W), with
+coefficients |lambda_d| <= 1, supported on squarefree d <= D with primes
+at most W, satisfying
+
+ sum over n in [P', 2P'] of (U(n) - 1_(P^-(n) > W)) (8.49)
+ << P' e^(-h_s) + D.
+
+The summand is nonnegative, so restriction to any J' preserves the
+bound. Replacing roughness by U in the normalized sum costs
+O(e^(-h_s) + D/P'), smaller than every fixed negative power of L. Also
+
+ sum over d of |lambda_d|/d <= prod_(p <= W) (1 + 1/p)
+ << log W = sqrt L. (8.50)
+
+Write q' for the character modulus. Terms with gcd(d, q') > 1 vanish.
+For the rest, split n = dv with v = q' y + a mod q'; the character is
+constant on a class. The y-variable ranges over an interval of size
+N = P'/(dq') >= x^(tau/2) for large x. Put u = t + sigma. Taking
+B_0 > C + 1 ensures |u| >= L^(B_0)/2. Claim: on every subinterval of
+the allowed y-range,
+
+ | sum over y of exp(iu log(q'y+a)) | << N (|u|^(-1) + N^(-delta)), (8.51)
+
+for a fixed delta > 0 depending only on tau.
+
+If |u| <= cN, the monotone first-derivative test gives O(N/|u|): the
+derivative of u log(q'y+a)/(2 pi) stays away from nonzero integers.
+Otherwise put eps_0 = 1/10. The overlapping ranges
+
+ N^(k-2+eps_0) <= |u| <= N^(k-eps_0), k >= 2, (8.52)
+
+cover cN < |u| <= x^2 using 2 <= k <= K = ceil(4/tau) + 3. The k-th
+derivative of the phase has constant sign and magnitude comparable to
+|u| N^(-k). For k = 2 the second-derivative test directly saves a
+positive power. For k > 2 the van der Corput differencing inequality
+is applied k-2 times with positive integer shifts at most
+H_0 = floor(N^(eps_0/(2k))). After shifts h_1,...,h_(k-2), the second
+derivative is an iterated integral of the k-th derivative, hence of
+constant sign and magnitude comparable to
+
+ |u| N^(-k) h_1 ... h_(k-2),
+ between c_k N^(-2+eps_0) and C_k N^(-eps_0/2). (8.53)
+
+On an interval of length m <= CN the second-derivative bound gives
+
+ O(m lambda^(1/2) + lambda^(-1/2)) << N^(1 - eps_0/4). (8.54)
+
+To justify the estimate uniformly for short subintervals, extend each
+sequence by zero in a containing interval of length O(N). The
+differencing inequality for its normalized sum has the form
+B_j^2 << H_0^(-1) + B_(j+1), where B_(j+1) bounds the average of the
+absolute normalized correlations. Their supports are intersections of
+translates of the original interval, hence again intervals. All shifts
+are o(N), preserving the derivative bounds. Iterating from the final
+exponent eps_0/4 proves a bound O(N^(-delta_k)) for the original
+normalized sum, with delta_k = eps_0/(k 2^(k-1)). Taking
+delta = eps_0/(K 2^(K-1)) proves (8.51) in every case. The differencing
+inequality itself follows by averaging H_0 translates and applying
+Cauchy-Schwarz; its zero-shift term is the stated O(H_0^(-1)).
+
+Partial summation of 1/[d(q'y+a)] costs O(1/P') times the uniform
+unweighted bound; summing the at most q' classes gives
+
+ | sum over n in J', d | n of chi(n) n^(-1+iu) |
+ << d^(-1) ( |u|^(-1) + x^(-tau delta/2) ). (8.55)
+
+Finally (8.50) bounds the total by
+
+ O(e^(-h_s) + D/P') + O(sqrt L ( L^(-B_0) + x^(-tau delta/2) )).
+ (8.56)
+
+Choosing B_0 > A + 2 in addition to its previous constraint proves
+(8.48). [End]
+
+
+8.8 COMPLETION AND ORDER OF PARAMETERS.
+
+We finish (8.35). Outside E it is O(L^(-2A_s + C_11)); choose A_s
+sufficiently large. On the exceptional intervals with |t| >= L^(B_0),
+Lemma 8.7 gives an arbitrarily strong uniform bound for P_l. Its range
+condition holds since 2L/h = o(Y) = x^(1+o(1)) < x^2/2, and the fixed
+frequency shift does not change this. The polynomial P_s is bounded,
+and Lemma 8.6 gives
+
+ int over E cap {|t| >= L^(B_0)} of |P_s(t) P_l(t) R(t)|^2 dt
+ << ( sup over |t| >= L^(B_0) of |P_l(t)|^2 ) L^O(1). (8.57)
+
+Here the sup is over the actual time range, and each occupied interval
+has length one. Choose the saving in Lemma 8.7 after the exponent in
+Lemma 8.6.
+
+For the remaining |t| <= L^(B_0) use (8.5) on the m polynomial in R.
+The retained dyads satisfy P M_0 P' R_0 = Y, so m << Y = x^(1+o(1)) <
+x^2 for large x, also after smooth-cuttoff separation. Its character
+modulus is a fixed log power, and its frequency is t + sigma_0. A
+single sufficiently large B therefore bounds this polynomial by L^(-B)
+throughout the range. Every other factor has absolute value L^O(1), and
+the length of this time interval is 2 L^(B_0). The resulting integral is
+L^(-2B + B_0 + O(1)), giving the required accuracy. This proves (8.35),
+then the local energy bound (8.23) via (8.32), and hence every comparison
+bound. The residual pairing and the raw identity in (8.16) prove (8.6).
+
+For completeness, the choices occur in this order. First fix the
+endpoint bounds, group geometry, cutoff derivative bounds, and desired
+saving D_0. The uniform endpoint norm bound fixes the physical transfer
+target and its required ideal target; the fixed Mellin cutoff fixes the
+ideal frequency range. Next choose the probe count and comparison
+parameters of Theorem 7.1, then the fixed J required by transference.
+All pattern, cell, and absolute norm costs are now determined. Choose
+the separation accuracies, arc exponent, local energy target, and Mellin
+tail precision. Next choose A_s, the accuracy of the long rough
+polynomial and its B_0. Finally choose one B in (8.5) exceeding all the
+modulus, frequency, and low-time saving requirements, and let x tend to
+infinity. The residual L^2 bounds used before the choice of J depend
+only on the endpoint coefficient bounds and a fixed divisor moment.
+Increasing later Fourier tail accuracies uses more integrations by
+parts, with no enlargement of the already fixed ideal frequency range.
+None of these choices is circular.
+
+This completes the proof of Theorem 8.1.
+
+
+9. A TYPE II ESTIMATE
+
+
+We apply the shifted-correlation estimate to factorizations mn = 2u+1,
+where u carries a weight supported on many geometric prime bands. The
+coefficient of m will satisfy the discrepancy hypothesis (8.5); the
+coefficient of n may be arbitrary within its stated bound. The task is
+to retain the discrepancy while converting multiplicative factorizations
+into additive correlations.
+
+We split u = eh, with e slightly smaller than the scale of m, using a
+smooth allocation of the band primes. Cauchy's inequality in (e, n)
+then has a small enough outside factor to control its diagonal. Off the
+diagonal the two factorizations give cross-products whose difference is
+a small nonzero integer. These are the shifted endpoints. All group
+factors and the compulsory rough integer are assigned to h, so both
+endpoints retain the form (8.4).
+
+
+9.1 THE WEIGHT AND THE UNIFORM STATEMENT.
+
+Use the prime groups and the marked weight W_ell of section 8. In
+particular, disjoint groups, masses in [v_-, v_+], both kinds of groups
+with counts between c_0 T and C_0 T. For fixed 0 < a < b < c < d <
+0.47, the small primes lie in [exp(L^a), exp(L^b)], the big in
+[exp(L^c), exp(L^d)], with the interval structure required there. The
+damping q in (0,1) and the integer ell >= 1 are fixed. Write u_* for
+the factor of u supported outside all groups and u_P = u/u_*; then
+
+ W_ell(u) = prod_g q^(omega_g(u) - ell) (9.1)
+ ((omega_g(u))_ell / V_g^ell).
+
+Fix 0 < c_1 < c_2, s' > 0, lambda > 1, with c_2 s' < 1/4. For
+0 <= j <= j_x put
+
+ s_j = s' L lambda^(-j),
+ Q_j = { p prime : c_1 s_j <= log p <= c_2 s_j }. (9.2)
+
+Assume these intervals are pairwise disjoint and disjoint from the prime
+groups, and c_- T <= s_(j_x) <= c_+ T for fixed 0 < c_- <= c_+. Choose
+a fixed integer r_0 such that
+
+ (r_0 - 1) c_1 / lambda >= c_2 + 1. (9.3)
+
+There are r_0 labelled slots in every band, each normally taking a prime
+in Q_j with repetitions allowed. In one specified slot of a fixed band
+j_** replace the prime by an integer in
+
+ I_** = [x^(tau_*), x^(eta_*)], P^-(p) > W, (9.4)
+ tau_* = c_1 s' lambda^(-j_**), eta_* = c_2 s' lambda^(-j_**).
+
+The notation p for this slot never asserts primality. For large x this
+slot is free of group primes, since exp(L^d) < W.
+
+Define
+
+ a_Q(v) = (prod_(j=0)^(j_x) 1/r_0!) (9.5)
+ #{admissible labelled slot lists with product v},
+ A(u) = a_Q(u_*) W_ell(u).
+
+The exceptional integer can be fixed as a divisor of v. Thereafter the
+prime multiplicities in each disjoint band determine the list up to at
+most r_0! permutations. Consequently
+
+ 0 <= a_Q(v) <= tau(v), 0 <= A(u) <= L^(C_A') tau(u_*), (9.6)
+ sum over v of a_Q(v)/v <= L^(C_A'),
+
+for a fixed exponent C_A'. The bound for W_ell follows by maximizing
+q^(t-ell) (t)_ell / V_g^ell in each group. For the last bound, factor
+the harmonic sum slot by slot: every prime slot has bounded harmonic
+mass, the exceptional slot has mass O(L), and there are O(T) slots. The
+exponent depends only on the fixed data.
+
+
+THEOREM 9.1 (Type II). Fix D_* > 0, b_* > 0, C > 0, and require
+eta_* < b_*/4 in (9.4). Let U, V be dyadic scales with
+
+ UV = x, x^(b_*) <= U, V <= x^(1 - b_*). (9.7)
+
+Let Psi be a fixed smooth function with compact support in a fixed
+compact subinterval of (0, infinity). Suppose |alpha_m|, |beta_n| <=
+L^C and alpha_m = 0 unless P^-(m) > W. There is a fixed exponent B,
+depending only on these data and the fixed group and band constants,
+such that the discrepancy hypothesis (8.5) on alpha implies
+
+ sum over m = U, n = V, u >= 1, mn = 2u+1 of (9.8)
+ A(u) Psi(u/x) alpha_m beta_n << x L^(-D_*).
+
+The sequence to which (8.5) is applied includes the actual restriction
+m = U and any additional interval restriction on m; explicitly, for
+that restricted sequence,
+
+ | sum over m in I of alpha_m chi(m) m^(it) / m | <= L^(-B) (9.9)
+
+for I in [1, x^2], chi of modulus at most L^B, and |t| <= L^B. There
+is no discrepancy hypothesis on beta. The constants are uniform over
+the sequences, scales, and interval restrictions.
+
+
+9.2 REMOVING A LARGE GROUP-PRIME FACTOR.
+
+PROOF OF THEOREM 9.1. First discard u_P > x^(b_*/4), with an error
+smaller than every fixed negative power of L times x. Set theta =
+L^(-d). For one group write a_p = (p^(1-theta) - 1)^(-1). Since
+p^theta <= e and the group primes tend to infinity, a_p <= 2 e/p. The
+tilted marked harmonic sum is
+
+ sum over v whose prime factors are all in P_g of (9.10)
+ q^(omega_g(v) - ell) (omega_g(v))_ell / (V_g^ell v^(1 - theta))
+ = V_g^(-ell) prod_(p in P_g) (1 + q a_p)
+ sum over p_1,...,p_ell in P_g, distinct ordered of
+ prod_(i=1)^ell a_(p_i) / (1 + q a_(p_i))
+ <= C_0.
+
+The last constant is fixed because v_- <= V_g <= v_+. Taking the
+product over O(T) groups gives
+
+ sum over v > x^(b_*/4), v_* = 1 of W_ell(v)/v
+ <= exp( -(1/4) b_* L^(1-d) ) L^(C_1). (9.11)
+
+On the support of (9.8), u = x. The number of divisors m of 2u+1 all of
+whose prime factors exceed W is at most 2^(log(2u+1)/log W) =
+exp(O(sqrt L)). Using (9.6) and (9.11), multiplying the harmonic mass
+by O(x), and using 1 - d > 1/2, the total discarded contribution is at
+most
+
+ x L^(C_2) exp( -(1/4) b_* L^(1-d) + O(sqrt L) ). (9.12)
+
+Call the remaining slot tuples good. This estimate is independent of
+the splitting precision introduced next.
+
+
+9.3 A SMOOTH PARTITION INTO TWO FACTORS.
+
+Put E = U L^(-K_0), where the fixed integer K_0 is chosen after the
+splitting costs have been bounded. Our target is a weighted partition
+into factorizations u = eh with
+
+ E L^(-C_s) <= e <= E, (9.13)
+
+where C_s depends only on the band constants. The reason for placing e
+below U is that Cauchy's inequality will contribute an outside factor
+EV = x L^(-K_0). We will use this logarithmic saving to control the
+diagonal, so the splitting costs must be independent of K_0.
+
+Allocate all of u_P and the exceptional integer slot to h; this
+preserves the group weight and the long rough factor at every shifted
+endpoint. Process the remaining prime slots in increasing band index,
+and in a fixed order within each band. Write v_i = log p_i and let
+s_(j(i)) be the scale of slot i. If delta_i in {0,1} records whether
+slot i is allocated to e, put
+
+ R_i = log E - sum_(t<i) delta_t v_t. (9.14)
+
+Fix gamma in C^infty(R) with 0 <= gamma <= 1, gamma(t) = 0 for t <= 0,
+gamma(t) = 1 for t >= 1. At slot i take it into e with probability
+gamma((R_i - v_i)/s_(j(i))); otherwise into h.
+
+Verify (9.13) by tracking the unfilled logarithmic size. At every stage
+the induction target is
+
+ 0 <= R_i <= sum_(t >= i) v_t + (c_2 + 1) s_(j_x). (9.15)
+
+The terminal allowance accounts for a skip in the final band. On a good
+tuple the factors assigned to h before the procedure starts have product
+at most x^(b_*/2). The sum of the available prime logarithms is
+therefore at least (1 - b_*/2) L + O(1), whereas 0 < log E <=
+(1 - b_*) L - K_0 T for large x. This proves the initial bound even
+without the terminal allowance. Taking a slot of positive probability
+requires R_i > v_i and subtracts v_i from both the residual and the
+available logarithm, so it preserves the bound and nonnegativity.
+Skipping a slot of positive probability requires
+
+ R_i < v_i + s_(j(i)) <= (c_2 + 1) s_(j(i)). (9.16)
+
+If a later band exists, its unprocessed prime slots have total logarithm
+at least (r_0 - 1) c_1 s_(j(i)+1) >= (c_2 + 1) s_(j(i)) by (9.3). The
+subtraction of one slot covers the possible exceptional integer in that
+later band. So after such a skip the residual fits inside the remaining
+available logarithm. In the final band a skip leaves at most
+(c_2 + 1) s_(j_x), and subsequent operations cannot increase this
+residual. This proves (9.15). After processing the last slot it gives
+
+ 0 <= log E - log e <= (c_2 + 1) s_(j_x). (9.17)
+
+Since s_(j_x) <= c_+ T, this proves (9.13) with C_s = (c_2 + 1) c_+.
+The geometric series for the remaining band scales bounds
+R_i/s_(j(i)) by a fixed constant; both bounds are independent of K_0.
+
+Choose a fixed smooth compactly supported rho with values in [0,1],
+equal to one throughout the possible range of (R_i - v_i)/s_(j(i)).
+Replace the two transition functions by f_1 = rho gamma and
+f_0 = rho (1 - gamma). This changes no branch on a good tuple. For an
+arbitrary tuple the sum is rho <= 1, so its total branch mass is at most
+one. Insert the resulting partition into (9.5), keeping every original
+factorial normalization. Branches sum to one on good tuples, and
+extending back to all tuples costs at most the error in (9.11). Every
+resulting h contains the exceptional rough integer.
+
+Quantitative detail of the smooth separation, independent of K_0. Let
+N = O(T) be the number of processed slots, and use the Fourier
+convention f(t) = (1/(2 pi)) int hat_f(xi) e^(i xi t) d xi. Choose a
+fixed C_F >= 1 bounding the Fourier L^1 norms of both f_0, f_1, with
+the normalization (1/(2 pi)) included. Summing the Fourier total
+variations over the 2^N patterns gives at most (2 C_F)^N = L^O(1). For
+the truncation: capping each |xi_i| at L has total error, for every
+fixed M, at most
+
+ 2^N N C_M C_F^(N-1) L^(-M). (9.18)
+
+Thus any prescribed power saving is available. In a fixed pattern the
+product of Fourier exponentials is a scalar of modulus one times
+prod_t p_t^(i sigma_t), where
+
+ sigma_t = -xi_t / s_(j(t)) - delta_t sum_(i>t) xi_i / s_(j(i)). (9.19)
+
+Indeed the scalar is exp(i log E sum_i xi_i / s_(j(i))). Since
+sum_i 1/s_(j(i)) << 1/T, all frequencies in (9.19) are O(L/T).
+Everything in this paragraph is independent of K_0.
+
+Separate Psi(eh/x) by Fourier inversion in log(eh/x) as well. Its
+Fourier L^1 norm is fixed, and the tail outside frequency L has
+arbitrary power saving; its two factors are powers of e and h. All
+these errors can be summed before Cauchy's inequality. Indeed, the
+absolute sum over the original factorizations is bounded by
+
+ L^O(1) sum over u = x of tau(u) tau(2u+1) << x L^O(1) (9.20)
+
+by Cauchy-Schwarz and divisor moments. The same estimate applies to
+each uniform transition or cutoff error, using the total Fourier
+variations of the other factors. So the original sum is, up to
+O(x L^(-D_* - 1)), an integral and a sum of total variation at most
+L^(C_f) of expressions
+
+ B_0 = sum over E L^(-C_s) <= e <= E, n = V of (9.21)
+ a_e(e) beta_n sum over m = U, h >= 1, mn = 2eh+1 of alpha_m a_h(h).
+
+The exponent C_f and every coefficient exponent below are independent of
+K_0:
+
+ |a_e(e)| <= L^(C_a), (9.22)
+ a_h(h) = h^(i varrho) W_ell(h) H(h_*),
+ H(t) = sum over pr = t of 1_(p in I_**, P^-(p) > W) p^(i sigma) c_r,
+ |c_r| <= L^(C_a).
+
+In particular |a_h(h)| <= L^O(1) tau(h_*). Only group-free prime slots
+go into e, so (eh)_* = e h_* and W_ell(eh) = W_ell(h). For a fixed
+pattern, the number of ordered pure-prime lists at a fixed product is at
+most (r_0!)^(j_x + 1) = L^O(1). This proves both the a_e bound and the
+bound for the residual coefficient c_r. Fixing the exceptional integer
+as a divisor gives the bound for a_h. Individual slot twists have
+modulus one; the common power of h from the cutoff is h^(i varrho). The
+frequencies varrho, sigma have fixed power bounds in L.
+
+
+9.4 CAUCHY'S INEQUALITY AND THE DIAGONAL.
+
+By Cauchy-Schwarz in (e, n), (9.21) satisfies
+
+ |B_0|^2 <= EV L^(C_3) Nn, (9.23)
+ Nn = sum over e, n of eta_e(e/E) eta_n(n/V)
+ |sum over m = U, h, mn = 2eh+1 of alpha_m a_h(h)|^2.
+
+Here eta_e, eta_n are nonnegative smooth majorants, bounded by a fixed
+constant, equal to one on the original ranges. They vanish unless
+(1/2) E L^(-C_s) <= e <= 2E and n = V. Their derivatives of order j in
+their displayed arguments are O_j(L^(C_4(j+1))), with C_3, C_4
+independent of K_0. For example, the lower edge of eta_e is obtained by
+rescaling a fixed smooth cutoff by L^(C_s).
+
+On the diagonal m = m' the two equations force h = h'. For fixed m, n
+the allowable e divide (mn - 1)/2, and
+
+ sum over e | (mn - 1)/2 of tau( (mn - 1)/(2e) )^2
+ <= tau(mn - 1)^3. (9.24)
+
+Collecting by v = mn and using divisor moments gives
+
+ Nn_diag << L^O(1) sum over v = x of tau(v) tau(v - 1)^3
+ << x L^(C_5). (9.25)
+
+The exponents C_3, C_5 are independent of K_0. Since EV =
+x L^(-K_0), its contribution to |B_0|^2 is O(x^2 L^(-K_0 + C_3 + C_5)).
+We can therefore fix K_0 large enough that its square root, even
+multiplied by L^(C_f), is O(x L^(-D_* - 1)). All subsequent precisions
+may depend on this fixed K_0.
+
+
+9.5 THE EXACT DETERMINANT PARAMETRIZATION.
+
+Consider an off-diagonal term of (9.23), with
+
+ mn = 2eh + 1, m'n = 2eh' + 1, m != m'. (9.26)
+
+The shared variables e, n force the two m values to be congruent modulo
+2e: the first equation makes n a unit modulo 2e, and subtracting the
+equations gives 2e | m' - m. Write m' - m = 2ek, with k != 0. The
+resulting identities are
+
+ m' - m = 2ek, h' - h = kn, z = m'h, z + k = mh'. (9.27)
+
+The last follows from mh' - m'h = k(mn - 2eh) = k. The enlarged e-range
+gives
+
+ 0 < |k| << L^(K_0 + C_s). (9.28)
+
+Conversely, fix such a k, positive integers m, m', h, h' with
+P^-(m), P^-(m') > W, and representations m'h = z, mh' = z+k. Suppose
+m' = m mod 2|k| and e = (m' - m)/(2k) > 0. Then e is an integer and
+
+ m(h' - h) = k(2eh + 1). (9.29)
+
+Every prime factor of m exceeds W, whereas |k| is bounded by a fixed
+power of L, so gcd(m, k) = 1 for large x. Equation (9.29) implies
+m | 2eh + 1. Set n = (2eh + 1)/m, a positive integer. The same
+identity gives h' - h = kn, and substituting m' = m + 2ek recovers the
+second equation of (9.26). This proves a bijection, with all variables
+recovered by the displayed formulas. In particular, no additional
+divisibility condition is being dropped. The coprimality gcd(m, k) = 1
+is necessary to this converse.
+
+Both m and m' are units modulo q_k = 2|k|, so the congruence is imposed
+exactly by
+
+ 1_(m' = m mod q_k) = (1/phi(q_k)) sum over chi mod q_k of (9.30)
+ chi(m) conj(chi(m')).
+
+Thus Nn_off is a sum over k, z and these characters of terms having
+coefficient
+
+ alpha_m conj(alpha_(m')) chi(m) conj(chi_(m')) (9.31)
+ a_h(h) conj(a_h(h')),
+
+with m'h = z, mh' = z+k, and with the enlarged smooth (e, n) cutoffs.
+The arguments are now the exact functions
+
+ e = (m' - m)/(2k), n = (m' - m) z / (k m m') + 1/m. (9.32)
+
+The cutoffs are extended smoothly by zero to nonpositive arguments, so
+they impose the positivity and size conditions as well.
+
+
+9.6 SMOOTH SEPARATION AND THE SHIFTED ENDPOINTS.
+
+On the resulting support, m, m' = U, n = V, and h = x/e. So z = m'h
+lies in [x L^(-C_6), x L^(C_6)] with a fixed C_6 now allowed to depend
+on K_0. Insert a smooth dyadic partition in z with O(T) terms,
+denoting one scale by Z = x L^O(1); keep its smooth cutoff psi_Z(z/Z)
+outside the Fourier expansion.
+
+Regularity of the pulled-back cutoffs. Put t_1 = log(m/U),
+t_2 = log(m'/U), t_3 = log(z/Z). Multiply by fixed smooth localizations
+in these three variables equal to one on the ranges in use. From
+(9.32) every derivative of e/E in these variables is O_j(U/(|k| E)),
+and every derivative of n/V is O_j(Z/(|k| U V) + (U V)^(-1)). Both are
+bounded by fixed powers of L; moreover the normalized derivatives of
+eta_e, eta_n have the bounds already given. Repeated use of the chain
+rule therefore bounds derivatives of the localized product cutoff by
+O_j(L^(C_7(j+1))). Its support in (t_1, t_2, t_3) is a fixed compact
+box. Fourier inversion, as in Lemma 4.4, represents it with total
+variation L^O(1) as a superposition of
+
+ m^(i xi_1) (m')^(i xi_2) z^(i xi_3). (9.33)
+
+Explicit tail estimate. Enlarge a fixed exponent C_8 so that, with
+P = L^(C_8), the localized cutoff F satisfies
+||partial^alpha F||_infty <<_alpha P^(|alpha|); its zeroth derivative
+is bounded independently of L. Integration by parts gives
+
+ |hat_F(xi)| <<_j (1 + |xi|/P)^(-j), (9.34)
+ int over R^3 of |hat_F(xi)| d xi << P^3,
+ int over |xi| > PL of |hat_F(xi)| d xi <<_j P^3 L^(3-j).
+
+So truncation at PL has uniform error O(L^(-A)) for every fixed A, by
+choosing j > A + 3 C_8 + 3. These later exponents may depend on K_0.
+
+There is sufficient absolute control to sum these errors. If the
+coefficients in (9.22) and the two m sequences are replaced by their
+absolute values, each resulting endpoint convolution is at most
+L^O(1) tau(z_*)^2. Its product with W_ell(z) has squared sum
+O(Z L^O(1)) on z = Z. Cauchy-Schwarz, also at z+k, therefore bounds
+the absolute correlation by Z L^O(1). This uses only divisor moments.
+It remains true after dropping the congruence; hence it controls the
+errors just described, after summing the polynomial number of k values,
+dyads, and character terms.
+
+Identify the endpoints so as to track exactly which sequence satisfies
+discrepancy. Use the notation of (9.22) and fix a character chi and
+frequencies in (9.33). Since m, m' are free of group primes,
+
+ z_* = m' h_*, (z+k)_* = m h'_*, (9.35)
+ W_ell(z) = W_ell(h), W_ell(z+k) = W_ell(h').
+
+Define the invariant endpoint functions
+
+ F_0(v) = sum over mpr = v_* of (9.36)
+ alpha_m chi(m) m^(i(varrho - xi_2))
+ 1_(p in I_**, P^-(p) > W) p^(-i sigma) conj(c_r),
+ G_0(v) = sum over mpr = v_* of
+ alpha_m chi(m) m^(i(xi_1 + varrho))
+ 1_(p in I_**, P^-(p) > W) p^(-i sigma) conj(c_r).
+
+Direct substitution shows the separated summand is
+
+ psi_Z(z/Z) z^(i(varrho + xi_3)) (z+k)^(-i varrho) (9.37)
+ conj(F_0(z)) G_0(z+k) W_ell(z) W_ell(z+k),
+
+up to scalar phases of modulus one and the Fourier coefficient. For
+example, at z = m'h the factor h^(i varrho) becomes
+z^(i varrho) (m')^(-i varrho), which explains the first endpoint's
+power and the conjugation of c_r. In particular, the sequence inside
+F_0 is the original alpha, with its actual interval restriction.
+
+Both functions in (9.36) have the form (8.4). The character modulus
+2|k|, all power frequencies, and the coefficient bounds are fixed
+powers of L. The interval I_** lies in [x^tau, x^eta] for fixed
+0 < tau < eta < 1/4, by (9.4) and the hypothesis eta_* < b_*/4. The
+residual c_r has a fixed power bound, and no roughness condition on r is
+needed. The original alpha is supported on W-rough integers and
+satisfies (8.5); the explicit character and power factors are precisely
+those permitted in (8.4). Thus the discrepancy hypothesis has not been
+silently transferred to a new coefficient sequence.
+
+Finally set tilde_psi_Z(t) = t psi_Z(t). The last unweighted
+correlation equals Z times
+
+ sum over z > 0, z + k > 0 of (tilde_psi_Z(z/Z)/z) (9.38)
+ z^(i(varrho + xi_3)) (z+k)^(-i varrho)
+ conj(F_0(z)) G_0(z+k) W_ell(z) W_ell(z+k).
+
+This is (8.6), including its harmonic normalization. Given any fixed
+D_0, Theorem 8.1 bounds it by L^(-D_0) once the discrepancy exponent B
+is sufficiently large. Consequently every separated unweighted
+correlation is O(Z L^(-D_0)). Choose D_0 after K_0, the k-range, all
+separation costs, and the desired saving in (9.23). The total
+off-diagonal contribution is then O(x L^(-A)) for any prescribed fixed
+A. Choose B after this application of Theorem 8.1. Together with
+(9.25), this gives |B_0| << x L^(-D_* - C_f - 1). Summing its
+pre-Cauchy expansion and the previously estimated tails proves (9.8).
+[End]
+
+
+REMARK 9.2 (order of precisions). The band constants, j_**, b_*, the
+coefficient bound C, and the target D_* are fixed first. The transition
+functions, their total variation, and the coefficient and diagonal
+exponents are independent of K_0; only then is K_0 chosen. The smooth
+separation after Cauchy's inequality and the accuracy required from
+Theorem 8.1 are fixed next, and the required discrepancy exponent B is
+fixed last. Accordingly, when alpha is the difference between a test
+and its rough-integer proxy, the precision of the cells defining that
+proxy may be chosen after B, provided the proxy's coefficient bound is
+already uniform in that cell precision. This is the order used in
+section 10.
+
+
+10. PRIME EXTRACTION I: CANDIDATES, TYPE I, PROXIES, AND TWO SIEVES
+
+
+Section 8 produced the shift correlation of Theorem 8.1, and section 9 used
+it to prove the Type II estimate of Theorem 9.1. This section and section
+11 use those inputs, together with Type I and the elementary sieve, to
+count W-rough predecessors of primes and then prove Theorem B. The pass
+from "rough predecessor" to "prime" has four separate pieces:
+
+ 10.1-10.3: the candidate set, its mass, and the marked Euler factor.
+ 10.4: Type I: equidistribution of 2u+1 in residue classes mod r for
+ all moduli r up to the sieve level.
+ 10.5: the density of ordinary x^(b_1)-rough integers in (x,2x], by the
+ one-prime contribution and the block sieve upper bound.
+ 10.6: the proxy that Type II compares against, and its discrepancy.
+ 10.7: the balanced composite contribution, whose two large prime
+ factors are both near x^(1/2) and are invisible to Type II.
+ Section 11: assembling the sieve, Type I, Type II, and the balanced
+ bound into Theorem B. Section 12: Theorem A from Theorem B.
+
+
+10.1 GEOMETRIC SETUP.
+
+
+Fix c_1 = 1, c_2 = 6/5, c_3 = 3/2, c_4 = 9/5, and r_0 a positive integer
+so large that, with s' = 1/(r_0 (c_1 + c_2)),
+
+ c_2 s' < delta, (r_0 - 1) c_1 / 2 >= c_2 + 1. (10.1)
+
+For example r_0 = 6 always works when 0 < delta < 1/11. Put
+
+ s_j = s' 2^(-j) L, Q_j = { p : c_1 s_j <= log p <= c_2 s_j }, (10.2)
+
+for 0 <= j <= j_x, where j_x is the largest integer for which
+c_1 s_{j_x} >= 20 T.
+
+Disjointness. Since c_2 = 6/5 < 2 c_1 = 2, Q_j and Q_(j-1) are
+disjoint and separated. Since c_3 = 3/2 > c_2 = 6/5, Q_j and P_g for
+any g at the same scale are disjoint. Consecutive scales are doubled;
+c_3, c_4 < 2 c_3 mean that the P-groups at scale j and scale j-1 are
+also disjoint, and c_3 > c_4/2 means that Q_j and P_(j-1) are disjoint.
+So all bands and groups are pairwise disjoint. The number of bands with
+either small or big primes is between c_0 T and C_0 T for fixed c_0, C_0,
+because the j-range has length (1/10) log_2 L + O(1) = c_1' T + O(1).
+
+The prime groups of both kinds. For each fixed scale j such that the
+log-interval [c_3 s_j, c_4 s_j] lies wholly inside either [L^(1/10),
+L^(1/5)] or [L^(3/10), L^(2/5)], let P_g be the set of primes whose log
+lies in that interval: small in the first case, big in the second. Their
+harmonic masses obey
+
+ V_g = sum over p in P_g of 1/p
+ = (c_4 - c_3) s_j (1 + o(1)) = (3/10) s_j (1 + o(1)), (10.3)
+
+so v_- <= V_g <= v_+ for fixed v_-, v_+ > 0.
+
+The candidate integers. There are r_0 ordered prime slots per Q-band.
+One designated slot, in a fixed band j_** chosen once and for all with
+j_** >= j_0, is the rough-integer slot: instead of a prime in Q_(j_**)
+it takes an arbitrary integer v in [x^(tau_*), x^(eta_*)] with
+P^-(v) > W, where lambda = 2, tau_* = c_1 s' lambda^(-j_**) and
+eta_* = c_2 s' lambda^(-j_**). Note W = exp(sqrt L) > exp(L^(2/5)) >
+exp(c_4 s_0)>= exp(c_4 s_j), so the rough slot is disjoint from every
+group and from every Q-band. A candidate has form
+
+ u = v · (product of Q-primes, r_0 per band) ·
+ (product of P-primes, at most one per group),
+ u_* = v · (product of Q-primes). (10.4)
+
+
+10.2 THE CANDIDATE MASS.
+
+
+Let a_Q, A be as in (9.5), (9.3). Put ell = 1 in (9.1) so W_1 is the
+damping associated with the marked P-divisors, and set
+
+ X_A = sum over u of A(u) Psi(u/x), (10.5)
+ H_Q = sum over v of a_Q(v) / v,
+ H_P = sum over r: r_* = 1 of W_1(r) / r.
+
+Recall from (9.6) that 0 <= A(u) <= L^(C_A') tau(u_*) pointwise.
+
+PROPOSITION 10.1 (candidate mass). There are constants C, C_A
+depending only on the early candidate choices such that, for sufficiently
+large x after fixing j_**,
+
+ 0 <= A(u) <= L^C tau(u_*), A(u) <= exp(C sqrt L) (u = x), (10.6)
+ H_P = exp( q sum_g V_g + o(1) ), (10.7)
+ X_A = (x/L) H_Q H_P (1 + o(1)) >> x L^(-C_A). (10.8)
+
+On the support of A(u) Psi(u/x) every prime divisor of u lies in
+[L^20, x^delta].
+
+PROOF. The first line of (10.6) is the bound (9.6). The second: for
+v = x, any possible rough-slot divisor divides the part of v supported
+on primes > W, which has at most O(L/log W) = O(sqrt L) prime factors
+counted with multiplicity, hence at most exp(O(sqrt L)) divisors. This
+is A(u) <= L^(O(1)) exp(O(sqrt L)) for the pointwise factor W_1 <= L^C
+and the tau factor.
+
+(10.7). For one group, the marked Euler factor is
+
+ F_g(q) = prod over p in P_g of (1 + q/(p-1)). (10.9)
+
+Summing the geometric series over the powers of the p in P_g shows that
+the factor of g in H_P is
+
+ (1/V_g) sum over p in P_g of 1/(p - 1 + q) · F_g(q). (10.10)
+
+Each prime factor contributes exp(q/(p-1) + O(p^(-2))). Since V_g is
+bounded above and below, and since sum over all p in any group of
+1/p^2 <= T exp(-2 L^(1/10)) = o(1), we have
+
+ F_g(q) = exp( q V_g + o(1/T) ). (10.11)
+
+
+...
+
+...
+10.3 THE MARKED EULER FACTOR AND THE USEFUL INEQUALITY.
+
+Two consequences are worth isolating.
+
+The lower comparison. From (10.10) and p - 1 + q <= p,
+
+ H_P >= prod over p in any P-group (1 + q/(p-1)). (10.15)
+
+The mask comparison. Suppose an integer u has an ordered list of
+distinct P-prime divisors p_(g,1) in each group g, at most one in each
+group. Then the damping factor q^(omega_P(u) - s_P) that W_1 assigns to
+u is exactly the probability that an independent Bernoulli(q) random
+subset of the usable P-groups is a sub-list of the given one. This
+identification is used in section 10.9 when we form the mask majorant of
+A(u); it is the reason the damping is exactly q^(omega_g - 1) per group
+and not some other function.
+
+
+10.4 CONGRUENCE DISTRIBUTION AND TYPE I.
+
+
+For odd squarefree d define the remainder
+
+ r(d) = sum_{d | N_u} A(u) Psi(u/x) - X_A / phi(d), (10.16)
+
+where N_u = 2u + 1. The main term X_A/phi(d) is the natural harmonic
+density in each reduced class.
+
+PROPOSITION 10.2 (Type I distribution). For every fixed
+0 < theta < 1/2 and every D > 0,
+
+ sum over 1 <= d <= x^theta, d odd and squarefree of |r(d)|
+ << x L^(-D) + X_A L^(-18). (10.17)
+
+PROOF. The congruence 2u+1 = 0 mod d specifies a unit class for u,
+since d is odd. Use character orthogonality on that class. Replacing
+the principal coprime mass by X_A has total cost at most X_A L^(-18),
+because for each supported u
+
+ sum over d <= x^theta, (d,u) > 1 of mu^2(d)/phi(d) (10.18)
+ <= ( sum over p | u of 1/(p-1) )
+ ( sum over d' <= x of mu^2(d')/phi(d') ) << L^(-18).
+
+Here every p | u is at least L^20 by (10.6), there are at most
+O(L/log L) such primes, and the last sum is O(L) by its Euler product
+and Mertens. So the main terms combine to X_A/phi(d) on the coprime
+class.
+
+Extract one fixed Q_0 slot, as in the proof of Proposition 10.1, to
+write
+
+ A(u) = sum over pr = u, p in Q_0 of b(r), 0 <= b(r) <= L^O(1)
+ tau(r). (10.19)
+
+Split p, r into dyads of sizes P, U with P U = x. There is a fixed
+a > 0 such that x^a << P, U << x^(1-a) in every contributing dyad.
+
+Character decomposition. A nonprincipal character modulo squarefree d
+is induced by a primitive nonprincipal character modulo f > 1, where
+d = h f and (h, f) = 1; it acts as that primitive character together
+with the restrictions (p, h) = (r, h) = 1, and phi(d) = phi(h) phi(f).
+
+Large conductors. Fix h. On conductors f = R > L^(C'), separate
+Psi(pr/x) by Mellin inversion, which has bounded integrated absolute
+cost. For each twist, the large sieve, Cauchy-Schwarz, and divisor
+moments give
+
+ sum over f = R of (1/phi(f)) sum over chi mod f, primitive of (10.20)
+ |sum over p = P of a_p chi(p)| |sum over r = U of b_r chi(r)|
+ << L^O(1)/R · sqrt( (P + R^2)(U + R^2) P U )
+ << x L^O(1) ( R^(-1) + P^(-1/2) + U^(-1/2) + R/sqrt(x) ).
+
+The coefficients include coprimality to h and unit-modulus Mellin
+twists, so their squared sums are O(P) and U L^O(1). Discarding
+(h, f) = 1 and squarefreeness only enlarges the positive bound.
+Summing dyads and 1/phi(h) costs a fixed power of L. Since
+R <= x^theta, a sufficiently large C' gives any prescribed
+logarithmic saving.
+
+Small conductors. For 1 < f <= 2 L^(C'), fix r and apply
+Siegel-Walfitz to the p-sum with the original smooth cutoff
+Psi(pr/x), using partial summation. The nonprincipal character sum
+is O_A(P L^(-A)) for arbitrary fixed A. Omitting primes dividing h
+costs only O(1) terms, since such primes in the range have log at
+least x^a and h <= x^theta. Their total cost after summing r,
+moduli, and dyads is x^(1-a) L^O(1). The remaining costs are fixed
+powers of L, absorbed by choosing A large.
+
+Summing all the contributions proves (10.17). [End]
+
+
+10.5 THE PRESIEVE AND ITS MAIN TERM.
+
+
+Define the standard sieve products
+
+ V(y) = prod over p <= y of (1 - 1/p),
+ V_1(y) = prod over 3 <= p <= y of (1 - 1/(p-1)),
+ Sel = 2 prod over p >= 3 of (1 - 1/(p-1)^2) > 0. (10.21)
+
+Mertens gives V(y) ~ e^(-gamma_E)/log y and V_1(y) ~ Sel V(y).
+
+Choose a fixed small 0 < kappa < 1/50, then a sufficiently small
+fixed b_1 > 0, and set b_* = b_1/3.
+
+Preliminary sieve step. Apply the block sieve (Lemma 4.5) to the odd
+prime divisors of N_u up to x^(b_1), with density g(p) = 1/(p-1) and
+the remainders r(d) from (10.16)-(10.17). Take
+
+ h = 2 floor(1/(40 b_1)), theta = 1/2 - kappa/2. (10.22)
+
+For sufficiently small b_1, h is large enough for Lemma 4.5, and
+b_1(4h+2) < theta. Choose D > C_A + 10 in (10.17). Then, summing the
+remainders with the Type I bound,
+
+ sum over P^-(N_u) > x^(b_1) of A(u) Psi(u/x) (10.23)
+ >= (Sel X_A/L) { (e^(-gamma_E)/b_1) (1 - O(e^(-c/b_1))) + o(1) }.
+
+The constants in the exponential error are uniform in small b_1 and in
+0 < kappa < 1/50.
+
+
+10.6 PROXIES WITH CHARACTER AND MELLIN DISCREPANCY.
+
+
+At fixed b_1, kappa, partition (b_1, 1/2 - kappa] into finitely many
+exponent bins (gamma, gamma']. Their mesh is chosen later. On the
+factor ranges below consider the tests
+
+ I_gamma(m) = 1_{P^-(m) > x^gamma}, I_pr(m) = 1_{m prime}. (10.24)
+
+Every such range lies between two fixed positive powers of x; throughout
+this subsection the ambient interval is [x^(b_1/4), x^(1 - b_1/4)].
+Put Delta_L = L^(-S), with S a fixed precision to be chosen last.
+Partition the logarithmic axis into intervals of width Delta_L. For
+a full cell C_Y = (Y, e^(Delta_L) Y] meeting the ambient interval set
+
+ c_I(C_Y) = (sum over m in C_Y of I(m)) / (10.25)
+ #{ m in C_Y : P^-(m) > W },
+ B_I(m) = c_I(C_Y) 1_{P^-(m) > W} (m in C_Y).
+
+The counts defining c_I are full-cell counts even when the factor range
+cuts a cell; range restrictions are imposed afterwards.
+
+LEMMA 10.1 (proxy discrepancy). The denominators in (10.25) are
+positive for large x, and 0 <= B_I <= 1. Given any fixed discrepancy
+exponent B, taking S > 2 B + 3 makes
+
+ alpha_m = (I(m) - B_I(m)) 1_{m in K} (10.26)
+
+satisfy the discrepancy condition (8.5), uniformly for every interval K
+inside a dyad in the stated factor ranges, for each of the finitely
+many tests above. Thus the coefficient bound in Theorem 9.1 is
+independent of S.
+
+PROOF. Use the block sieve (Lemma 4.5) on ordinary integers in a cell
+with z = W, g(p) = 1/p, and h_s = 2 ceil(T^2). Each divisibility
+remainder is O(1), and the sieve level is
+
+ D_W = W^(4 h_s + 2) = exp(O(sqrt L T^2)) = x^o(1). (10.27)
+
+Since Y >> x^(b_1/4), uniformly for these cells,
+
+ #{ m in C_Y : P^-(m) > W } ~ Delta_L Y V(W) (1 + O(e^(-T^2))). (10.28)
+
+Both actual tests select subsets of these rough integers for large x:
+for the prime test all integers in the cell exceed W, and for the other
+tests x^gamma > W. So 0 <= c_I <= 1 exactly.
+
+Principal case. Every prime divisor of a modulus r <= L^B is below W,
+so a principal character is identically one throughout the support of
+alpha. On a full cell the unweighted sum of I - B_I is zero. For
+f(t) = t^(iv-1) with |v| <= L^B, its variation on that cell is at most
+O((1+|v|) Delta_L / Y). The absolute harmonic mass on a dyad is O(1)
+(even O(L^(1/2)) would suffice). So the full cells contribute
+O(L^(B-S)); intersecting the test interval in (8.5) with K leaves at
+most two partial cells, whose combined harmonic mass is
+O(L^(-S) + x^(-b_1/4)). These bounds give the principal case with room
+to spare when S > 2 B + 3.
+
+Nonprincipal case for the actual roughness test. Each admitted integer
+has a unique nondecreasing list of at most O(1/b_1) prime factors. Fix
+the first l-1 factors and sum over the last prime. Its order
+restriction, its lower bound x^gamma, and the interval restriction on
+the full product intersect in one prime interval whose endpoints lie
+between x^gamma and x^2. By Siegel-Walfitz and partial summation, the
+harmonic sum of this prime against a nonprincipal character and the
+twist p^(iv) has arbitrarily strong logarithmic saving, uniformly for a
+prescribed logarithmic bound on modulus and frequency. The reciprocal
+masses of the remaining factors are bounded in terms of b_1, because
+sum over x^gamma < p <= x^2 of 1/p = O_{b_1}(1). Summing the bounded
+number of list lengths preserves the saving. Repeated primes are
+included by the nondecreasing enumeration. Imprimitive nonprincipal
+characters give the same estimate via their nonprincipal primitive
+characters; primes dividing the modulus are too small to occur. For
+I_pr this is the same argument with one prime.
+
+Nonprincipal case for the proxy. For every subinterval J' of a cell and
+every unit class a mod r, apply the block sieve to that class, omitting
+primes dividing r from the sieve. The CRT gives an O(1) remainder at
+each squarefree sieve product. Since all prime divisors of r are below
+W, the main term is
+
+ |J'|/r · prod over p <= W, p ∤ r of (1 - 1/p) = |J'| V(W)/phi(r). (10.29)
+
+Thus
+
+ #{ m in J' : m = a mod r, P^-(m) > W } (10.30)
+ = |J'| V(W)/phi(r) (1 + O(e^(-T^2))) + O(D_W).
+
+Summing against a nonprincipal character cancels the common main term,
+and bounds the remaining sum by O(|J'| V(W) e^(-T^2) + phi(r) D_W).
+Multiply by c_I <= 1 and use partial summation against m^(iv-1). The
+number of cells is at most O(L^(S+1)); the moduli and twists cost fixed
+powers of L. The first error remains smaller than every fixed negative
+power of L, and the second is x^(-b_1/4 + o(1)) times a fixed power of
+L. So the proxy has the discrepancy required. [End]
+
+Prescribe the saving in Theorem 9.1 large enough that its errors, after
+all dyadic decompositions, are o(X_A/L). Its coefficient exponent is
+fixed before S by Lemma 10.1; obtain the required discrepancy exponent
+in (8.5) and then choose S. There are only finitely many test types, so
+the same S works for all.
+
+
+10.7 LOCAL DENSITIES AND THE INTEGRAL IDENTITY.
+
+
+For w > gamma > 0 define the Buchstab rough-number density
+
+ D_gamma(w) = 1/w + sum over l >= 2 of (1/l!) (10.31)
+ int over t_i >= gamma, sum_{i<l} t_i <= w - gamma of
+ (1/(w - sum_{i<l} t_i)) prod_{i<l} dt_i / t_i.
+
+Only finitely many terms are nonzero. On compact subsets of w > gamma >
+0 the functions are jointly continuous, including at thresholds
+w = l gamma: the integrands have bounded denominators and the moving
+boundaries have measure zero. This D_gamma is the Buchstab density in
+logarithmic coordinates; the minimum-coordinate decomposition below is
+the Buchstab identity.
+
+LEMMA 10.2 (proxy density bounds). For the prime proxy on
+x^(1/2 - 2 kappa) <= m <= x^(1/2 + 2 kappa),
+
+ c_pr(m) <= C/(L V(W)), (10.32)
+
+with C absolute for 0 < kappa < 1/50. If mn = N_u on the support of
+Psi(u/x) and log n / L in (gamma, gamma'], then
+
+ c_gamma(m) <= ( sup over gamma <= a <= gamma' of D_gamma(1-a) + o(1) )
+ / (L V(W)). (10.33)
+
+At fixed b_1 one also has the two identities
+
+ int over b_1 <= alpha <= 1/2 of D_alpha(1-alpha) d alpha / alpha (10.34)
+ = D_{b_1}(1) - 1,
+
+ D_{b_1}(1) <= (e^(-gamma_E)/b_1) (1 + O(e^(-c/b_1))). (10.35)
+
+At alpha = 1/2 the integrand is understood by its left limit.
+
+PROOF. For (10.32): the prime number theorem with arbitrarily large
+logarithmic error at both endpoints of a cell gives
+
+ #{ p in (Y, e^(Delta_L) Y] } = (1+o(1)) Delta_L Y / log Y. (10.36)
+
+For w = log Y / L in [0.46+o(1), 0.54+o(1)], divide by (10.28) to get
+(10.32) with an absolute eventual constant.
+
+For (10.33): uniformly on compact sets with gamma >= b_1, w - gamma
+bounded below and w bounded above, the number of integers rough above
+x^gamma in a cell is at most
+
+ (D_gamma(w) + o(1)) Delta_L Y / L. (10.37)
+
+Indeed repeated prime factors contribute at most
+
+ sum over p > x^gamma of floor(2Y/p^2) << Y x^(-b_1)
+ = o(Delta_L Y / L). (10.38)
+
+Count the squarefree remaining integers by ordered lists of l primes
+with weight 1/l!, where l is bounded in terms of b_1. Fix the first l-1
+primes, write Q = prod_{i<l} p_i and t_i = log p_i / L. A last prime
+can occur only when sum_{i<l} t_i <= w - gamma + O(Delta_L/L). Its
+count is at most
+
+ (1+o(1)) Delta_L Y / (L Q (w - sum_{i<l} t_i)). (10.39)
+
+The prime number theorem is uniform here because Y/Q >= x^gamma/2.
+The reciprocal-prime measures converge to dt_i / t_i. A finite-grid
+approximation gives uniform convergence of the resulting integrals:
+denominators stay bounded away from zero, while strips around the
+moving hyperplane boundary have uniformly vanishing volume. This
+proves (10.37). In our application w = 1 - log n / L + o(1) and
+w - gamma >= 2 kappa + o(1). Continuity, followed by division by
+(10.28), gives (10.33).
+
+For (10.34): write the l-th term (l >= 2) of D_(b_1)(1) on the simplex
+
+ t_1 + ... + t_l = 1, t_i >= b_1, measure dt_1 ... dt_{l-1} /
+ (l! t_1 ... t_l). (10.40)
+
+This measure is invariant under permutations of the l coordinates:
+exchanging a dependent and an independent coordinate has absolute
+Jacobian one. Except on a null set exactly one coordinate is the
+minimum, say alpha. Selecting that coordinate in l ways, its measure
+is d alpha / alpha, and the remaining coordinates (sum 1 - alpha, lower
+bound alpha) give the (l-1)-term of D_alpha(1-alpha). The coefficient
+l/l! is 1/(l-1)!. Summing proves (10.34); the one-prime term of
+D_(b_1)(1) equals one.
+
+For (10.35): order prime lists with weight 1/l! kill strictly less than
+one mass per integer, so
+
+ liminf over x of (L/x) #{ x < m <= 2x : P^-(m) > x^(b_1) }
+ >= D_(b_1)(1). (10.41)
+
+On the other hand Lemma 4.5 with g(p) = 1/p, O(1) remainders, and
+h = 2 floor(1/(40 b_1)), bounds this count by
+
+ x V(x^(b_1)) (1 + O(e^(-c/b_1))) + O(x^(b_1(4h+2)/...)). (10.42)
+
+Its remainder is o(x/L) for small b_1, and the Mertens asymptotics in
+(10.21) prove (10.35). [End]
+
+
+10.8 SUBTRACTING COMPOSITES AWAY FROM BALANCE.
+
+
+Consider a composite N_u counted in (10.23) with least prime factor at
+most x^(1/2-kappa). This p lies in one bin (x^gamma, x^(gamma')], and
+m = N_u/p satisfies P^-(m) > x^gamma. Its total contribution is
+bounded by
+
+ sum over mp = N_u, x^gamma < p <= x^(gamma') of A(u) Psi(u/x)
+ I_gamma(m). (10.43)
+
+All contributing dyads of m and p lie between x^(b_*) and x^(1-b_*)
+for large x, with b_* = b_1/3: constants in N_u = x are absorbed by the
+strict exponent slack. Apply Theorem 9.1 with alpha = I_gamma - B_gamma
+restricted to each actual cofactor range, and beta the prime indicator
+restricted to its bin and dyad. Lemma 10.1 supplies its discrepancy
+hypothesis. Replacing I_gamma by B_gamma costs o(X_A/L) in total.
+
+For a prime p > W the condition that m = N_u/p be rough above W is
+equivalent to P^-(N_u) > W. By (10.33) the resulting upper bound
+reduces to a constant over L V(W), times
+
+ sum over x^gamma < p <= x^(gamma') of (10.44)
+ sum over p | N_u, P^-(N_u) > W of A(u) Psi(u/x).
+
+For each such p sieve the odd primes up to W with base mass X_A/(p-1),
+density 1/(p-1), and remainders r(pd). Take h_s = 2 ceil(T^2) in
+Lemma 4.5. All products pd are at most x^(1/2-kappa+o(1)), which is
+below the Type I level x^(1/2 - kappa/2). Moreover different pairs
+(p, d) give different products: p > W is their unique prime factor
+above W. So the Type I bound (10.17) applies without any divisor
+multiplicity loss, giving
+
+ sum over x^gamma < p <= x^(gamma') of p | N_u, P^-(N_u) > W (10.45)
+ of A(u) Psi(u/x)
+ = X_A V_1(W) sum over x^gamma < p <= x^(gamma') of 1/(p-1)
+ + o(X_A V(W)).
+
+The reciprocal sum tends to log(gamma'/gamma). So the composite
+contribution of the bin is at most
+
+ (Sel X_A / L) { sup over gamma <= a <= gamma' of
+ D_gamma(1-a) · log(gamma'/gamma) + o(1) }. (10.46)
+
+At fixed b_1, kappa, joint continuity in Lemma 10.2 permits a
+sufficiently fine fixed mesh such that the sum of these constants is
+at most
+
+ int over b_1 <= alpha <= 1/2 - kappa of D_alpha(1-alpha) (10.47)
+ · d alpha / alpha + 1/10.
+
+Subtracting (10.46) from (10.23) and using (10.34)-(10.35) leaves at
+least
+
+ (Sel X_A / L) { 1 - 1/10 - O(b_1^{-1} e^(-c/b_1)) + o(1) }
+ >= Sel X_A / (2 L) (10.48)
+
+on primes and composites with least prime factor exceeding
+x^(1/2-kappa), provided b_1 is sufficiently small.
+
+
+10.9 A UNIFORM UPPER BOUND FOR BALANCED COMPOSITES.
+
+
+If a composite N_u = x has least prime factor above x^(1/2-kappa), it
+has exactly two prime factors counted with multiplicity, because
+3(1/2 - kappa) > 1. Both factors belong, for large x, to
+
+ B_kappa = [x^(1/2 - 2 kappa), x^(1/2 + 2 kappa)]. (10.65)
+
+We may overcount them by ordered pairs (m, n) of primes in that range
+with mn = N_u. Replace the first prime indicator by its proxy using
+Theorem 9.1, then replace the second using the same theorem with the
+factor roles exchanged. The remaining coefficient in the second
+application is a proxy bounded by one. All required discrepancy and
+range hypotheses follow from Lemma 10.1, as before. By (10.32) the
+resulting upper bound is o(X_A/L) plus
+
+ (C/(L^2 V(W)^2)) sum over m, n in B_kappa, mn = 2u+1, (10.66)
+ P^-(m) > W, P^-(n) > W of A(u) Psi(u/x).
+
+We bound this positive sum with a constant independent of kappa, b_1,
+j_**, and S. More precisely, each dyadic pair with mn = x contributes
+O(X_A V(W)^2). There are only O(kappa L + 1) such pairs in the
+indicated range, so the prefactor in (10.66) gives an
+O((kappa + L^(-1)) X_A/L) bound.
+
+Micro bands. Choose a fixed large index j' and then theta in the gap
+
+ c_2 s' 2^(-j') < theta < c_1 s' 2^(-j'+1), 10 theta <= 1/20, (10.67)
+ sum over j >= j' of r_0 c_2 s' 2^(-j) <= 1/25.
+
+The gap exists because c_2 < 2 c_1. These choices depend only on the
+candidate geometry. Increase the early lower bound j_0 to ensure
+j_0 >= j', so the rough slot is in a band j >= j'. Call these the
+micro bands. Write H_Q^mic for the Q harmonic mass of just these bands.
+Omitting the finitely many fixed bands j < j' gives
+
+ H_Q^mic << H_Q, (10.68)
+
+with a constant independent of j_**.
+
+An assignment consists of the complete ordered Q-lists in the micro
+bands, including the rough slot, and one marked prime from every
+P-group. Give it weight
+
+ lambda_assgn = prod_{j=j'}^{j_x} (1/r_0!) prod over P-groups g of (10.69)
+ (1/V_g),
+
+and let D_1 be the product of all its entries, with multiplicity. The
+micro Q contribution has size at most x^(1/25) by (10.67); the P marks
+have product exp(O(T L^(2/5))) = x^o(1). So
+
+ D_1 <= x^(1/20), sum over assignments of lambda_assgn / D_1
+ = H_Q^mic, (10.70)
+ sum over assignments of lambda_assgn <= x^(1/20) H_Q^mic.
+
+In the middle identity the harmonic sum of the normalized P-mark in
+each group is exactly V_g^(-1) sum over p in P_g of 1/p = 1.
+
+Damping. Once one P prime per group is marked in D_1, every additional
+distinct P-prime divisor of u contributes a factor q. We represent
+these factors by independent random permissions for those primes;
+averaging the permissions recovers exactly the damping.
+
+For each assignment, ban every odd non-P prime l <= x^theta not
+dividing D_1. For each P prime not dividing D_1, independently allow
+it with probability q and otherwise ban it. Primes dividing D_1 are
+never banned. All P primes are below x^theta and indeed below W.
+Then we have the pointwise majorant
+
+ A(u) <= sum over assignments of lambda_assgn (10.71)
+ 1_{D_1 | u} E_mask 1_{l does not divide u for every
+ banned l}.
+
+To verify it, expand A(u) into Q-lists and one P mark per group. For
+every genuine list the divisibility D_1 | u holds, and every non-P
+prime divisor of u below x^theta occurs in D_1: omitted Q-bands
+contain only pure primes above x^theta. The micro Q product has no P
+factors, so D_1 contains exactly one distinct P prime per group. For
+such a genuine list the mask expectation is q^(omega(u)-s), which is
+the damping in W_1(u). Once the micro entries are fixed, the
+normalized number of omitted pure-prime lists with any fixed residual
+product is at most one: a band with prime multiplicities a_p
+contributes prod 1/a_p! <= 1, and disjointness prevents alternative
+band assignments. Dropping these residual restrictions proves (10.71).
+
+Dyadic estimate. Fix a pair of dyads m = M_1, n = M_2 meeting the
+product support mn = x, an assignment, and a mask. Since D_1 is odd,
+D_1 | u and mn = 2u+1 imply mn = 1 mod D_1. Use this congruence to
+bound the number of pairs in the full dyadic box. For an odd prime
+l <= z' := x^theta with l ∤ D_1, the bad events are
+
+ mn = 0 mod l (l <= W), mn = 1 mod l (l banned). (10.72)
+
+The two residue sets are disjoint and contain respectively 2l-1 and
+l-1 pairs. Put
+
+ nu(l) = (2l-1) 1_{l <= W} + (l-1) 1_{l banned}, g(l) = nu(l)/l^2. (10.73)
+
+These densities satisfy the hypotheses of the block sieve uniformly in
+assignment and mask: g(l) <= 3/l, and for l >= 3 they are bounded away
+from one. The base mass is the product of the two real side lengths
+times phi(D_1)/D_1^2.
+
+Lattice error. For a squarefree product d of the sieve primes the CRT
+gives exactly phi(D_1) nu(d) residue pairs modulo D_1 d, including when
+D_1 has prime-power factors. Each pair of residue classes has lattice
+count equal to its area term with error
+
+ O( 1 + (M_1 + M_2)/(D_1 d) ). (10.74)
+
+Since nu(d) <= d 3^(omega(d)) and phi(D_1) <= D_1, the sum of absolute
+remainders up to D = (z')^(10) = x^(10 theta) is
+
+ << L^O(1) ((M_1 + M_2) D + D_1 D^2)
+ <= L^O(1) ((M_1 + M_2) x^(1/20) + D_1 x^(1/10)). (10.75)
+
+Here omega(d) occurs only in this elementary divisor bound; its sums
+follow for instance from 3^(omega(d)) <= tau_3(d). Apply the upper-
+bound version of the block sieve with h = 2.
+
+Euler product. A banned prime below W has factor 1 - 3/l + 2/l^2, and
+a banned prime above W has factor 1 - 1/l + 1/l^2. Each is at most
+
+ (1 - 1/l)^(1 + 2·1_{l<=W}) (1 + O(l^(-2))). (10.76)
+
+An allowed P prime has factor (1 - 1/l)^2, so it requires one
+compensating factor (1 - 1/l)^(-1). Omitting the prime 2 changes only
+an absolute constant, as does the convergent product of the
+1 + O(l^(-2)) factors. Removed primes dividing D_1 require at most
+three compensating factors. So
+
+ prod over 3 <= l <= z', l ∤ D_1 of (1 - g(l)) (10.77)
+ <= C V(W)^2 V(z') prod over l | D_1 of (1 - 1/l)^(-3)
+ prod over P primes p ∤ D_1 of (1 - 1/p)^(-1).
+
+Every prime dividing D_1 is at least L^20, so D_1 <= x^(1/20) makes
+its compensating product uniformly bounded. The expectation of the
+last product is
+
+ prod over P primes p ∤ D_1 of (1 - q + q/(1 - 1/p))
+ = prod over P primes p ∤ D_1 of (1 + q/(p-1)) <= H_P (10.78)
+
+by (10.15).
+
+Summing main terms. Since phi(D_1)/D_1^2 <= 1/D_1, sum the main sieve
+terms over assignments using (10.70), and bound Psi by its fixed
+supremum. Their contribution on the dyadic pair is
+
+ << x V(W)^2 V(x^theta) H_Q^mic H_P << X_A V(W)^2, (10.79)
+
+by (10.8), (10.68), and V(x^theta) << 1/L. To sum the error (10.75)
+use M_i << x^(0.54) and (10.70); the result is
+
+ << x^(0.64) L^O(1) H_Q^mic = o(X_A V(W)^2). (10.80)
+
+The comparison is uniform in the later parameters: use
+H_Q^mic << H_Q, H_P >= 1, and X_A V(W)^2 = x H_Q H_P / L^2.
+
+So the dyadic estimate holds:
+
+ sum over m = M_1, n = M_2, mn = 2u+1, P^-(m) > W, P^-(n) > W (10.81)
+ of A(u) Psi(u/x) << X_A V(W)^2.
+
+There are O(kappa L + 1) possible dyads for m in B_kappa, and for each
+only O(1) possible dyads for n because mn = x. Combining (10.66) and
+(10.81) bounds the entire balanced composite contribution by
+
+ C_bal (kappa + L^(-1)) X_A/L + o(X_A/L). (10.82)
+
+The constant C_bal depends only on delta, r_0, Psi, j', theta, and the
+fixed P-group geometry. It does not depend on kappa, b_1, j_**, the
+later analytic parameters, or S. Indeed the candidate comparison is
+uniform in j_**; the omitted macro bands are fixed before the gap; the
+prime proxy bound is uniform on [0.46, 0.54]; and the sieve-density and
+lattice constants just used are absolute.
+
+
+11. CLOSING THE PARAMETER CHOICES AND PROVING THEOREM B.
+
+
+The choices above can be made in the following order.
+
+
+11.1 THE ORDER.
+
+
+(1) Fix delta, Psi, r_0, and the Q/P geometry. Choose the finite prefix
+ for the candidate lower bound in the proof of Proposition 10.1, then
+ j' and theta in (10.67), and enlarge j_0 to cover both requirements.
+ All these are early choices, depending only on fixed parameters.
+
+(2) Fix kappa in (0, 1/50) so small that C_bal kappa < Sel/4. This is
+ possible because the constant C_bal in (10.82) is independent of the
+ gap.
+
+(3) Choose b_1 > 0 sufficiently small for (10.23), (10.35), and (10.48).
+ Set b_* = b_1/3. Choose j_** to meet (10.1) and c_2 s' 2^(-j_**) <
+ b_*/4. Then choose the finite exponent mesh for (10.46).
+
+(4) Prescribe the saving in Theorem 9.1 large enough that every
+ replacement error, including dyadic sums, is o(X_A/L). The
+ coefficient exponents are already bounded independently of S. The
+ proof of that theorem fixes its Cauchy splitting precision, its
+ shift-saving target, its graph and analytic parameters, and finally
+ a required discrepancy exponent B in (8.5).
+
+(5) Choose S sufficiently large in Lemma 10.1 for that B. Fix any
+ prime-number-theorem accuracies needed for this S, then let x tend
+ to infinity.
+
+In particular, the precision of the proxy cells causes no feedback into
+the Type II coefficient bound. All constants that appear in the
+balanced-composite bound (10.82) are fixed before step (2).
+
+
+11.2 COUNTING PRIMES AND PROVING THEOREM B.
+
+
+Subtract (10.82) from (10.48). For all sufficiently large x there
+remains a positive constant multiple of X_A/L on prime values of N_u:
+
+ sum over 2u+1 prime of A(u) Psi(u/x) >> X_A/L. (11.1)
+
+By Proposition 10.1 each summand is at most exp(O(sqrt L)), and X_A >>
+x L^(-C_A). The map u -> 2u+1 is injective, so the number of distinct
+primes is at least
+
+ x L^(-C_A-1) exp(-O(sqrt L)) = x^(1-o(1)). (11.2)
+
+Their range is 2x < p <= 4x + 1 <= 5x. Moreover, P^+(p-1) = P^+(2u) =
+max(2, P^+(u)) <= x^delta for large x. The strict inequality c_2 s' <
+delta in (10.1) leaves room for every subpower P-prime, and the factor 2
+is eventually below x^delta. This proves Theorem B.
+
+
+11.3 REMARK ON THE PROOF SKELETON.
+
+
+The pieces of the proof combine as follows. Section 4 supplied the
+elementary lemmas; sections 5, 6, 7 proved that the physical dilation
+graph has the same moments as its idealised counterpart; section 8
+extracted a cancellation at any prescribed shift, which section 9
+converted into the Type II bilinear estimate. Sections 10.1-10.9 then
+threaded the sieve: Type I to control the congruence distribution, the
+block sieve to establish the presieve mass, proxies to turn roughness
+tests into ordinary-density tests, Type II to remove unbalanced
+composites, and a two-variable sieve to control the balanced window.
+Section 11.1 fixed the parameters, and section 11.2 converted the
+surviving prime mass into a count. Nothing in this chain depends on
+Siegel-Walfitz for the ideal norm or the shift cancellation; the only
+ineffective input is the usual one inside Type I and the prime number
+theorem in the block sieve, and both are absolute.
+
+
+12. THEOREM A FROM THEOREM B.
+
+
+The derivation is complete in section 2. This section records the
+exact constants, so that the reader who jumps to the end can check
+that the proof really finishes Theorem A.
+
+Setting. Suppose eps is a fixed real with 0 < eps < 1. Choose a
+fixed 0 < delta < 1/4 with 4 delta < eps, for example delta = eps/8.
+
+The prime set. Apply Theorem B with x = X/5 for large X. Since
+2(X/5) = 2X/5 and 5(X/5) = X, and (X/5)^delta < X^delta, Theorem B
+yields a set Pp of primes with
+
+ X/3 < p <= X, p-1 is X^delta-smooth, |Pp| >= X^(1-delta). (12.1)
+
+The last inequality uses X^(1-o(1)) >= X^(1-delta) for large X.
+
+Many distinct products. Put M = |Pp| and k = floor(X^(2 delta)).
+For large X, k <= M because 3 delta < 1. The elementary bound
+binom(M,k) = prod_{j=0}^{k-1} (M-j)/(k-j) >= (M/k)^k, and every factor
+(M-j)/(k-j) is at least M/k, gives
+
+ number of k-element subsets Q of Pp >= (M/k)^k
+ >= X^((1-3 delta) k). (12.2)
+
+Different subsets have different products m_Q by unique
+factorization, and every such m_Q satisfies X/3 < m_Q <= X^k.
+
+Their totients are few. By multiplicativity of phi on squarefree
+m_Q,
+
+ phi(m_Q) = prod_{p in Q} (p-1). (12.3)
+
+Each factor is at most X and is X^delta-smooth, so phi(m_Q) is
+X^delta-smooth and at most X^k. An X^delta-smooth integer at most
+X^k has form prod p^(a_p) over primes p <= X^delta, subject to
+sum_p a_p log p <= k log X; in particular each a_p is at most
+k log X/log 2. So the number of possible phi-values is at most
+
+ (1 + k log X / log 2)^(X^delta) = X^(o(k)). (12.4)
+
+The exponent claim: the logarithm of the left side, divided by
+k log X, is O_delta(X^delta log X / (k log X)) = O_delta(X^(-delta)),
+which tends to zero because k = X^(2 delta).
+
+Pigeonhole. By (12.2) and (12.4), some totient value n <= X^k has
+
+ g(n) >= X^((1-3 delta - o(1)) k) > n^(1 - eps) (12.5)
+
+for large X, since 3 delta + o(1) < eps and 1 - eps > 0.
+
+Infinitely many n. The lower bound (12.5) tends to infinity with
+X, so the values n achieving it cannot belong to a fixed finite set.
+They are unbounded, giving infinitely many n with g(n) > n^(1 - eps).
+
+This proves Theorem A. For eps >= 1 the statement is subsumed by any
+smaller positive eps. The elementary upper bound n^(1+eta) from
+Lemma 2.1 shows the exponent 1 in Theorem A is the largest possible.
+
+
+13. WHERE EACH HYPOTHESIS IS USED.
+
+
+Every result of the paper is stated with the parameters on which it
+depends, and the following table records where each external
+hypothesis is introduced and where it is discharged. All constants
+are fixed before x tends to infinity, except where a parameter
+depends on x, which is stated.
+
+Hypothesis | Introduced | Used / discharged in
+-------------------------------+----------------+--------------------------------
+Prime number theorem with | sec 4.1 | 4.2, 8.5, 10.7 (proxy
+logarithmic error | | densities), 11.2
+Mertens asymptotics | sec 4.1 | 4.2, 4.5 (block sieve),
+ | | 10.5 (Sel, V(W))
+Siegel-Walfitz (Thm 4.x) | sec 4.1 | 4.4 (harmonic character
+ | | estimates), Lemma 10.1
+ | | (proxy discrepancy), and
+ | | the small-conductor case
+ | | of Type I (Prop 10.2)
+Multiplicative large sieve | sec 4.1 | 7.3 (character frame),
+ | | 10.4 (Type I, large f)
+Block sieve (Lemma 4.5) | sec 4.5 | Cor 4.6 (rough
+ | | polynomial), Lemma 10.1
+ | | (proxy discrepancy),
+ | | Lemma 10.2 (rough
+ | | densities), 10.5 (pre-
+ | | sieve), 10.8 (second
+ | | sieve for unbalanced
+ | | composites), 10.9
+ | | (two-variable sieve for
+ | | balanced composites)
+Ideal-norm hypothesis (5.12) | sec 5.2 | required by Thm 5.2
+ | | (transference); proved
+ | | by Thm 7.1
+Distinctness of birth values | sec 6.7 | restored in 6.7 by the
+ | | rank expansion
+Discrepancy condition (8.5) | sec 8.1 | required by Thm 9.1
+ | | (Type II); supplied by
+ | | Lemma 10.1
+Geometric data (5.1) | sec 5.1 | fixed before 6-9;
+ | | used by 10.1 and 10.9
+Candidate geometry (10.1) | sec 10.1 | fixed at the start of
+ | | single-prime-extraction
+ | | step
+Band gaps (9.1) | sec 9.1 | fixed before Type II,
+ | | controlled by j_0 in
+ | | (10.1)
+
+The quantifier order. Throughout, the choices are made in the order:
+
+ delta, Psi, r_0, Q/P geometry
+ -> finite prefix for the candidate lower bound, then j' and theta
+ -> kappa (with C_bal kappa < Sel/4)
+ -> b_1 (with b_1(4h+2) < theta in (10.22)) and b_* = b_1/3
+ -> j_** (with c_2 s' 2^(-j_**) < b_*/4)
+ -> finite exponent mesh for (10.46)
+ -> Type II saving target and the constants it needs (J, E_id,
+ A_0, C_1, m, B)
+ -> S in Lemma 10.1 (with S > 2B+3)
+ -> prime-number-theorem accuracies for this S
+ -> x -> infinity.
+
+The only apparent feedback is the requirement c_2 s' < delta for the
+final smooth-image growth in (11.2), and that inequality is
+discharged by fixing r_0 sufficiently large. Everything else is
+fixed in one direction.
+
+Dependence on J. The pattern length J is chosen last among the
+graph analytic parameters: after the ideal norm target E_id and the
+comparison kernels. Its only appearance outside the graph
+construction is in the small-group gain in (6.37) and the small-group
+mask of (10.9); both are invisible once J is fixed.
+
+Dependence on the discrepancy exponent B. B is chosen last in the
+Type II chain: after J and the Mellin cutoffs, and before S. Its
+only role is to state the discrepancy hypothesis (8.5), so it is
+also the only constraint on the cell precision in (10.25).
+
+
+13.1 A ONE-PARAGRAPH SKELETON.
+
+A reader who wants only the shape of the proof can hold the following
+in mind. The candidate set supplies about x/L integers u whose prime
+factors all lie below x^delta. The presieve removes u with a small
+odd prime dividing 2u+1, leaving x/L mass. Type I ensures that
+2u+1 is equidistributed among residue classes up to the sieve level.
+Type II replaces roughness of each factor of 2u+1 by a local density,
+which the two-variable sieve and the Buchstab identity then subtract
+from the presieve mass. The remainder is positive on prime values,
+and the count of distinct primes follows by dividing the surviving
+mass by the largest summand. Everything else is bookkeeping to make
+these five steps uniform in the parameters and correct at every
+scale.
+
+
+14. REFERENCES AND PROOF-DEPENDENCY MAP.
+
+
+14.1 SHORT REFERENCE LIST.
+
+The mathematics is all self-contained (every scalar is a named finite
+product or sum), but a few external results are worth citing for
+orientation:
+
+ Erdos, P. On the normal number of prime factors of p-1 and some
+ related problems concerning Euler's phi-function. Quart. J. Math.
+ 6 (1935), 205-213.
+
+ Erdos, P. On pseudoprimes and Carmichael numbers. Publ. Math.
+ Debrecen 4 (1956), 201-206.
+
+ Pomerance, C. Popular values of Euler's function. Mathematika 27
+ (1980), 84-89.
+
+ Baker, R. C. and Harman, G. Shifted primes without large prime
+ factors. Acta Arith. 83 (1998), 331-361.
+
+ Montgomery, H. L. and Vaughan, R. C. Hilbert's inequality. J.
+ London Math. Soc. (2) 8 (1974), 73-82.
+
+ Ford, K. and Halberstam, H. The Brun-Hooley sieve. J. Number
+ Theory 81 (2000), 335-350.
+
+ Soundararajan, K. Moments of the Riemann zeta function. Ann. of
+ Math. (2) 170 (2009), 981-993.
+
+ Buchstab, A. Asymptotische Abschaetzung einer allgemeinen
+ zahlentheoretischen Funktion. Rec. Math. [Mat. Sbornik] N.S. 2
+ (44) (1937), 1239-1246.
+
+ Matomaki, K. and Radziwill, M. Multiplicative functions in short
+ intervals. Ann. of Math. (2) 183 (2016), 1015-1056.
+
+ Alford, W. R., Granville, A., and Pomerance, C. There are
+ infinitely many Carmichael numbers. Ann. of Math. (2) 139 (1994),
+ 703-722.
+
+ Pilatte, C. Improved bounds for the two-point logarithmic Chowla
+ conjecture. arXiv:2310.19357, v3 (2026).
+
+The role each of these plays: Erdos (1935), Erdos (1956), and
+Pomerance (1980) were the origin of Theorem A and the smoothness
+expectation in Theorem B. Baker-Harman (1998) were the strongest
+earlier shifted-prime bounds and highlight why a fixed exponent
+delta with x^{1-o(1)} count is a change of kind. Montgomery-Vaughan
+(1974) is the source of the Dirichlet-polynomial mean-value lemma
+in 4.3. Ford-Halberstam (2000) is the source of the block sieve
+inequality in 4.5. Soundararajan (2009) is the source of the
+prime-polynomial moment argument in 8.6. Buchstab (1937) is the
+source of the rough-integer density in 10.7. Matomaki-Radziwill
+(2016) is the modern model for Type II estimates of this kind.
+Alford-Granville-Pomerance and Pilatte are included as context for
+the totient-fiber problem; neither is used in the proof.
+
+
+14.2 PROOF-DEPENDENCY MAP.
+
+The following list is the plain-text version of the paper's diagram
+of dependencies. A result may use anything to its left.
+
+ Theorem 5.2 (local transference)
+ depends on Section 6 (rare transfers, clean edges) and
+ Section 7 (ideal kernels).
+
+ Theorem 7.1 (ideal norm bound)
+ depends on Sections 7.3 (character frame) and 7.4 (symmetric
+ probes).
+
+ Theorem 8.1 (shift cancellation)
+ depends on Theorem 5.2 and its pairing corollary, and on the
+ Mellin and local-energy input of Section 8.5.
+
+ Theorem 9.1 (Type II)
+ depends on Theorem 8.1.
+
+ Proposition 10.1 (candidate mass)
+ depends on Section 4 only (prime number theorem).
+
+ Proposition 10.2 (Type I)
+ depends on Section 4.1 (Siegel-Walfitz and large sieve).
+
+ Lemma 10.1 (proxy discrepancy)
+ depends on Lemma 4.5 (block sieve) and Theorem 4.4 (Siegel-
+ Walfitz).
+
+ Lemma 10.2 (rough densities)
+ depends on Lemma 4.5 and the prime number theorem.
+
+ Sections 10.8 and 10.9 (removing unbalanced and balanced
+ composites)
+ depend on Theorem 9.1 and Lemma 10.1.
+
+ Theorem B
+ depends on Propositions 10.1-10.2, Lemmas 10.1-10.2, and
+ Sections 10.8-10.9.
+
+ Theorem A
+ depends on Theorem B and Lemma 2.1.
+
+Section 3 (the shape of the proof) reads these in order. Section 13.1
+compresses the same chain into a single paragraph.
+
+
+14.3 A NOTE ON THE STYLE OF THIS FILE.
+
+Because the file is meant to be read without LaTeX, several conventions
+differ from a conventional paper.
+
+ - "e(t) = exp(2 pi i t)"; "L = log x"; "T = log L".
+ - "z << w" means |z| <= C w for an absolute C, occasionally for a
+ constant depending on fixed parameters; those parameters are
+ stated.
+ - "for large x" means "for all x >= x_0(<fixed parameters>)".
+ - "x^(1-o(1))" is defined in the header.
+ - A display's equation number, e.g. (10.23), is meant to be cited
+ only from later in this file. Section 13 has the index of
+ where each hypothesis is actually consumed.