DOCSLIB.ORG

Field Extensions Generated by Kernels of Isogenies by Jonathan

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Field Extensions Generated by Kernels of Isogenies by Jonathan Love A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Mathematics University of Toronto c Copyright 2016 by Jonathan Love Abstract Field Extensions Generated by Kernels of Isogenies Jonathan Love Master of Science Graduate Department of Mathematics University of Toronto 2016 Given an odd prime p, A technique due to Jean-Fran¸coisMestre allows one to construct infinitely many quadratic fields for which the ideal class group has p{rank at least 2, using a degree p isogeny between elliptic curves such that the kernel has a rational point. This technique only works for primes p ≤ 7; we attempt to generalize the construction for larger primes. One line of approach uses higher degree isogenies (which have no rational point in the kernel), from which we obtain higher-degree number fields with p{rank at least two. In the process, we collect data on the number fields generated by the points in the kernel of an isogeny, and make a series of conjectures based on the data. We also discuss the possibilities and limitations of replacing the elliptic curves in Mestre's technique with more general abelian varieties. ii Contents 1 Motivation: Ideal Class Groups1 1.1 Results and Open Problems...................................2 2 Elliptic Curves and Isogenies5 2.0.1 The Projective Plane...................................5 2.1 Elliptic Curves..........................................6 2.2 Isogenies..............................................7 2.3 Generating Quadratic Fields...................................8 2.3.1 Preimages of Quotient Maps..............................9 3 Isogenies with Irrational Kernel 11 3.1 Data on Kernel Fields...................................... 12 3.2 Observations from the Data................................... 12 3.2.1 p = 11; 19; 43; 67..................................... 13 3.2.2 p = 37........................................... 15 3.2.3 p = 17........................................... 16 3.2.4 p = 13........................................... 16 3.3 Preimages of points........................................ 17 3.3.1 Points with X 2 Q .................................... 17 Examples......................................... 18 Ramification....................................... 19 3.3.2 Points with X 2 K .................................... 19 4 Higher Genus Curves 21 4.1 Background............................................ 21 4.2 Hyperelliptic curves....................................... 22 4.3 Z=pZ covers by Descent..................................... 22 4.3.1 A family of hyperelliptic curves............................. 22 4.4 Proportion of Points on a Curve for which p j h(Q(P )).................... 24 5 Appendix: Description of Code 28 5.1 Computing Ideal Class Groups................................. 28 5.1.1 Classes of Binary Quadratic Forms........................... 28 5.1.2 The Class Group of Forms................................ 30 iii Operating on Form Orbits................................ 33 5.2 Points P on a curve with p j h(Q(P )).............................. 34 5.3 Kernel Fields of Isogenies.................................... 35 Bibliography 37 iv List of Tables 3.1 Extensions generated by kernels of isogenies.......................... 14 v List of Figures 4.1 Proportion of points (X; Y ) 2 X0(11) with X 2 Q and 5 j h(Q(P ))............. 24 4.2 Proportion of points (X; Y ) 2 X0(23) with X 2 Q and 11 j h(Q(P ))............ 24 4.3 y2 = x6 + 2x5 + 5x4 + 2x3 + 2x2 + 1 (has 11{torsion), p = 11................ 25 4.4 y2 = x6 + 2x5 + 5x4 + 2x3 + 2x2 + 2 (no 11{torsion), p = 11................. 25 4.5 y2 = x6 + 4x4 + 10x3 + 4x2 − 4x + 1 (has 13{torsion), p = 13................ 26 4.6 y2 = x6 + x5 + x4 + x3 + x2 + 3x + 1 (no 13{torsion), p = 13................ 26 4.7 y2 = (9x2 + 2x + 1)(32x3 + 81x2 − 6x + 1) (has 17{torsion), p = 17............. 27 4.8 y2 = (10 − x)(3x + 2)(72x4 + 96x3 + 45x2 − 38x + 5) (has 17{torsion), p = 17....... 27 vi Chapter 1 Motivation: Ideal Class Groups Consider a field K that is a finite extension of Q, and let OK be its ring of integers. In many ways, this ring behaves a lot like the integers. For instance, there is a well-defined notion of size, and elements can always be factored into a finite product of smaller irreducible elements. Studying these number systems can often give us insights into the structure of the integers themselves (as an example, the question of which integers can be expressed as a sum of two squares can be completely solved by considering factorization in Z[i]; see for instance section 2.2 of [12]). There is one very significant way in which these rings may fail to be like the integers, however: there is not always a unique way to factor an element into irreducible elements. This has considerable implications in number theory; for instance, if factorization into irreducibles were always unique, then we might have had a relatively simple proof of Fermat's last theorem as early as the 1800s ([7]). As a result, it would be useful to measure, in some sense, the extent to which unique factorization fails. Fortunately, a convenient tool for doing so exists, using the ideals of the ring. We note the following proposition: Theorem 1.0.1. Let OK be the ring of integers of a finite extension K=Q. Then elements of OK can be factored uniquely into irreducible elements if and only if every ideal of OK is a principal ideal. (see e.g. [22], Proposition 3.18 and preceding discussion). In particular, factorization of ideals of OK into prime ideals is always unique, and in a principal ideal domain, this factorization corresponds with the factorization of an element into irreducible elements. Thus, to study the failure of unique factorization, we need to study the ways in which an ideal can fail to be a principal ideal. The set of nonzero ideals IK of a ring of integers OK form a monoid under the operation of multi- plication. We define an equivalence relation ∼ on IK: given I;J 2 IK, we say I ∼ J if (a)I = (b)J for some a; b 2 OK . The set of equivalence classes is called Cl(K). One can check that multiplication is well defined on equivalence classes, and in fact makes Cl(K) into a group, called the ideal class group of K. The collection of all principal ideals is one of the equivalence classes, and corresponds to the identity element of Cl(K); thus, OK has unique factorization if and only if Cl(K) is the trivial group. So to better understand failure of unique factorization, Cl(K) is the structure we would like to understand. One of the most basic results about Cl(K) is the following: Theorem 1.0.2 ([22], Theorem 4.3). Let D be the discriminant of K, n = [K : Q], and 2r the number 1 Chapter 1. Motivation: Ideal Class Groups 2 of non-real embeddings K,! C. Then every equivalence class of ideals has an ideal I with 4 r n! N(I) ≤ pjDj : π nn Since there are only finitely many ideals of any given norm, this allows us to prove an important corollary: Theorem 1.0.3. Cl(K) is a finite abelian group. In fact, we can directly compute Cl(K) simply by listing all ideals with norm no greater than the Minkowski bound and checking how they multiply together - though this algorithm is impractical for all but the simplest field extensions. A more efficient algorithm is discussed in the appendix, section 5.1. Instead of taking a field and computing its class group, one can ask the converse; given a finite abelian group A, which fields K have Cl(K) = A? Or, more generally, have A ≤ Cl(K)? Very little is known about this sort of question in general, but considerable progress has been made in the case of quadratic fields. 1.1 Results and Open Problems For the remainder of this section, D 2 will denote a fundamental discriminant (either D ≡ 1 (mod 4) Z p is squarefree, or D ≡ 2; 3 (mod 4) is squarefree), and K will be a quadratic field: K = ( D) for some 4 p Q fundamental discriminant D. Note that every quadratic field K = Q( M) can be written in this way; if s2 is the largest perfect square dividing M (so that M=s2 is squarefree), then ( 2 2 M; M=s2 ≡ 2; 3 (mod 4) D = s 1 2 2 s M; M=s ≡ 1 (mod 4) p p is a fundamental discriminant with Q( M) = Q( D). We define the class number h(K) := jCl(K)j. Though Gauss conjectured the following in 1801 ([14], Section V, Article 303), this fact was only proven in 1934 by Heilbronn ([16]): p Theorem 1.1.1. For each n 2 Z, there are only finitely many D < 0 for which h(Q( D)) = n. In fact, we have very strict bounds on the growth of the class number: Theorem 1.1.2 (Siegel, 1935 [26]). For all " > 0, p 1=2−" 1=2+" jDj h(Q( D)) jDj : (Here f(D) g(D) means that for all C 2 R, we have Cf(D) < g(D) for sufficiently large D). However, though this tells us a lot about the size of the class group, it fails to give us much more information about the structure of the group itself. However, not much progress has been made in this direction. We do have the following: Theorem 1.1.3 (Ankeny, 1955 [1]). For any positive integer n, there are infinitely many D < 0 such p that h(Q( D)) is divisible by n. Chapter 1. Motivation: Ideal Class Groups 3 By Cauchy's theorem, this tells us that whenever A is a product of distinct prime cyclic groups (i.e. when jAj is squarefree), A appears as a subgroup of the ideal class group for infinitely many imaginary quadratic fields.
Recommended publications
  • The Class Number One Problem for Imaginary Quadratic Fields

    The Class Number One Problem for Imaginary Quadratic Fields

    MODULAR CURVES AND THE CLASS NUMBER ONE PROBLEM JEREMY BOOHER Gauss found 9 imaginary quadratic fields with class number one, and in the early 19th century conjectured he had found all of them. It turns out he was correct, but it took until the mid 20th century to prove this. Theorem 1. Let K be an imaginary quadratic field whose ring of integers has class number one. Then K is one of p p p p p p p p Q(i); Q( −2); Q( −3); Q( −7); Q( −11); Q( −19); Q( −43); Q( −67); Q( −163): There are several approaches. Heegner [9] gave a proof in 1952 using the theory of modular functions and complex multiplication. It was dismissed since there were gaps in Heegner's paper and the work of Weber [18] on which it was based. In 1967 Stark gave a correct proof [16], and then noticed that Heegner's proof was essentially correct and in fact equiv- alent to his own. Also in 1967, Baker gave a proof using lower bounds for linear forms in logarithms [1]. Later, Serre [14] gave a new approach based on modular curve, reducing the class number + one problem to finding special points on the modular curve Xns(n). For certain values of n, it is feasible to find all of these points. He remarks that when \N = 24 An elliptic curve is obtained. This is the level considered in effect by Heegner." Serre says nothing more, and later writers only repeat this comment. This essay will present Heegner's argument, as modernized in Cox [7], then explain Serre's strategy.
  • Introduction to Class Field Theory and Primes of the Form X + Ny

    Introduction to Class Field Theory and Primes of the Form X + Ny

    Introduction to Class Field Theory and Primes of the Form x2 + ny2 Che Li October 3, 2018 Abstract This paper introduces the basic theorems of class field theory, based on an exposition of some fundamental ideas in algebraic number theory (prime decomposition of ideals, ramification theory, Hilbert class field, and generalized ideal class group), to answer the question of which primes can be expressed in the form x2 + ny2 for integers x and y, for a given n. Contents 1 Number Fields1 1.1 Prime Decomposition of Ideals..........................1 1.2 Basic Ramification Theory.............................3 2 Quadratic Fields6 3 Class Field Theory7 3.1 Hilbert Class Field.................................7 3.2 p = x2 + ny2 for infinitely n’s (1)........................8 3.3 Example: p = x2 + 5y2 .............................. 11 3.4 Orders in Imaginary Quadratic Fields...................... 13 3.5 Theorems of Class Field Theory.......................... 16 3.6 p = x2 + ny2 for infinitely many n’s (2)..................... 18 3.7 Example: p = x2 + 27y2 .............................. 20 1 Number Fields 1.1 Prime Decomposition of Ideals We will review some basic facts from algebraic number theory, including Dedekind Domain, unique factorization of ideals, and ramification theory. To begin, we define an algebraic number field (or, simply, a number field) to be a finite field extension K of Q. The set of algebraic integers in K form a ring OK , which we call the ring of integers, i.e., OK is the set of all α 2 K which are roots of a monic integer polynomial. In general, OK is not a UFD but a Dedekind domain.
  • Units and Primes in Quadratic Fields

    Units and Primes in Quadratic Fields

    Units and Primes 1 / 20 Overview Evolution of Primality Norms, Units, and Primes Factorization as Products of Primes Units in a Quadratic Field 2 / 20 Rational Integer Primes Definition A rational integer m is prime if it is not 0 or ±1, and possesses no factors but ±1 and ±m. 3 / 20 Division Property of Rational Primes Theorem 1.3 Let p; a; b be rational integers. If p is prime and and p j ab, then p j a or p j b. 4 / 20 Gaussian Integer Primes Definition Let π; α; β be Gaussian integers. We say that prime if it is not 0, not a unit, and if in every factorization π = αβ, one of α or β is a unit. Note A Gaussian integer is a unit if there exists some Gaussian integer η such that η = 1. 5 / 20 Division Property of Gaussian Integer Primes Theorem 1.7 Let π; α; β be Gaussian integers. If π is prime and π j αβ, then π j α or π j β. 6 / 20 Algebraic Integers Definition An algebraic number is an algebraic integer if its minimal polynomial over Q has only rational integers as coefficients. Question How does the notion of primality extend to the algebraic integers? 7 / 20 Algebraic Integer Primes Let A denote the ring of all algebraic integers, let K = Q(θ) be an algebraic extension, and let R = A \ K. Given α; β 2 R, write α j β when there exists some γ 2 R with αγ = β. Definition Say that 2 R is a unit in K when there exists some η 2 R with η = 1.
  • A Concrete Example of Prime Behavior in Quadratic Fields

    A Concrete Example of Prime Behavior in Quadratic Fields

    A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this paper is to provide a concise way for undergraduate math- ematics students to learn about how prime numbers behave in quadratic fields. This paper will provide students with some basic number theory background required to understand the material being presented. We start with the topic of quadratic fields, number fields of degree two. This section includes some basic properties of these fields and definitions which we will be using later on in the paper. The next section introduces the reader to prime numbers and how they are different from what is taught in earlier math courses, specifically the difference between an irreducible number and a prime number. We then move onto the majority of the discussion on prime numbers in quadratic fields and how they behave, specifically when a prime will ramify, split, or be inert. The final section of this paper will detail an explicit example of a quadratic field and what happens to prime numbers p within it. The specific field we choose is Q( −5) and we will be looking at what forms primes will have to be of for each of the three possible outcomes within the field. 2. Quadratic Fields One of the most important concepts of algebraic number theory comes from the factorization of primes in number fields. We want to construct Date: March 17, 2017. 1 2 CASEY BRUCK a way to observe the behavior of elements in a field extension, and while number fields in general may be a very complicated subject beyond the scope of this paper, we can fully analyze quadratic number fields.
  • Computational Techniques in Quadratic Fields

    Computational Techniques in Quadratic Fields

    Computational Techniques in Quadratic Fields by Michael John Jacobson, Jr. A thesis presented to the University of Manitoba in partial fulfilment of the requirements for the degree of Master of Science in Computer Science Winnipeg, Manitoba, Canada, 1995 c Michael John Jacobson, Jr. 1995 ii I hereby declare that I am the sole author of this thesis. I authorize the University of Manitoba to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Manitoba to reproduce this thesis by photocopy- ing or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. iii The University of Manitoba requires the signatures of all persons using or photocopy- ing this thesis. Please sign below, and give address and date. iv Abstract Since Kummer's work on Fermat's Last Theorem, algebraic number theory has been a subject of interest for many mathematicians. In particular, a great amount of effort has been expended on the simplest algebraic extensions of the rationals, quadratic fields. These are intimately linked to binary quadratic forms and have proven to be a good test- ing ground for algebraic number theorists because, although computing with ideals and field elements is relatively easy, there are still many unsolved and difficult problems re- maining. For example, it is not known whether there exist infinitely many real quadratic fields with class number one, and the best unconditional algorithm known for computing the class number has complexity O D1=2+ : In fact, the apparent difficulty of com- puting class numbers has given rise to cryptographic algorithms based on arithmetic in quadratic fields.
  • Computing Infeasibility Certificates for Combinatorial Problems Through

    Computing Infeasibility Certificates for Combinatorial Problems Through

    1 Computing Infeasibility Certificates for Combinatorial Problems through Hilbert’s Nullstellensatz Jesus´ A. De Loera Department of Mathematics, University of California, Davis, Davis, CA Jon Lee IBM T.J. Watson Research Center, Yorktown Heights, NY Peter N. Malkin Department of Mathematics, University of California, Davis, Davis, CA Susan Margulies Computational and Applied Math Department, Rice University, Houston, TX Abstract Systems of polynomial equations with coefficients over a field K can be used to concisely model combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3- colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solu- tion over the algebraic closure of the field K. In this paper, we investigate an algorithm aimed at proving combinatorial infeasibility based on the observed low degree of Hilbert’s Nullstellensatz certificates for polynomial systems arising in combinatorics, and based on fast large-scale linear- algebra computations over K. We also describe several mathematical ideas for optimizing our algorithm, such as using alternative forms of the Nullstellensatz for computation, adding care- fully constructed polynomials to our system, branching and exploiting symmetry. We report on experiments based on the problem of proving the non-3-colorability of graphs. We successfully solved graph instances with almost two thousand nodes and tens of thousands of edges. Key words: combinatorics, systems of polynomials, feasibility, Non-linear Optimization, Graph 3-coloring 1. Introduction It is well known that systems of polynomial equations over a field can yield compact models of difficult combinatorial problems. For example, it was first noted by D.
  • Gsm073-Endmatter.Pdf

    Gsm073-Endmatter.Pdf

    http://dx.doi.org/10.1090/gsm/073 Graduat e Algebra : Commutativ e Vie w This page intentionally left blank Graduat e Algebra : Commutativ e View Louis Halle Rowen Graduate Studies in Mathematics Volum e 73 KHSS^ K l|y|^| America n Mathematica l Societ y iSyiiU ^ Providence , Rhod e Islan d Contents Introduction xi List of symbols xv Chapter 0. Introduction and Prerequisites 1 Groups 2 Rings 6 Polynomials 9 Structure theories 12 Vector spaces and linear algebra 13 Bilinear forms and inner products 15 Appendix 0A: Quadratic Forms 18 Appendix OB: Ordered Monoids 23 Exercises - Chapter 0 25 Appendix 0A 28 Appendix OB 31 Part I. Modules Chapter 1. Introduction to Modules and their Structure Theory 35 Maps of modules 38 The lattice of submodules of a module 42 Appendix 1A: Categories 44 VI Contents Chapter 2. Finitely Generated Modules 51 Cyclic modules 51 Generating sets 52 Direct sums of two modules 53 The direct sum of any set of modules 54 Bases and free modules 56 Matrices over commutative rings 58 Torsion 61 The structure of finitely generated modules over a PID 62 The theory of a single linear transformation 71 Application to Abelian groups 77 Appendix 2A: Arithmetic Lattices 77 Chapter 3. Simple Modules and Composition Series 81 Simple modules 81 Composition series 82 A group-theoretic version of composition series 87 Exercises — Part I 89 Chapter 1 89 Appendix 1A 90 Chapter 2 94 Chapter 3 96 Part II. AfRne Algebras and Noetherian Rings Introduction to Part II 99 Chapter 4. Galois Theory of Fields 101 Field extensions 102 Adjoining
  • Finite Field

    Finite Field

    Finite field From Wikipedia, the free encyclopedia In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod n when n is a prime number. TheFinite number field - Wikipedia,of elements the of free a finite encyclopedia field is called its order. A finite field of order q exists if and only if the order q is a prime power p18/09/15k (where 12:06p is a amprime number and k is a positive integer). All fields of a given order are isomorphic. In a field of order pk, adding p copies of any element always results in zero; that is, the characteristic of the field is p. In a finite field of order q, the polynomial Xq − X has all q elements of the finite field as roots. The non-zero elements of a finite field form a multiplicative group. This group is cyclic, so all non-zero elements can be expressed as powers of a single element called a primitive element of the field (in general there will be several primitive elements for a given field.) A field has, by definition, a commutative multiplication operation. A more general algebraic structure that satisfies all the other axioms of a field but isn't required to have a commutative multiplication is called a division ring (or sometimes skewfield).
  • Math 154. Class Groups for Imaginary Quadratic Fields

    Math 154. Class Groups for Imaginary Quadratic Fields

    Math 154. Class groups for imaginary quadratic fields Homework 6 introduces the notion of class group of a Dedekind domain; for a number field K we speak of the \class group" of K when we really mean that of OK . An important theorem later in the course for rings of integers of number fields is that their class group is finite; the size is then called the class number of the number field. In general it is a non-trivial problem to determine the class number of a number field, let alone the structure of its class group. However, in the special case of imaginary quadratic fields there is a very explicit algorithm that determines the class group. The main point is that if K is an imaginary quadratic field with discriminant D < 0 and we choose an orientation of the Z-module OK (or more concretely, we choose a square root of D in OK ) then this choice gives rise to a natural bijection between the class group of K and 2 2 the set SD of SL2(Z)-equivalence classes of positive-definite binary quadratic forms q(x; y) = ax + bxy + cy over Z with discriminant 4ac − b2 equal to −D. Gauss developed \reduction theory" for binary (2-variable) and ternary (3-variable) quadratic forms over Z, and via this theory he proved that the set of such forms q with 1 ≤ a ≤ c and jbj ≤ a (and b ≥ 0 if either a = c or jbj = a) is a set of representatives for the equivalence classes in SD.
  • 494 Lecture: Splitting Fields and the Primitive Element Theorem

    494 Lecture: Splitting Fields and the Primitive Element Theorem

    494 Lecture: Splitting fields and the primitive element theorem Ben Gould March 30, 2018 1 Splitting Fields We saw previously that for any field F and (let's say irreducible) polynomial f 2 F [x], that there is some extension K=F such that f splits over K, i.e. all of the roots of f lie in K. We consider such extensions in depth now. Definition 1.1. For F a field and f 2 F [x], we say that an extension K=F is a splitting field for f provided that • f splits completely over K, i.e. f(x) = (x − a1) ··· (x − ar) for ai 2 K, and • K is generated by the roots of f: K = F (a1; :::; ar). The second statement implies that for each β 2 K there is a polynomial p 2 F [x] such that p(a1; :::; ar) = β; in general such a polynomial is not unique (since the ai are algebraic over F ). When F contains Q, it is clear that the splitting field for f is unique (up to isomorphism of fields). In higher characteristic, one needs to construct the splitting field abstractly. A similar uniqueness result can be obtained. Proposition 1.2. Three things about splitting fields. 1. If K=L=F is a tower of fields such that K is the splitting field for some f 2 F [x], K is also the splitting field of f when considered in K[x]. 2. Every polynomial over any field (!) admits a splitting field. 3. A splitting field is a finite extension of the base field, and every finite extension is contained in a splitting field.
  • Modular Forms and the Hilbert Class Field

    Modular Forms and the Hilbert Class Field

    Modular forms and the Hilbert class field Vladislav Vladilenov Petkov VIGRE 2009, Department of Mathematics University of Chicago Abstract The current article studies the relation between the j−invariant function of elliptic curves with complex multiplication and the Maximal unramified abelian extensions of imaginary quadratic fields related to these curves. In the second section we prove that the j−invariant is a modular form of weight 0 and takes algebraic values at special points in the upper halfplane related to the curves we study. In the third section we use this function to construct the Hilbert class field of an imaginary quadratic number field and we prove that the Ga- lois group of that extension is isomorphic to the Class group of the base field, giving the particular isomorphism, which is closely related to the j−invariant. Finally we give an unexpected application of those results to construct a curious approximation of π. 1 Introduction We say that an elliptic curve E has complex multiplication by an order O of a finite imaginary extension K/Q, if there exists an isomorphism between O and the ring of endomorphisms of E, which we denote by End(E). In such case E has other endomorphisms beside the ordinary ”multiplication by n”- [n], n ∈ Z. Although the theory of modular functions, which we will define in the next section, is related to general elliptic curves over C, throughout the current paper we will be interested solely in elliptic curves with complex multiplication. Further, if E is an elliptic curve over an imaginary field K we would usually assume that E has complex multiplication by the ring of integers in K.
  • 22 Ring Class Fields and the CM Method

    22 Ring Class Fields and the CM Method

    18.783 Elliptic Curves Spring 2017 Lecture #22 05/03/2017 22 Ring class fields and the CM method Let O be an imaginary quadratic order of discriminant D, and let EllO(C) := fj(E) 2 C : End(E) = Cg. In the previous lecture we proved that the Hilbert class polynomial Y HD(X) := HO(X) := X − j(E) j(E)2EllO(C) has integerp coefficients. We then defined L to be the splitting field of HD(X) over the field K = Q( D), and showed that there is an injective group homomorphism Ψ: Gal(L=K) ,! cl(O) that commutes with the group actions of Gal(L=K) and cl(O) on the set EllO(C) = EllO(L) of roots of HD(X). To complete the proof of the the First Main Theorem of Complex Multiplication, which asserts that Ψ is an isomorphism, we need to show that Ψ is surjective, equivalently, that HD(X) is irreducible over K. At the end of the last lecture we introduced the Artin map p 7! σp, which sends each unramified prime p of K (prime ideal of OK ) to the corresponding Frobenius element σp, which is the unique element of Gal(L=K) for which Np σp(x) ≡ x mod q; (1) for all x 2 OL and primes qjp (prime ideals of OL that divide the ideal pOL); the existence of a single σp 2 Gal(L=K) satisfying (1) for all qjp follows from the fact that Gal(L=K) ,! cl(O) is abelian. The Frobenius element σp can also be characterized as follows: for each prime qjp the finite field Fq := OL=q is an extension of the finite field Fp := OK =p and the automorphism σ¯p 2 Gal(Fq=Fp) defined by σ¯p(¯x) = σ(x) (where x 7! x¯ is the reduction Np map OL !OL=q), is the Frobenius automorphism x 7! x generating Gal(Fq=Fp).