Wiki
Wiki

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

Updated


Source. Zhi-Wei Sun, Covering the integers by arithmetic sequences II, Trans. Amer. Math. Soc. 348 (1996), no. 11, 4279–4320, DOI. Theorem I is on pp. 6–7 of the 48-page author copy described on the source card, which does not carry the journal pagination. The paper introduces Theorems I and II as two collections of its central results "in the simplest case while we actually prove more" (p. 6); their parts are derived from later corollaries, as listed under Proof route.

Conventions

The system is

A={as+nsZ}s=1k(a1,…,ak∈Z, n1,…,nk∈Z+),A=\{a_s+n_s\mathbb Z\}_{s=1}^k\qquad(a_1,\dots,a_k\in\mathbb Z,\ n_1,\dots,n_k\in\mathbb Z^+),

the paper's (1). It is an mm-cover of Z\mathbb Z when every integer lies in at least mm of the sequences, and an exact mm-cover when every integer lies in exactly mm of them. The sequence at+ntZa_t+n_t\mathbb Z is essential when {as+nsZ}s≠t\{a_s+n_s\mathbb Z\}_{s\ne t} is not an mm-cover of Z\mathbb Z (p. 2). Write (x,y)(x,y) for the greatest common divisor, p(n)p(n) for the least prime factor of n>1n>1, and r1≡r2(mod1)r_1\equiv r_2\pmod 1 for r1−r2∈Zr_1-r_2\in\mathbb Z. The denominator of a rational a/ba/b with b∈Z+b\in\mathbb Z^+ and (a,b)=1(a,b)=1 is bb. The paper's condition (7) (p. 5) is

n1≤⋯≤nk−l<nk−l+1=⋯=nk.n_1\le\cdots\le n_{k-l}<n_{k-l+1}=\cdots=n_k .

Statement

Let AA be an mm-cover of Z\mathbb Z with m∈Z+m\in\mathbb Z^+.

(i) For any m1,…,mk∈Z+m_1,\dots,m_k\in\mathbb Z^+, at least mm distinct positive integers have the form ∑s∈Ims/ns\sum_{s\in I}m_s/n_s with I⊆{1,…,k}I\subseteq\{1,\dots,k\}.

(ii) If m>1m>1, then for any m1,…,mk∈Z+m_1,\dots,m_k\in\mathbb Z^+ and any t=1,…,kt=1,\dots,k there is I⊆{1,…,k}I\subseteq\{1,\dots,k\} with t∉It\notin I and ∑s∈Ims/ns∈Z+\sum_{s\in I}m_s/n_s\in\mathbb Z^+ (the paper's (11)). Further, if n∈Z+n\in\mathbb Z^+ and the subsystem {as+nsZ: 1≤s≤k, ns∣n}\{a_s+n_s\mathbb Z:\ 1\le s\le k,\ n_s\mid n\} is not an mm-cover of Z\mathbb Z, then

∑s∈I(n,ns)ns∈Z+for some I⊆{1≤s≤k: ns∤n}.\sum_{s\in I}\frac{(n,n_s)}{n_s}\in\mathbb Z^+ \qquad\text{for some } I\subseteq\{1\le s\le k:\ n_s\nmid n\}.

As printed, the condition m>1m>1 opens the first sentence of (ii); Corollary 7(ii) (pp. 20–21), from which the paper derives the second sentence, does not assume m>1m>1.

(iii) If at+ntZa_t+n_t\mathbb Z is essential, then for every r=0,1,…,nt−1r=0,1,\dots,n_t-1 there are I1,I2⊆{1,…,k}∖{t}I_1,I_2\subseteq\{1,\dots,k\}\setminus\{t\} with

rnt≡∑s∈I11ns−∑s∈I21ns(mod1),∑s∈I11ns≥m−1,∑s∈I21ns≥m−2\frac r{n_t}\equiv\sum_{s\in I_1}\frac1{n_s}-\sum_{s\in I_2}\frac1{n_s}\pmod 1, \qquad \sum_{s\in I_1}\frac1{n_s}\ge m-1,\quad\sum_{s\in I_2}\frac1{n_s}\ge m-2

(the paper's (12)), and the sums ∑s∈I1/ns\sum_{s\in I}1/n_s with I⊆{1,…,k}∖{t}I\subseteq\{1,\dots,k\}\setminus\{t\} have at least ntn_t distinct fractional parts.

(iv) Assume (7) with 0<l≤k0<l\le k. If l≠kl\ne k, then

l≥nknk−lor∑s=1k−l1ns≥ml\ge\frac{n_k}{n_{k-l}}\qquad\text{or}\qquad\sum_{s=1}^{k-l}\frac1{n_s}\ge m

(the paper's (13)). If nk≠1n_k\ne1, then at least one of the following holds: at least mm distinct positive integers have the form ∑s∈I1/ns−1/nk\sum_{s\in I}1/n_s-1/n_k with I⊆{1,…,k}I\subseteq\{1,\dots,k\}; or ll is a sum of denominators greater than 11, not necessarily distinct, of rationals ∑s∈I1/ns−1/nk\sum_{s\in I}1/n_s-1/n_k with I⊆{1,…,k}I\subseteq\{1,\dots,k\}, and therefore l≥p(lcm⁡(n1,…,nk))l\ge p(\operatorname{lcm}(n_1,\dots,n_k)).

Proof route and dependencies

The paper derives the parts from later results, as its own remarks state:

  • (i) from Corollary 12 with λ=0\lambda=0 and n=1n=1 (p. 40);
  • the first sentence of (ii) from Corollary 8(i) with n=1n=1 (remark, p. 23), and the second from the second part of Corollary 7 (p. 21);
  • (iii) from the second parts of Corollary 10 and Theorem 1 (remark, p. 25);
  • the first assertion of (iv) from Corollary 13 (p. 40), whose hypothesis lnk−l<nkln_{k-l}<n_k yields ∑s=1k−l1/ns≥m\sum_{s=1}^{k-l}1/n_s\ge m, and the second from Corollary 12 with λ=n=1\lambda=n=1 and rs=1/nsr_s=1/n_s (p. 40).

Corollary 12 rests on part IIb of the paper's Theorem 3 (p. 40). No proof is reconstructed here.

Bears on

  • Problem 947: the first assertion of (iv) with m=1m=1 excludes an exact cover with k≥2k\ge2 sequences and distinct moduli. Order the moduli increasingly; then (7) holds with l=1≠kl=1\ne k. The alternative 1≥nk/nk−11\ge n_k/n_{k-1} is false, and for an exact cover ∑s=1k1/ns=1\sum_{s=1}^k1/n_s=1 (p. 2), so ∑s=1k−11/ns=1−1/nk<1\sum_{s=1}^{k-1}1/n_s=1-1/n_k<1. This derivation is the corpus's; the paper credits the theorem itself to Davenport, Mirsky, Newman and Radó (p. 4) and does not restate it as a consequence of (iv).