Wiki
Wiki

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

Updated

Transversal prime groups


Proved uniform estimate

Let P1,…,PrP_1,\ldots,P_r be disjoint finite sets of primes, with ∑p∈Pj1/p≤c\sum_{p\in P_j}1/p\le c for a fixed cc. Assign one residue bpb_p to each prime. For every product qq choosing one prime from each group, give qq the residue induced by the bpb_p via CRT. Let BB be the union of their delayed classes, activated only at n≥qn\ge q.

There is a function gc(r)=Oc(1/r)g_c(r)=O_c(1/r) such that, for every positive integer NN,

∣B∩(N,2N]∣≤gc(r)N.(1)|B\cap(N,2N]|\le g_c(r)N. \tag{1}

The estimate is uniform in the prime groups and all their residue choices. In particular these coherent high-rank product families cannot have a fixed positive normalized harmonic deletion while r→∞r\to\infty, regardless of the sizes of the quotients n/qn/q.

This controls the actual trace for the family underlying the divisor-face capacity obstruction. It shows why feasible abstract face weights need not be realizable as first-kill harmonic masses.

Proof

Put η=e−2c\eta=e^{-2c}, C=2/ηC=2/\eta, and z=(2N)C/rz=(2N)^{C/r}. For each jj, let Fj(n)F_j(n) indicate avoidance of the prime classes in PjP_j with p≤zp\le z, and set

pj=∏p∈Pjp≤z(1−1/p),M(n)=∑jFj(n),m=∑jpj.p_j=\prod_{\substack{p\in P_j\\p\le z}}(1-1/p), \qquad M(n)=\sum_jF_j(n),\qquad m=\sum_jp_j.

Since log⁡(1−1/p)≥−2/p\log(1-1/p)\ge-2/p, we have pj≥ηp_j\ge\eta and m≥ηrm\ge\eta r.

Take rr sufficiently large in terms of cc, and let kk be the largest even integer at most r/(2C)=ηr/4r/(2C)=\eta r/4. Thus k≥2k\ge2 and zk≤2Nz^k\le\sqrt{2N}. For one group, or the union of any two groups, Bonferroni's inequalities give a uniform comparison between its avoidance probability on (N,2N](N,2N] and its Haar avoidance probability, with error at most

ϵr(N)=(2c)kk!+2N.(2)\epsilon_r(N)=\frac{(2c)^k}{k!}+\sqrt{\frac2N}. \tag{2}

To verify the error directly, compare the even inclusion--exclusion partial sum through order kk and the odd sum through order k−1k-1. Each congruence intersection involved has a squarefree modulus at most zk≤2Nz^k\le\sqrt{2N}. There is at most one term for each such modulus, because each prime has a single fixed residue. The total normalized counting error is therefore at most 2N/N\sqrt{2N}/N. The Haar gap between the two partial sums is the degree-kk elementary symmetric sum of the prime reciprocals, at most (2c)k/k!(2c)^k/k!. This proves (2).

Haar independence between disjoint prime groups gives EHaarFjFℓ=pjpℓ\mathbb E_{\rm Haar}F_jF_\ell=p_jp_\ell for j≠ℓj\ne\ell. Using (2) for all one- and two-group expectations, with averages over I=(N,2N]I=(N,2N], yields

EI(M−m)2≤r/4+3r2ϵr(N).\mathbb E_I(M-m)^2\le r/4+3r^2\epsilon_r(N).

Consequently

Pr⁡I(M<ηr/2)≤η−2(1/r+12ϵr(N)).(3)\Pr_I(M<\eta r/2) \le\eta^{-2}\bigl(1/r+12\epsilon_r(N)\bigr). \tag{3}

If n∈B∩In\in B\cap I, choose an active product q≤nq\le n witnessing it. Every group counted by M(n)M(n) must supply a prime greater than zz to this product. If M(n)≥ηr/2M(n)\ge\eta r/2, then

q>zM(n)≥zηr/2=2N≥n,q>z^{M(n)}\ge z^{\eta r/2}=2N\ge n,

a contradiction. Thus every actual deletion lies in the event in (3). If B∩IB\cap I is nonempty, its witness satisfies 2N≥q≥2r2N\ge q\ge2^r, so 2/N≤21−r/2\sqrt{2/N}\le2^{1-r/2}. We may therefore take

gc(r)=η−2(1/r+12(2c)k/k!+12⋅21−r/2)=Oc(1/r).g_c(r)=\eta^{-2}\left( 1/r+12(2c)^k/k!+12\cdot2^{1-r/2}\right)=O_c(1/r).

For the finitely many smaller rr, set gc(r)=1g_c(r)=1. This proves (1). Summing (1) over dyadic intervals, and using 1/n≤1/N1/n\le1/N on each, gives the asserted vanishing normalized harmonic bound as r→∞r\to\infty.

Removing the bound on group reciprocal sums

For these same complete transversal families, a stronger result follows from the fundamental lemma of sieve theory. Define

uj=∏p∈Pj(1−1/p),μ=∑juj.u_j=\prod_{p\in P_j}(1-1/p),\qquad \mu=\sum_ju_j.

Uniformly over finite disjoint prime groups and their coherent residues,

sup⁡X≥1∣B∩[1,X]∣X≪1μas μ→∞.(4)\sup_{X\ge1}\frac{|B\cap[1,X]|}{X}\ll\frac1\mu \quad\text{as }\mu\to\infty. \tag{4}

External input, checked. Koukoulopoulos, The Distribution of Prime Numbers, Theorem 19.1, printed p. 195 (PDF page 206), supplies upper and lower sieve weights of absolute value at most one, supported on squarefree d≤Dd\le D, with relative Euler-product error O(s−s/2)O(s^{-s/2}), where s=log⁡D/log⁡zs=\log D/\log z is sufficiently large. For any selected prime set and one forbidden residue per prime, its dimension hypothesis holds with absolute parameters: take ν(p)=1\nu(p)=1, κ=1\kappa=1, and an absolute CC in Axiom 2, as explained on printed p. 187 (PDF page 198). Both passages were checked in the author-hosted full text. No supplied source file was altered.

Here is the application, including the interval error. On (N,2N](N,2N] take z=(2N)2/μz=(2N)^{2/\mu}, D=ND=\sqrt N, and define Fj,pj,m,MF_j,p_j,m,M as in the elementary proof. Then m≥μm\ge\mu. For a single group or two groups together, each modulus in a sieve-weight sum prescribes one CRT class, with normalized counting error at most 1/N1/N. There are at most DD such moduli. The pointwise sieve inequalities apply to any vector of prime hits, by representing that vector by a squarefree integer. Thus the fundamental lemma gives

∣EIFj−pj∣≤ϵpj+R,∣EIFjFℓ−pjpℓ∣≤ϵpjpℓ+R,|\mathbb E_I F_j-p_j|\le\epsilon p_j+R, \qquad |\mathbb E_I F_jF_\ell-p_jp_\ell| \le\epsilon p_jp_\ell+R,

where R=N−1/2R=N^{-1/2} and ϵ≪s−s/2\epsilon\ll s^{-s/2}, with absolute constants. For N≥2N\ge2, s≥μ/8s\ge\mu/8. If the interval contains a deleted point, N≥2r−1N\ge2^{r-1} and r≥μr\ge\mu, so all size hypotheses hold when μ\mu is sufficiently large.

Expansion of the centered second moment now gives

EI(M−m)2≤m+4ϵm2+3r2R.\mathbb E_I(M-m)^2\le m+4\epsilon m^2+3r^2R.

An active certificate requires M<μ/2M<\mu/2, since otherwise its prime product exceeds zμ/2=2Nz^{\mu/2}=2N. This event is contained in {∣M−m∣>m/2}\{|M-m|>m/2\}. Its probability is at most

4μ+16ϵ+12r2μ2N≪1μ.\frac4\mu+16\epsilon+\frac{12r^2}{\mu^2\sqrt N} \ll\frac1\mu.

The last term is exponentially small in μ\mu, using N≥2r−1N\ge2^{r-1} and r≥μr\ge\mu. Dyadic summation proves (4), and partial summation gives the same bound for HB(X)/H⌊X⌋H_B(X)/H_{\lfloor X\rfloor}.

In particular a small periodic footprint always forces small deletion for one complete transversal family. Write

β=∏j(1−uj),L=log⁡(1/β).\beta=\prod_j(1-u_j),\qquad L=\log(1/\beta).

If some uj≥1−1/Lu_j\ge1-1/L, every deletion lies in that group's delayed prime union, whose count is at most X∑p∈Pj1/p≤−Xlog⁡uj≤2X/LX\sum_{p\in P_j}1/p\le-X\log u_j\le2X/L for L≥2L\ge2. Otherwise the increasing function −log⁡(1−u)/u-\log(1-u)/u is at most 2log⁡L2\log L on the possible range, so L≤2μlog⁡LL\le2\mu\log L. Applying (4) yields

sup⁡X≥1HB(X)H⌊X⌋≪log⁡log⁡(1/β)log⁡(1/β)(β↓0).\sup_{X\ge1}\frac{H_B(X)}{H_{\lfloor X\rfloor}} \ll\frac{\log\log(1/\beta)}{\log(1/\beta)} \qquad(\beta\downarrow0).

The empty-family case β=0\beta=0 is immediate.

Limitation

The proof uses one consistent prime residue bpb_p throughout all product classes. Arbitrary singleton residues modulo the products need not have this consistency. Nor has a general small-footprint family been reduced to complete transversal families with controlled total error. These are specific missing steps, not consequences of this estimate.