Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Bounded prime overlap blocks
The later branch-separated centers theorem allows arbitrarily many blocks at a prime when their centers have bounded multiplicity in each first-digit branch. It proves logarithmic density for arbitrary residues satisfying , without coherence, and allows signed centers.
The theorem below extends the disjoint-prime-support result in prepared blocks. It is a sufficient condition, not a resolution for arbitrary singleton residues.
Theorem
Partition a family of globally distinct moduli into nonempty blocks . In block , use a single integer residue
Suppose each prime divides moduli in at most different blocks, where is a fixed positive integer. Then the delayed union has logarithmic density equal to the Haar measure of its full periodic union. Moreover, finite congruence subfamilies approximate in upper logarithmic density.
For a finite such family, if its full union has measure , then, for every ,
No assertion of natural density is made when the full survivor measure is positive.
Product-space inequality
Let be nonnegative functions on a finite product probability space. Suppose each coordinate occurs in the dependence sets of at most functions. Then
Here the individual coordinate spaces need not be finite.
For a proof, induct on the number of coordinates. In the last coordinate, apply Hölder with exponent to its incident factors, padding with factors equal to one if fewer than occur. Replace each incident by , and leave the other factors unchanged. The remaining coordinate-dependence bound is still . The induction hypothesis applies to the , and . This proves (2).
Proof of the theorem
Write
The prime coordinates of are independent under Haar measure. Apply (2) to the avoidance indicators of finitely many finite block truncations. Exhausting each of those blocks gives, for every finite set of block indices,
The passage to infinite blocks is continuity of probability for decreasing sequences of avoidance events.
If , fixed finite congruence prefixes already prove natural density zero for the survivor set, so assume . Taking logarithms in (3) and exhausting yields
Let be the delayed integer union of block . The normalization of its center gives the exact identity
Indeed a congruence hit is active precisely at the points with ; its root is inactive. Consequently, using the exact harmonic inequality for multiples,
For infinite , at a fixed cutoff only the finitely many moduli matter, so the finite inequality applies directly.
Equations (4)--(6) give the uniform tail bound
Each retained block has finite-congruence approximation in upper logarithmic density: this is the multiples theorem followed by the fixed translation in (5). More explicitly, for a finite subfamily , the multiples difference has logarithmic density , which tends to zero as exhausts . Fixed translations preserve logarithmic density, because their reciprocal-weight changes are absolutely summable. Finite unions of retained blocks therefore have the same approximation property. Combining it with (7) proves the theorem. The limit is the full Haar measure, since the finite periodic union measures increase to it.
For a finite family, summing (6) and using (4), with , proves (1). Global modulus distinctness is preserved throughout: blocks are a partition of the given modulus set, not additional copies of congruences.
A coherent varying-residue consequence
Suppose , normalized by , for a fixed . Omit the trivial modulus- case. If, for some fixed ,
where is the least prime factor, then the original delayed system has logarithmic density and finite-periodic logarithmic approximation.
To prove this, group the moduli by their exact normalized residue . If a prime occurs in a group, then
At most integers in this interval have that residue modulo . Hence the block theorem applies with .
Condition (8) may also hold only outside a finite set of moduli: the exceptional moduli introduce at most finitely many additional center groups and thus increase by at most a fixed amount.
For an unrestricted coherent center, a prime can occur in arbitrarily many normalized-residue groups. Neither (3) nor (4) then supplies the summable block bound. This is the remaining limitation of this argument.
Allowing a reciprocal-summable set of exceptional overlap primes
Theorem. Suppose the residues are coherent, and partition the moduli by their exact normalized residues . Let be a set of primes with . If each prime outside occurs in at most of these groups, then the delayed union has logarithmic density and finite-congruence approximation in upper logarithmic density.
There is no bound on how many groups share a prime in . In particular, arbitrary overlap at finitely many primes is harmless. The proof does not give a uniform finite small-footprint estimate when the exceptional set and the needed truncations vary.
Finite exceptional set
First suppose is finite and nonempty. Fix , and temporarily discard every modulus divisible by for any . Coherence and activation imply that all discarded hits lie in the union of the delayed classes . Thus their harmonic mass is at most
Their full Haar union has at most the same sum as its measure.
Put and consider the retained family. In a fixed fiber , , split each root group further by . Every retained modulus in this subblock has the form , where . Write . The subblock is incompatible with the fiber unless . For a compatible subblock, put . For every one of its moduli, normalization gives
The original active hits, with , are exactly
sm-b\in M(D'),\qquad D'=\{q/h:q\text{ is in the subblock}}. \tag{10}Indeed ; being a positive multiple of is equivalent to (10). It automatically gives . For such a hit, and
Since is injective, the exact multiples inequality gives
The full projected union has measure exactly : multiplication by and translation by preserve Haar measure on all coordinates appearing in , since .
Outside , a prime now occurs in at most projected subblocks, where is the number of divisors of . No prime in occurs in . Let be the full survivor measure of the projected family in the chosen fiber. If , product-space Hölder, as in (3)--(4), gives
Here is fixed. The ratios are bounded by a constant depending only on , uniformly for . Consequently (11)--(12) give uniformly negligible harmonic tails of subblocks.
Each individual subblock also has finite-congruence logarithmic approximation. Under (10), deleting all but finitely many generators restricts a difference of two multiples sets to one residue modulo . The unrestricted multiples difference has logarithmic density tending to zero as the generators are exhausted; the inequality transfers its upper harmonic bound. This suffices even though no density for the restricted multiples difference is being assumed. Thus (12) yields finite-congruence approximation for the entire fiber.
If , finite prefixes of the projected family have survivor densities tending to zero. Each such prefix is eventually periodic, so its complement bounds the tail and gives the same approximation conclusion. The finitely many original integers represented by do not matter. Finally, the affine map divides upper logarithmic density by . Summing over the finitely many fibers establishes the conclusion for the retained family.
Let in (9). Uniform harmonic approximation and the corresponding Haar bound transfer finite-congruence approximation and the Haar value to the original family. If is empty, the original bounded-overlap theorem applies directly.
Infinite reciprocal-summable exceptional set
First discard moduli containing any with . Every discarded active hit is in the delayed class for such a prime, so its normalized harmonic mass, and the Haar measure of the discarded union, are at most
For the retained family, the only exceptional primes are the finitely many in . Apply the finite-exception argument and then let .
All subblocks are partitions or restrictions of the original distinct moduli. Effective moduli may repeat across subblocks, but Hölder is applied to subblock events, not to a newly asserted singleton system. Thus no duplicate-modulus construction is introduced. Coherence is essential for both exceptional-prime deletion bounds. The argument does not handle unbounded overlap on a set of primes with divergent reciprocal sum.