Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This proves the whole statement of
L253.
Write e(u)=exp(2πiu),
ψ(u)=u−⌊u⌋−21, and
SC(X)=C<c≤2C∑ψ(X/c),YX=X/C.
All implied constants below are uniform in m,K,C,X,r. They may depend
on the fixed positive parameter η, and eventually on δ.
The analytic input and its specialization
Theorem 6 of Bourgain, Decoupling, exponential sums and the Riemann zeta
function, J. Amer. Math. Soc. 30 (2017), 205--224, in
arXiv:1408.5794v2, Section 5,
states that
(κ,λ)=(13/84+η,55/84+η)
is an exponent pair for every fixed 0<η<1/100.
In the normalization used there,
an admissible phase of size T on an interval of length comparable to
M, with T≥M, has exponential sum
≪η(T/M)κMλ.
The phase class consists of functions whose derivatives approximate those
of a monomial with first derivative yu−s, s>0; the constants are
uniform for fixed s and fixed derivative tolerances. Section 5 explains
both the extension to M>T and the allowance of subintervals. These
qualifications matter here, since the first few frequencies can have
C>rYX.
For X>0 and r≥1, take
f(u)=−rXu−1/2(C≤u≤2C).
Its first derivative is exactly
f′(u)=(rX/2)u−3/2: this is the source's monomial with
s=3/2, with zero approximation error at every derivative order.
Equivalently, its normalized phase is −v−1/2 on 1≤v≤2,
independent of r,X,C, and its size is T=rYX.
The positive-phase sum is the conjugate of the sum for f, so the same
bound applies. Thus, whenever rYX≥2C,
The equality uses λ−κ=1/2. The fixed change from the source's
interval [M/2,M] to [C,2C] changes only constants. No almost-all
qualification occurs in this estimate.
Both terms have exactly these exponents after substituting V.
In particular
1+a=1+κ3/2+2κ,1−b=1+κ1.(3)
Uniform construction
Fix 0<δ<1/20, set η=δ/10 and
ν=21/38−δ. Then
1/2<ν<21/38 and 0<κ<1/4. All inequalities that follow hold
for every K beyond a single threshold depending only on δ.
The following bounds are uniform throughout the remaining range:
8K<C≤32Kν=o(K),256CK2≤E≤128CK2≤m,(4)
and, for X=m and X=m+E,
42K<YX≤22K.(5)
Indeed 16m/K2>K/8≥1, so C≤32m/K2≤32Kν,
while C≥16m/K2 bounds Ym above by K/4 and
C<16m/K2+1≤32m/K2 bounds it below by K/(42).
For large K, C≤K2/256, giving the lower bound for E after
rounding down. Also C>K/8 gives E<K3/2/16≤m for
K≥64. This proves (4), and m+E≤2m proves (5).
In particular, YX≥2C for all sufficiently large K, because
ν<1. Furthermore
C1/2YX−κ>8K1/4−κ⟶∞.
Thus (2) applies to both endpoints, giving
∣SC(m)∣+∣SC(m+E)∣≪δCaKb.(6)
By Lemma 2 of the proof of L251, the number of pairs of positive integers
(c,q) with C<c≤2C and m<cq2≤m+E is
C<c≤2C∑((m+E)/c−m/c)−SC(m+E)+SC(m).
The elementary estimate (3) in that proof uses only (4), (5) and
Ym≤K/4, and gives the lower bound K/(219C) for this sum's
main term. To compare (6) with it, (3) and C≤32Kν yield
K/CCaKb≪δK{ν(3/2+2κ)−1}/(1+κ).(7)
Here the exponent is strictly negative. More precisely,
It follows that the pair count is positive for every sufficiently large
K, uniformly for all the integers m in the specified range. Choose
such a pair and let t be the largest nonnegative integer satisfying
ct2<cq2−m. The adjustment lemma in L251 gives
0<N−m<2cE+c≤K/4+2C≤K,N=c(q−t)(q+t).
Also 1≤c≤2C≤K, q−t≥1, and
q≤(m+E)/c≤22K,t<E/c≤82CK.
Since C≥1, these two bounds give q+t<K. All three factors are
positive integers at most K. This proves the first sentence after
choosing an integer K0(δ) large enough for the finitely many
uniform threshold requirements above. Since 2+ν=97/38−δ, its
exponent is exactly the one stated.
Translation to k(n)
Fix ε>0. Choose 0<δ<1/20 so small that
1/(97/38−δ)<38/97+ε, and write d=97/38−δ.
For every integer n≥1, set
K=max(K0(δ),⌈n1/d⌉).
Then n≤Kd, and the first sentence supplies a K-smooth member of
every block (m,m+K] with 0≤m≤n. If a longer block witnessed
k(n)≥K, its first K terms would have no such member. Hence
k(n)≤K−1<max(K0(δ),n1/d)≤K0(δ)n38/97+ε.
This gives the stated bound with Aε=K0(δ).
Every construction included m=0, so requiring m to be positive
preserves all conclusions. □