Skip to content

Section 3.5 · PDF pages 15–16

The finite character balance

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

3.5 The finite character balance

We now give the analytic estimate used to produce the power bound. Its group and its weights vary with the admissible point x. Keeping the threshold independent of these varying objects is the reason for stating the following construction explicitly.

Let H be a finite abelian group, of order n, written additively. Put

Selectable PDF notation • transcription unchecked
Γ = (ℤ/2ℤ)^{2}× H, Φ = {((0, e), h)}, f = |Φ| = 2n,

and put s_{0} = ((1, 0), 0), κ = ((1, 1), 0), e_{1}(t) = s_{0} + (0, t). The partner map is π_{t}(g) = κ + g + (0, t); it bijects Γ \ Φ with Φ. Let χ_{C}((e_{1}, e_{2}), h) = (−1)^{e1}. For T_{2} ⊆H, the thick subset at u is

Selectable PDF notation • transcription unchecked
Θ_{u} = {((0, 1), s + u) : s ∈T_{2}} ⊆Φ, δ_{2} = |T_{2}|/n.

Characters of Γ are homomorphisms to the complex unit circle; their group is denoted Γ̂.

An arithmetic datum assigns to each prime p an inertia subgroup I_{p} ≤Γ and a Frobenius element F_{p} ∈Γ. For r ≥1, set

Selectable PDF notation • transcription unchecked
b_{ψ}(p^{r}) =^{1} ∑ψ(rF_{p} + h), b_{ψ}(m) =∏b_{ψ}(p^{vp(m)}).
^{|Ip|}h∈Ip p|m

Thus |b_{ψ}(m)| ≤1, b_{1}(m) = 1. Fix arbitrary complex numbers ℓ(ψ), and define

Selectable PDF notation • transcription unchecked
{{G∑(y), ψ = 1,
^{GD(ψ; y) =}{ Λ(m)b_{ψ}(m)(y/m −1) + yℓ(ψ), ψ ̸= 1.
m≤y

Only positive y will be used. These definitions agree with the primitive Dirichlet Chebyshev functions when the inertia and Frobenius data come from the host and ℓ is its compatible logarithmic derivative.

Assume that d is prime and S is a finite set of primes with 2, q_{1} ∈S, d /∈S, and

Selectable PDF notation • transcription unchecked
I_{d} = {0, s_{0}}, I_{p} ⊆Φ, F_{p} ∈Φ (p ∈S), I_{p} = 0 (p /∈S ∪{d}).

A prime is called inert in this calculation when p /∈{2, q_{1}, d} and F_{p} /∈ Φ. For a cutoff N ∈ ℕ, A > 0, t ∈H, and a weight function w positive on Φ, define

Selectable PDF notation • transcription unchecked
∑ ∑

ASK(A, t, w) = 2 log p (A/p^{r}−w(π_{t}(rF_{p})))_{+}

Selectable PDF notation • transcription unchecked
_{p}p_{ inert}≤N ∑1_{rF}≤r_{p}≤_{ /∈Φ}N∑

+ log d (A/d^{r}−w(π_{t}g))_{+},

Selectable PDF notation • transcription unchecked
^{1≤r≤N}g−rF^{g /∈}_{d}^{Φ}∈I_{d}

and

Selectable PDF notation • transcription unchecked
( ∑ )

MAIN(A, w) = A(log A −1 −γ + ℓ(χ_{C}) −^{1} log w(ρ)).

Selectable PDF notation • transcription unchecked
^{f}ρ∈Φ

The count ASK is real; the main term may be complex.

Lemma 3.5 (Exact balance). If A/w(ρ) ≤N for every ρ ∈Φ, then

Selectable PDF notation • transcription unchecked
∑∑

ASK(A, t, w) − MAIN(A, w) = ^{1} ψ(g) w(π_{t}g)G_{D}(ψ; A/w(π_{t}g)).

Selectable PDF notation • transcription unchecked
^{f}g /∈Φ_{ψ∈Γ}̂

Proof. Finite character orthogonality gives

Selectable PDF notation • transcription unchecked
_{f}^{1}∑ψ(g) b_{ψ}(p^{r}) =_{|I}^{2}_{|}1_{g−rFp∈Ip}. (18)
ψ∈Γ̂^{p}

Indeed, expand the inertia average; the inner sum over characters is |Γ| if rF_{p} + h = g, and zero otherwise, and |Γ|/f = 2. The orthogonality identity follows, for a finite abelian group, by decomposing it into cyclic groups and summing finite geometric progressions of roots of unity. The same argument shows that it has exactly |Γ| = 2f characters.

Insert (18) into the finite sum over m ≤N of

Selectable PDF notation • transcription unchecked
^{Λ(m)}∑∑ψ(g)b_{ψ}(m)(A/m −w(π_{t}g))_{+}.
^{f} g /∈Φ ψ

Only prime powers m = p^{r} contribute. If p ∈S, then rF_{p}+I_{p} ⊆Φ, so there is no contribution for g /∈Φ. If p /∈S ∪{d}, its coefficient is 21_{g=rFp}; it is zero unless p is inert. For p = d, |I_{d}| = 2 makes the coefficient exactly the indicator in the ramified part of ASK. Terms p^{r}> N vanish since A/w(π_{t}g) ≤N; in particular extending the exponent range to r ≤N, or including the d-term when d > N, adds zero terms. This proves that the finite sum just displayed is ASK(A, t, w).

For W = w(π_{t}g), the inner sum over m is

Selectable PDF notation • transcription unchecked
{

A log A −A log W −(1 + γ)A, ψ = 1,

Selectable PDF notation • transcription unchecked
^{WGD(ψ; A/W) +} −Aℓ(ψ), ψ ̸= 1.

This follows by factoring A/m −W = W((A/W)/m −1) for the nonzero ramp terms. The finite cutoff is legitimate by the same vanishing beyond N. Finally

Selectable PDF notation • transcription unchecked
∑ {⎪{f, ψ = 1,
ψ(g) =⎪−f, ψ = χ_{C},
g /∈Φ {

0, otherwise.

To check it, express the complement indicator as (1 −χ_{C}(g))/2 and apply character orthogonality. The principal correction sums to A log A −(1 + γ)A −(A/f)∑_{ρ∈Φ} log w(ρ), by the partner bijection. The other corrections sum to Aℓ(χ_{C}). Their total is the displayed main term.