Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Parent refinement overlap
The overlapping preparation produces
many protected points in parents of very small conditional survivor
measure. The following theorem rules out refining these parents with
bounded overlap, at all cutoffs, not only polynomial-length epochs.
The later weighted estimates improve
its error and remove overlap restrictions up to a quantified cutoff.
The last section below also treats arbitrary overlap at every cutoff
when the assigned parent leaves only a small prime-factor rank.
The unrestricted case remains open.
Statement
Let P={p:3≤p≤z},
λ=∑p∈P1/p, and, for large λ, put
r=⌊2λ−6λ⌋,b=⌈2λ+2λ⌉,s=b−r=O(λ).
Write
R(x)=#{p∈P:xmodp∈{0,1}},T={R≤b}.
Let S be the full survivor set of any finite preparation with
squarefree moduli supported on P, prescribing only digits
0 and 1 at those primes. A parent fixes such digits at exactly r
primes. Append classes Cq=[aq]q, 0≤aq<q, with
globally distinct moduli, each refining one chosen assigned parent.
Parents here are geometric cylinders, not potentially repeated labels.
Assume the classes assigned to each parent have pointwise multiplicity
at most L on T. Let U=⋃qCq,
τ=μ(S∩U), and let B be the appended union activated
at n≥q. With c0=2log2−1>0, uniformly for X≥2,
All constants are absolute. In particular, τ≤e−cλ
and L=eo(λ) force the left side to tend to zero uniformly
in X. This includes one refinement per parent, or disjoint
refinements within each parent. The protected set G in the earlier
preparation lies in S∩T, so (1) applies to its trace.
Let jq count the primes of P dividing q at
which aq has digit 0 or 1. Then jq≥r. Omit classes
with jq>b, which do not meet T. Independence at the primes
not dividing q gives the exact conditional probability
Use the proved elementary dimension-two upper sieve,
and choose an absolute B>B2+2, where B2 is its length
exponent. For Y≤zs+B, sieve at w=Y1/(s+B).
A counted quotient has at most s successes at primes at most
w not dividing q. Group by their exact set J and their
two possible digits. Their product d is at most ws;
the remaining quotient interval has length Y/d≥wB, so the
upper sieve applies to the other primes. Summing its bound gives
when w≥3. The trivial bound Nq(Y)≤Y handles the
remaining range. To see the factor in (5), the summand for a fixed
success set is
(Y/d)2∣J∣∏p≤w,p∤qd(1−2/p).
Factor out the complete avoiding product and use (2),
∏3≤p≤w(1−2/p)≪(logw)−2, and
logw=logY/(s+B).
For Y≥zs+B, instead sieve at w=z, grouping by at
most b−jq successes. The same divisor sum is now exactly (3),
giving
Nq(Y)≤CθqY.(6)
Partial summation proves (4): the short-range contribution is bounded
using ∫0∞min(1,A/u2)du=2A, with
A=C(s+B)2PqFs; the long range contributes
Cθqlog(2W). No assumption is made about extra prime
factors or prime powers of q.
Distinctness controls the remaining arithmetic error
Let
βr=Pr⎩⎨⎧p∈P∑Bernoulli(1/p)≥r⎭⎬⎫.
Chernoff's inequality at parameter log2 gives
βr≤2−rp∈P∏(1+1/p)≤exp{−c0λ+O(λ)}.(7)
Every appended modulus has at least r prime factors in
P. Distinctness and the exact multiples inequality from
basic reductions
therefore imply
q≤X∑q1≤βrH⌊X⌋.(8)
Put σX=∑q≤Xθq/q. Activation represents
every hit as aq+qt with t≥1. Since
1/(aq+qt)≤1/(qt), (4) and the union bound give
is uniform. Indeed Pq is bounded by a constant times
∏p∣q(1−1/p)−2. Split those primes at
log(3q). The smaller-prime product is
O((loglog(3q))2); the logarithm of the remaining product
is O(ω(q)/log(3q))=O(1).
Write H=H⌊X⌋. If H≤e2λ, (8)
and (10) bound the last factor in (9) by O((1+λ)βr).
If H>e2λ, use Vz=e−2λ+O(1),
θq≥VzPq, Cauchy--Schwarz, and (8) to get
H1q≤X∑qPq≪eλHσXβr≤CσXβr.
When σX≤1, these estimates prove
HHT∩B(X)≤CσX+exp{−c0λ/2+O(λlog(2λ))}.(11)
When σX>1, the same assertion follows from the trivial
bound one.
Comparing the low-count region to actual survivors
First discard any appended class with S∩Cq=∅;
this changes no hits on S. Apply (11) to this retained family,
and henceforth let σX denote its raw mass sum.
For the union UX of the remaining
classes with q≤X, we claim
μ(T∩UX)≤Fsμ(S∩UX).(12)
Take x∈T∩Cq. Let J be its success primes in
P not dividing q. There are at most s of them.
Change all their digits to arbitrary nonsuccess digits. Every resulting
point still lies in Cq, and now has no success prime outside
q. It must survive the preparation: a matching preparatory class
would use only primes dividing q, hence would contain all of
Cq, contrary to the discard step.
Thus the entire nonsuccess fiber at J, with all other coordinates
fixed, belongs to E=S∩UX. For each fixed J, let FJ
be the set of other-coordinate configurations whose full nonsuccess
fiber lies in E. Expanding these fibers to success digits has
measure
μ(FJ)p∈J∏p2≤μ(E)p∈J∏p−22.
Every point of T∩UX occurs in one such expanded fiber.
Summing over ∣J∣≤s proves (12). All sets here are finite
unions of cylinders; no infinite-fiber measurability assertion is needed.
Finally a point of T belongs to at most (rb) parents:
choose their r primes among its at most b success primes,
after which the digits are forced. The in-parent overlap assumption
therefore gives
σX≤L(rb)μ(T∩UX)≤L(rb)Fsτ.
Both (rb) and Fs are
exp{O(λlog(2λ))}. Substitute in (11),
and note that the retained union covers every point counted on the
left of (1). This proves the theorem.
Remaining gap
The progression estimate, raw-mass bound (11), and survivor comparison
(12) hold without a multiplicity hypothesis. Only the final passage
from σX=∑qμ(T∩Cq) to union measure needs it.
Without the scale or residual-rank restrictions proved in the later
sections, no estimate removing that overlap loss has been proved. Nor has a
construction with enough overlapping refinements and protected active
trace been obtained. Therefore this theorem excludes a substantial
subclass of the proposed construction, not a general counterexample
or a general density theorem.
Arbitrary overlap with bounded residual rank
There is a second all-scale theorem, which replaces the overlap
hypothesis by a rank hypothesis. Assign each appended class to one
geometric parent C=[a]d, and suppose
q=dm,Ω(m)≤K.
The parent modulus is a squarefree product of exactly r old
primes, and its digits are 0 or 1, as above. Uniformly in X≥2,
without any overlap bound,
In particular K=o(λ) and τ≤e−cλ,
for fixed c>0, exclude a protected harmonic anomaly at every
cutoff. Rank counts prime factors with multiplicity; no restriction
on the sizes or identities of the extra primes is imposed.
Retain only classes with q≤X, with jq≤b, and
with S∩Cq=∅. Partition the counted active
hits disjointly among these classes. Within one assigned parent write
qi=dmi and let ci be the assigned harmonic mass divided
by H=H⌊X⌋. Put
α=i∑ci,θ0=VzPd.
First suppose H≥e2λ.
For each divisor e of some mi, and v(mode), let
Se,v=i:e∣mi(aqi−a)/d≡v(mode)∑ci.
The assigned points in this sum belong to the face [a+dv]de.
They also satisfy n≥qi≥de, so the face is active.
It still prescribes at least the r parent successes. Apply the
progression estimate (4) to this face. Since
Pde≤3KPd,θde≤VzPdeFs,HPd≪VzPd=θ0,
it gives
Se,v≤deAθ0,A≤3Kexp{O(λlog(2λ))}.(14)
If the face forces more than b successes it contributes zero
and needs no sieve estimate. The last displayed bound uses
Vz=e−2λ+O(1) and Pd≥1.
Every retained class satisfies θqi≥θ0.
Every nonempty compatible pair intersection has conditional
T-probability at most B0θ0, where
B0≤32KFs.
Indeed its modulus is d[mi,mj], adding at most 2K
prime factors to the parent, and it forces at least r
successes. An intersection forcing more than b contributes zero.
On the profinite probability space put
Z=i∑dmici1T∩Cqi.
Then EZ≥θ0α. Expanding the second
moment, using CRT, and writing (mi,mj)=∑e∣(mi,mj)φ(e),
gives the upper bound
In the first inequality it is harmless to include pairs compatible
modulo e but incompatible modulo their full gcd. The second
inequality is (14), and the last uses
∑e∣mφ(e)/e≤d(m)≤2Ω(m).
Cauchy--Schwarz on the support T∩UC now gives
α≤54Kexp{O(λlog(2λ))}μ(T∩UC),
where UC is the union assigned to that parent.
Each point of T lies in at most (rb) geometric
parents. Sum the preceding bound over parents and apply (12):
C∑μ(T∩UC)≤(rb)μ(T∩UX)≤(rb)Fsτ.
Both new factors are exp{O(λlog(2λ))}.
This proves the first term of (13) in the large-cutoff range.
For H<e2λ, the overlap-free bound (3) of
weighted divisibility moments
is at most exp{−c0λ+O(λlog(2λ))},
since κ=2+c0. This proves (13) for the remaining cutoffs.
Every counting step retained original activation, and distinctness
enters the weighted cutoff for the small-cutoff range. Arbitrary
unbounded residual rank and arbitrary overlap together are not covered.