Romyar SharifiLECTURE NOTES
READING EDITIONPDF

LECTURE NOTES / Chapter 4

Algebraic Number Theory

Romyar Sharifi

Chapter 4 Geometry of numbers

Book contents

Chapter 4
Geometry of numbers

4.1. Lattices

Definition 4.1.1.

A lattice in an finite-dimensional -vector space V is an abelian subgroup of V that is generated by a finite set of -linearly independent vectors.

Definition 4.1.2.

A lattice in a finite-dimensional -vector space V is said to be complete, or full, if its elements span V.

The following is an immediate consequence of the definitions.

Lemma 4.1.3.

If Λ is a complete lattice in a finite-dimensional -vector space V, then Λ is generated by a basis of V.

Definition 4.1.4.

Let Λ be a complete lattice in a finite-dimensional vector space V. The fundamental domain of Λ relative to a -basis {v1,,vn} of Λ is the set

D = {i=1nc ivi|ci [0,1) for all 1 i n}.

The following is essentially immediate.

Lemma 4.1.5.

If D is a fundamental domain of a complete lattice Λ in a vector space V, then every element of V may be written uniquely in the form x+y for some x Λ and some y D.

Of course, a finite-dimensional -vector space V has a Euclidean metric with respect to any basis of V (as such a basis defines an isomorphism 𝑉≅n for some n). Though the metric depends upon the choice of basis, the resulting topology is independent of the choice of basis.

Definition 4.1.6.

We say that a subgroup of an finite-dimensional -vector space V is discrete if it has the discrete topology as a subspace of V.

In other words, a subgroup Λ of a finite-dimensional real vector space V is discrete if for every v Λ there exists an open neighborhood U of v in V such that U Λ = {v}. The following is elementary.

Lemma 4.1.7.

A discrete subgroup of a finite-dimensional -vector space V is a closed subset of V.

Proposition 4.1.8.

A subgroup of a finite-dimensional -vector space is discrete if and only if it is a lattice.

Proof.

Let V be an n-dimensional -vector space for some n 0, and let Λ be a subgroup. If Λ is a lattice, then Λ = i=1mvi for some linearly independent vi Λ and m n. Extend these to an ordered basis v1,,vn of V. Let v = i=1maivi Λ for some ai . Then

U = {v+i=1nc ivi|ci (1,1) for all 1 i n}

is an open neighborhood in V containing v but no other elements of Λ. Thus Λ is discrete.

Conversely, suppose Λ is discrete. Let W be the subspace of V spanned by Λ, and let v1,,vm Λ be linearly independent with m maximal, so that the vi necessarily span W. Let Σ = i=1mvi Λ. We claim that Σ is of finite index in Λ. By definition, Σ is a complete lattice in W, so so we may choose a system S of representatives of the cosets ΛΣ inside the fundamental domain D of Σ in W. That is, S ΛD. However, Λ is discrete and closed and D is a bounded set, so the intersection of Λ with the closure of D is discrete and compact, hence finite. Since ΛD is then finite, S has only finitely many elements.

Now set d = [Λ : Σ]. Then Λ 1 dΣ, and 1dΣΣ is a free abelian group of rank m, so Λ is free of rank (at most) m. In other words, Λ is a lattice.

Lemma 4.1.9.

A lattice Λ in V is complete if and only if there exists a bounded subset B of V such that every element of V is the sum of an element of B and an element of Λ.

Proof.

If Λ is a complete lattice, we may let B be the fundamental domain of V relative to a basis, and in fact every element of V may in that case be written uniquely as an element of B+Λ.

Suppose that there exists a B as in the statement of the lemma. Let W be the -span of Λ, and let v V. For each k 1, write 𝑘𝑣 = bk+xk with bk B and xk Λ. As B is bounded, we have

limk1 kbk = 0,

so

v = limk1 kxk.

But 1kxk W for all k and W is closed, so v W.

We will suppose now that our finite-dimensional vector space V comes equipped with a symmetric, positive definite inner product

,: V ×V .

In other words, V is an finite-dimensional real inner product space. The Euclidean metric defined by a choice of an orthonormal basis of V is independent of the choice. The resulting Lebesgue measure μV on V has the property that the cube defined by an orthonormal basis of V has volume (i.e., measure) one.

Definition 4.1.10.

Let V be an finite-dimensional real vector space with a symmetric, positive definite inner product ,. Let Λ be a complete lattice in V. The volume Vol(Λ) of lattice is the volume of the fundamental domain of Λ relative to a -basis of Λ.

Remark 4.1.11.

That the volume of Λ is indepedendent of the choice of basis is a consequence of the following lemma.

Lemma 4.1.12.

Let V be an n-dimensional real inner product space. Let e1,,en be an orthonormal basis of V. Let Λ be a complete lattice in V with basis v1,,vn, write

vi =j=1na 𝑖𝑗ej,

and let A = (a𝑖𝑗). Then

Vol(Λ) = |detA| = |det(vi,vj)|12.
Proof.

The first equality is a standard statement of linear algebra. The second is the fact that

vi,vj =k=1n l=1na 𝑖𝑘a𝑗𝑙ek,el =k=1na 𝑖𝑘a𝑗𝑘 = (AAT ) 𝑖𝑗,

since det(AAT ) = det(A)2.

Definition 4.1.13.

Let T be a subset of a finite-dimensional vector space V.

a.

We say that T is convex if it contains the line segment

= {(1c)v+𝑐𝑤c [0,1]}

between any two vectors v,w T .

b.

We say that T is symmetric about the origin if v T for all v T .

Now we come to the main theorem of this subsection.

Theorem 4.1.14 (Minkowski’s theorem).

Let V be an n-dimensional real inner product space, and let Λ be a complete lattice in V. Let X be a convex, measurable subset of V that is symmetric about the origin, and suppose that

μK(X) > 2nVol(Λ).

Then X Λ{0}.

Proof.

Let

Y = 1 2X = {1 2xx X }.

If y Y, then 2y X, so 2y X as X is symmetric about the origin. If y Y as well, then

yy = 1 2(2y)+ 1 2(2y) X,

since X is convex. We therefore have that the difference of any two points of Y is in X. Note also that μV (Y ) = 1 2nμV (X) > Vol(Λ).

Let D a the fundamental domain for Λ. Suppose that the sets v+Y for v Λ were pairwise disjoint. Then we would have

Vol(Λ) vΛμV (D(v+Y )) =vΛμV ((Dv)Y ) = μV (Y ),

the latter equality following since the sets Dv cover V. This does not hold by assumption, so there exist distinct v,w Λ such that (v+Y )(w+Y ) is nonempty. But then vw X, so X Λ{0}.

4.2. Real and complex embeddings

Let K be an number field of degree n over . Then, since K is separable and is algebraically closed, then we obtain the product

KK σ : K

of embeddings of K in .

Definition 4.2.1.

Let K be a number field.

a.

A real embedding (or real prime) of K is a field embedding of K in .

b.

A complex embedding of K is a field embedding of K in that does not have image contained in .

c.

A complex prime of K is an unordered pair {σ,σ¯} of complex embeddings such that σ¯(α) = σ(α)¯ for α K, where z¯ denotes the complex conjugate of z .

d.

An archimedean prime of K is either a real prime or a complex prime.

Notation 4.2.2.

The number of real (resp., complex) primes of a number field K is denoted r1(K) (resp., r2(K)).

We can also apply Proposition 1.1.1 to obtain the following.

Theorem 4.2.3.

Let K be a number field. Then r1(K)+2r2(K) = [K : ]. In fact, we have an isomorphism of -algebras

κ: K r1(K) ×r2(K)

where κ(α 1) for α K is the product of the real embeddings of K applied to α and one complex embedding from each complex prime of applied to α.

Proof.

Let K = (𝜃) and f K[x] be the minimal polynomial of 𝜃. In [x], we may write

f =i=1r1(xα i)j=1r2f j,

for some r1,r2 0 with r1 +2r2 = [K : ], where αi and fj is irreducible quadratic. Note that [x](fj)≅ℂ for each 1 j r2 via maps that take x+(fj) to a chosen root of fj in . By Proposition 1.1.1, we then have

K ℝ≅i=1r1× i=1r2

and the composition of the natural inclusion of K in K is the product of the real embeddings of K and one choice of complex embedding of K among pairs of complex conjugate embeddings (i.e., complex primes). We therefore have r1 = r1(K) and r2 = r2(K).

Examples 4.2.4.

a.

The field (i) has one complex prime, corresponding to the two complex embeddings of (i) taking i to ±i.

b.

The field (23) has one real prime and that takes 23 to 23 one complex prime corresponding to the two complex embeddings taking 23 to ω±123.

Remark 4.2.5.

Given a number field K, Theorem 4.2.3 provides us with a product of embeddings

ιK: K i=1r1× i=1r2

corresponding to the real and complex primes of K.

4.3. Finiteness of the class group

Throughout this section, we let K be a number field of degree n over . We set r1 = r1(K) and r2 = r2(K). We let σi for 1 i r1 be the real embeddings of K, and we let τi for 1 i r2 be a choice of complex embedding from each complex prime of K. We identify K with r1 ×r2 as in Theorem 4.2.3.

We endow K with the Lebesgue measure μK on nr1 ×r2, where the inverse of said isomorphism is defined by

(x1,,xr1,z1,,zr2)(x1,,xr1,Re(z1),Im(z1),,Re(zr2),Im(zr2)).

Proposition 4.3.1.

Let 𝔞 be a nonzero ideal of 𝒪K. Then ιK(𝔞) is a complete lattice in K and

Vol(ιK(𝔞)) = 2r2 𝑁𝔞|disc(K)|12.
Proof.

Let α1,,αn be a -basis of 𝔞. Consider the matrix A Mn() with ith row

(σ1(αi),,σr1(αi),τ1(αi),τ1(αi)¯,,τr2(αi),τr2(αi)¯)

and the matrix B Mn() with ith row

(σ1(αi),,σr1(αi),Re(τ1(αi)),Im(τ1(αi)),,Re(τr2(αi)),Im(τr2(αi))).

Simple column operations yield that detA = (2i)r2 detB, and Lemmas 1.4.10 and 1.4.6 imply that

|detA| = |D(α1,,αn)|12 = 𝑁𝔞|disc(K)|12.

In particular, detB0, so the rows of images of the αi in K are -linearly independent, which is to say that ιK(𝔞) is complete. Since Lemma 4.1.12 implies that Vol(ιK(𝔞)) = |detB|, we have the result.

Notation 4.3.2.

We define a norm on K ℝ≅r1 ×r2 by

vK =i=1r1|x i|+2j=1r2|z j|

for v = (x1,,xr1,z1,,zr2). For t > 0, let

Dt = {v K vK < t}.

We compute the volume of Dt.

Lemma 4.3.3.

We have

μK(Dt) = 2r1r2πr2 tn n!
Proof.

We treat this as a problem about the real inner product space V = Rr1 ×r2 of dimension n = r1 +2r2. Let Bt(r1,r2) be the subset of Dt = Dt(r1,r2) inside V of elements with nonnegative real coordinates. Then μV (Bt(r1,r2)) = 2r1μV (Dt(r1,r2)). Suppose first that r2 = 0 and the result holds for (r1 1,0). Then we have

μV (Bt(r1,0)) =x=0tμ V (Btx(r11,0))𝑑𝑥 =x=0t xn1 (n1)!𝑑𝑥 = tn n!.

Next, suppose that r2 > 0 and the result holds for (r1,r2 1). By elementary calculation, we obtain

μV (Bt(r1,r2)) =r=0t2𝜃=02πμ V (Bt2r(r1,r21))𝑟𝑑𝑟𝑑𝜃 = 2π (π 2 )r21r=0t2 (2r)n2 (n2)!(t2r)𝑑𝑟 = (π 2 )r2 tn n!.

Proposition 4.3.4.

For any nonzero ideal 𝔞 of 𝒪K, there exists α 𝔞{0} such that

|NK(α)|(4 π )r2 n! nn 𝑁𝔞|disc(K)|12.
Proof.

Let t be such that

μK(Dt) > 2nVol(ι K(𝔞)). (4.3.1)

Since ιK(𝔞) is a lattice, Minkowski’s theorem ensures that Dt contains ιK(α) for some nonzero α 𝔞. Note that NK(α) is the product of images of α under the distinct field embeddings of K in . Hence, we have

|NK(α)| = |σ1(α)||σr1(α)||τ1(α)|2|τ r2(α)|2,

and since the arithmetic mean bounds the geometric mean, this is at most the nth power of

1 n (i=1r1|σ i(α)|+2j=1r2|τ j(α)|).

On the other hand, since α Dt, the latter quantity is less than tn, so we have |NK(α)| < ( tn)n. Now, Lemma 4.3.3 and Proposition 4.3.1 allow us to rewrite (4.3.1) as

2r1r2πr2 tn n! > 2nr2 𝑁𝔞|disc(K)|12.

Set

C = (4 π )r2 n! nn 𝑁𝔞|disc(K)|12,

so ( tn)n > C. We can and do choose ( tn)n to be less than the smallest integer greater than C. Since |NK(α)|is an integer, we must then have that |NK(α)| C.

Definition 4.3.5.

Let K be a number field of degree n over . The Minkowski bound BK is the quantity

BK = n! nn ( 4 π )r2|disc(K)|12.

Proposition 4.3.4 has the following interesting corollary

Corollary 4.3.6.

The discriminant of a number field K satisfies |disc(K)|12 (π4 )r2 nn n! .

Proof.

Take 𝔞 = 𝒪K in Proposition 4.3.4, and note that |NK(α)| 1 for all α 𝒪K.

Theorem 4.3.7 (Minkowski).

Let K be a number field of degree n over . Then there exists a set of representatives for the ideal class group of K consisting of integral ideals 𝔞 with 𝑁𝔞 BK.

Proof.

Let 𝔞 be a fractional ideal of 𝒪K. Let d K× be such that 𝔟 = d𝔞1 is an integral ideal. By Proposition 4.3.4, there exists β 𝔟{0} with |NK(β)| BK𝑁𝔟. Now, note that (β) = 𝔟𝔠 for some ideal 𝔠 of 𝒪K, and the ideal class of 𝔠 is the ideal class of 𝔟1, which is the ideal class of 𝔞. Furthermore, we have that |NK(β)| = 𝑁𝔟𝑁𝔠, so 𝑁𝔠 BK, as desired.

As a consequence, we have the following theorem.

Theorem 4.3.8.

The class group of a number field is finite.

Proof.

In fact, the set of nonzero integral ideals 𝔞 with 𝑁𝔞 BK is finite. To see this, write 𝔞 = 𝔭1r1𝔭krk for distinct prime ideals 𝔭i and ri 1 for some 1 i k. Then

𝑁𝔞 = p1r1f1p krkfk,

where N𝔭i = pifi with pi prime. Since there are only finitely many positive integers less than BK, there are only finitely many primes that could divide 𝑁𝔞, and the exponents of these primes are bounded (e.g., by log2(BK)). Since each prime (p) of has only finitely many primes of 𝒪K lying over it, we are done.

Definition 4.3.9.

The class number hK of a number field K is the order of the class group ClK.

The Minkowski bound allows us to actually give bounds on the class number of a number field and sometimes, to actually compute the class group.

Example 4.3.10.

Consider K = (5). Note that disc(K) = 20, so the Minkowski bound is

BK = 2 π20 < 3.

Since [5] is not a UFD, it is not a PID, so hK 2. Since 2 ramifies in [5], the class of the prime over it in K is the only nontrivial element in ClK. We therefore have hK = 2.

Example 4.3.11.

Consider K = (17). In this case disc(K) = 17, and the Minkowski bound is

BK = 1 217 < 3.

Set α = 17+1 2 so that 𝒪K = [α]. Since the norm of any prime 𝔭 of [α] is at least the prime p with 𝔭 = (p), there exists a set of representatives for ClK dividing 2. The minimal polynomial of α is x2 x4, which splits modulo 2. Therefore, the class group ClK is generated by the two primes over 2. Their classes are inverse to each other, so ClK is generated any one of them, which we denote 𝔭. For α 𝒪K, we have 𝔭 = (α) if and only if N(α) = ±2. Note that

NK (17+5 2 ) = 2517 4 = 2,

so 𝔭 is principal and K is a UFD.

4.4. Dirichlet’s unit theorem

Lemma 4.4.1.

Let n,N 1. The set of algebraic integers α such that [(α) : ] n and |σ(α)| N for all archimedean embeddings σ of (α) is finite.

Proof.

Let α be such an integer, and let f = i=0naixi be its minimal polynomial in [x]. In [x], we have f = σ(xσ(α)), the product being taken over the archimedean embeddings. Then |ai| is bounded: e.g., it satisfies |ai| Nni(n i) for all i. As each ai is an integer, the number of minimal polynomials of elements in the stated set, and hence the order of the set, is finite.

Corollary 4.4.2.

Let K be a number field. Then μ(K) is a finite group, equal to the set of all α 𝒪K such that |σ(α)| = 1 for all archimedean embeddings σ of K.

Proof.

If α 𝒪K satisfies |σ(α)| = 1 for all σ, then so does αn for all n. Since the set T of such α is finite by Lemma 4.4.1, the group α is finite, and hence α μ(K). In particular, since a root of unity has complex absolute value 1 under any archimedean embeddings, the set μ(K) = T is finite.

Definition 4.4.3.

The unit group of a number field K is the group 𝒪K× of units in 𝒪K.

Definition 4.4.4.

For a number field K, we let K: K×r1+r2 be defined on α K× as

K(α) = (log|σ1(α)|,,log|σr1(α)|,log|τ1(α)|,,log|τr2(α)|),

where σ1,,σr1 are the real embeddings of K and τ1,,τr2 are the complex embeddings of K.

Proposition 4.4.5.

For a number field K, the set K(𝒪K×) is a lattice in r1+r2 that sits in the hyperplane

H = {(x1,,xr1+r2)|i=1r1x i+2j=1r2x j+r1 = 0},

and kerK = μ(K).

Proof.

That kerK = μ(K) is just a rewording of Corollary 4.4.2. For α 𝒪K×, we have that

i=0r1 log|σ i(α)|+2j=0r2 log|τ j(α)| = log|NK(α)| = 0,

the latter equality by Corollary 2.5.18, so K(α) H. For N 0, consider the bounded subset

DN = {(x1,,xr1+r2) H|xi| N for all i}

of H. By Lemma 4.4.1, the set of elements of 𝒪K× contained in DN is finite, which means that there exists an open neighborhood U in r1+r2 such that the intersection U K(𝒪K×) is {0}. This implies that K(𝒪K×) is a discrete group: the set K(α)+U is also open and its intersection with K(𝒪K×) is {K(α)}. Finally, recall that a discrete subgroup of r1+r2 is a lattice.

Proposition 4.4.5 implies that the sequence

1 μ(K) 𝒪K× KK(𝒪K×) 0

is exact and that the set K(𝒪K×) is a free abelian group of finite rank. In particular, 𝒪K×is a finitely generated abelian group of rank that of K(𝒪K×), and the sequence is split. If K(𝒪K×) is a complete lattice in H, then we know that the rank of 𝒪K× is r1 +r2 1. Dirichlet’s unit theorem tells us that this is in fact the case. For this, we require the following lemma.

Lemma 4.4.6.

Let A = (a𝑖𝑗) Mk() for some k 1 satisfy a𝑖𝑗 < 0 for all ij and j=1ka𝑖𝑗 > 0 for all i. Then A is invertible.

Proof.

Suppose by way of contradication that v = (v1,,vk) k is a solution to 𝐴𝑣 = 0, scaled so that vj = 1 for some j and |vi| 1 for all ij. Then

0 =i=1ka 𝑗𝑖vi = a𝑗𝑗+i=1 ij ka 𝑗𝑖vi. (4.4.1)

Note that a𝑗𝑖vi a𝑗𝑖 for ij since a𝑗𝑖 is negative and vi 1. Thus, the right-hand side of (4.4.1) is at least i=1ka𝑖𝑗 > 0, which is the desired contradiction.

For a number field K, let us use κ to identify K and r1 ×r2 as rings. We can then make the following definition.

Notation 4.4.7.

For a number field K, we let

[]: K

denote the multiplicative function given by

[(x1,,xr1,z1,,zr2)] = |x1||xr1||z1|2|z r2|2,

for xi with 1 i r1 and zj with 1 j r2.

The following rather complicated lemma is useful in showing the completeness of K(𝒪K×) in H.

Lemma 4.4.8.

Let K be a number field of degree n. Set

D = {v K 12 [v] 1}.

Let X be a bounded, convex subset of K that is symmetric about the origin and has volume

μV (X) > 2r1+r2|disc(K)|12.

There exist α1,,αs 𝒪K for some s 1 such that for each v D, there exists some 𝜖 𝒪K× and 1 i s such that vιK(𝜖) ιK(αi1)X.

Proof.

For w K , the set

wιK(𝒪K) = {wιK(α)α 𝒪K}

is a complete lattice with volume 2r2|disc(K)|12 [w]. Suppose w D. Since [w] 1, we have

2nVol(wι K(𝒪K)) 2nVol(ι K(𝒪K)) = 2r1+r2|disc(K)|12,

the latter equality by Proposition 4.3.1. Minkowski’s theorem then tells us that there exists α 𝒪K{0} such that wιK(α) X.

Since X is bounded, there exists M > 0 such that [x] M for all x X. In particular, we have [wιK(α)] M, which since [w] 1 2 forces [ιK(α)] 2M and then N(α𝒪K) 2M. As there are only finitely many ideals of absolute norm at most 2M, there are only finitely many ideals α𝒪K such that wιK(α𝒪K)X{0} for some w D. Let α1𝒪K,,αs𝒪K be these ideals.

Finally, given v D, let β 𝒪K{0} have the property that vιK(β) X. Then β𝒪K = αi𝒪K for some 1 i s, so 𝜖 = βαi1 𝒪K× and vιK(𝜖) ιK(αi1)X.

Theorem 4.4.9 (Dirichlet’s unit theorem).

Let K be a number field. Then we have an isomorphism

𝒪K×r1(K)+r2(K)1 ×μ(K).
Proof.

Let D, X, and α1,,αs 𝒪K be as in Lemma 4.4.8. Set

Y = i=1sι K(αi1)X.

Since Y is bounded, we may let N be such that if (λ1,,λr1+r2) Y, then |λi| N for all 1 i r1 +r2. For 1 i r1 +r2, let

v(i) = (v1(i),,v r1+r2(i)) K

be an element such that |vj(i)| > N for ji but [v(i)] = 1. Then v(i) D, so there exists 𝜖(i) 𝒪K× such that v(i) ιK(𝜖(i)) Y. In particular, we must have

ιK(𝜖(i)) = (𝜖1(i),,𝜖 r1+r2(i)) = (σ1(𝜖(i)),,σ r1(𝜖(i)),τ1(𝜖(i)),,τ r2(𝜖(i)))

with |𝜖j(i)| < 1 for all ji. In other words, K(𝜖(i)) has negative coordinates for ji.

Assume without loss of generality that r1 +r2 > 1. Set

ai,j = { log|σj(𝜖(i))| for 1 j r1 2log|τjr1(𝜖(i))|for r1 +1 j r1 +r2.

Consider the matrix A = (ai,j)i,j Mr1+r21(). For i < r1 +r2, we have that the sum of the ith row is

j=1r1+r21a i,j = ai,r1+r2 > 0

as K(𝜖(i)) H and ir1 +r2. Lemma 4.4.6 then tells us that A is invertible, so the K(𝜖(i)) for 1 i < r1 +r2 form a system of r1 +r2 1 linearly independent vectors in H. In other words, K(𝒪K×) is a complete lattice.

Example 4.4.10.

Let K = (d) for some square-free integer d , d1. If K is a real quadratic field, which is to say that d > 0, then r1(K) = 2 and r2(K) = 0. Since the complex conjugate of a root of unity ζ equals ζ if and only if ζ2 = 1, we have in this case that μ(K) = {±1} and

𝒪K×≅ℤ2×.

If K is an imaginary quadratic field, which is to say that d < 0, then r1(K) = 0 and r2(K) = 1. In this case, since [K : ] = 2, the field K cannot contain any roots of unity aside from 4th and 6th roots of 1. But (i) = (1) and (ω) = (3) for ω a primitive 3rd root of 1, so for d < 0, we have 𝒪K×≅ℤ2 unless d = 1 or d = 3, in which case 𝒪K×≅ℤ4 and 6, respectively.

Example 4.4.11.

Let K = (2). In this case, we know that 𝒪K is generated by ±𝜖 for some 𝜖 𝒪K× of infinite order. To find a,b such that 𝜖 = a+b2, we note that NK(a+b2) = a2 2b2 = ±1. Suppose we choose 𝜖 with a,b > 0, which can be done since

{±𝜖,±𝜖1} = {±a±b2}.

The 𝜖 is known as the fundamental unit for K.

If we consider 𝜖n = an+bn2 for n > 1, it is not hard to check that an > a and bn > b. Therefore, we must find a solution to a2 2b2 = ±1 with a > 0 or b > 0 minimal (and therefore both), e.g., a = b = 1. That is, 1+2 is a fundamental unit for K.

Example 4.4.12.

Let n 3 be a positive integer, and let m be n or 2n according to whether n is even or odd, respectively. We have

[μn]×φ(n) 2 1 ×μm.

Find in the notes