All functions have finite support. Write ∥⋅∥2 and
⟨⋅,⋅⟩ for the norm and inner product in
ℓ2(Z). An ordered pair (a,a′) belongs to
(j+W)×(j+h+W) for exactly rW(a′−a−h) values of j. Therefore
⟨F,F(⋅+h)⟩=t∑r(h+t)rW(t).(1)
At h=0, the term t=0 is kn and all other representation counts
are at most one. Since ∑trW(t)=n2 and rW(0)=n,
∥F∥22≤kn+n2−n.(2)
For every t∈W−W, the hypothesis ∣s∣>diamW gives
s+t=0. Its inclusion in A−A and uniqueness give r(s+t)=1.
Equation (1) at h=s consequently gives
⟨F,F(⋅+s)⟩=n2.(3)
Cauchy--Schwarz and translation invariance of the norm imply
∥F∥22≥n2. Combining (2) and (3) gives
∥F−F(⋅+s)∥22=2∥F∥22−2n2≤2n(k−1).(4)
Fix an integer K≥1 and set
g=K−1∑i=0K−1F(⋅+is). Telescoping (4), followed by
the triangle inequality, gives
∥F−g∥2≤K1i=0∑K−1i2n(k−1)=2K−12n(k−1).(5)
For distinct i,i′∈{0,…,K−1} we have
∣(i′−i)s∣>diamW, so (i′−i)s∈/W−W.
Thus the windows j+is+W are pairwise disjoint for each fixed j.
It follows that ∑iF(j+is)≤k, hence 0≤g(j)≤k/K.
Each element of A is counted in exactly n windows j+W, so
∑jg(j)=∑jF(j)=kn. Therefore
∥g∥22≤Kkj∑g(j)=Kk2n.(6)
Using (3), (5), (6), and the triangle inequality,
n≤∥F∥2≤∥g∥2+∥F−g∥2≤kKn+2K−12n(k−1).
Division by n proves the inequality for every K≥1, including
K=1. Take K=⌈k1/3⌉. Since K≥k1/3,
K−1≤k1/3 and k−1≤k, its right-hand side is at most
(1+1/2)k5/6. Squaring proves
∣W∣≤(3/2+2)k5/3.□
Restricted uniqueness. The proof only uses r(t)≤1 for
t∈(W−W)∖{0} and r(s+t)=1 for t∈W−W.
If a set of k integers represents every positive difference up to
L≥1 exactly once, put u=⌊(L+1)/2⌋,
W={0,…,u−1} and s=u. The restricted conditions hold because
s+(W−W)={1,…,2u−1} and 2u−1≤L≤2u.
Hence L≤(3+22)k5/3. This recovers the leading term of
L239 under its weaker hypothesis, without using that claim as an input
or imposing uniqueness on differences larger than L.