Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Compression and blocks
Finite union compression: proved
For any finite list of moduli and residues , let be the union of the full classes and the union of . Then
Here densities are periodic densities, not densities of delayed infinite unions. Distinctness is unnecessary for this finite comparison.
Proof. Let and use CRT to decompose as the product of its prime-power coordinates. Fix one prime and every coordinate other than its -coordinate. Each class whose other coordinates are compatible contributes one -adic ball of relative measure . The union of these balls has measure at least their largest measure. Replace every ball's center by zero, for all classes simultaneously, leaving the other coordinates unchanged. The resulting balls in this fiber are nested, so their union has precisely the largest measure. Thus the replacement does not increase any fiber measure, hence does not increase total measure. Iterate over all prime coordinates to obtain the zero classes.
The introduction of the Filaseta–Ford–Konyagin–Pomerance–Yu source attributes this comparison to Rogers (paragraph defining ). The proof above was independently reconstructed; the source passage was checked.
Why the supplied multi-residue construction is not a solution
The Wang source, Lemmas 3.1–3.4 and Section 4, was checked. Its block at assigns endpoints to at most distinct moduli, where . Endpoints with the same label subset reuse one modulus but use different residues; the endpoint interval is shorter than that modulus. Keeping one residue per modulus therefore leaves at most endpoints and local harmonic mass , not the fixed positive amount needed for its logarithmic-density oscillation.
A possible counterexample mechanism remains conditional: construct long epochs of singleton classes that remove a fixed proportion of logarithmic mass while adding a summably small amount of eventual periodic measure. Finite periodic recovery and the activation threshold then allow epochs to be separated without changing earlier recovery averages. The missing singleton block/epoch construction is not supplied by Wang's theorem.
Uniform bound for bounded-quotient deletion: proved
Let be a finite set of distinct moduli, let be their full periodic union, and normalize . Write
For , let consist of those that are deleted by some class with . Then
The first inequality sums over the possible integers and then over the distinct moduli.
For the second, give each -smooth integer mass . Equivalently, its valuations at primes are independent with . For , the probability that some divides is exactly : the geometric valuation tails are , identical to Haar valuations. Every is itself -smooth and belongs to , so
where the last inequality uses finite compression and inclusion. Distinctness matters in the first sum: multiple residues at one modulus cannot be counted repeatedly as distinct atoms of the smooth distribution.
The classical bound therefore makes (1) a uniform weak-type estimate with constant . The smooth-number identity and this Euler-product bound were checked in the Davenport–Erdős 1951 source, equations (5)–(7) and the paragraph before (12). They are only being used for zero-class multiples, where their hypotheses apply.
Consequently no sequence of finite singleton epochs with periodic footprints tending to zero can delete a fixed positive normalized logarithmic mass using a uniformly bounded ratio . This rules out the direct singleton analog of Wang's epochs, not merely one construction of their dyadic blocks. It leaves deletion with unbounded quotient and conditioned-tail constructions unresolved.
Summable footprints and selected endpoints: proved
Suppose finite blocks have pairwise disjoint modulus sets and full periodic unions with . Select at most one endpoint per modulus. The union of all selected endpoints has logarithmic density zero. Indeed, endpoints from finitely many blocks form a finite set. For the tail and any cutoff , apply finite compression to its moduli and the union bound to obtain
Taking an upper logarithmic density and then proves the claim. The same proof permits any fixed finite number of selected endpoints per modulus. Endpoint coincidences only reduce the harmonic sum.
Quantitative dyadic obstruction: proved
If and , then, for arbitrary singleton residues,
To see this, let on the common finite period. Then and
The middle inequality follows by writing . Cauchy–Schwarz gives the claim. Thus such blocks at every dyadic scale cannot have summable individual footprints. This is weaker than (1) for entire logarithmic epochs, but has a direct elementary proof.
Sharpening the harmonic constant
The exact multiples inequality (2) in basic reductions improves every occurrence of in the bounds above to . Indeed,
Thus the limiting constant in (1) is at most , with no Mertens theorem needed. The earlier smooth-product bounds remain valid but are weaker.
Nearby-multiple injections need not exist
Section 6.3 of the third independent record correctly rules out a pointwise way of applying the multiples inequality. There is no absolute such that every delayed singleton union admits an injection taking each deleted integer to a multiple of a witnessing modulus at most .
Indeed, fix integers and , and use the distinct moduli with residues , for . Their full cylinders lie in distinct residues modulo , so their footprint is exactly . At the active union satisfies
Every target multiple belongs to , which has only points below . Choosing sufficiently large contradicts even an injection into this larger target set, without requiring it to respect the particular witness. The original footprint is , not the compressed footprint ; ignoring the distinct residue fibers loses exactly the information this attempt needed.
Rough moduli in a fixed power range have small reciprocal cost
The stronger support estimate in Section 6.4 of the same input is also valid. Fix and . If consists of distinct integers with no prime factor at most , and is any singleton residue assignment on , then
The constant depends only on . Modulus , if present, causes no exception to the argument.
Here are the missing uniform details. The elementary prime estimates give . Every -rough integer at most has at most prime factors counted with multiplicity. Summing over ordered prime tuples therefore proves
where the sum includes . For a fixed , expanding the gcd and then writing yields
If and , compatibility and CRT give . Cauchy--Schwarz gives , proving (R).
The fixed roughness range is essential: bounded prime rank alone does not bound reciprocal support cost, as all prime moduli demonstrate. The counting and harmonic consequences of (R) are already subsumed by the bounded-rank finite theorem. Neither result controls incremental footprints inside an earlier survivor set.
Infinite multiplier simulation preserves measure, not the anomaly
There is an exact eventual-measure simulation of a countable multi-residue system by globally distinct singleton moduli. Normalize every original pair as with . Partition primes into disjoint sets , each with divergent reciprocal sum, and discard the finitely many primes from its assigned set. Such a partition can be made by assigning successive finite prime batches of reciprocal sum at least one to each index infinitely often. Replace by
All new moduli are distinct: has unique largest prime factor , and disjoint prime assignments distinguish repeated original moduli. Writing an original hit as , the lifted delayed union removes it exactly when has a prime divisor in . Such a divisor satisfies , so activation is respected.
For each fixed original class the omitted quotient set has natural density zero, by the finite upper bound as . The same conditional Haar calculation proves that the completed periodic unions agree up to a null set. Thus a finite original family and its infinite lift differ on a natural-density-zero set, and the full countable Haar unions also have equal measures.
This does not transfer logarithmic-density failure for arbitrary multi-residue systems: a countable union of the omitted natural-density-zero sets is uncontrolled. Every lifted modulus exceeds , so the lift misses every original hit below . For Wang's particular construction, the stronger result below proves that its infinite prime lift actually has natural density.
Arbitrary quotient ranges and a logarithmic-moment constraint
The bounded-quotient obstruction extends to any set of quotient indices. For a finite singleton family with periodic footprint , and , let be the union of the hits with . Distinctness and the previously proved compression bound give
In particular a multiplicative quotient window has harmonic contribution at most
Making the quotients large without making their logarithmic range broad therefore does not evade the obstruction.
More quantitatively, select any one witnessing quotient for every deleted , and write . For , (3) implies
Indeed the normalized mass with is at most . Integrating the lower bound for the complementary mass proves (4).
This is a necessary condition on a small-full-footprint counterexample epoch, not a sufficient condition and not a bound for conditioned tails.
Every divisor-refinement of a Wang block is uniformly small
The following proved bound handles arbitrary composite multipliers and unbounded quotient ranges, rather than only selected early endpoints.
Refinement lemma. Let be a periodic union of residue classes using the finite set of base moduli . Put
Let be any finite or infinite delayed singleton union with globally distinct moduli , where each is divisible by some and each full refined cylinder is contained in . Then
The same bound holds for .
Proof. Activation and distinctness give
For , this is at most the second quantity in (5); below there are no hits. For , the inclusion and the fact that a partial period contains at most all occupied residues give
Partial summation transfers this uniform counting bound to harmonic weights. This proves (5).
For a Wang block, write , , and let be its number of used base moduli. Lemmas 3.1 and 3.4 of the full source give
The passages defining , the diameter assertion in Lemma 3.1, and Lemma 3.4 were checked in the full source for this application. Endpoints attached to a common modulus are different residues, since their interval has diameter smaller than that modulus. Pigeonholing gives
On the other hand,
and therefore
Here , , and . Thus for every sufficiently large Wang block, every singleton divisor-refinement obeys
This rules out repairing one of these blocks by arbitrary long-quotient divisor refinements. It does not assume the refined moduli are prime extensions, nor any upper bound on their sizes.
Natural density of the full fresh-prime lift
Apply the disjoint-prime lift described above to every original congruence pair in Wang's system. Its moduli are globally distinct. For a fixed original pair , the omitted positive quotient integers avoid every prime in and have natural density zero, by and finite CRT products. Thus the lift of any finite number of original blocks differs from their delayed original union by a natural-density-zero set. In particular its natural density equals that finite union's Haar measure.
By (6), the lifted union of all blocks beyond has, uniformly in , at most hits below . This tends to zero after division by and then , since . Finite-block approximation now proves
So this infinite singleton lift has natural density, and hence logarithmic density. It cannot be a counterexample to Problem 25. Arbitrary other refinements of a fixed finite number of source blocks need not be settled by this argument; (6) controls their remote-block tails, not every possible system inside one parent cylinder.
Refinement trees with summable parent mass
There is a further natural-density criterion for recursive covering constructions. A node of a rooted tree is a cylinder . Expanding it installs finitely many classes contained in , with moduli divisible by , and partitions the remaining part of into finitely many child cylinders. Write for the part removed by this expansion. Ancestor expansions precede descendant expansions in this description; the installed congruences themselves are still activated by their numerical moduli.
Proposition. If , the full delayed union has natural density equal to its Haar union measure. In particular this holds if there is a fixed such that at every expanded node.
Proof. Every activated deletion made at node occurs in at an integer at least . Its count below is therefore at most . The union of the deletions made outside any finite collection of expanded nodes has count at most
Finite approximation proves the first assertion. For the second, the are pairwise disjoint, including for ancestor--descendant pairs, because descendants lie in their ancestors' surviving regions. Hence
This proves the proposition. No multiplicity restriction is needed for this criterion; it applies in particular when the installed moduli are globally distinct.
The fixed-efficiency survivor-tree construction in the proof of Theorem 10.2 (Section 10, printed pp. 410–413) of the Balister et al. source falls within this criterion: its local surviving fraction is at most . That construction and its final reciprocal-cost calculation were checked in the full source. Its direct infinite iteration therefore cannot furnish the requested counterexample.
If the local efficiencies vary, the proof still applies whenever . It supplies no bound when the parent masses are nonsummable and the efficiencies tend to zero. In particular it does not rule out an arbitrary conditioned-tail construction.
Bounded-quotient nullity without an efficiency hypothesis
For bounded-quotient hits there is a stronger conclusion, even when the parent masses are nonsummable and the local efficiencies tend to zero. Assume that all installed moduli are globally distinct and that each modulus carries one residue class. For an expanded node , let be its finite family of installed full cylinders and set
Thus is the full periodic union installed at that node, not merely its activated part or a first-kill subset.
Proposition. For every fixed real , the set
has logarithmic density zero. In particular this holds for all first-kill endpoints with a uniformly bounded ratio .
Proof. The sets are pairwise disjoint. If properly descends from , then lies in a surviving child region of , and therefore avoids every class installed at . For incomparable nodes , the cylinders lie in disjoint child cylinders at their first branching ancestor. Consequently
Enumerate the expanded nodes as , and put . Then .
Let consist of the hits defining whose witnessing class was installed at a node with . For a cutoff , only moduli can witness such hits. There are finitely many of them, by global distinctness. The bounded-quotient estimate proved above, together with the sharpened harmonic compression bound, gives
Indeed, the full union of these finitely many classes is contained in , of Haar measure . The classes from the first nodes contribute only finitely many hits with , because each of these nodes installs finitely many classes. Dividing by , letting , and then letting proves the proposition.
The proof counts all bounded-quotient hits, not only first kills. Every counted hit satisfies the actual activation condition ; reordering the installed classes by numerical modulus does not change this inclusion. Thus the conclusion does not require the construction's ancestor order to agree with numerical modulus order.
This excludes an endpoint-only counterexample from any such refinement tree, including one with collapsing efficiencies. It does not establish logarithmic density for the entire delayed union: deletions with unbounded quotient ranges remain unresolved when the summable-parent criterion is unavailable.