Write d(c)=y−x, pc=q+d(c) and w(c)=2y−x for a cell c=(x,y)
of S. Since d is injective on S, the ∣S∣ primes pc are
distinct. Put K=⌊αP⌋.
Size of the primes. From ∣x∣,∣y∣≤ω we get ∣d(c)∣≤2ω,
so every pc and P lie in [q−2ω,q+2ω]. The hypothesis
(4−α)q≥16ω+1 with 4−α≤1 gives q≥16ω+1.
Since 3P is an integer and 3P≤αP, we have K≥3P.
Hence
K ≥ 3q−6ω ≥ 2q+4ω+1,K ≤ α(q+2ω) ≤ 4q−8ω−1.
The first inequality uses q≥10ω+1. The second is
(4−α)q≥(2α+8)ω+1, which follows from the hypothesis
because 2α+8<16.
The layers. By the Chinese remainder theorem choose z with
z≡−x(modpc) for every c=(x,y) in S. The multiples of
pc are then exactly the integers
z+x+tpc=z+tq+(1−t)x+ty(t∈Z),
since x+t(y−x)=(1−t)x+ty. Call this the layer-t multiple of c.
With ∣x∣,∣y∣≤ω its offset from z+tq is at most
(∣1−t∣+∣t∣)ω in absolute value. In particular:
- layer 0 is z+x∈[z−ω,z+ω];
- layer 1 is z+q+y∈[z+q−ω,z+q+ω];
- layer 2 is z+2q+w(c)∈[z+2q−3ω,z+2q+3ω];
- every layer t≤−1 is at most z−q+3ω;
- every layer t≥3 is at least z+3q−5ω.
For the last two, the bound at t=−1 is z−q+3ω and at t=3
it is z+3q−5ω. Moving from t to t−1 or t+1 changes the
position by q and the offset bound by 2ω<q, so the bounds hold
for all t≤−1 and all t≥3.
The block. Let
L=max(z−q+3ω+1, z+2q+3ω+1−K),J=[L,L+K−1].
We check z−q+3ω+1≤L≤z−ω and
z+2q+3ω≤L+K−1≤z+3q−5ω−1. The two lower bounds hold by
the definition of L. For the two upper bounds, compare each term of the
maximum with each upper limit:
z−q+3ω+1≤z−ω since q≥4ω+1;
z−q+3ω+1≤z+3q−5ω−K since K≤4q−8ω−1;
z+2q+3ω+1−K≤z−ω since K≥2q+4ω+1; and
z+2q+3ω+1−K≤z+3q−5ω−K since q≥8ω+1.
Therefore J contains every layer 0, 1 and 2 multiple: they lie in
[z−ω,z+2q+3ω]⊆J. It contains no multiple in a layer
t≤−1 or t≥3, since those lie below L or above L+K−1. So the
integers of J divisible by some pc are exactly the three sets
z+X, z+q+Y and z+2q+W.
Counting once. The three sets lie in the disjoint intervals
[z−ω,z+ω], [z+q−ω,z+q+ω] and
[z+2q−3ω,z+2q+3ω], because q>4ω. Hence J
contains exactly ∣X∣+∣Y∣+∣W∣ integers divisible by at least one
pc, each counted once; an integer of J divisible by several of the
primes is a single element of one of these sets.
Positivity. Replacing z by z+n∏c∈Spc preserves every
congruence and translates J and all layers by the same amount. For n
large, L≥1, so J is a block of K consecutive positive integers.
This completes the proof.