Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Ordered coherent runs
This criterion measures how often the residue pattern changes as the modulus increases, rather than the number of its prime coordinates. It controls bounded-quotient first kills, not the full delayed union.
A uniform primitive-annulus lemma
Lemma. For every there is a constant such that every primitive set satisfies
Primitive means that no two distinct members divide one another. The constants are independent of and the location of the annulus.
For a finite prime set , write
The weighted smooth-antichain bound states that every primitive family of -smooth integers has reciprocal sum at most , where
Its product-measure proof is useful here: a geometric valuation splits as , where is Bernoulli with parameter . Write , with Bernoulli of parameter and fair, independently. Conditional on , a divisibility antichain becomes an antichain in a uniform Boolean cube of dimension . Sperner's bound and Chebyshev give (2).
Integers coprime to all primes in form a periodic set of density . Their harmonic sums therefore obey
For this follows by subtracting the two bounded-error periodic harmonic estimates. For , use the initial-interval estimate and ; for the sum is empty.
Choose with . Since the reciprocal sum of all -smooth integers is , choose such that
Factor uniquely with smooth and rough. At each fixed , the selected smooth parts with form an antichain. The part with has , so its harmonic contribution is at most
For , discard primitivity and sum (3) on . This contribution is at most . The coefficient of is at most ; all other terms depend only on the chosen . This proves (1).
Sublogarithmically many ordered coherent pieces
Theorem. Suppose the increasing singleton family is coherent on each member of a partition into consecutive modulus intervals. Let be the number of these intervals containing selected moduli at most . If
then, for every fixed , the union of first kills with has logarithmic density zero.
Here coherence within a piece means that its residues are the projections of one profinite center; different pieces may have arbitrary different centers. It would suffice to require compatibility just for divisibility-comparable moduli within a piece.
Let be the moduli with a first kill in this quotient range. Within each piece is primitive. Indeed, if both occur, , and their classes are compatible, then the entire -class is contained in the -class. Every active point for is already active for , contradicting a first kill at .
Partition at the piece boundaries and apply (1) to the primitive moduli in each piece. The logarithmic interval lengths telescope, giving
The initial modulus , if present, is harmless. Divide by , use (4), and then let . Finally a witnessing modulus contributes at most to the harmonic sum of its bounded-quotient hits. Overcounting can only increase the upper bound. This proves the theorem with the original activation thresholds.
In particular, it applies whenever the canonical residues are nondecreasing along the modulus sequence and
There are at most constant-residue runs before such a modulus, and each run is coherent. This includes the fixed profile .
The earlier finite-component estimate allows arbitrary interlacing but loses a factor equal to the number of components. The ordered-run theorem permits many more components by using their disjoint logarithmic intervals. It gives no assertion when the number of ordered pieces is comparable to , nor for arbitrary monotone sublinear residues. The fixed flat-profile construction also shows that its logarithmic conclusion cannot be strengthened to natural nullity even in example (5).