Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Bohr protected preparations
One counterexample attempt sought finite sieves with all moduli at most , very small full survivor measure, but a positive proportion of survivors across , for fixed . Such a preparation alone would not yet be a counterexample: it would still need to be incorporated into compatible infinite singleton blocks producing fixed logarithmic overdeletion. No such preparation or infinite construction was obtained.
The following theorem rules out protecting a single interval under a rotation as the proposed preparation, even when the slope changes arbitrarily with . It is a finite counting estimate, not a general density theorem.
Theorem
Fix an interval of length . Let
Suppose a finite family has distinct moduli , one residue class per modulus, and every full class avoids . Let be the full periodic survivor density. Then
The constant is independent of , the residues, and the family.
The same assertion holds after translating the interval of integers and the Bohr interval. Thus on , fixed, a protected Bohr set of positive counting proportion forces a positive full survivor measure. This includes rational, Liouville, and -dependent slopes. It does not treat arbitrary protected sets.
An avoided progression yields a rational approximation
Put . If a progression modulo avoids , its rotation phases form at least consecutive terms with step , all avoiding . The elementary pigeonhole approximation lemma gives a with
For clarity, the lemma follows by putting on the circle and choosing two of the points at circular distance at most .
The corresponding -spaced subsequence has length at least . If its signed step , with , travels a full circle, consecutive points leave gaps smaller than , contradicting avoidance. For , this gives
with an absolute constant , for example . The assertion also holds if the step is zero. After reduction, there is consequently a rational satisfying
We may replace by its fractional part throughout.
Let be all reduced fractions satisfying the last two conditions in (2). If no forbidden class is present, (1) is immediate. Otherwise is nonempty. Define
and let be the least denominator in . It suffices to work when is smaller than a sufficiently small constant depending on : the other range follows from the trivial bounds and after increasing .
No small denominator: the whole sieve has small cost
Suppose . Fractions with denominators in are separated by at least . Since the approximation interval has length , their number in is .
For a fixed reduced denominator , condition for some implies
Summing this bound over the approximants, in dyadic denominator blocks from to , gives
Distinctness and one class per modulus now matter: the full Haar union bound gives , which implies (1).
A small denominator: a common periodic region survives
Suppose , and choose its reduced approximant . It is the only fraction in when is sufficiently small. Indeed any distinct one with denominator has distance at least from it, whereas two approximants are at distance at most . The inequality rules this out.
Write
We have , so in the relevant range.
If , the set is -periodic. Any forbidden class intersecting it would have a common point with it in , because the combined period is at most . Thus the whole periodic set survives. Its density differs from by at most , giving (1).
Assume now , and let . For , define
Every forbidden full class avoids this entire -periodic region. Otherwise CRT supplies a common integer within distance of , and inside , since the combined period is at most . Its actual phase differs from by at most , so , a contradiction. Consequently
Here is the averaging estimate required for (4). For each residue , the function
is constant on at most intervals in , since the total phase travel is at most . Counting on the progression therefore differs from by . Summing over gives
Eroding by the margin removes, for each , at most units of time: the phase passes each endpoint only times. Deleting the two boundary time intervals also costs at most . Hence
This reasoning permits either choice of endpoint inclusion in ; for nonzero , possible endpoint visits add only counting errors per residue. Combining the last display with (4) yields
which proves (1).
Interpretation for the attempted construction
On a window entirely above all preparatory moduli, delayed avoidance is full congruence avoidance. Translating to an initial interval changes neither moduli nor full periodic density; it only translates the Bohr interval. Applying (1) with makes its error tend to zero. Thus a positive-density protected single Bohr interval cannot coexist with a preparatory survivor measure tending to zero.
The theorem neither controls high-complexity protected sets nor proves that every finite sieve with small Haar survivor measure has few survivors on such a window. The general preparation and the infinite counterexample remain unconstructed.