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 Res > 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)ps

for all s with Res > 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) =0ts1et𝑑𝑡

for all s with Res > 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) = (n1)! 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 = d1fχ, 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χχ¯(ab1)e2𝜋𝑖𝑎fχ,

which gives the desired equality upon reordering the sum.

Lemma 4.1.18.

For a primitive Dirichlet character χ, we have

|τ(χ)| = fχ12.
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χ π )s2Γ (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) = 𝜖χΛ(χ¯,1s)

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 Res > 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)ps). (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 (1p𝑓𝑠)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=0f1(1ζ fps)g = (1p𝑓𝑠)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 et1 =n=0B ntn n!

Example 4.2.2.

We have

et1 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 et1 = tet et1 = t et1 +t,

so

t et1 + 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=0B 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=0r1 xi xr1 = 1 x1,

taking r = mfχ 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𝑋𝑡 et1 =n=0B 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,χ = mn1 a=1mχ(a)B n( a m)

for n 1.

Proof.

We have

n=0mn1 a=1mχ(a)B n ( a m ) tn n! =a=1mχ(a)m1 n=0B 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 ma=1mχ(a)a.
Proof.

We compute easily that B1(x) = x12. 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(χ,1n) = Bn,χ n

for all positive integers n.

Proof.

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

f(t) = te(1x)t et1 =n=0B n(1x)tn n!.

For s , set

g(s) = lim𝜖0+γ𝜖f(t)ts2𝑑𝑡,

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, ts2 = e(s2)logt, where we take the branch of the logarithm given by the positive real axis. Then

g(s) = lim𝜖0+ ((e2𝜋𝑖𝑠1)𝜖f(t)ts2𝑑𝑡 +C𝜖f(t)ts2𝑑𝑡).

If Res > 1, the second term vanishes in the limit, and this simplifies to

(e2𝜋𝑖𝑠1)1g(s) =0f(t)ts2𝑑𝑡 = k=00ts1e(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 = 1n, we obtain

lims1n(e2𝜋𝑖𝑠1)Γ(s)ζ(s,x) = lim 𝜖0+C𝜖f(t)t1n𝑑𝑡 = 2𝜋𝑖Bn(1x) n!

by Cauchy’s integral formula. We have

lims1n(e2𝜋𝑖𝑠1)Γ(s) = 2𝜋𝑖lim s1nsΓ(s) = 2𝜋𝑖(1)n1 (n1)! ,

so we obtain

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

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

L(χ,1n) =a=1fχ(a)fn1ζ(1n,a f ) = 1 na=1fχ(a)fn1B 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|1e2𝜋𝑖𝑎fχ|if χ is even .
Proof.

If χ is odd, then the functional equation and the fact that Γ(12) = π12 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(1e2𝜋𝑖𝑎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(1e2𝜋𝑖𝑎f) with

log|1e2𝜋𝑖𝑎f| = 1 2(log(1e2𝜋𝑖𝑎f)+log(1e2𝜋𝑖(fa)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 |12 .

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(FF+). 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 m2mod4. Then

QF = { 1misaprimepower 2 otherwise .
Proof.

Let τ be the generator of Gal(FF+). 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 FF+, 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 = rankEF = rankEF +.

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.10 tells us that

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

On the other hand, note that each ci in Definition 1.2.5 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|1e2𝜋𝑖𝑎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|12. (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+|12 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+|12,

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|1e2𝜋𝑖𝑎fχ|) = 2r1(F+)hF +RF + 2|dF+|12 ,

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ζma1 a < mF×

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 = ζpna2 ζpna2 ζpn12 ζpn12|1 < a < pn2,(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 < pn2 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 pn21χ(b)log|1ζ pnb|)| = | χX(F+) χ1 1 2c=1 (c,p)=1 pn1χ(c)log|1ζ pnc||.

As χ has conductor dividing pn and

1ζnc = j=0k1(1ζ 𝑛𝑘c+𝑗𝑘)

for n,k 1 and c0modn, we have

c=1 (c,p)=1 pn1χ(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.10.

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 ζnnm = ζ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

xm1 x1 =dm d>1 Φd(x).

Plugging in x = 1, we obtain

m =dm 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, ζm1 1ζm 1ζm1 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 ibmod. Note that b m1 mod, so moving this term from the product to the other side, we have

N(μm)(μm)(1ζ𝑚ℓ) = 1ζm 1ζm1 = ζm1 1ζm 1ζm1 .

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 μp1(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 )1p)E is unramified, in which case it is 1.

Proof.

Let Δ = Gal(EF ). 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𝒪 = Bp𝒪. We remark that Lemma 2.8.7 implies that

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

Note also that we have

rp(B𝒪ψ) = [k : 𝔽 p]dimk((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

dimk(A𝒪ωχ1)δ χ dimk(A𝒪χ) dim k(A𝒪ωχ1)+dim k((𝒪E×𝒪 E×p) 𝒪ωχ1),

where we have set A = AEpAE to shorten notation.

Note that we have the following isomorphisms of groups

Homp(AE,μp)𝒪Homp(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)𝒪)Homk(A𝒪ωψ1,k),

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

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

dimk(A𝒪ωχ1) dim k(((Bμ(E))μ(E)p) 𝒪χ)+dim k(A𝒪(χ)) = δ χ+dimk(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

dimk(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) { pk0mod(p1) 0 k 0mod(p1) .

Corollary 4.4.4.

For any even integer k, we have

rp(A(μp)(ωk)) r p(A(μp)(ω1k)) 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 ma=1 (a,m)=1 maσ a1.
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 σbb 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σa1 = a=1 (a,m)=1 m 𝑎𝑏 m σa1.

Since 𝑎𝑏mamb , we have (σbb)𝜃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 )σa1 [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(σbb)+b=1 (b,m)=1 me bbJ,

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(χ)σbb (μ 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(χ)σbb)τ = g(χb)τg(χ)𝑏𝜏 = χb(c)1χ(c)bg(χ)σbb = g(χ)σbb,

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 ClF = 0.

Proof.

Fix C ClF , 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σb1𝔏(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σb1𝔩(g(χ)1) = t b.

In other words, we have the factorization

g(χ)1𝒪 F =b=1 (b,m)=1 m(σ b1𝔩)tb,

so

b=1 (b,m)=1 mt bσb1

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σb1𝔏(ζ1) = 1

for all b. We calculate

g(χ) (ζ1)tb g(χ)τ (ζc1)tb χ(c)1g(χ) ctb(ζ1)tb modσb1𝔏.

This forces e2𝜋𝑖m ctb modσb1𝔏 and therefore modulo σb1𝔩, since both sides of the latter congruence lie in F. In other words, we have

e2𝜋𝑖𝑏m ctb mod𝔩.

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

e2𝜋𝑖m c(1)ammod𝔩.

We therefore have that

tb (1)𝑎𝑏 m mod(1),

forcing

tb = (1) 𝑎𝑏 m .

It follows that

(1)b=1 (n,m)=1 m 𝑎𝑏 m σb1 = (1)σ a𝜃F

annihilates C.

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

(g(χ)σa1x)1𝒪 F = 𝔩(1)x𝜃F .

By Lemmas 4.5.2 and 4.5.4, we have g(χ)σa1x F. Therefore, the identity

(g(χ)σa1x)𝒪 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 j1modp1 be an odd integer, and suppose that AF (ωj) 0. Then B1,ωj pp. 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(σbb)𝜃F = (ωj(b)b)1 pa=1p1aω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 {Xii 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 = limiIXi.

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 Ai 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

ψ~(χπi1(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 ψ~(χπi1(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 {ψii 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) =cD 𝑛𝑐=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 {ψnn 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(limnD[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 ) = nk1B k (a n ).

For m dividing n, we have

ψn(k) ( a m ) = mk1B k ( a m ) =j=0nm1nk1B k (a+𝑗𝑚 n ) =b=0 bamodm n1ψ 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 ) = nk1B 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 mn and i0modm, we have

ψ ( i m ) = 1ζmi = k=0nm1(1ζ ni+𝑘𝑚) = j=0 jimodm n1ψ (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|1e2𝜋𝑖α|

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=0m1χ(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 m2mod4. 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 m2mod4. Then we have

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

where

a = { 0 if g = 1 2g2 +1gif g 2 and b = { 0 if g = 1 2g2 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)σ a1 [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(1e1)A = eA.

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 = NGfpfλ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 22g2 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 = 1e1. Then

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

so [[G] : U] = 1. Moreover, note that ee1 = 0, and from this it is easily seen that e[G] = eU, 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(FF+),U) = U(σ 1 1)Ue[G]eU

is 22g1 . We then have

(e+[G] : e+U)(e[G] : eU) = 22g1,

and the proof is finished upon showing that (e[G] : eU) = 22g2 , 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 22g2 φ(m)1if g 2,
Proof.

The quotient e+[G]e+IG is isomorphic to via the augmentation map, while e+Ue+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 )σb1

for positive integers c with c0modm.

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

(1e1)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 ffχ, then

eχηψ(d) = eχb=1 (b,m)=1 mψ (b f )χ¯(b) = eχφ(m) φ(f) (pf(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 (1e1)ηψ(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 : (1e1)T ψ) = |χG^{1} χ(1)=±1 ψ(χ)|.
Proof.

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

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

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

(1e1)T ψ = ωψU = (1e1)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 (1e1)U = U0. Multiplication by ωψ determines an -linear endomorphism of (1e1)e±[G] that takes e±U0 onto (1e1)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.9.

Remark 4.7.13.

For any [G]-module A that is free over , we have A0 = A(1e1)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

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

Note that

(1e1)T T 0((1e1)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 2pm 1 φ(pkp)logpNG,

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(p1)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 4pmlogpNG.

It follows that

[(1e1)T : T 0] = [e1T : T G] = pmφ(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 = (1e1)e+V, in which ρ(EF ) forms a lattice of full rank r = φ(m) 2 1. The lattice e+IG has a basis e+(1σa1) 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)|σa1 = a=2 (a,m)=1 m2 1log|σ a(αi)|e+(1σ a1).

Since the matrix with entries log|ηiσa| has determinant 2rRF 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 (σaa)𝜃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 σm2𝜃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 : (1e1)T )((1e1)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 + (22g1 )12 φ(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] : eU)(eU : 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 = 22g2 if g 2 and 2bQF = 1 if g = 1, we obtain

[[G] : I F ] = 2φ(m)22bQ F |χG^ χodd ψ(1)(χ)|w F = 2b2[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