Skip to content

Section 3.7 · PDF pages 19–21

The quantitative core inequality

The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.

3.7 The quantitative core inequality

Let K^{′}⊆Ψ(A_{0}) contain the trivial character, and assume ψ(s_{0}) = 1 for every ψ ∈K^{′}. For a real c, define

Selectable PDF notation • transcription unchecked
{

1, ψ is trivial on {0} × H,

Selectable PDF notation • transcription unchecked
w_{c}(ψ) =

c, otherwise,

and put ∑

Selectable PDF notation • transcription unchecked
G_{K}(x) = w_{c}(ψ)ℜG_{D}(ψ; x), Σ(x) = ∑ |G_{D}(ψ; x)|.
ψ∈K^{′} ψ∈Ψ(A_{0})\K^{′}

Assume, with fixed real M, K_{o}, C_{E}, that

Selectable PDF notation • transcription unchecked
||||| ||||| |Ψ(A_{0})| ≤M,
∑ψ(0, t) −c|T| ≤Mx^{−1+ϵ}|T| (ψ ∈K^{′}, ψ|_{{0}×H} ̸= 1), (23)
t∈T

|ℓ(ψ)| ≤K_{o} (1 ̸= ψ ∈K^{′}), |ℓ(ψ)| ≤C_{E} log x (ψ ∈Ψ(A_{0}) \ K^{′}).

Proposition 3.7 (Core inequality). Fix C ≥0, ϵ > 0, C_{E}, K_{o}, M ∈ℝ, and |c| ≤1. There is a threshold x_{1}, depending only on these fixed numbers, such that the following holds for every x ≥x_{1} and every choice of the finite groups, arithmetic data, sets, weights and parameters introduced above. Assume (21), (22), the thin bound, (23), and

Selectable PDF notation • transcription unchecked
a_{E} ≥0, a_{E} ≤2xb, |T| ≥_{2}^{1}x^{−ϵ/8}n, x^{−ϵ}≤|T_{2}|/n ≤1,
x^{1/2−ϵ}≤m ≤x^{1/2+ϵ/2}, xm ≤k ≤n^{2}x^{1/2−ϵ}.

Define the nonnegative bracket

Selectable PDF notation • transcription unchecked
ℰ = |T|a_{E}(1 + m^{2}/k)
(_{|T2|kbx}ϵ)
+ m 2nmbx^{ϵ}+_{n2x−ϵ} .

If

gap(u) ≤x^{Cϵ}ℰ (u ∈A_{0}),

then

Selectable PDF notation • transcription unchecked
G_{K}(x) ≤x^{1/2+(C+3)ϵ}+ Σ(x).

Proof. The constant C_{d} in (19) is absolute. Set

Selectable PDF notation • transcription unchecked
A_{1} = 5 + C_{d} + |K_{o}| + |M|(4 + C_{d} + |K_{o}|) + 4|C_{E}|.

Choose x_{1} ≥3 so large that, for x ≥x_{1},

Selectable PDF notation • transcription unchecked
x^{3ϵ/8}≥26, x^{1/4}≥|M|A_{1}.

These choices are independent of all the subsequently varying data. Write s = x^{1/4}, e = x^{ϵ}, and R = A_{1}se. The estimates log x ≤4s and log(x + 1) ≤5s imply

Selectable PDF notation • transcription unchecked
C_{d} ≤R,
(24)

log(x + 1) + C_{d} + |K_{o}| + |M|x^{−1+ϵ}x(log x + C_{d} + |K_{o}|) ≤R,

log(x + 1) + C_{d} + |C_{E}| log x ≤R.

For example, in the middle line use x^{−1+ϵ}x = e, log x + C_{d} + |K_{o}| ≤(4 + C_{d} + |K_{o}|)s, and s, e ≥1. The other two inequalities follow term by term from the same facts.

For ψ ∈Ψ(A_{0}), put

Selectable PDF notation • transcription unchecked
_{v(ψ) =}{w_{c}(ψ)ℜG_{D}(ψ; x), ψ ∈K^{′},
−|G_{D}(ψ; x)|, ψ /∈K^{′}.

We claim that

Selectable PDF notation • transcription unchecked
|T|(v(ψ) −R)≤∑ℜ(ψ(e_{1}(t))G_{D}(ψ; a_{t}/b)). (25)
t∈T

For the trivial character, this is the first estimate of (19), since |a_{t}/b −x| ≤ 1. For 1 ̸= ψ ∈ K^{′}, let c^{′} = w_{c}(ψ). If ψ is trivial on H, its sum on T equals |T|; otherwise (23) bounds its difference from c|T|. Thus in both cases the difference from c^{′}|T| has modulus at most |M|x^{−1+ϵ}|T|. Since ψ(s_{0}) = 1, we have ψ(e_{1}(t)) = ψ(0, t). Subtract c^{′}|T|G_{D}(ψ; x) from the sum in (25). The resulting complex number is the sum of ∑

Selectable PDF notation • transcription unchecked
ψ(0, t)(G_{D}(ψ; a_{t}/b) −G_{D}(ψ; x))
t∈T

and

Selectable PDF notation • transcription unchecked
∑ψ(0, t) −c^{′}|T|)G_{D}(ψ; x).
t∈T

The first has modulus at most |T|(log(x + 1) + C_{d} + |K_{o}|). For the second, (19) applied between 1 and x, with G_{D}(ψ; 1) = ℓ(ψ), gives

|G_{D}(ψ; x)| ≤x(log x + C_{d} + |K_{o}|).

Their total is at most |T|R by (24); taking real parts proves the claim. For ψ /∈K^{′}, it is nontrivial because 1 ∈K^{′}. The movement estimate bounds each term’s modulus by

|G_{D}(ψ; x)| + log(x + 1) + C_{d} + |C_{E}| log x ≤|G_{D}(ψ; x)| + R.

Its real part is therefore at least v(ψ) −R, which proves the last case of (25).

Summing that inequality over Ψ(A_{0}), and using ∑_{ψ}v(ψ) = G_{K}(x) −Σ(x), gives

Selectable PDF notation • transcription unchecked
|T|(G_{K}(x) −Σ(x) −|Ψ(A_{0})|R)≤∑ℜ ∑ ψ(e_{1}(t))G_{D}(ψ; a_{t}/b).
t∈T ψ∈Ψ(A_{0})

The choice |M|A_{1} ≤s gives |Ψ(A_{0})|R ≤s^{2}e = x^{1/2+ϵ}; in particular it is at most 4x^{1/2+ϵ}, the allowance used in the source. Apply Lemma 3.6 with

Selectable PDF notation • transcription unchecked
Q = |T|mb, δ = |T_{2}|/n, 𝒢 = G_{K}(x) −Σ(x), E = x^{Cϵ}ℰ.

It yields

Selectable PDF notation • transcription unchecked
Q_{2}^{δ}(𝒢 −4x^{1/2+ϵ}) ≤x^{Cϵ}ℰ + 2Q/x. (26)

Here Q > 0, because the hypotheses imply m > 0, |T| > 0 and b > 0.

We give the full scalar estimate. Put

Selectable PDF notation • transcription unchecked
P = x^{Cϵ}, X = x^{1/2+ϵ}, Y = x^{1/2+13ϵ/8}.

Then P, Y ≥1, X ≤Y , and the lower bound for |T| gives n ≤2|T|x^{ϵ/8}. The four terms of ℰ are bounded as follows:

Selectable PDF notation • transcription unchecked
|T|a_{E} ≤2Y Q,
|T|a_{E}m^{2}/k ≤2Q ≤2Y Q,
2nm^{2}bx^{ϵ}≤4Y Q,
m|T_{2}|kbx^{2ϵ}_{≤2Y Q.}
n^{2}

For the first, a_{E} ≤ 2xb and x ≤ x^{1/2+ϵ}m. For the second, use k ≥ xm in addition. For the third, use n ≤2|T|x^{ϵ/8} and m ≤x^{1/2+ϵ/2}; its exponent is 1/2 + ϵ/2 + ϵ + ϵ/8 = 1/2 + 13ϵ/8. For the fourth, use k ≤n^{2}x^{1/2−ϵ}, |T_{2}| ≤n, and again the upper bound for n in terms of |T|. This gives exponent 1/2 + 9ϵ/8, which is no larger than that of Y . Thus ℰ ≤10Y Q.

Divide (26) by Q; since 2/x ≤1 ≤PY ,

Selectable PDF notation • transcription unchecked
δ(𝒢 −4X) ≤22PY.

If 𝒢 −4X ≤0, the desired final bound already follows from the same calculation below. Otherwise multiply the inequality by x^{ϵ}, using x^{ϵ}δ ≥1, to obtain 𝒢 −4X ≤22PY x^{ϵ}. This latter inequality also holds in the nonpositive case. Now PY x^{ϵ}= x^{1/2+(C+21/8)ϵ} and X ≤x^{1/2+(C+21/8)ϵ}. Hence

Selectable PDF notation • transcription unchecked
_{𝒢 ≤26x}1/2+(C+21/8)ϵ_{≤x}3ϵ/8_{x}1/2+(C+21/8)ϵ_{= x}1/2+(C+3)ϵ_{.}

Adding Σ(x) proves the proposition.