Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 4

Iwasawa Theory

Romyar Sharifi

Chapter 4 Cyclotomic fields

Book contents

Chapter 4
Cyclotomic fields

4.1. Dirichlet L-functions

In this section, we summarize, largely without proof, various results regarding L-functions of Dirichlet characters.

Definition 4.1.1.

A multiplicative function χ : ℤ →ℂ is called a Dirichlet character if it is periodic of some period n ≥ 1 and χ(a)≠0 for a ∈ℤ if and only if (a,n) = 1. The integer n is called the modulus of χ.

Example 4.1.2.

There is a unique Dirichlet character 1 which has value 1 at every a ∈ℤ, and it is known as the trivial character.

Definition 4.1.3.

a.

The conductor fχ of a Dirichlet character χ is the smallest integer f dividing its period such that there exists a Dirichlet character ψ of modulus f with χ(a) = ψ(a) for all a ∈ℤ with (a,n) = 1.

b.

We say that a Dirichlet character is primitive if its conductor equals its modulus.

Definition 4.1.4.

We say that a Dirichlet character χ is even (resp., odd) if χ(−1) = 1 (resp., χ(−1) = −1.)

Every character ϕ : (ℤ∕𝑛ℤ)×→ℂ×gives rise to a Dirichlet character χ : ℤ →ℂ of period n with χ(a) = ϕ(a(𝑚𝑜𝑑n)) for a ∈ℤ with (a,n) = 1. The resulting character χ has conductor f, where f is minimal such that ϕ factors through (ℤ∕𝑓ℤ)×.

Definition 4.1.5.

Let ϕ : (ℤ∕𝑛ℤ)×→ℂ×, and suppose that the induced Dirichlet character has conductor f. The primitive Dirichlet character attached to ϕ is the primitive Dirichlet character of conductor f that satisfies ϕ(a) = χ(a′) for a ∈ℤ, (a,f) = 1, where a′∈ℤ is any integer with a′≡ amodf and (a′,n) = 1.

Let F∕ℚ be an abelian field, and let n ≥ 1 be such that F ⊆ℚ(μn). The cyclotomic character then allows us to identify Gal ⁡ (F∕ℚ) with a quotient of (ℤ∕𝑛ℤ)×.

Notation 4.1.6.

The set X(F ) of primitive Dirichlet characters of F ⊆ℚ(μN) consists of the primitive characters of conductor dividing n attached to characters of (ℤ∕𝑛ℤ)× that factor through Gal ⁡ (F∕ℚ).

Remark 4.1.7.

A Dirichlet character χ ∈ X(F ) is even if and only if the associated character on Gal ⁡ (F∕ℚ) is even.

To any Dirichlet character, we can attach an L-series.

Definition 4.1.8.

Let χ be a Dirichlet character. The Dirichlet L-series attached to χ is the complex-valued function on s ∈ℂ with Re ⁡ s > 1 defined by

L(χ,s) = ∑n=1∞χ(n) ns .

Example 4.1.9.

For χ = 1, one has L(1,s) = ζ(s), the Riemann ζ-function.

We note that Dirichlet L-series have Euler product expansions.

Proposition 4.1.10.

One has

L(χ,s) = ∏pprime 1 1−χ(p)p−s

for all s ∈ℂ with Re ⁡ s > 1.

Theorem 4.1.11.

The L-series L(χ,s) has a meromorphic continuation to all of ℂ that is analytic if fχ > 1, while ζ(s) is holomorphic aside from a simple pole at s = 1 with residue 1.

Definition 4.1.12.

The Dirichlet L-function L(χ,s) of a Dirichlet character χ is the meromorphic continuation of the L-series L(χ,s) to ℂ.

Definition 4.1.13.

The Γ-function is the unique meromorphic function on ℂ that satisfies

Γ(s) = ∫ 0∞ts−1e−t𝑑𝑡

for all s ∈ℂ with Re ⁡ s > 0 and

Γ(s+1) = sΓ(s)

for all s for which it is defined.

Remark 4.1.14.

The Γ-function has poles, which are all simple, at exactly the nonpositive integers. It also satisfies Γ(n) = (n−1)! for any positive integer n.

Definition 4.1.15.

The Gauss sum attached to a Dirichlet character χ of modulus n is the value

τ(χ) = ∑a=1nχ(a)e2𝜋𝑖𝑎∕n.

Definition 4.1.16.

For a Dirichlet character χ, we let χ¯ denote its complex conjugate, which satisfies χ¯(a) = χ(a)¯ for all a ∈ℤ.

We mention a couple of basic lemmas regarding Gauss sums that will be of use.

Lemma 4.1.17.

Let χ be a primitive Dirichlet character. Then we have

χ(b)τ(χ¯) = ∑a=1fχχ¯(a)e2𝜋𝑖𝑎𝑏∕fχ

for all b ∈ℤ.

Proof.

If χ(b) = 0, then setting d = (b,fχ) and m = d−1fχ, we have

∑a=1fχχ¯(a)e2𝜋𝑖𝑎𝑏∕fχ = ∑ a=1m∑ c=1dχ¯(a+𝑚𝑐)e2𝜋𝑖𝑎𝑏∕fχ,

and

∑c=1dχ¯(a+𝑚𝑐) = 0

for all a. If χ(b)≠0, then

χ(b)τ(χ¯) = ∑a=1fχχ¯(ab−1)e2𝜋𝑖𝑎∕fχ,

which gives the desired equality upon reordering the sum. □

Lemma 4.1.18.

For a primitive Dirichlet character χ, we have

|τ(χ)| = fχ1∕2.
Proof.

Note that τ(χ)¯ = χ(−1)τ(χ¯). We then have

|τ(χ)| = χ(−1)∑a=1fχχ(a)τ(χ¯)e2𝜋𝑖𝑎∕fχ,

and by Lemma 4.1.17, this equals

χ(−1)∑a=1fχ (∑ b=1fχχ¯(b)e2𝜋𝑖𝑎𝑏∕fχ)e2𝜋𝑖𝑎∕fχ = χ(−1)∑ b=1fχχ¯(b)∑ a=1fχe2𝜋𝑖𝑎(b+1)∕fχ.

The latter sum of exponentials is zero unless b = fχ−1, in which case it is fχ. Hence,

|τ(χ)| = |χ(−1)|2f χ = fχ.

□

Definition 4.1.19.

For a primitive Dirichlet character χ, we set

δχ = (1−χ(−1))∕2, 𝜖χ = τ(χ) iδχfχ, and Λ(χ,s) = (fχ π )s∕2Γ (s+δχ 2 )L(χ,s),

Theorem 4.1.20.

Let χ be a primitive Dirichlet character. Then the L-functions of χ and χ¯ satisfy the functional equation

Λ(χ,s) = 𝜖χΛ(χ¯,1−s)

for all s ∈ℂ.

We give the relationship between Dirichlet L-functions and the Dedekind zeta function of an abelian field.

Proposition 4.1.21.

Let F be an abelian field. Then

ζF (s) = ∏χ∈X(F )L(χ,s).
Proof.

It suffices to check this on s with Re ⁡ s > 1 by uniqueness of the meromorphic continuations. In turn, it suffices to check that for each prime p, we have

∏𝔭∈Vp(F )(1−(𝑁𝔭)−s) = ∏ χ∈X(F )(1−χ(p)p−s). (4.1.1)

As F∕ℚ is Galois, we have 𝑁𝔭 = p−𝑓𝑠, where f is the common residue degree of the primes over p in F, so the lefthand side is just (1−p−𝑓𝑠)g, where g = |Vp(F )|. Note that χ(p) = 0 if p ramified in the fixed field of the kernel of χ. Thus, the product reduces to χ ∈ X(E), where E is the maximal subextension of F∕ℚ that is unramified at p. Viewing χ ∈ X(E) as a Galois character, so χ(p) is the value of χ on the Frobenius at p, which is a generator of a cyclic subgroup of order f in Gal ⁡ (E∕ℚ). Since 𝑓𝑔 = [E : ℚ], there are g characters χ such that χ(f) = ζfi for a fixed primitive fth root of unity ζf and given integer i with 0 ≤ i ≤ f −1. The righthand side of (4.1.1) is then simply

∏i=0f−1(1−ζ fp−s)g = (1−p−𝑓𝑠)g,

as required. □

Corollary 4.1.22.

Let χ be a Dirichlet character with associated primitive character nontrivial. Then L(χ,1)≠0.

Proof.

Since ζF (s) has a simple pole at s = 1, as does L(χ0,s), for χ0 the trivial character of modulus [F : ℚ], while L(χ,s) is analytic for χ≠χ0, this is a direct result of Proposition 4.1.21. □

4.2. Bernoulli numbers

Definition 4.2.1.

For n ≥ 0, the nth Bernoulli number Bn is the value of the nth derivative of tet −1 at 0.

In other words, Bn is the rational number appearing in the Taylor expansion

t et−1 = ∑n=0∞B ntn n!

Example 4.2.2.

We have

et−1 t = ∑n=0∞ tn (n+1)! = 1+ 1 2t + 1 6t2 +⋯,

so B0 = 1, B1 = −12, and B2 = 1 6 after inverting the series.

Remark 4.2.3.

Note that

−t e−t−1 = tet et−1 = t et−1 +t,

so

t et−1 + 1 2t

is an even function, and therefore we have Bn = 0 for all odd n ≥ 2.

We shall require generalizations of these numbers attached to Dirichlet characters.

Definition 4.2.4.

Let χ be a primitive Dirichlet character, and let m be any multiple of fχ. Then the generalized Bernoulli number Bn,χ is the algebraic number appearing in the series expansions

∑a=1mχ(a) te𝑎𝑡 e𝑚𝑡−1 = ∑n=0∞B n,χtn n!.

Remark 4.2.5.

The independence from m in the definition of Bn,χ is easily seen to boil down to the fact that

∑i=0r−1 xi xr−1 = 1 x−1,

taking r = m∕fχ and x = efχt.

Remark 4.2.6.

We have Bn,1 = Bn for all n ≥ 2, but B1,1 = 1 2 = −B1.

Remark 4.2.7.

We have that Bn,χ = 0 for n≢δχmod2, aside from B1,1.

We also have Bernoulli polynomials.

Definition 4.2.8.

The nth Bernoulli polynomial Bn(X) ∈ℚ[X] is the polynomial appearing in the series expansion

te𝑋𝑡 et−1 = ∑n=0∞B n(X)tn n!.

Example 4.2.9.

We have B0(X) = 1 and B1(X) = X −1 2.

Lemma 4.2.10.

Let χ be a primitive Dirichlet character, and let m be a multiple of fχ. We have

Bn,χ = mn−1∑ a=1mχ(a)B n( a m)

for n ≥ 1.

Proof.

We have

∑n=0∞mn−1∑ a=1mχ(a)B n ( a m ) tn n! = ∑a=1mχ(a)m−1∑ n=0∞B n ( a m ) (𝑚𝑡)n n! = ∑a=1mχ(a) te𝑎𝑡 e𝑚𝑡−1.

□

Corollary 4.2.11.

Let χ be a primitive, nontrivial Dirichlet character of conductor dividing m. Then we have

B1,χ = 1 m∑a=1mχ(a)a.
Proof.

We compute easily that B1(x) = x−1∕2. The result then follows from Lemma 4.2.10 and the fact that the sum over all χ(a) for 1 ≤ a ≤ m is zero, since χ is nontrivial. □

Definition 4.2.12.

A value of L(χ,s) at s ∈ℤ is known as an L-value, or as a special value of the L-function L(χ,s).

The following proposition gives a relationship between L-values and generalized Bernoulli numbers.

Proposition 4.2.13.

Let χ be a primitive Dirichlet character. Then we have

L(χ,1−n) = −Bn,χ n

for all positive integers n.

Proof.

Let x ∈ℝ with 0 < x ≤ 1, and consider the complex function

f(t) = te(1−x)t et−1 = ∑n=0∞B n(1−x)tn n!.

For s ∈ℂ, set

g(s) = lim ⁡ 𝜖→0+ ∫ γ𝜖f(t)ts−2𝑑𝑡,

where the path γ𝜖 consists of the horizontal infinite path along the real axis to 𝜖, following by a counterclockwise traversal around the circle C𝜖 of radius 𝜖, followed by the horizontal infinite path from 𝜖 along the positive real axis. Here, ts−2 = e(s−2)log⁡t, where we take the branch of the logarithm given by the positive real axis. Then

g(s) = lim ⁡ 𝜖→0+ ((e2𝜋𝑖𝑠−1)∫ 𝜖∞f(t)ts−2𝑑𝑡 +∫ C𝜖f(t)ts−2𝑑𝑡).

If Re ⁡ s > 1, the second term vanishes in the limit, and this simplifies to

(e2𝜋𝑖𝑠−1)−1g(s) = ∫ 0∞f(t)ts−2𝑑𝑡 = ∑ k=0∞∫ 0∞ts−1e−(x+k)t𝑑𝑡 = ∑ k=0∞(x+k)−sΓ(s) = Γ(s)ζ(s,x),

where we set ζ(s,x) = ∑ ⁡k=0∞(x+k)−s. The latter function can be meromorphically continued to all of ℂ which is again analytic away from s = 1. We therefore have

g(s) = (e2𝜋𝑖𝑠−1)Γ(s)ζ(s,x)

for all s ∈ℂ−{1}.

For s = 1−n, we obtain

lim ⁡ s→1−n(e2𝜋𝑖𝑠−1)Γ(s)ζ(s,x) = lim ⁡ 𝜖→0+ ∫ C𝜖f(t)t−1−n𝑑𝑡 = 2𝜋𝑖⋅Bn(1−x) n!

by Cauchy’s integral formula. We have

lim ⁡ s→1−n(e2𝜋𝑖𝑠−1)Γ(s) = 2𝜋𝑖lim ⁡ s→1−nsΓ(s) = 2𝜋𝑖(−1)n−1 (n−1)! ,

so we obtain

ζ(1−n,x) = (−1)n−1Bn(1−x) n = −Bn(x) n .

Finally, setting f = fχ, we need only note that

L(χ,1−n) = ∑a=1fχ(a)fn−1ζ(1−n,a f ) = −1 n∑a=1fχ(a)fn−1B n(a f ) = −Bn,χ n .

□

Theorem 4.2.14.

Let χ be a nontrivial primitive Dirichlet character. We have

L(χ,1) = { 𝜋𝑖𝜏(χ) fχ B1,χ¯  if χ is odd, −τ(χ) fχ ∑a=1fχχ¯(a)log⁡|1−e2𝜋𝑖𝑎∕fχ|if χ is even .
Proof.

If χ is odd, then the functional equation and the fact that Γ(1∕2) = π1∕2 imply that

L(χ,1) = −𝜋𝑖𝜏(χ) fχ L(χ¯,0) = 𝜋𝑖𝜏(χ) fχ B1,χ¯.

Now let χ be even, and set f = fχ. By Lemma 4.1.17, we then have

L(χ,1) = ∑n=1∞χ(n) n = ∑n=1∞ 1 τ(χ¯)∑a=1fχ¯(a)e2𝜋𝑖𝑎𝑛∕f n = − 1 τ(χ¯)∑a=1fχ¯(a)log⁡(1−e2𝜋𝑖𝑎∕f).

By Lemma 4.1.18 (and Lemma 4.1.17), we have that τ(χ¯)τ(χ) = f, and the evenness of χ¯ plus the fact that the sum is taken over all a mod f tell us that we may replace log⁡(1−e2𝜋𝑖𝑎∕f) with

log⁡|1−e2𝜋𝑖𝑎∕f| = 1 2(log⁡(1−e2𝜋𝑖𝑎∕f)+log⁡(1−e2𝜋𝑖(f−a)∕f)).

□

Combining the analytic class number formula with Proposition 4.1.21 and Theorem 4.1.11, we obtain the following, which we will at times also refer to as the analytic class number formula.

Corollary 4.2.15.

Let F be an abelian field. Then we have

∏ χ∈X(F ) χ≠1 L(χ,1) = 2r1(F )(2π)r2(F )hF RF wF |dF |1∕2 .

We note the following.

Lemma 4.2.16.

Let F be a CM field. Set QF = [EF : μ(F )EF +]. Then QF ∈{1,2} and

[EF : EF +] = QF 2 wF .
Proof.

Let τ be the generator of Gal ⁡ (F∕F+). For α ∈ EF , we have |α1−τ| = 1 under any complex embedding of F, so α1−τ ∈ μ(F ). Consider the commutative diagram

Units and roots of unity in a CM field. A full diagram description follows.
Diagram description: Units and roots of unity in a CM field

The structural squares and triangles displayed here commute.

Objects, listed by row and column:

  • Row 1, from left to right: column 2: 1; column 3: 1; column 4: 1.
  • Row 2, from left to right: column 1: 1; column 2: left angle bracket minus 1 right angle bracket; column 3: mu (F); column 4: mu (F) superscript (2); column 5: 1.
  • Row 3, from left to right: column 1: 1; column 2: E subscript (F) superscript (plus); column 3: E subscript (F); column 4: mu (F).
  • Row 4, from left to right: column 1: 1; column 2: E subscript (F) superscript (plus) / left angle bracket minus 1 right angle bracket; column 3: E subscript (F) / mu (F); column 4: mu (F) / mu (F) superscript (2).
  • Row 5, from left to right: column 2: 1; column 3: 1; column 4: 1.

Arrows and lines:

  1. An arrow from 1 (row 1, column 2) to left angle bracket minus 1 right angle bracket, without a label.
  2. An arrow from 1 (row 1, column 3) to mu (F) (row 2, column 3), without a label.
  3. An arrow from 1 (row 1, column 4) to mu (F) superscript (2), without a label.
  4. An arrow from 1 (row 2, column 1) to left angle bracket minus 1 right angle bracket, without a label.
  5. An arrow from left angle bracket minus 1 right angle bracket to mu (F) (row 2, column 3), without a label.
  6. An arrow from left angle bracket minus 1 right angle bracket to E subscript (F) superscript (plus), without a label.
  7. An arrow from mu (F) (row 2, column 3) to mu (F) superscript (2), without a label.
  8. An arrow from mu (F) (row 2, column 3) to E subscript (F), without a label.
  9. An arrow from mu (F) superscript (2) to 1 (row 2, column 5), without a label.
  10. An arrow from mu (F) superscript (2) to mu (F) (row 3, column 4), without a label.
  11. An arrow from 1 (row 3, column 1) to E subscript (F) superscript (plus), without a label.
  12. An arrow from E subscript (F) superscript (plus) to E subscript (F), without a label.
  13. An arrow from E subscript (F) superscript (plus) to E subscript (F) superscript (plus) / left angle bracket minus 1 right angle bracket, without a label.
  14. An arrow from E subscript (F) to mu (F) (row 3, column 4), labelled 1 minus tau.
  15. An arrow from E subscript (F) to E subscript (F) / mu (F), without a label.
  16. An arrow from mu (F) (row 3, column 4) to mu (F) / mu (F) superscript (2), without a label.
  17. An arrow from 1 (row 4, column 1) to E subscript (F) superscript (plus) / left angle bracket minus 1 right angle bracket, without a label.
  18. An arrow from E subscript (F) superscript (plus) / left angle bracket minus 1 right angle bracket to E subscript (F) / mu (F), without a label.
  19. An arrow from E subscript (F) superscript (plus) / left angle bracket minus 1 right angle bracket to 1 (row 5, column 2), without a label.
  20. An arrow from E subscript (F) / mu (F) to mu (F) / mu (F) superscript (2), labelled 1 minus tau.
  21. An arrow from E subscript (F) / mu (F) to 1 (row 5, column 3), without a label.
  22. An arrow from mu (F) / mu (F) superscript (2) to 1 (row 5, column 4), without a label.

The snake lemma tells us that the cokernels K of the two maps τ −1 are isomorphic. The lower two rows yield

[EF : EF +] = wF |K| and [EF : μ(F )EF +] = 2 |K|,

and the result follows. □

We remark that for cyclotomic fields, QF is computable.

Lemma 4.2.17.

Let F = ℚ(μm) for some m ≥ 1 with m≢2mod4. Then

QF = { 1misaprimepower 2 otherwise .
Proof.

Let τ be the generator of Gal ⁡ (F∕F+). Note that

QF = 2|coker ⁡ (EF →1−τμ(F ))|−1

by the proof of Lemma 4.2.16. If m is not a prime power, then 1−ζm is a unit, and (1−ζm)1−τ = −ζm, which generates μ(F ). Thus QF = 2 in this case. Conversely, if α1−τ = −ζm generates μ(F ) for some α ∈ EF , we would have α−1(1−ζm) ∈ F+. If m were a power of a prime p, then α−1(1−ζm) would generate the unique prime over p in F. Since this prime is ramified in F∕F+, its generator cannot lie in F+. This forces QF to be 1 if m is a prime power. □

Notation 4.2.18.

For a CM field F, we set RF + = RF+

Lemma 4.2.19.

Let F be a CM field. Then

RF = 2r2(F )−2 wF [EF : EF +]RF +.
Proof.

Let

r = r2(F )−1 = rank ⁡ EF = rank ⁡ EF +.

Suppose that α1,α2,…,αr ∈ EF + satsify

⟨−1,α1,α2,…,αr⟩ = EF +.

Then

μ(F )⋅⟨α1,α2,…,αr⟩ = μ(F )EF +,

which has index 2[EF : EF +]∕wF in EF , so Lemma 1.2.9 tells us that

RF = wF 2[EF : EF +]RF (α1,α2,…,αr).

On the other hand, note that each ci in Definition 1.2.4 is 2 for F but 1 for F+, so

RF (α1,α2,…,αr) = 2rR F +,

as desired. □

Corollary 4.2.15 implies the following.

Theorem 4.2.20.

Suppose that F is a CM abelian field. Then

hF − = 2[E F : EF +]∏ χ∈X(F ) χodd −B1,χ 2 and hF + = 1 RF +∏ χ∈X(F ) χ≠1even ( −1 2 ∑a=1fχχ(a)log⁡|1−e2𝜋𝑖𝑎∕fχ|).
Proof.

Let E be an arbitrary abelian field. We remark that for χ ∈ X(E), the quantity fχ is the conductor of the corresponding character (ℤ∕fχℤ)×→ℂ×. Therefore, the conductor-discriminant fomula tells us that

|dE| = ∏χ∈X(E)fχ. (4.2.1)

Moreover, a comparison of the functional equations of the Dirichlet L-functions and the Artin L-functions yields that

∏χ∈X(E)𝜖χ = 1,

so

∏χ∈X(E)τ(χ) = ir2(E)|d E|1∕2. (4.2.2)

Taking the quotient of the analytic class number formula for F by that for F+ and applying Theorem 4.2.14, we obtain

∏ χ∈X(F ) χ odd 𝜋𝑖𝜏(χ) fχ B1,χ¯ = πr2(F ) |dF ∕dF+|1∕2 RF ∕RF + wF ∕wF+ hF −. (4.2.3)

Applying (4.2.1) and (4.2.2) for E = F and E = F+, we see that

∏ χ∈X(F ) χ odd 𝜋𝑖𝜏(χ) fχ = (−π)r2(F ) |dF ∕dF+|1∕2,

and Lemma 4.2.19 tells us that

RF ∕RF + wF ∕wF+ = 2r2(F )−1[E F : EF +],

since wF+ = 2. Equation (4.2.3) is then immediately reduced to the desired form.

On the other hand, the analytic class number formula for F+ and Theorem 4.2.14,

∏ χ∈X(F ) χ≠1even (−τ(χ) fχ ∑a=1fχχ¯(a)log⁡|1−e2𝜋𝑖𝑎∕fχ|) = 2r1(F+)hF +RF + 2|dF+|1∕2 ,

Applying (4.2.1) and (4.2.2) and noting that replacing χ¯(a) by χ(a) in the resulting sum makes no difference in the result, we obtain the formula for hF +. □

4.3. Cyclotomic units

The product appearing in the formula for hF + in Theorem 4.2.20 may appear itself something like a regulator. This is essentially the case.

Definition 4.3.1.

If F is an abelian field contained in ℚ(μm) for m ≥ 1, we let S = V𝑚∞ and define the group of cyclotomic S-units CF,S of F to be the subgroup

CF,S = ⟨1−ζma∣1 ≤ a < m⟩∩F×

of 𝒪F,S×, where ζm is a primitive mth root of unity. The group of cyclotomic units of F is then defined as the intersection CF = EF ∩CF,S.

Remark 4.3.2.

The definition of CF is independent of the multiple m of the conductor of F+.

We have the following result of Hasse, which is due to Kummer in the case of ℚ(μp) for a prime p. We will prove a generalization of this result to arbitrary cyclotomic fields in Theorem 4.7.1.

Theorem 4.3.3 (Hasse).

Let F = ℚ(μpn) for an odd prime p and n ≥ 1. Then we have

hF + = [E F + : C F +].
Proof.

The set

{ξa = ζpna∕2 −ζpn−a∕2 ζpn1∕2 −ζpn−1∕2|1 < a < pn∕2,(a,p) = 1}

forms an independent set of generators of CF +. Let us let Rcyc denote the regulator of the latter set. Then Rcyc is the absolute value of the determinant of the matrix with rows and columns indexed by the integers a prime to p with 1 < a < pn∕2 with entries in the row and column corresponding to (a,b) given by log⁡|σa(ξb)|, where σa(ζpn) = ζpna. Now

log⁡|σa(ξb)| = log⁡|1−ζpn𝑎𝑏|−log⁡|1−ζ pna|.

Proposition 1.5.18 applied to the group Gal ⁡ (F+∕ℚ) yields

Rcyc = |∏ χ∈X(F+) χ≠1 (∑b=1 (b,p)=1 pn∕2−1χ(b)log⁡|1−ζ pnb|)| = |∏ χ∈X(F+) χ≠1 1 2∑c=1 (c,p)=1 pn−1χ(c)log⁡|1−ζ pnc||.

As χ has conductor dividing pn and

1−ζnc = ∏ j=0k−1(1−ζ 𝑛𝑘c+𝑗𝑘)

for n,k ≥ 1 and c≢0modn, we have

∑c=1 (c,p)=1 pn−1χ(c)log⁡|1−ζ pnc| = ∑ c=1 (c,p)=1 fχ−1χ(c)log⁡|1−ζ fχc|,

the middle step by Theorem 4.2.14. By Theorem 4.2.20, it then follows that Rcyc = hF +RF +. On the other hand, we have Rcyc = RF +[EF + : CF +] by Lemma 1.2.9. □

A standard choice of primitive mth roots of unity for m ≥ 1, viewing ℚ¯ as a subset of ℂ, is to take ζm = e2𝜋𝑖∕m for m ≥ 1. This choice has the advantage that ζnn∕m = ζm for m dividing n. Let us make such a choice. We first remark that the elements 1−ζm for m divisible by two distinct primes are in fact units.

Lemma 4.3.4.

If m is divisible by two distinct primes, then 1−ζm ∈ Cℚ(μm).

Proof.

For a positive integer d, let Φd denote the dth cyclotomic polynomial. We have

Φm(1) = ∏i=1 (i,m)=1 m(1−ζ mi),

so it suffices to show that Φm(1) = ±1. We have

xm−1 x−1 = ∏d∣m d>1 Φd(x).

Plugging in x = 1, we obtain

m = ∏d∣m d>1 Φd(1).

Note Φpk(1) = pk for any power pk of a prime p. Expressing m = ∏ ⁡i=1gpiki as a product of powers of distinct primes pi, we then also have

m = ∏i=1gΦ piki(1).

Since each Φd(1) is an integer, it follows that Φm(1) = ±1, as desired. □

Next, we note the following the compatibility of the elements 1−ζm under norms.

Lemma 4.3.5.

For m ≥ 1 and a prime ℓ, we have

Nℚ(μ𝑚ℓ)∕ℚ(μm)(1−ζ𝑚ℓ) = { 1−ζm if ℓ∣m, −ζmℓ−1 1−ζm 1−ζmℓ−1 if ℓ ∤ m.
Proof.

Note that

∏i=1ℓ(1−ζ 𝑚ℓζℓi) = 1−ζ m.

If ℓ divides m, then the left-hand side runs over the conjugates of 1−ζ𝑚ℓ under Gal ⁡ (ℚ(μ𝑚ℓ)∕ℚ(μm)), so the product equals the norm.

If ℓ does not divide m, then let a,b ∈ℤ with 𝑎ℓ+𝑏𝑚 = 1. We then have ζmaζℓb = ζ𝑚ℓ, so the conjugates of ζ𝑚ℓ have the form ζ𝑚ℓζℓi with i≢−bmodℓ. Note that b ≡ m−1 modℓ, so moving this term from the product to the other side, we have

Nℚ(μmℓ)∕ℚ(μm)(1−ζ𝑚ℓ) = 1−ζm 1−ζm−ℓ−1 = −ζmℓ−1 1−ζm 1−ζmℓ−1 .

□

4.4. Reflection theorems

We now refine Theorem 1.4.15 by working with eigenspaces. Start with a totally real field F. Let

χ : GF →ℚ¯×

be a character with finite image. Any embedding φ of F¯ in ℂ fixes an element cφ ∈ GF that is the restriction of complex conjugation in Gal ⁡ (ℂ∕ℝ), since F is taken to a subfield of ℝ under the embedding. All such complex conjugations in GF arise in this way, and they form [F : ℚ] distinct conjugacy classes in Gℚ for the real embeddings of F in F¯ = ℚ¯. In GF ab, these complex conjugations restrict to exactly [F : ℚ] distinct elements, with the elements of the same class restricting to the same element.

Definition 4.4.1.

We say that a character χ : GF →ℚ¯× of a totally real field F is totally even if χ is trivial on all complex conjugations and totally odd if χ is nontrivial on all complex conjugations. If F = ℚ, we say more simply that χ is even or odd in the respective cases.

We let Fχ denote the extension of F that is the fixed field of the kernel of χ, which will itself be totally real if χ is totally even and CM if χ is totally odd. If F = ℚ, these are the only cases.

We now suppose that χ has order prime to a given odd prime p. We fix an embedding ιp: ℚ¯ →ℚp¯, which allows us to view χ as a character with values in ℚp¯×, and hence in ℤp¯×.

One key character of interest to us is the Teichmüller character

ω : GF →ℚp×

which has image contained in μp−1(ℤp) and is defined by the equality

σ(ζ) = ζω(σ)

for any σ ∈ GF and ζ ∈ μp. Note that the Teichmüller character is an odd character on GF .

Theorem 4.4.2 (Leopoldt’s Spiegelungsatz).

Let F be a totally real field, and let χ : GF →ℚp¯× be a totally odd character of finite order prime to p. Let E be an abelian extension of F of degree prime to p that contains Fχ(μp). Then we have

rp(AE(ωχ−1))−δ χ ≤ rp(AE(χ)) ≤ r p(AE(ωχ−1))+r p((𝒪E×∕𝒪 E×p)(ωχ−1)),

where δχ is 0 unless χ = ω and the extension E(μ(F )1∕p)∕E is unramified, in which case it is 1.

Proof.

Let Δ = Gal ⁡ (E∕F ). Let 𝒪 be the ring generated over ℤp by the character values of Δ. Let k denote the residue field of 𝒪, and let kψ denote the residue field of 𝒪ψ, the ring of values of ψ, for any ψ ∈Δ∗. As 𝒪 is unramified over ℤp, we have [𝒪 : 𝒪ψ] = [k : kψ].

For a ℤp[Δ]-module B, we let B𝒪 = B⊗ℤp𝒪. We remark that Lemma 2.8.7 implies that

rp(B𝒪ψ) = [k : k ψ]rp(B(ψ)).

Note also that we have

rp(B𝒪ψ) = [k : 𝔽 p]dim⁡k((B∕𝑝𝐵)𝒪ψ),

so

rp(B(ψ)) = [k ψ : 𝔽p]−1dim⁡ k((B∕𝑝𝐵)𝒪ψ). (4.4.1)

Since 𝒪χ = 𝒪ωχ−1 and since δχ = 0 unless χ = ω, in which case kχ = 𝔽p, equation (4.4.1) tells us that the desired inequalities are equivalent to

dim⁡k(A𝒪ωχ−1)−δ χ ≤dim⁡k(A𝒪χ) ≤dim⁡ k(A𝒪ωχ−1)+dim⁡ k((𝒪E×∕𝒪 E×p) 𝒪ωχ−1),

where we have set A = AE∕pAE to shorten notation.

Note that we have the following isomorphisms of groups

Hom ⁡ ℤp(AE,μp)𝒪≅Hom ⁡ ℤp(AE,(μp)𝒪)≅Hom ⁡ 𝒪((AE)𝒪,(μp)𝒪)

the first step following from the freeness of 𝒪 over ℤp and the second from the adjointness of Hom ⁡ and ⊗. Moreover, Lemma 2.8.7 implies that

Hom ⁡ 𝒪((AE)𝒪,(μp)𝒪)ψ≅Hom ⁡ 𝒪((AE)𝒪ωψ−1,(μ p)𝒪)

for any ψ ∈Δ∗. Recalling Lemma 1.4.6, we then have an exact sequence

0 → ((B∩𝒪E×)∕𝒪 E×p) 𝒪ψ → Hom ⁡ 𝒪((AE)𝒪ωψ−1,(μ p)𝒪) → (AE)𝒪ψ[p],

where B is the set of elements of E×that have pth roots that generate unramified extensions of E. Since (μp)𝒪 is a one-dimensional k-vector space, we have

Hom ⁡ 𝒪((AE)𝒪ωψ−1,(μ p)𝒪)≅Hom ⁡ k(A𝒪ωψ−1,k),

which as the k-dual of a k-vector space has dimension equal to dim⁡k(A𝒪ωψ−1 ).

In the case that ψ = χ, we then have that

dim⁡k(A𝒪ωχ−1) ≤dim⁡ k(((B∩μ(E))∕μ(E)p) 𝒪χ)+dim⁡ k(A𝒪(χ)) = δ χ+dim⁡k(AE(χ)),

since the p-power roots of unity in E have trivial χ-eigenspace unless [χ] = [ω], which happens if and only if χ = ω, as ω takes its values in ℤp. On the other hand, if we take ψ = ωχ−1, then we have

dim⁡k(A𝒪χ) ≤dim⁡ k((𝒪E×∕𝒪 E×p) 𝒪ωχ−1)+dim⁡ k(A𝒪ωχ−1),

finishing the proof. □

In the special case that F = ℚ and E = ℚ(μp), we remark that δω = 0, as ℚ(μp2)∕F is ramified at the unique prime over p. Moreover, we have the following.

Lemma 4.4.3.

Let k be an even integer. Then

(𝒪ℚ(μp)×⊗ℤℤ p)(ωk)≅ { ℤpk≢0mod(p−1) 0 k ≡ 0mod(p−1) .

Corollary 4.4.4.

For any even integer k, we have

rp(Aℚ(μp)(ωk)) ≤ r p(Aℚ(μp)(ω1−k)) ≤ r p(Aℚ(μp)(ωk))+1.

Corollary 4.4.5.

We have Aℚ(μp)(ω) = Aℚ(μp)(1) = 0.

Proof.

We know that

Aℚ(μp)(1) = A ℚ(μp)Gal ⁡ (ℚ(μp)∕ℚ)≅Aℚ = 0.

As Theorem 4.4.2 and Lemma 4.4.3 tell us that rp(Aℚ(μp)(1)) = rp(Aℚ(μp)(ω)), so we are done. □

4.5. Stickelberger theory

Let us fix an integer m ≥ 1 and a primitive mth root of unity ζm throughout this section.

Definition 4.5.1.

Let F = ℚ(μm), and let G = Gal ⁡ (F∕ℚ).

a.

For a ∈ℤ with (a,m) = 1, let σa ∈ G be such that σa(ζm) = ζma. The Stickelberger element 𝜃F is the element of ℚ[G] given by

𝜃F = 1 m∑a=1 (a,m)=1 maσ a−1.
b.

The Stickelberger ideal of F is the ideal IF = ℤ[G]𝜃F ∩ℤ[G] of ℤ[G].

Lemma 4.5.2.

Let J denote the ideal of ℤ[G] generated by elements of the form σb−b for b ∈ℤ with (b,m) = 1. Then J = {x ∈ℤ[G]∣x𝜃F ∈ℤ[G]}.

Proof.

Let us use ⟨α⟩ to denote the fractional part of α ∈ℚ. We note

σb𝜃F = ∑a=1 (a,m)=1 m a mσbσa−1 = ∑ a=1 (a,m)=1 m ⟨𝑎𝑏 m ⟩σa−1.

Since ⟨𝑎𝑏m⟩−⟨am⟩b ∈ℤ, we have (σb−b)𝜃F ∈IF for all b ∈ℤ prime to m, and hence J𝜃F ⊆ℤ[G].

Now take x = ∑ ⁡bebσb with x𝜃F ∈ℤ[G]. Writing this out, we have

∑a=1 (a,m)=1 m(∑ b=1 (b,m)=1 me b ⟨𝑎𝑏 m ⟩)σa−1 ∈ℤ[G],

which implies that

∑b=1 (b,m)=1 me bb∈𝑚ℤ.

But note that m = (m+1)−σ1 ∈ J, so 𝑚ℤ ⊂ J. We then have

x = ∑b=1 (b,m)=1 me b(σb−b)+∑b=1 (b,m)=1 me bb∈J,

finishing the proof. □

Definition 4.5.3.

Let q be a power of a prime ℓ and χ : 𝔽q×→ℂ× be a character, which we extend to a function χ : 𝔽q →ℂ by χ(0) = 0. The Gauss sum attached to χ is

g(χ) = −∑α∈𝔽q×χ(α)e2𝜋𝑖Tr ⁡ (α)∕ℓ

where Tr ⁡ = Tr ⁡ 𝔽q∕𝔽ℓ is the trace map.

Lemma 4.5.4.

Let q be a power of a prime ℓ prime to m. Let χ : 𝔽q×→ μm be a character, so g(χ) ∈ℚ(μℓ𝑚). Let b ∈ℤ be relatively prime to m, and let σb ∈ Gal ⁡ (ℚ(μℓ𝑚)∕ℚ(μℓ)) be the unique lift of σb ∈ G. Then

g(χ)σb−b ∈ℚ(μ m).

In particular, we have g(χ)m ∈ℚ(μm).

Proof.

For τ ∈ Gal ⁡ (ℚ(μℓ𝑚)∕ℚ(μm)) with τ(ζℓ) = ζℓc, we have

g(χ)τ = −∑ α∈𝔽qχ(α)e2𝜋𝑖Tr ⁡ (𝑐𝛼)∕ℓ = χ(c)−1g(χ).

On the other hand, we have g(χ)σb = g(χb) as σb fixes μℓ, so we see that

(g(χ)σb−b)τ = g(χb)τg(χ)−𝑏𝜏 = χb(c)−1χ(c)−bg(χ)σb−b = g(χ)σb−b,

as desired. □

Lemma 4.5.5.

Let q be a power of a prime ℓ and χ : 𝔽q×→ℂ× be a character. Then

g(χ)g(χ¯) = χ(−1)ℓ.

We state Stickelberger’s theorem for F = ℚ(μm). A similar result holds for abelian fields in general.

Theorem 4.5.6 (Stickelberger).

Let F = ℚ(μm), set G = Gal ⁡ (F∕ℚ). Then the Stickelberger ideal of F annihilates the class group: IF ⋅Cl ⁡ F = 0.

Proof.

Fix C ∈ Cl ⁡ F , and let 𝔩 be a prime ideal representing C in 𝒪F that lies above a completely split prime ℓ of ℚ. Note that ℓ ≡ 1modm, and let c ∈ℤ be a primitive root modulo ℓ. Let χ : 𝔽ℓ×→ℂ× denote the character with χ(c) = e2𝜋𝑖∕m. There is unique prime 𝔏 of ℚ(μℓ𝑚) lying above 𝔩, and 𝔏ℓ−1 = 𝔩⋅ℤ[μℓ𝑚]. We use v𝔏 to denote the additive valuation attached to 𝔏. For b ∈ℤ prime to m, and σb ∈ Gal ⁡ (ℚ(μℓ𝑚)∕ℚ(μℓ)) the unique lift of σb ∈ Gal ⁡ (F∕ℚ), we set

tb = vσb−1𝔏(g(χ)).

By Lemma 4.5.5, we have that g(χ)∣(ℓ), so tb ≤ ℓ−1, and by Lemma 4.5.4, we have in the smaller field F that

vσb−1𝔩(g(χ)ℓ−1) = t b.

In other words, we have the factorization

g(χ)ℓ−1𝒪 F = ∏b=1 (b,m)=1 m(σ b−1𝔩)tb,

so

∑b=1 (b,m)=1 mt bσb−1

annihilates the class of 𝔩.

Now take τ ∈ Gal ⁡ (F (μℓ)∕F ) given by τ(ζℓ) = ζℓc. Then since every prime over ℓ is totally ramified F (μℓ)∕F, we have that τ is in the inertia group of all such primes. Note that

vσb−1𝔏(ζℓ−1) = 1

for all b. We calculate

g(χ) (ζℓ−1)tb ≡ g(χ)τ (ζℓc−1)tb ≡ χ(c)−1g(χ) ctb(ζℓ−1)tb modσb−1𝔏.

This forces e2𝜋𝑖∕m ≡ c−tb modσb−1𝔏 and therefore modulo σb−1𝔩, since both sides of the latter congruence lie in F. In other words, we have

e2𝜋𝑖𝑏∕m ≡ c−tb mod𝔩.

On the other hand, there exists some a prime to m such that

e2𝜋𝑖∕m ≡ c−(ℓ−1)a∕mmod𝔩.

We therefore have that

tb ≡(ℓ−1)𝑎𝑏 m mod(ℓ−1),

forcing

tb = (ℓ−1) ⟨𝑎𝑏 m ⟩.

It follows that

(ℓ−1)∑b=1 (n,m)=1 m ⟨𝑎𝑏 m ⟩σb−1 = (ℓ−1)σ a𝜃F

annihilates C.

Now suppose x ∈ℤ[G] is such that x𝜃F ∈IF . We then have

(g(χ)σa−1x)ℓ−1𝒪 F = 𝔩(ℓ−1)x𝜃F .

By Lemmas 4.5.2 and 4.5.4, we have g(χ)σa−1x ∈ F. Therefore, the identity

(g(χ)σa−1x)𝒪 F = 𝔩x𝜃F

actually holds, and so we see that x𝜃F annihilates C. So, IF annihilates C, and we are done. □

This has an interesting application for the field ℚ(μp).

Theorem 4.5.7 (Herbrand).

Let p be an odd prime, and set F = ℚ(μp). Let j≢1modp−1 be an odd integer, and suppose that AF (ωj) ≠0. Then B1,ω−j ∈ pℤp. Moreover, we have AF (ω) = 0.

Proof.

By Stickelberger’s theorem, we have that IF ⋅AF = 0. In particular, we have that Ij = eωjIF annihilates AF (ωj) , where eωj ∈ℤp[G] is the idempotent attached to ωj. Note that for, b prime to p, we have

eωj(σb−b)𝜃F = (ωj(b)−b)1 p∑a=1p−1aω−j(a)e ωj = (ωj(b)−b)B 1,ω−jeωj,

where we have applied Corollary 4.2.11 in the last step. It follows that (ωj(b)−b)B1,ω−j annihilates AF (ωj) for all b prime to p. Choosing b to be a primitive root of 1, we have that ωj(b)≢bmodp, so if AF (ωj) is nontrivial, then B1,ω−j must be divisible by p. For j = 1, we note that

(ωj(1+p)−(1+p))B 1,ω−1 = −pB1,ω−1 = −∑i=1pω(a)−1a ≡ 1modp,

so we get that 1 annihliates AF (ω), hence the result. □

As with the plus part, the minus part of the class number of a cyclotomic field of prime power roots of unit can be interpreted as an index, as in the following result of Iwasawa. The proof is deferred to its generalization to arbitrary cyclotomic fields in Theorem 4.7.1.

Theorem 4.5.8 (Iwasawa).

Let F = ℚ(μpn) for a prime p and n ≥ 1. Then

hF − = [ℤ[G]− : I F −].

4.6. Distributions

Definition 4.6.1.

Let {Xi∣i ∈ I} be a collection of finite sets, were I is a directed set under ≤, and let π𝑖𝑗: Xi → Xj for i ≥ j be a collection surjective maps. Let A be an abelian group. An A-valued distribution on the collection (Xi,π𝑖𝑗) is a set of maps ψi: Xi → A for i ∈ I that satisfy the distribution relation

ψj(x) = ∑y∈π𝑖𝑗−1(x)ψi(y)

for all j ≤ i and x ∈ Xi.

Remark 4.6.2.

Given a collection (Xi,π𝑖𝑗) as above, we may consider the inverse limit

X = lim ←i∈IXi.

Let πi: X → Xi be the map induced by the system. Let Step ⁡ (X,A) denote the set of A-valued step functions on X. Supposing now that A is a ring, a distribution {ψi: Xi → A∣i ∈ I} on the collection (Xi,π𝑖𝑗) (or more simply, on X) gives rise to an A-module homomorphism

ψ~: Step ⁡ (X,A) → A

as follows. If χY denotes the characteristic function of a compact-open subset Y of X, then we let

ψ~(χπi−1(x)) = ψi(x)

for any i ∈ I and x ∈ Xi. We take ψ~ as the A-linear extension of this map to the group of all step functions. The distribution relation insures that it is well-defined. Conversely, given an A-module homomorphism ψ~: Step ⁡ (X,A) → A, we may define ψi(x) to be ψ~(χπi−1(x)), and the ψi provide a distribution on X.

Example 4.6.3.

Let I be the set of positive integers, ordered in the usual manner. Let Xi = ℤ∕piℤ, and let π𝑖𝑗 for j ≤ i be the reduction modulo pj map. Let a ∈ℤp. Define

ψi(x) = { 1if x ≡ amodpi, 0otherwise.

Then {ψi∣i ≥ 0} is an R-valued distribution for any ring R, called the δ-distribution at a. The corresponding functional δa satisfies δa(f) = f(a), where f ∈ Step ⁡ (ℤp,R) is any congruence function.

Let us focus on a specific case of interest.

Definition 4.6.4.

Let A be an abelian group, and let D be a divisible abelian group with finitely topologically generated Pontryagin dual.

a.

By an A-valued distribution on D, we mean a function ψ : D → A with the property that

ψ(d) = ∑c∈D 𝑛𝑐=d ψ(c) (4.6.1)

for all positive integers n and d ∈ D.

b.

By an A-valued punctured distribution on D, we mean a function ψ : D−{0}→ A satisfying the distribution relation (4.6.1) for all positive integers n and d ∈ D−{0}.

Remark 4.6.5.

For an abelian group A and a torsion divisible abelian group D, the A-valued distributions on D are in one-to-one correspondence with the A-valued distributions {ψn∣n ≥ 1} on the collection of n-torsion subgroups D[n] in D for n ≥ 1, together with the transition maps πn,m: D[n] → D[m] for m dividing n given by multiplication by nm. That is, ψ and the maps ψn take the same values on the elements of 1nℤ∕ℤ. If A is a ring, then the maps ψ also give rise to a functional ψ~: Step ⁡ (lim ←nD[n],A) → A, as noted above.

Remark 4.6.6.

Punctured distributions on D do not quite give rise to distributions on the sets D[n]−{0}, since multiplication by nm does not preserve these sets.

Example 4.6.7.

Let I be the set of positive integers, ordered by divisibility. Fix k ≥ 0, and for 0 ≤ a < n with n ≥ 1, set

ψn(k) (a n ) = nk−1B k (a n ).

For m dividing n, we have

ψn(k) ( a m ) = mk−1B k ( a m ) = ∑j=0n∕m−1nk−1B k (a+𝑗𝑚 n ) = ∑b=0 b≡amodm n−1ψ n(k) (b n ).

Thus, we can safely make the following definition.

Definition 4.6.8.

For k ≥ 0, the kth Bernoulli distribution ψ(k) is the ℚ-valued distribution on ℚ∕ℤ defined by

ψ(k) (a n ) = nk−1B k (⟨a n ⟩),

where ⟨α⟩ denotes the smallest nonegative rational number representing α ∈ℚ∕ℤ.

We also mention the following example of something close to a distribution.

Example 4.6.9.

Define ψ : ℚ∕ℤ−{0}→ℚ(μ∞)× by ψ( in) = 1−ζni. If m∣n and i≢0modm, we have

ψ ( i m ) = 1−ζmi = ∏ k=0n∕m−1(1−ζ ni+𝑘𝑚) = ∏ j=0 j≡imodm n−1ψ (j n ),

so ψ satisfies the distribution relations under multiplication. Thus ψ is a punctured distribution on ℚ∕ℤ.

We will be interested in the following resulting distribution.

Notation 4.6.10.

Let ψcyc be the ℝ-valued punctured distribution on ℚ∕ℤ given by

ψcyc(α) = −1 2log⁡|1−e2𝜋𝑖⟨α⟩|

for α ∈ℚ∕ℤ.

Remark 4.6.11.

Note that an A-valued (punctured) distribution ψ on ℚ∕ℤ gives rise to an A-valued map ψ~ on (nontrivial) Dirichlet characters χ in that Dirichlet characters are step functions on ℤ^ (that are zero at zero). In particular, if χ has modulus dividing m, then

ψ~(χ) = ∑a=0m−1χ(a)ψ ( a m ).

Example 4.6.12.

By Lemma 4.2.10, we have

ψ(n)(χ) = B n,χ

for a primitive Dirichlet character χ. In particular, ψ(n)(χ) = 0 if n≢χ(−1)mod2, unless n = 1 and χ = 1. Similarly, ψcyc(χ) = 0 unless χ is even.

4.7. Sinnott’s theorem

In this section, we fix m > 1 with m≢2mod4. We set F = ℚ(μm) and G = Gal ⁡ (F∕ℚ). The goal of this section is to prove the following generalization of the results of Hasse and Iwasawa for F, which is due to Sinnott.1

Theorem 4.7.1 (Sinnott).

Let F = ℚ(μm) for m > 1 with m≢2mod4. Then we have

[EF + : C F +] = 2ah F + and [ℤ[G]− : I F −] = 2bh F −,

where

a = { 0 if g = 1 2g−2 +1−gif g ≥ 2 and b = { 0 if g = 1 2g−2 −1if g ≥ 2,

for g the number of primes dividing m.

Notation 4.7.2.

For χ ∈G^, we have the idempotent

eχ = 1 φ(m)∑a=1 (a,m)=1 mχ(a)σ a−1 ∈ℂ[G].

We also have idempotents

e± = 1±σ−1 2 ∈ℚ[G].

The following is essentially immediate from the definitions.

Lemma 4.7.3.

We have e±A = 1 2ℤ[G]± inside ℚ[G]. In particular, we see that

[e±ℤ[G] : ℤ[G]±] = 2φ(m)∕2.

Notation 4.7.4.

For any ℤ[G]-module A, set A0 = ker⁡(NG: A → A).

Remark 4.7.5.

For a ℤ[G]-module A, we note that e−(1−e1)A = e−A.

Notation 4.7.6.

For each prime p dividing m, set

λp = ∑χ∈G^(1−χ¯(p))eχ ∈ℚ[G].

For each positive integer f dividing m, set Gf = Gal ⁡ (ℚ(μm)∕ℚ(μf)). Let U denote the ℤ[G]-module generated by the elements

uf = NGf∏p∣fλp ∈ℚ[G]

for positive integers f dividing m, where the product is taken over primes dividing f.

We briefly sketch a proof of the following proposition.

Proposition 4.7.7.

Let g be the number of primes dividing m. Then we have the following equalities:

(e±ℤ[G] : e±U) = { 1 if g = 1 22g−2 if g ≥ 2.
Proof.

If g = 1, then U is generated by NG and λp for the unique prime p dividing m. We have u1 = NG = |G|e1 and up = λp = 1−e1. Then

[e1ℤ[G]+ℤ[G] : U] = |G| = [e1ℤ[G]+ℤ[G] : ℤ[G]],

so [ℤ[G] : U] = 1. Moreover, note that e−e1 = 0, and from this it is easily seen that e−ℤ[G] = e−U, and as a result, [e+ℤ[G] : e+U] = 1 as well.

For g ≥ 2, we indicate only a few details of the proof. One uses the fact that U is the product over primes p dividing m of the modules Up generated by NIp and λp, where Ip < Gal ⁡ (F∕ℚ) is the inertia group at p, to see that (ℤ[G] : U) = 1. On the other hand,

(ℤ[G] : U) = (e+ℤ[G] : e+U)(ℤ[G]− : U−).

One checks that the order of

H^−1(Gal ⁡ (F∕F+),U) = U−∕(σ −1 −1)U≅e−ℤ[G]∕e−U

is 22g−1 . We then have

(e+ℤ[G] : e+U)(e−ℤ[G] : e−U) = 22g−1,

and the proof is finished upon showing that (e−ℤ[G] : e−U) = 22g−2 , which we omit. □

Recall that IG denotes the augmentation ideal in ℤ[G].

Corollary 4.7.8.

Let g be the number of primes dividing m. Then

(e+I G : e+U0) = { φ(m)−1 if g = 1 22g−2 φ(m)−1if g ≥ 2,
Proof.

The quotient e+ℤ[G]∕e+IG is isomorphic to ℤ via the augmentation map, while e+U∕e+U0 is generated by the class of u1 = NG, and the image of NG ∈ e+ℤ[G] under the augmentation map is |G| = φ(M). It follows that

(e±ℤ[G] : e±U) = φ(M)(e+I G : e+U0),

and we apply Proposition 4.7.7. □

Notation 4.7.9.

For a punctured ℂ-valued distribution ψ on ℚ∕ℤ, let T ψ be the subgroup of ℂ[G] generated by the elements

ηψ(c) = ∑b=1 (b,m)=1 mψ (𝑏𝑐 m )σb−1

for positive integers c with c≢0modm.

Remark 4.7.10.

The group T ψ is a ℤ[G]-module, as σaηψ(c) = ηψ(𝑎𝑐) for a prime to m. As a ℤ[G]-module, it is then generated by the elements ηψ(d) for d positive dividing m.

At times, we will view the elements of G^ also as primitive Dirichlet characters.

Proposition 4.7.11.

Let ψ be a punctured ℂ-valued distribution on ℚ∕ℤ. Then

(1−e1)T ψ = ωψU,

where

ωψ = ∑χ∈G^−{1}ψ(χ¯)eχ ∈ℂ[G].
Proof.

For d ≥ 1 dividing m, set f = m d. Let χ be a nontrivial character of G^. Then eχηψ(d) vanishes if f does not divide the conductor fχ of χ, and if f∣fχ, then

eχηψ(d) = eχ∑b=1 (b,m)=1 mψ (b f )χ¯(b) = eχφ(m) φ(f) (∏p∣f(1−χ¯(p)))ψ(χ¯).

Noting that eχωψ = eχψ(χ¯), that eχλp = eχ(1−χ¯(p)), and that

eχNGf = { eχφ(m) φ(f) if fχ∣f 0 otherwise,

we conclude that

eχηψ(d) = eχωψuf.

This holds for all χ≠1, and we also ahve that e1ωψ = 0, so we obtain (1−e1)ηψ(d) = ωψuf. In that this holds for all d, the result follows. □

Lemma 4.7.12.

Let ψ be a punctured ℂ-valued distribution on ℚ∕ℤ. In the notation of Proposition 4.7.11, if ψ(χ) = 0 for all nontrivial χ ∈G^ with χ(−1) = ∓1, then

(e±U0 : (1−e1)T ψ) = |∏χ∈G^−{1} χ(−1)=±1 ψ(χ)|.
Proof.

By our condition on χ, the element ωψ of Proposition 4.7.11 is

ωψ = ∑ χ∈G^−{1} χ(−1)=±1 ψ(χ)eχ.

Then ωψ ∈ (1−e1)e±ℂ[G] by assumption on ψ, and Proposition 4.7.11 implies that

(1−e1)T ψ = ωψU = (1−e1)e±ω ψU0.

Note that e1λp = 0 for any prime p dividing m, so e1uf = 0 if f is a positive divisor of m other than 1. Since the uf generate U as a ℤ[G]-module and u1 = NG, we therefore have U = U0 +NGℤ. It follows that (1−e1)U = U0. Multiplication by ωψ determines an ℂ-linear endomorphism of (1−e1)e±ℂ[G] that takes e±U0 onto (1−e1)T ψ. The idempotent eχ for nontrivial χ ∈G^ with χ(−1) = ±1 is an eigenvector of this endomorphism with eigenvalue ψ(χ). The determinant is of course the product of these eigenvalues. The result then follows by Lemma 1.2.8. □

Remark 4.7.13.

For any ℤ[G]-module A that is free over ℤ, we have A0 = A∩(1−e1)A, since e1A0 = 0 and the kernel of NG is the image of e1 on A⊗ℤℚ.

Example 4.7.14.

The ℝ-vector space V spanned by the elements of G has V0 equal to the elements with coefficients summing to 0. For S the set of primes above m in F, we have T = T ψcyc = ρ(CF,S) is contained in V, and note that T 0 = ρ(CF ) by the product formula.

Lemma 4.7.15.

For ψ = ψcyc and T = T ψcyc, we have

[(1−e1)T : T 0] = 2−gφ(m).
Proof.

Note that

(1−e1)T ∕T 0≅((1−e1)T +T )∕T ≅(e1T +T )∕T ≅e1T ∕T G.

We have

e1T = 1 φ(m)NGρ(CF,S) = 1 φ(m)ρ(CF,SNG).

Note that |(1−ζf)NG| = 1 if f is not a prime power, and (1−ζpk)NG = pφ(m)∕φ(pk). It follows that

e1T = 1 2∑p∣m 1 φ(pkp)log⁡p⋅NGℤ,

where kp ≥ 1 is the additive p-adic valuation of m.

Next, note that α ∈ CF,S satisfies j(α) ∈ T G if and only if j(ασ−1) = 0 for all σ ∈ G, which is equivalent to ασ−1 ∈ μ(F ), which is in turn equivalent to α1+τ ∈ℚ×, with τ complex conjugation. Let

P = {α ∈ CF,S∣α1+j ∈ℚ×},

and note that T G = ρ(P) = 1 2ρ(P1+τ). For an odd prime p dividing m, set

αp = ∏a=1(p−1)∕2(1−ζ pa),

and set α2 = 1−ζ4 if m is even. Then each αp for p dividing m lies in P, so P1+τ contains the group H generated by all primes dividing m. Since P1+τ is a subgroup of the positive rationals, the quotient P1+τ∕H is torsion-free, and on the other hand (P1+j)φ(m) = (P1+j)NG ⊆ H, which forces P1+τ = H. Thus

T G = 1 4∑p∣mlog⁡p⋅NGℤ.

It follows that

[(1−e1)T : T 0] = [e1T : T G] = ∏ p∣mφ(pk) 2 = φ(m) 2g .

□

Lemma 4.7.16.

Let ρ : EF,S → V+ denote the ℤ[G]-module homomorphism

ρ(α) = −1 2∑σ∈Glog⁡|σ(α)|σ−1.

Then

(e+I G : ρ(EF )) = RF + QF .
Proof.

Let X = (1−e1)e+V, in which ρ(EF ) forms a lattice of full rank r = φ(m) 2 −1. The lattice e+IG has a basis e+(1−σa−1) for 1 < a < m 2 with (a,m) = 1. Fix a complex embedding of F, hence an absolute value. For an independent system of units α1,…,αr ∈ EF + generating EF ∕μF , we have

ρ(αi) = −∑a=1 (a,m)=1 ⌈m2 ⌉−1log⁡|σ a(αi)|σa−1 = ∑ a=2 (a,m)=1 ⌈m2 ⌉−1log⁡|σ a(αi)|e+(1−σ a−1).

Since the matrix with entries log⁡|ηiσa| has determinant 2−rRF by definition and RF = 2r QF RF +, we are done. □

Lemma 4.7.17.

We have

[e−ℤ[G]𝜃 F : IF −] = w F .

.

Proof.

Let ΘF = ℤ[G]𝜃F for brevity. Since (σa−a)𝜃F ∈IF for all a ∈ℤ, we have that

ΘF = IF +𝜃F ℤ,

and therefore ΘF ∕IF ≅ℤ∕𝑚ℤ as m is minimal with m𝜃F integral. From the fact that ⟨α⟩+⟩1−α⟩ = 1 for α∉ℤ, one see that e+𝜃F = 1 2NGℤ. Since (σ2 −2)𝜃F ∈IF and e+(σ2 −2) = −12NG, we then have that e+ΘF = e+IF and therefore (ℤ[G]𝜃)F + = IF +, which in turn implies that

ΘF −∕I F −≅Θ F ∕IF ≅ℤ∕𝑚ℤ.

If m is even, then σm∕2𝜃F = 1 2NG = e+𝜃F . Therefore, we have e+ΘF ⊆ΘF , and in turn this implies that e−ΘF ⊆ΘF . In other words, we have [e−ΘF : ΘF −] = 1.

If m is odd, then e−σa𝜃F = σa𝜃F −1 2NG, so

e−Θ F +ΘF = 1 2NGℤ+𝜃F ,

and therefore

e−Θ F ∕ΘF −≅1 2NGℤ∕(ΘF ∩1 2NGℤ).

Note that NG = (1+j)𝜃F ∈ΘF but 12NG∉ΘF since mΘF ⊂ℤ[G] and m is odd. Therefore, we have [e−ΘF : ΘF −] = 2.

For arbitrary m, we conclude that

[e−ℤ[G]𝜃 F : IF −] = [e−Θ F : ΘF −][Θ F − : I F −] = wF m ⋅m = wF .

□

We are now ready to prove Sinnott’s theorem.

Proof

Proof of Theorem 4.7.1. First consider ψ = ψcyc, and set T = T ψ. Since T 0 = ρ(CF ), we may write our index as a product

[EF + : C F +] = [ρ(E F ) : ρ(CF )] = (ρ(EF ) : e+I G)(e+I G : e+U0)(e+U0 : (1−e1)T )((1−e1)T : T 0).

The latter four relative indices are computed by Lemma 4.7.16, Lemma 4.7.12, Corollary 4.7.8, and Lemma 4.7.15, respectively. Plugging in, we obtain

[EF + : C F +] = QF RF + ⋅(22g−1 )1∕2 φ(m) ⋅|∏ χ∈G^−{1} χ even ψcyc(χ)|⋅φ(m) 2g = 2a 1 RF +∏ χ∈G^−{1} χ even ψcyc(χ) = 2ah F +,

where the last equality follows from Theorem 4.2.20.

Next, consider ψ = ψ(1), the first Bernoulli distribution, which by definition has T ψ(1) = e−ℤ[G]𝜃F . We write the index in question as a product as follows:

[ℤ[G]− : I F −] = (ℤ[G]− : e−ℤ[G])(e−ℤ[G] : e−U)(e−U : e−ℤ[G]𝜃 F )(e−ℤ[G]𝜃 F : IF −).

The latter four relative indices are computed by Lemmas 4.7.3, Proposition 4.7.7, 4.7.12, and 4.7.17, respectively. Noting also that 2bQF = 22g−2 if g ≥ 2 and 2bQF = 1 if g = 1, we obtain

[ℤ[G]− : I F −] = 2−φ(m)∕2⋅2bQ F ⋅|∏χ∈G^ χodd ψ(1)(χ)|⋅w F = 2b⋅2[E F : EF +]∏ χ∈G^ χodd −B1,χ 2 = 2bh F −

where the second equality uses that QF wF = 2[EF : EF +] by Lemma 4.2.16, and the final equality follows from Theorem 4.2.20. □

Find in the notes