The Ideal Class Group

Transcription

1 Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned the ideal class group briefly in (3.4.5); it measures how close a Dedekind domain is to a principal ideal domain. 5.1 Lattices Definitions and Comments Let e 1,...,e n R n, with the e i linearly independent over R. Thus the e i form a basis for R n as a vector space over R. The e i also form a basis for a free Z-module of rank n, namely H = Ze Ze n. A set H constructed in this way is said to be a lattice in R n. The fundamental domain of H is given by T = {x R n : x = n a i e i, 0 a i < 1}. In the most familiar case, e 1 and e 2 are linearly independent vectors in the plane, and T is the parallelogram generated by the e i. In general, every point of R n is congruent modulo H to a unique point of T,soR n is the disjoint union of the sets h + T, h H. If µ is Lebesgue measure, then the volume µ(t ) of the fundamental domain T will be denoted by v(h). If we generate H using a different Z-basis, the volume of the fundamental domain is unchanged. (The change of variables matrix between Z-bases is unimodular, hence has determinant ±1. The result follows from the change of variables formula for multiple integrals.) 1

2 2 CHAPTER 5. THE IDEAL CLASS GROUP Lemma Let S be a Lebesgue measurable subset of R n with µ(s) >v(h). Then there exist distinct points x, y S such that x y H. Proof. As we observed in (5.1.1), the sets h + T,h H, are (pairwise) disjoint and cover R n. Thus the sets S (h + T ),h H, are disjoint and cover S. Consequently, µ(s) = h H µ(s (h + T )). By translation-invariance of Lebesgue measure, µ(s (h + T )) = µ(( h + S) T ). Now if S (h 1 + T ) and S (h 2 + T ) are disjoint, it does not follow that ( h 1 + S) T and ( h 2 + S) T are disjoint, as we are not subtracting the same vector from each set. In fact, if the sets ( h + S) T,h H, were disjoint, we would reach a contradiction via v(h) =µ(t ) h H µ(( h + S) T )=µ(s). Thus there are distinct elements h 1,h 2 H such that ( h 1 +S) ( h 2 +S) T. Choose (necessarily distinct) x, y S such that h 1 + x = h 2 + y. Then x y = h 1 h 2 H, as desired Minkowski s Convex Body Theorem Let H be a lattice in R n, and assume that S is a Lebesgue measurable subset of R n that is symmetric about the origin and convex. If (a) µ(s) > 2 n v(h), or (b) µ(s) 2 n v(h) and S is compact, then S (H \{0}). Proof. (a) Let S = 1 2 S. Then µ(s )=2 n µ(s) >v(h) by hypothesis, so by (5.1.2), there exist distinct elements y, z S such that y z H. But y z = 1 2 (2y +( 2z)), a convex combination of 2y and 2z. But y S 2y S, and z S 2z S 2z S by symmetry about the origin. Thus y z S and since y and z are distinct, y z H \{0}. (b) We apply (a) to (1+1/m)S, m =1, 2,... Since S, hence (1+1/m)S, is a bounded set, it contains only finitely many points of the lattice H. Consequently, for every positive integer m, S m =(1+1/m)S (H \{0}) is a nonempty finite, hence compact, subset of R n. Since S m+1 S m for all m, the sets S m form a nested sequence, and therefore m=1s m. Ifx m=1s m, then x H \{0} and x/(1+1/m) S for every m. Since S is closed, we may let m to conclude that x S Example With n = 2, take e 1 =(1, 0) and e 2 =(0, 1). The fundamental domain is the unit square, closed at the bottom and on the left, and open at the top and on the right. Let S be the set of all a 1 e 1 + a 2 e 2 with 1 <a i < 1,i =1, 2. Then µ(s) =4v(H), but S contains no nonzero lattice points. Thus compactness is a necessary hypothesis in part (b).

3 5.2. A VOLUME CALCULATION A Volume Calculation We will use n-dimensional integration technique to derive a result that will be needed in the proof that the ideal class group is finite. We will work in R n, realized as the product of copies of R and copies of C, where +2 = n. Our interest is in the set B t = {(y 1,...,y r1,z 1,...,z r2 ) R r1 C r2 : We will show that the volume of B t is given by z j t},t 0. V (,,t)=2 r1 ( π 2 t n 2 )r n!. The proof is by double induction on and. If = 1 and = 0, hence n =1,we are calculating the length of the interval [ t, t], which is 2t, as predicted. If = 0 and = 1, hence n = 2, we are calculating the area of {z 1 :2 z 1 t}, a disk of radius t/2. The result is πt 2 /4, again as predicted. Now assume that the formula holds for,, and all t. Then V ( +1,,t) is the volume of the set described by or equivalently by y + z j t z j t y. Now if y >t, then B t is empty. For smaller values of y, suppose we change y to y + dy. This creates a box in (n + 1)-space with dy as one of the dimensions. The volume of the box is V (,,t y )dy. Thus V ( +1,,t)= t t V (,,t y )dy which by the induction hypothesis is 2 t 0 2r1 (π/2) r2 [(t y) n /n!] dy. Evaluating the integral, we obtain 2 r1+1 (π/2) r2 t n+1 /(n + 1)!, as desired. Finally, V (, +1,t) is the volume of the set described by z j +2 z t. As above, V (, +1,t)= V (,,t 2 z )dµ(z) z t/2

5 5.3. THE CANONICAL EMBEDDING 5 and x iy. Then add 1/2 times row 1 to row 2, and the entries become 2x and iy. Factoring out 2 and i, weget ( ) ( ) x Re σj (x 2i = 2i k ). y Im σ j (x k ) Do this for each j =1,...,. In the above calculation, σ j appears immediately under σ j, but in the original ordering they are separated by, which introduces a factor of ( 1) r2 when we calculate a determinant. To summarize, we have det C =(2i) r2 det(σ j (x k )) Note that j and k range from 1 to n; no operations are needed for the first rows. Now let M be the free Z-module generated by the x i, so that σ(m) is a free Z-module with basis σ(x i ),i = 1,...,n, hence a lattice in R n. The fundamental domain is a parallelotope whose sides are the σ(x i ), and the volume of the fundamental domain is the absolute value of the determinant whose rows (or columns) are the σ(x i ). Consequently [see (5.1.1) for notation], v(σ(m)) = det C =2 r2 det σ j (x k ). We apply this result in an algebraic number theory setting Proposition Let B be the ring of algebraic integers of a number field L, and let I be a nonzero integral ideal of B, so that by (4.2.4) and (5.3.2), σ(i) is a lattice in R n. Then the volume of the fundamental domain of this lattice is v(σ(i)) = 2 r2 d 1/2 N(I); in particular, v(σ(b)) = 2 r2 d 1/2, where d is the field discriminant. Proof. The result for I = B follows from (5.3.2) and (2.3.3), taking the x k as an integral basis for B. To establish the general result, observe that the fundamental domain for σ(i) can be assembled by taking the disjoint union of N(I) copies of the fundamental domain of σ(b). To convince yourself of this, let e 1 and e 2 be basis vectors in the plane. The lattice H generated by 2e 1 and 3e 2 is a subgroup of the lattice H generated by e 1 and e 2, but the fundamental domain T of H is larger than the fundamental domain T of H. In fact, exactly 6 copies of T will fit inside T Minkowski Bound on Element Norms If I is a nonzero integral ideal of B, then I contains a nonzero element x such that N L/Q (x) (4/π) r2 (n!/n n ) d 1/2 N(I). Proof. The set B t of Section 5.2 is compact, convex and symmetric about the origin. The volume of B t is µ(b t )=2 r1 (π/2) r2 t n /n!, with µ indicating Lebesgue measure. We

6 6 CHAPTER 5. THE IDEAL CLASS GROUP choose t so that µ(b t )=2 n v(σ(i)), which by (5.3.3) is 2 n r2 d 1/2 N(I). Equating the two expressions for µ(b t ), we get t n =2 n r1 π r2 n! d 1/2 N(I). Apply (5.1.3b) with H = σ(i) and S = B t. By our choice of t, the hypothesis of (5.1.3b) is satisfied, and we have S (H \{0}). Thus there is a nonzero element x I such that σ(x) B t. Now by (2.1.6), the absolute value of the norm of x is the product of the positive numbers a i = σ i (x),,...,n. To estimate N(x), we invoke the inequality of the arithmetic and geometric means, which states that (a 1 a n ) 1/n (a a n )/n. It follows that a 1 a n ( n a i/n) n. With our a i s, we have N(x) [ 1 n σ i (x) + 2 n r 1+ i=+1 Since σ(x) B t, we have N(x) t n /n n. By choice of t, σ i (x) ] n. N(x) (1/n n )2 n r1 π r2 n! d 1/2 N(I). But n =2,so2 n r1 π r2 =2 2r2 π r2 =(4/π) r2, and the result follows Minkowski Bound on Ideal Norms Every ideal class [see (3.4.5)] of L contains an integral ideal I such that N(I) (4/π) r2 (n!/n n ) d 1/2. Proof. Let J be a fractional ideal in the given class. We can multiply by a principal ideal of B without changing the ideal class, so we can assume with loss of generality that J =(J ) 1 is an integral ideal. Choose a nonzero element x J such that x satisfies the norm inequality of (5.3.4). Our candidate is I = xj. First note that I is an integral ideal because x J and JJ = B. Now (x) =IJ,so by (4.2.6) and (5.3.4), N(I)N(J) =N(x) (4/π) r2 (n!/n n ) d 1/2 N(J). Cancel N(J) to get the desired result Corollary The ideal class group of a number field is finite. Proof. By (4.2.13), there are only finitely many integral ideals with a given norm. By (5.3.5), we can associate with each ideal class an integral ideal whose norm is bounded above by a fixed constant. If the ideal class group were infinite, we would eventually use the same integral ideal in two different ideal classes, which is impossible.

7 5.3. THE CANONICAL EMBEDDING Applications Suppose that a number field L has a Minkowski bound on ideal norms that is less than 2. Since the only ideal of norm 1 is the trivial ideal (1) = B, every ideal class must contain (1). Thus there can be only one ideal class, and the class number of L, that is, the order of the ideal class group, is h L = 1. By (3.4.5), B is a PID, equivalently, by (3.2.8), a UFD. If the Minkowski bound is greater than 2 but less than 3, we must examine ideals whose norm is 2. If I is such an ideal, then by (4.2.9), I divides (2). Thus the prime factorization of (2) will give useful information about the class number. In the exercises, we will look at several explicit examples. Problems For Section Calculate the Minkowski bound on ideal norms for an imaginary quadratic field, in terms of the field discriminant d. Use the result to show that Q( m) has class numbe for m = 1, 2, 3, Calculate the Minkowski bound on ideal norms or a real quadratic field, in terms of the field discriminant d. Use the result to show that Q( m) has class numbe for m =2, 3, 5, Show that in the ring of algebraic integers of Q( 5), there is only one ideal whose norm is 2. Then use the Minkowski bound to prove that the class number is Repeat Problem 3 for Q( 6). 5. Show that the only prime ideals of norm 2 in the ring of algebraic integers of Q( 17) are principal. Conclude that the class number is Find the class number of Q( 14). (It will be necessary to determine the number of ideals of norm 3 as well as norm 2.) Problems 7-10 consider bounds on the field discriminant. 7. Let L be a number field of degree n over Q, with field discriminant d. Show that d a n =(π/4) n n 2n /(n!) Show that a 2 = π 2 /4and a n+1 /a n 3π/4. From this, derive the lower bound d (π/3)(3π/4) n 1 for n Show that n/ log d is bounded above by a constant that is independent of the particular number field. 10. Show that if L Q, then d > 1, hence in any nontrivial extension of Q, at least one prime must ramify.

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

The discriminant First and raw version 0.1 23. september 2013 klokken 13:45 One of the most significant invariant of an algebraic number field is the discriminant. One is tempted to say, apart from the

CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas

1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

Algebraic Number Theory 1. Algebraic prerequisites 1.1. General 1.1.1. Definition. For a field F define the ring homomorphism Z F by n n 1 F. Its kernel I is an ideal of Z such that Z/I is isomorphic to

ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free

1 Review of complex numbers 1.1 Complex numbers: algebra The set C of complex numbers is formed by adding a square root i of 1 to the set of real numbers: i = 1. Every complex number can be written uniquely

MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some non-constructive existence theorems throughout mathematics. We will

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since