Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Hough, Section 3, printed pp. 367–372 of the published paper. These are definitions and elementary identifications used by the result pages, not an additional theorem asserted by the source.

Let M\mathcal M be a finite set of distinct integers greater than M>1M>1, with one residue am(modm)a_m\pmod m for each m∈Mm\in\mathcal M. Put Q=lcm⁡(M)Q=\operatorname{lcm}(\mathcal M), with Q=1Q=1 for the empty set, and vp=vp(Q)v_p=v_p(Q). Take 1=P−1<P0<P1<⋯→∞1=P_{-1}<P_0<P_1<\cdots\to\infty, with P0≥2P_0\ge2, and define

Q−1=1,Qi=∏p≤Pipvp,Mi={m∈M:m∣Qi},Ri=⋂m∈Mi(am mod m)c.Q_{-1}=1,\qquad Q_i=\prod_{p\le P_i}p^{v_p},\qquad \mathcal M_i=\{m\in\mathcal M:m\mid Q_i\},\qquad R_i=\bigcap_{m\in\mathcal M_i}(a_m\bmod m)^c.

Sets are regarded as periodic subsets of the integers or as their images in the indicated finite quotient. In particular R−1=ZR_{-1}=\mathbb Z. For some finite ii, Qi=QQ_i=Q and RiR_i is the final uncovered set. A nonempty subset of Z/QZ\mathbb Z/Q\mathbb Z lifts to a periodic set of positive density, namely its cardinality divided by QQ. No assertion about the limit of infinitely many positive densities is needed.

At step i+1i+1, put

Ni+1={n>1:n∣Qi+1, p∣n⇒Pi<p≤Pi+1}.\mathcal N_{i+1}=\{n>1:n\mid Q_{i+1},\ p\mid n\Rightarrow P_i<p\le P_{i+1}\}.

Every m∈Mi+1∖Mim\in\mathcal M_{i+1}\setminus\mathcal M_i factors uniquely as m=m0nm=m_0n, where m0∣Qim_0\mid Q_i, n∈Ni+1n\in\mathcal N_{i+1}, and gcd⁡(m0,n)=gcd⁡(Qi,n)=1\gcd(m_0,n)=\gcd(Q_i,n)=1. For r∈Ri mod Qir\in R_i\bmod Q_i define

An,r=(r mod Qi)∩⋃m0∣Qim0n∈M(am0n mod m0n),an(r)=∣An,r mod nQi∣.A_{n,r}=(r\bmod Q_i)\cap \bigcup_{\substack{m_0\mid Q_i\\m_0n\in\mathcal M}}(a_{m_0n}\bmod m_0n), \qquad a_n(r)=|A_{n,r}\bmod nQ_i|.

The Chinese remainder theorem shows that a term in this union is empty unless r≡am0n(modm0)r\equiv a_{m_0n}\pmod{m_0}, and otherwise is exactly one class modulo nQinQ_i. The surviving part of the fiber is

Ri+1∩(r mod Qi)=(r mod Qi)∩⋂n∈Ni+1An,rc.R_{i+1}\cap(r\bmod Q_i) =(r\bmod Q_i)\cap\bigcap_{n\in\mathcal N_{i+1}}A_{n,r}^{c}.

For λ≥0\lambda\ge0, the fiber rr is λ\lambda-good when, for every prime p∈(Pi,Pi+1]p\in(P_i,P_{i+1}],

∑n∈Ni+1p∣nan(r)eλω(n)n≤1−e−λ.(5)\sum_{\substack{n\in\mathcal N_{i+1}\\p\mid n}} \frac{a_n(r)e^{\lambda\omega(n)}}n\le1-e^{-\lambda}. \tag{5}

Here ω(n)\omega(n) counts distinct prime divisors. It is λ\lambda-well distributed when its surviving part is nonempty and for every n∈Ni+1n\in\mathcal N_{i+1} and every residue b(modn)b\pmod n,

∣Ri+1∩(r mod Qi)∩(b mod n) mod Qi+1∣∣Ri+1∩(r mod Qi) mod Qi+1∣≤eλω(n)n.(4)\frac{|R_{i+1}\cap(r\bmod Q_i)\cap(b\bmod n)\bmod Q_{i+1}|} {|R_{i+1}\cap(r\bmod Q_i)\bmod Q_{i+1}|} \le\frac{e^{\lambda\omega(n)}}n. \tag{4}

The same inequality for n=1n=1 is the identity 1≤11\le1.

Let R−1∗=ZR_{-1}^*=\mathbb Z, and at stage ii select good fibers Ri∗⊆Si:=Ri−1∗∩Ri⊆Z/QiZR_i^*\subseteq S_i:=R_{i-1}^*\cap R_i\subseteq\mathbb Z/Q_i\mathbb Z. Let μi\mu_i be a nonnegative finite measure supported on SiS_i, with Ti=μi(Si)>0T_i=\mu_i(S_i)>0. For an integer k≥1k\ge1, let ℓk(m)\ell_k(m) be the number of ordered kk-tuples of positive integers with least common multiple mm, and put

βk(i)k=∑m∣Qiℓk(m)max⁡b mod mμi(Si∩(b mod m))Ti.\beta_k(i)^k= \sum_{m\mid Q_i}\ell_k(m)\max_{b\bmod m} \frac{\mu_i(S_i\cap(b\bmod m))}{T_i}.

The normalization makes these statistics invariant under multiplication of μi\mu_i by a positive constant. The m=1m=1 term is 11, so every βk(i)≥1\beta_k(i)\ge1. Measures need not remain probability measures. The initial uniform measure and its bound are proved in the initial-stage argument; the next measure is defined in Lemma 2.

Conventions. General moduli require the full powers pvp(Q)p^{v_p(Q)}. Section 2's products of primes describe only its square-free overview. Empty products are 11 and empty sums are 00. A stage with no new prime divisor of QQ has Ni+1=∅\mathcal N_{i+1}=\varnothing, no new exclusion, and every surviving fiber is good. This also covers M=∅\mathcal M=\varnothing.

Bears on. Problem 2.