Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Protected set distortion
A finite trace-to-measure inequality
There are absolute constants C,Q0>0 with the following property.
Let Q≥Q0 be an integer, and install one forbidden residue at
each modulus in an arbitrary set D⊆[1,Q] of distinct
moduli. Let S be the full periodic survivor set and
δ=μ(S),α=∣S∩I∣/Q,
where I is any interval of Q consecutive integers. Set
ε(Q)=ClogQ(loglogQ)3.
If α>ε(Q), then
δ≥(α−ε(Q))exp{−α−ε(Q)ClogQ}.(1)
In particular, if α≥2ε(Q), then
δ≥exp(−C′logQ/α).(2)
These are finite density bounds, not logarithmic-density existence
theorems. On I=[Q,2Q), all installed congruences are active under
the original rule, so no activation discrepancy is hidden in (1).
If modulus 1 is installed, then S is empty and the hypotheses
requiring positive α are false; hence it may be omitted below.
Checked distortion inputs
The BBMST digest
was read first. The following statements and their proofs were checked
in the full source:
Section 2.2, Lemmas 2.1, 3.3, 3.5, Theorem 3.2, and the Jensen step in
the proof of Theorem 3.1. We use their prime-stage distorted measures
with parameters dp∈[0,1/2], denoting the final measure by
P. Define
ν(m)=p∣m∏(1−dp)−1,Δ=log+(dP/dμ).
The needed conclusions are:
Later prime stages preserve all previously exposed coordinate
marginals. Setting a stage parameter to zero leaves its measure
unchanged.
The final probability of the forbidden set introduced at prime
p is at most Mp(2)/(4dp(1−dp)), where
Mp(2)≤(p−1)21ℓ<p∏(1+(1−dℓ)(ℓ−1)23ℓ−1).(3)
Distinctness of the original moduli is used in this estimate.
The mean positive log distortion satisfies
EPΔ≤2q∈D∑qν(q).(4)
If an event R has final probability b>0, Jensen's inequality
gives
μ(R)≥bexp{−EPΔ/b}.(5)
We will preserve the actual union of the small-prime forbidden sets,
rather than bound it by their reciprocal sum.
An adjustable prime cutoff
Fix a sufficiently large y, and choose
dp=0(p≤y),dp=2logplogy(p>y).(6)
These are allowed parameters. Elementary prime counting and partial
summation show, uniformly in y,
p>y∑pdp=2logyp>y∑plogp1=O(1).(7)
Thus ν(p)−1≤2dp and
∏p(1+(ν(p)−1)/p)=O(1), uniformly in y.
If g is the nonnegative squarefree-supported multiplicative
function with g(p)=ν(p)−1, then ν=1∗g. It follows that
q≤Q∑qν(q)=m≤Q∑mg(m)H⌊Q/m⌋≪HQ.(8)
The logarithm of the product in (3) is at most
3ℓ<p∑ℓ1+Oℓ∑ℓ−2+ℓ<p∑ℓdℓ≤3loglogp+O(1).
Here we used the elementary Euler-product estimates already recorded
in coprime entropy. Consequently
Mp(2)≪(logp)3/p2. The total final forbidden probability
at primes greater than y is therefore at most
ηy≪logy1p>y∑p2(logp)4≪y(logy)2.(9)
The last step is partial summation with π(t)≪t/logt.
Let Sy be the survivor set using the installed moduli all of
whose prime factors are at most y, and put
σy=μ(Sy). Equations (6) and marginal preservation give
P(Sy)=σy,P(S)≥σy−ηy.
Combining (4), (5), and (8), for
t=σy−C1(logy)2/y>0, yields
δ≥texp(−C2logQ/t).(10)
The function t↦te−K/t is increasing, which justifies
using a lower bound for the final surviving probability.
Reading the small-prime measure from the integer interval
Put
M=exp(4π(y)logQ).
The subsystem with y-smooth moduli at most M has a period P
satisfying
P∣p≤y∏p⌊logpM⌋,logP≤π(y)logM=41logQ.
Its survivor set Sy,M contains S. Periodic counting on the
interval I, uniformly in its starting point, gives
μ(Sy,M)≥α−Q−3/4.(11)
The reciprocal sum of all y-smooth integers greater than M
obeys
m>MP+(m)≤y∑m1≪(logy)exp(−logM/logy).(12)
Indeed, Rankin's inequality with θ=1/logy gives the upper
bound M−θ∏p≤y(1−p−1+θ)−1.
For y large enough that θ≤1/4, comparison with
∏p≤y(1−1/p)−1 shows this product is O(logy):
the first-power logarithmic difference is bounded by
eθ∑p≤y(logp)/p=O(1), and the higher powers
are bounded by an absolutely convergent series.
The union bound for the omitted smooth moduli and (11)--(12) imply
σy≥α−Q−3/4−C3(logy)exp{−4π(y)logylogQ}.(13)
Finally set L=loglogQ and y=logQ/(A0L), with a large
absolute A0. Chebyshev's bound π(y)≤Cπy/logy
makes the exponent in (13) at most −4L when
A0≥16Cπ. Its error is then
Q−3/4+O(L/(logQ)4). Meanwhile (9) is
O(L3/logQ). Substitute into (10) to prove (1).
For (2), use α−ε≥α/2 and absorb the
prefactor by αlog(2/α)=O(1).
A smaller error using quasipolynomial equidistribution
for an absolute c>0 and sufficiently large Q, leaving the
constant C in the exponent of (1) absolute. In particular (2)
holds whenever α≥2ε(Q) with this smaller error.
This improvement uses Bazzi's theorem through the linked interval
result; the earlier logarithmic error has the elementary smooth-period
proof above.
Let A be the interval theorem's constant and choose
v=(2AlogQ)1/3,M=ev,y=ev.
The interval of length Q is long enough for that theorem with
largest modulus M, since exp(A(logM)3)=Q1/2.
Thus (11) is replaced by
μ(Sy,M)≥α−O(e−2v). The same smooth-tail
estimate (12) and distortion loss (9) give, respectively,
σy≥α−O(e−2v+ve−v),ηy=O(ve−v).
For large Q their total error is at most (14), after reducing
c. Equation (10) proves the improved assertion.
Limitation
For fixed positive α, (2) allows the full survivor density
to go to zero as a power of the largest modulus. It neither bounds
the incremental Haar mass of arbitrary first-kill cells in terms of
their logarithmic trace nor proves the required tail continuity.
The sparse range below (14) is not treated by these estimates.