Wiki
Wiki

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

Updated

Coherent power cutoff


The estimate here controls conditioned first-kill increments, uniformly in the earlier period, rather than only small full footprints. It handles arbitrarily many modulus scales below a fixed power cutoff. Coherence is essential to the proof. The original coherent problem is reduced to unbounded but subpower quotients, not resolved.

A uniform selected-cell estimate: proved

Let DD be a finite set of moduli, with common center α∈Z^\alpha\in\widehat{\mathbb Z}. Put

Cq=α+qZ^,Fq=Cq∖⋃r∈Dr<qCr,eq=μ(Fq).C_q=\alpha+q\widehat{\mathbb Z},\qquad F_q=C_q\setminus\bigcup_{\substack{r\in D\\r<q}}C_r, \qquad e_q=\mu(F_q).

For any J⊆DJ\subseteq D, write τ=∑q∈Jeq\tau=\sum_{q\in J}e_q. There is an absolute constant CC such that, for 0<η≤1/20<\eta\le1/2 and any interval II of H≥2H\ge2 consecutive integers,

1H#{n∈I:n∈Fq for some q∈J, q≤H1−η}≤fη(τ):=min⁡(1,Cηlog⁡(2/τ)).(1)\frac1H\#\{n\in I:n\in F_q\text{ for some }q\in J, \ q\le H^{1-\eta}\} \le f_\eta(\tau):= \min\left(1,\frac{C}{\eta\log(2/\tau)}\right). \tag{1}

Set fη(0)=0f_\eta(0)=0. The bound is uniform in the center, the location of II, the number of moduli, and the choice of cells.

The first-divisor and smooth-factor decomposition is adapted from Erdős--Hall--Tenenbaum, On the densities of sets of multiples, Section 2, equations (2.7)--(2.8). Those passages were checked in the author-hosted paper. The proof below supplies the needed uniform translated smooth-part estimate; it never assumes ∣n−α∣≤H|n-\alpha|\le H.

Two elementary sieve ingredients

For y≥2y\ge2 and any real interval KK of length M≥y5M\ge y^5,

#{h∈K∩Z:h≠0, p∤h (p≤y)}≪Mlog⁡y.(2)\#\{h\in K\cap\mathbb Z:h\ne0,\ p\nmid h\ (p\le y)\} \ll\frac M{\log y}. \tag{2}

This includes negative intervals. Here is a proof to fix the uniformity. Choose Selberg weights supported on squarefree d≤yd\le y, with λ1=1\lambda_1=1. Squaring their divisor sum majorizes the rough-integer indicator, and progression counting gives the upper bound

M∑d,e≤yλdλe[d,e]+O((∑d≤y∣λd∣)2).M\sum_{d,e\le y}\frac{\lambda_d\lambda_e}{[d,e]} +O\left(\left(\sum_{d\le y}|\lambda_d|\right)^2\right).

Write G(y)=∑d≤yμ2(d)/φ(d)G(y)=\sum_{d\le y}\mu^2(d)/\varphi(d). The quadratic form diagonalizes as

∑rφ(r)(∑r∣dλd/d)2.\sum_r\varphi(r)\left(\sum_{r\mid d}\lambda_d/d\right)^2.

Its minimum subject to λ1=1\lambda_1=1 is 1/G(y)1/G(y), attained by

λd=μ(d)dφ(d)G(y)∑m≤y/d(m,d)=1μ2(m)φ(m).\lambda_d=\frac{\mu(d)d}{\varphi(d)G(y)} \sum_{\substack{m\le y/d\\(m,d)=1}}\frac{\mu^2(m)}{\varphi(m)}.

Indeed Möbius inversion turns the constraint into ∑rμ(r)∑r∣dλd/d=1\sum_r\mu(r)\sum_{r\mid d}\lambda_d/d=1, and Cauchy--Schwarz gives this minimum and optimizer. In particular ∣λd∣≤d|\lambda_d|\le d. Also G(y)≫log⁡yG(y)\gg\log y: squarefree integers have counting function at least (2−ζ(2))⌊x⌋(2-\zeta(2))\lfloor x\rfloor, by the union bound over square divisors, and φ(d)≤d\varphi(d)\le d. Thus the bound is O(M/log⁡y+y4)O(M/\log y+y^4), proving (2).

We also use

∑p≤ylog⁡pp−1≪log⁡y,ZH:=∏p≤H(1−1/p)−1≪log⁡H.(3)\sum_{p\le y}\frac{\log p}{p-1}\ll\log y, \qquad Z_H:=\prod_{p\le H}(1-1/p)^{-1}\ll\log H. \tag{3}

The first follows by partial summation from Chebyshev's elementary ∑p≤ylog⁡p≪y\sum_{p\le y}\log p\ll y: primes in (m,2m](m,2m] divide (2mm)\binom{2m}{m}, and dyadic summation proves that estimate. The Euler product bound is the passage immediately before equation (12) in the Davenport--Erdős 1951 full source, checked again for this application.

Uniform control of the shifted smooth part

Discard moduli above H1−ηH^{1-\eta}, which does not change any retained first-kill cell, and choose an integer bb realizing the retained center residues. Fix

0<δ≤η/10,y=Hδ≥2.0<\delta\le\eta/10,\qquad y=H^\delta\ge2.

For p≤yp\le y, let kpk_p be minimal with pkp>Hη/4p^{k_p}>H^{\eta/4}. The proportion of n∈In\in I for which any pkpp^{k_p} divides n−bn-b is at most

Hδ−η/4+Hδ−1.H^{\delta-\eta/4}+H^{\delta-1}.

Outside this set, n≠bn\ne b and the logarithm of the yy-smooth part of ∣n−b∣|n-b| is

T(n)=∑p≤y∑1≤k<kp(log⁡p)1pk∣n−b.T(n)=\sum_{p\le y}\sum_{1\le k<k_p} (\log p)\mathbf1_{p^k\mid n-b}.

Its average over II is at most

∑p≤ylog⁡pp−1+1H∑p≤y(kp−1)log⁡p≪δlog⁡H+ηHδ−1log⁡H.\sum_{p\le y}\frac{\log p}{p-1} +\frac1H\sum_{p\le y}(k_p-1)\log p \ll\delta\log H+\eta H^{\delta-1}\log H.

Markov's inequality therefore shows that the smooth part is at most Hη/2H^{\eta/2}, except on a proportion

≪δ/η+H−3η/20.(4)\ll\delta/\eta+H^{-3\eta/20}. \tag{4}

All counting here is in translated progressions, so the size of bb does not enter the estimates.

Charging good points to their actual first-kill cells

For a remaining point first killed by qq, write

n−b=qsh,n-b=qsh,

where s>0s>0 is the entire yy-smooth part of (n−b)/q(n-b)/q and hh is possibly negative and yy-rough. Then s≤Hη/2s\le H^{\eta/2} and qs≤H1−η/2qs\le H^{1-\eta/2}. Moreover qq is the first DD-divisor of qsqs: any earlier divisor of qsqs would divide n−bn-b.

For each admissible ss, the quotient hh lies in an interval of length H/(qs)≥Hη/2≥y5H/(qs)\ge H^{\eta/2}\ge y^5. By (2), the number of good points in this cell is at most

CHlog⁡y∑P+(s)≤yfirst⁡D(qs)=q1qs.(5)\frac{CH}{\log y} \sum_{\substack{P^+(s)\le y\\\operatorname{first}_D(qs)=q}} \frac1{qs}. \tag{5}

Here P+(1)=1P^+(1)=1, and enlarging the sum by dropping its size restrictions only increases the bound.

The geometric valuation model on primes at most HH gives the exact identity

ZHeq=∑P+(m)≤Hfirst⁡D(m)=q1m.(6)Z_H e_q= \sum_{\substack{P^+(m)\le H\\\operatorname{first}_D(m)=q}}\frac1m. \tag{6}

Indeed coherence translates all full first-kill cells to those of the zero-residue system. Every integer in this smooth model has mass 1/(ZHm)1/(Z_Hm), and the relevant divisibility event has Haar probability eqe_q. Every admissible qsqs in (5) occurs in (6). Combining (3)--(6) and summing only the selected cells proves

NH≪τδ+δη+H−3η/20,(7)\frac NH\ll\frac\tau\delta+\frac\delta\eta+H^{-3\eta/20}, \tag{7}

where NN denotes the count on the left of (1).

Optimization with no hidden interval-length restriction

If Fq≠∅F_q\ne\varnothing, no earlier modulus divides qq. The atom qq in the geometric model on primes at most qq therefore shows

eq≥1qZq≥1q2,e_q\ge\frac1{qZ_q}\ge\frac1{q^2},

since Zq≤∏m=2q(1−1/m)−1=qZ_q\le\prod_{m=2}^q(1-1/m)^{-1}=q. If the counted set is nonempty, a selected q≤H1−ηq\le H^{1-\eta} consequently gives τ≥H−2(1−η)\tau\ge H^{-2(1-\eta)}.

Set L=log⁡(1/τ)L=\log(1/\tau). If L≥20/ηL\ge20/\eta, take δ=2/L\delta=2/L. Then δ≤η/10\delta\le\eta/10 and

y=H2/L≥e1/(1−η)>2.y=H^{2/L}\ge e^{1/(1-\eta)}>2.

All three terms in (7) are O(1/(ηL))O(1/(\eta L)): the first is Le−L/2Le^{-L}/2, and the last is at most exp⁡(−3ηL/(40(1−η)))\exp(-3\eta L/(40(1-\eta))). For smaller LL, the trivial bound suffices after enlarging the absolute constant. This proves (1).

Natural density with any fixed power delay

For every infinite coherent family and every 0<η≤1/20<\eta\le1/2, the set

Bη={n≥1:∃q≤n1−η, n≡α(modq)}B_\eta=\{n\ge1:\exists q\le n^{1-\eta},\ n\equiv\alpha\pmod q\}

has natural density β=μ(⋃qCq)\beta=\mu(\bigcup_q C_q), uniformly over the coherent center. Equivalently, every activation rule n≥q1+εn\ge q^{1+\varepsilon}, ε>0\varepsilon>0, has this conclusion. Exponents corresponding to η>1/2\eta>1/2 follow by squeezing between a fixed finite prefix and B1/2B_{1/2}.

To prove the assertion, let q(n)q(n) be the least full covering modulus. If some modulus is power-active at nn, so is q(n)q(n). The difference from a fixed finite power-delayed prefix is therefore contained in the tail first-kill cells with q(n)≤n1−ηq(n)\le n^{1-\eta}. Their total Haar mass tends to zero as the prefix increases. Apply (1) on [1,X][1,X], with selected tail cells and cutoff q≤X1−ηq\le X^{1-\eta}. This makes the omitted upper counting density uniformly small. Finite prefixes have their periodic densities, uniformly in the center, proving the claim.

For a finite family, the same argument with all cells selected gives

∣Bη∩[1,X]∣≤fη(β)X,HBη(X)≤fη(β)H⌊X⌋.|B_\eta\cap[1,X]|\le f_\eta(\beta)X, \qquad H_{B_\eta}(X)\le f_\eta(\beta)H_{\lfloor X\rfloor}.

The second inequality follows from the first by partial summation.

A new natural-density case for the original activation

Let PP be the primitive core of a coherent modulus family; deleting nonminimal multiples changes neither the full nor the delayed union. The original set with activation n≥qn\ge q has natural density β\beta if

lim⁡η↓0lim sup⁡X→∞∑q∈PX1−η<q≤X1q=0.(8)\lim_{\eta\downarrow0}\limsup_{X\to\infty} \sum_{\substack{q\in P\\X^{1-\eta}<q\le X}}\frac1q=0. \tag{8}

In particular,

∣P∩[1,t]∣≪t/log⁡t(9)|P\cap[1,t]|\ll t/\log t \tag{9}

suffices, with no bound on prime-factor rank.

Indeed, after a fixed prefix, the first kills with q≤X1−ηq\le X^{1-\eta} are bounded by (1). The remaining active classes contribute at most

X∑q∈PX1−η<q≤X1/qX\sum_{\substack{q\in P\\X^{1-\eta}<q\le X}}1/q

points up to XX. First let X→∞X\to\infty, then exhaust the prefix, and finally let η↓0\eta\downarrow0. Condition (8) proves finite-periodic natural approximation. For (9), partial summation bounds the reciprocal shell by O(log⁡(1/(1−η)))+O(1/log⁡X)O(\log(1/(1-\eta)))+O(1/\log X), establishing (8).

The remaining subpower-quotient layer

For the original coherent union BB, write

Eη=B∖Bη={n:n1−η<q(n)≤n}.E_\eta=B\setminus B_\eta =\{n:n^{1-\eta}<q(n)\le n\}.

Since every fixed BηB_\eta has density β\beta,

ld⁡‾(Eη)=ld⁡‾(B)−β(0<η≤1/2).\overline{\operatorname{ld}}(E_\eta) =\overline{\operatorname{ld}}(B)-\beta \qquad(0<\eta\le1/2).

Thus any excess persists in every arbitrarily thin power band next to q=nq=n. On the other hand, bounded-quotient first kills in a coherent family are already logarithmically null by the primitive-core argument. Any remaining excess must therefore occur at unbounded but subpower quotients n/q(n)n/q(n).

Neither primitive-core logarithmic nullity nor the estimate

HEη(X)≤η1−η∑q≤Xq∈Plog⁡qq+O(∑q≤Xq∈P1q)H_{E_\eta}(X) \le\frac{\eta}{1-\eta} \sum_{\substack{q\le X\\q\in P}}\frac{\log q}{q} +O\left(\sum_{\substack{q\le X\\q\in P}}\frac1q\right)

controls this layer after division by log⁡X\log X. No continuity of logarithmic density under the decreasing limit η↓0\eta\downarrow0 is available. The unrestricted coherent case remains open here.

A quotient-only natural estimate cannot close the gap

There are finite zero-residue systems with Haar footprint tending to zero but a fixed positive proportion of first kills at unbounded, subpower quotients. Thus the missing boundary layer requires a specifically logarithmic argument, not merely an improvement of (1) depending on the minimum quotient.

For an integer K≥2K\ge2, choose a finite prime pool P\mathcal P with p≥Kp\ge K for every p∈Pp\in\mathcal P and ∑p∈P1/p≥1\sum_{p\in\mathcal P}1/p\ge1. Set

L=2max⁡P,M=L/K,D=[N,NM]∩N,X=NL.L=2\max\mathcal P,\qquad M=L/K,\qquad D=[N,NM]\cap\mathbb N,\qquad X=NL.

Use the zero class at each modulus in DD. If X/2≤n≤XX/2\le n\le X and p∈Pp\in\mathcal P divides nn, then

N≤n/p≤NM,n/(n/p)=p≥K.N\le n/p\le NM,\qquad n/(n/p)=p\ge K.

The least DD-divisor q(n)q(n) is no larger than n/pn/p and no smaller than NN. Its quotient therefore lies in [K,L][K,L]. By finite periodic counting, for fixed P\mathcal P these points occupy an asymptotic fraction of [1,X][1,X] at least

12(1−∏p∈P(1−1/p))≥1−e−12.\frac12\left(1-\prod_{p\in\mathcal P}(1-1/p)\right) \ge\frac{1-e^{-1}}2.

On the other hand, for fixed MM the Haar footprint of DD tends to zero as N→∞N\to\infty: cover DD by finitely many dyadic modulus windows and apply the proved window bound. Replacing DD by its primitive core preserves the full union and the least divisor at each point.

For each K→∞K\to\infty, choose NN sufficiently large that the footprint is at most 1/K1/K, the displayed counting proportion is at least (1−e−1)/4(1-e^{-1})/4, and log⁡L/log⁡N≤1/K\log L/\log N\le1/K. All choices are finite and can be made by taking the least integer satisfying these conditions. The first-kill quotients now tend to infinity but satisfy log⁡(n/q(n))/log⁡n→0\log(n/q(n))/\log n\to0 uniformly on the counted points. All moduli are distinct and all hits are active.

This is not a logarithmic-density anomaly: these are zero-residue systems, for which the exact harmonic comparison is already proved. The final interval supplies only bounded unnormalized harmonic mass.

An unconditioned finite estimate would suffice: proved reduction

The following reduction removes conditioning on earlier first-kill cells from a possible logarithmic estimate. The finite estimate assumed here is unproved; neither the power-cutoff theorem nor the one-block estimate establishes it.

Suppose there is a nondecreasing function f:[0,1]→[0,1]f:[0,1]\to[0,1], with f(t)→0f(t)\to0 as t↓0t\downarrow0 and f(0)=0f(0)=0, such that every finite coherent family DD, every center α\alpha, and every X≥2X\ge2 satisfy

HBD,α(X)≤f(βD)H⌊X⌋,βD=μ(⋃q∈D(α+qZ^)).(10)H_{B_{D,\alpha}}(X) \le f(\beta_D)H_{\lfloor X\rfloor}, \qquad \beta_D=\mu\left(\bigcup_{q\in D} (\alpha+q\widehat{\mathbb Z})\right). \tag{10}

Here BD,αB_{D,\alpha} uses the original activation n≥qn\ge q. Monotonicity of ff entails no loss: replace any proposed bound tending to zero at zero by its nondecreasing envelope, and use the trivial bound one where necessary.

Conditional conclusion. If (10) holds, every infinite coherent family has finite-periodic approximation in upper logarithmic density, and its delayed union has logarithmic density equal to its full Haar measure. The reduction incurs no constants depending on the earlier period in its final tail bound.

Proof. Let UU be the full union, BB its delayed integer union, and β=μ(U)\beta=\mu(U). Fix a finite prefix D0D_0, with full union U0U_0, delayed union B0B_0, Haar measure β0\beta_0, and period L=lcm⁡(D0)L=\operatorname{lcm}(D_0). Put τ=β−β0\tau=\beta-\beta_0. Except for finitely many integers, B∖B0B\setminus B_0 lies in the residues r(modL)r\pmod L that avoid U0U_0. Normalize 0≤r<L0\le r<L and fix one such surviving residue.

Write n=r+Lmn=r+Lm. A modulus qq can meet this residue precisely when

α≡r(modgq),gq=(q,L).\alpha\equiv r\pmod{g_q},\qquad g_q=(q,L).

For each compatible qq, its pullback is one congruence in mm modulo dq=q/gqd_q=q/g_q, because (L/gq,dq)=1(L/g_q,d_q)=1. These pullback congruences are coherent. Indeed, for any finite compatible collection qjq_j, put Q=lcm⁡jqjQ=\operatorname{lcm}_j q_j. Primewise comparison of valuations gives

(Q,L)=lcm⁡j(qj,L).(Q,L)=\operatorname{lcm}_j(q_j,L).

Individual compatibility therefore implies α≡r(mod(Q,L))\alpha\equiv r\pmod{(Q,L)}, so the congruence Lm+r≡α(modQ)Lm+r\equiv\alpha\pmod Q has an integer solution. Thus every finite collection of pullbacks has a common solution; compactness supplies a common center γr∈Z^\gamma_r\in\widehat{\mathbb Z}. This argument does not assume that α−r\alpha-r is divisible by LL in all profinite coordinates.

Collapse duplicate effective moduli dqd_q and let PrP_r be their primitive core. Every effective modulus has a divisor in PrP_r, since it has only finitely many positive divisors. Let WrW_r be the standard delayed union for PrP_r and center γr\gamma_r, and let

Vr={m≥1:r+Lm∈B}V_r=\{m\ge1:r+Lm\in B\}

be the actual projected deletion set. Taking the primitive core leaves the full projected union and its standard delayed union unchanged.

For each p∈Prp\in P_r, some original modulus qpq_p has effective modulus pp; hence qp=(qp,L)p≤Lpq_p=(q_p,L)p\le Lp. Consequently m≥pm\ge p makes r+Lm≥Lp≥qpr+Lm\ge Lp\ge q_p, proving Wr⊆VrW_r\subseteq V_r. Conversely, if m∈Vr∖Wrm\in V_r\setminus W_r, choose an active original witness qq, with effective modulus dd, and then a primitive p∣dp\mid d. The congruence m≡γr(modp)m\equiv\gamma_r\pmod p holds. Since m∉Wrm\notin W_r,

1≤m<p≤d≤q≤Lm+r≤L(m+1).(11)1\le m<p\le d\le q\le Lm+r\le L(m+1). \tag{11}

For each pp, at most one integer mm satisfies its congruence and 0<m<p0<m<p. For p>2Lp>2L, (11) also gives 1/m≤2L/p1/m\le2L/p. Therefore

HVr∖Wr(T)≤CL+2L∑p∈Prp≤L(T+1)1p=o(log⁡T).(12)H_{V_r\setminus W_r}(T) \le C_L+2L \sum_{\substack{p\in P_r\\p\le L(T+1)}}\frac1p =o(\log T). \tag{12}

The last equality uses the proved logarithmic nullity of primitive sets from structured residues. Thus the discrepancy caused by the changed activation is logarithmically null, despite the possibly large fixed period LL.

Let βr\beta_r be the Haar measure of the full projected union. The map m↦r+Lmm\mapsto r+Lm identifies normalized Haar measure on Z^\widehat{\mathbb Z} with conditional Haar measure on r+LZ^r+L\widehat{\mathbb Z}. Hence

1L∑r survivingβr=τ.(13)\frac1L\sum_{r\text{ surviving}}\beta_r=\tau. \tag{13}

For each finite cutoff TT, WrW_r agrees below TT with the delayed union of the finite family Pr∩[1,T]P_r\cap[1,T]. That finite family's Haar footprint is at most βr\beta_r. Applying (10) and monotonicity of ff proves

ld⁡‾(Wr)≤f(βr),ld⁡‾(Vr)≤f(βr),(14)\overline{\operatorname{ld}}(W_r)\le f(\beta_r), \qquad \overline{\operatorname{ld}}(V_r)\le f(\beta_r), \tag{14}

where the second bound follows from (12). This is the complete passage from the assumed finite estimate to the infinite projected family.

A fixed positive affine image E↦r+LEE\mapsto r+LE divides upper logarithmic density by LL: the difference between 1/(Lm+r)1/(Lm+r) and 1/(Lm)1/(Lm) is absolutely summable. Summing (14) over the finitely many surviving residues, and discarding the finitely many terms with m=0m=0, gives

ld⁡‾(B∖B0)≤1L∑r survivingf(βr).\overline{\operatorname{ld}}(B\setminus B_0) \le\frac1L\sum_{r\text{ surviving}} f(\beta_r).

For any 0<λ≤10<\lambda\le1, split this sum at βr=λ\beta_r=\lambda. Equation (13) shows that at most Lτ/λL\tau/\lambda residues have βr>λ\beta_r>\lambda. Since f≤1f\le1, it follows that

ld⁡‾(B∖B0)≤f(λ)+τ/λ.\overline{\operatorname{ld}}(B\setminus B_0) \le f(\lambda)+\tau/\lambda.

Taking λ=τ\lambda=\sqrt\tau when τ>0\tau>0 yields the period-independent bound

ld⁡‾(B∖B0)≤f(τ)+τ.(15)\overline{\operatorname{ld}}(B\setminus B_0) \le f(\sqrt\tau)+\sqrt\tau. \tag{15}

When τ=0\tau=0, every βr=0\beta_r=0, and (14) gives the same conclusion with right side zero. Exhausting the prefix makes τ→0\tau\to0. Thus the omitted logarithmic mass tends to zero, and finite periodicity gives ld⁡(B)=β\operatorname{ld}(B)=\beta. □\square

The primitive-root error in (12) may have constants depending on LL; they disappear before the prefix is exhausted because LL is fixed when logarithmic density is taken. The remaining finite estimate (10) must still be uniform over families and centers. No such estimate has been proved here.