Wiki
Wiki

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 NN, very small full survivor measure, but a positive proportion of survivors across [N,NK][N,N^K], for fixed K>1K>1. 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 NN. It is a finite counting estimate, not a general density theorem.

Theorem

Fix an interval I⊂R/ZI\subset\mathbb R/\mathbb Z of length ℓ>0\ell>0. Let

S={1≤n≤H:{nθ}∈I}.S=\{1\le n\le H:\{n\theta\}\in I\}.

Suppose a finite family has distinct moduli q≤Nq\le N, one residue class per modulus, and every full class avoids SS. Let δ\delta be the full periodic survivor density. Then

δ≥∣S∣H−CℓNlog⁡(2N)H(H≥CℓNlog⁡(2N)).(1)\delta\ge\frac{|S|}{H} -C_\ell\sqrt{\frac{N\log(2N)}H} \qquad(H\ge C_\ell N\log(2N)). \tag{1}

The constant is independent of θ\theta, the residues, and the family.

The same assertion holds after translating the interval of integers and the Bohr interval. Thus on [N,NK][N,N^K], K>1K>1 fixed, a protected Bohr set of positive counting proportion forces a positive full survivor measure. This includes rational, Liouville, and NN-dependent slopes. It does not treat arbitrary protected sets.

An avoided progression yields a rational approximation

Put J=⌈8/ℓ⌉J=\lceil8/\ell\rceil. If a progression modulo q≤Nq\le N avoids SS, its rotation phases form at least H/q−1H/q-1 consecutive terms with step qθq\theta, all avoiding II. The elementary pigeonhole approximation lemma gives a 1≤j≤J1\le j\le J with

∥jqθ∥≤1/(J+1)<ℓ/4.\|jq\theta\|\le1/(J+1)<\ell/4.

For clarity, the lemma follows by putting 0,qθ,…,Jqθ0,q\theta,\ldots,Jq\theta on the circle and choosing two of the J+1J+1 points at circular distance at most 1/(J+1)1/(J+1).

The corresponding jj-spaced subsequence has length at least H/(jq)−2H/(jq)-2. If its signed step ξ\xi, with ∣ξ∣=∥jqθ∥<ℓ/4|\xi|=\|jq\theta\|<\ell/4, travels a full circle, consecutive points leave gaps smaller than ℓ\ell, contradicting avoidance. For H≥8JNH\ge8JN, this gives

∥jqθ∥≤Ajq/H\|jq\theta\|\le A jq/H

with an absolute constant AA, for example A=8A=8. The assertion also holds if the step is zero. After reduction, there is consequently a rational a/ba/b satisfying

b∣jq,b≤JN,∣θ−a/b∣≤A/H.(2)b\mid jq,\qquad b\le JN,\qquad |\theta-a/b|\le A/H. \tag{2}

We may replace θ\theta by its fractional part throughout.

Let A\mathcal A be all reduced fractions satisfying the last two conditions in (2). If no forbidden class is present, (1) is immediate. Otherwise A\mathcal A is nonempty. Define

η=Nlog⁡(2N)H,B=log⁡(2N)η=Hlog⁡(2N)N,\eta=\sqrt{\frac{N\log(2N)}H}, \qquad B=\frac{\log(2N)}\eta =\sqrt{\frac{H\log(2N)}N},

and let b0b_0 be the least denominator in A\mathcal A. It suffices to work when η\eta is smaller than a sufficiently small constant depending on ℓ\ell: the other range follows from the trivial bounds δ≥0\delta\ge0 and ∣S∣/H≤1|S|/H\le1 after increasing CℓC_\ell.

No small denominator: the whole sieve has small cost

Suppose b0>Bb_0>B. Fractions with denominators in [Q,2Q)[Q,2Q) are separated by at least 1/(4Q2)1/(4Q^2). Since the approximation interval has length 2A/H2A/H, their number in A\mathcal A is O(1+Q2/H)O(1+Q^2/H).

For a fixed reduced denominator bb, condition b∣jqb\mid jq for some j≤Jj\le J implies

∑q≤Nb∣jq for some j≤J1q≤∑j≤J(b,j)bH⌊N(b,j)/b⌋≪ℓlog⁡(2N)b.\sum_{\substack{q\le N\\b\mid jq\text{ for some }j\le J}}\frac1q \le\sum_{j\le J}\frac{(b,j)}b H_{\lfloor N(b,j)/b\rfloor} \ll_\ell\frac{\log(2N)}b.

Summing this bound over the approximants, in dyadic denominator blocks from b0b_0 to JNJN, gives

∑q selected1q≪ℓlog⁡(2N)(1b0+NH)≪ℓη+η2≪ℓη.(3)\sum_{q\text{ selected}}\frac1q \ll_\ell\log(2N)\left(\frac1{b_0}+\frac NH\right) \ll_\ell\eta+\eta^2\ll_\ell\eta. \tag{3}

Distinctness and one class per modulus now matter: the full Haar union bound gives δ≥1−Oℓ(η)\delta\ge1-O_\ell(\eta), which implies (1).

A small denominator: a common periodic region survives

Suppose b0≤Bb_0\le B, and choose its reduced approximant a/ba/b. It is the only fraction in A\mathcal A when η\eta is sufficiently small. Indeed any distinct one with denominator b′≤JNb'\le JN has distance at least 1/(bJN)1/(bJN) from it, whereas two approximants are at distance at most 2A/H2A/H. The inequality 2ABJN/H=2AJη<12ABJN/H=2AJ\eta<1 rules this out.

Write

θ=a/b+ε,∣ε∣H≤A,L=bN.\theta=a/b+\varepsilon,\qquad |\varepsilon|H\le A, \qquad L=bN.

We have L/H≤BN/H=ηL/H\le BN/H=\eta, so L<H/4L<H/4 in the relevant range.

If ε=0\varepsilon=0, the set {n:{an/b}∈I}\{n:\{an/b\}\in I\} is bb-periodic. Any forbidden class intersecting it would have a common point with it in [1,H][1,H], because the combined period is at most bN=L<HbN=L<H. Thus the whole periodic set survives. Its density differs from ∣S∣/H|S|/H by at most b/Hb/H, giving (1).

Assume now ε≠0\varepsilon\ne0, and let w=∣ε∣Lw=|\varepsilon|L. For L≤t≤H−LL\le t\le H-L, define

Rt={r mod b:{ar/b+εt} lies in I at distance greater than w from its boundary}.R_t=\left\{r\bmod b: \{ar/b+\varepsilon t\}\text{ lies in }I \text{ at distance greater than }w\text{ from its boundary}\right\}.

Every forbidden full class avoids this entire bb-periodic region. Otherwise CRT supplies a common integer nn within distance LL of tt, and inside [1,H][1,H], since the combined period is at most bq≤Lbq\le L. Its actual phase differs from ar/b+εtar/b+\varepsilon t by at most ∣ε∣L=w|\varepsilon|L=w, so n∈Sn\in S, a contradiction. Consequently

δ≥max⁡L≤t≤H−L∣Rt∣/b.(4)\delta\ge\max_{L\le t\le H-L}|R_t|/b. \tag{4}

Here is the averaging estimate required for (4). For each residue r mod br\bmod b, the function

fr(t)=1I({ar/b+εt})f_r(t)=\mathbf1_I(\{ar/b+\varepsilon t\})

is constant on at most OA(1)O_A(1) intervals in [0,H][0,H], since the total phase travel is at most AA. Counting on the progression n≡r(modb)n\equiv r\pmod b therefore differs from b−1∫0Hfr(t) dtb^{-1}\int_0^H f_r(t)\,dt by OA(1)O_A(1). Summing over rr gives

∣S∣=∫0H1b∑rfr(t) dt+OA(b).|S|=\int_0^H\frac1b\sum_r f_r(t)\,dt+O_A(b).

Eroding II by the margin ww removes, for each rr, at most OA(w/∣ε∣)=OA(L)O_A(w/|\varepsilon|)=O_A(L) units of time: the phase passes each endpoint only OA(1)O_A(1) times. Deleting the two boundary time intervals also costs at most 2L2L. Hence

∫LH−L∣Rt∣b dt≥∣S∣−OA(L).\int_L^{H-L}\frac{|R_t|}{b}\,dt\ge |S|-O_A(L).

This reasoning permits either choice of endpoint inclusion in II; for nonzero ε\varepsilon, possible endpoint visits add only OA(1)O_A(1) counting errors per residue. Combining the last display with (4) yields

δ≥∣S∣/H−OA(L/H)≥∣S∣/H−Oℓ(η),\delta\ge |S|/H-O_A(L/H) \ge |S|/H-O_\ell(\eta),

which proves (1).

Interpretation for the attempted construction

On a window entirely above all preparatory moduli, delayed avoidance is full congruence avoidance. Translating [N,NK][N,N^K] to an initial interval changes neither moduli nor full periodic density; it only translates the Bohr interval. Applying (1) with H=⌊NK⌋−NH=\lfloor N^K\rfloor-N 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.