# A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

Save this PDF as:

Size: px
Start display at page:

Download "A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number"

## Transcription

1 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 let α K. The unique monic, irreducible polynomial f Q[X] of smallest degree such that f(α) = 0 is called the normalised minimal polynomial (NMP) of α over Q. Norm and trace For any number field K and any element β K, multiplication by β defines a Q-linear map i(β) : K K. i is an injective ring homomorphism K End Q (K). Let P β = det(xi i(β)) Q[X] be the characteristic polynomial of i(β). Then P β (β) = 0, since i(p β (β)) = P β (i(β)) = 0 by the Cayley Hamilton Theorem. We define the norm and trace of β to be N K/Q (β) = det(i(β)) Tr K/Q (β) = Tr(i(β)). The norm and trace have the following properties: for all α, β K. Also, N K/Q (αβ) = N K/Q (α) N K/Q (β) Tr K/Q (α + β) = Tr K/Q (α) + Tr K/Q (β) N K/Q (λα) = λ [K:Q] N K/Q (α) Tr K/Q (λα) = λ Tr K/Q (α) for all λ Q and all α K. Finally we have the formulae N K/Q (α) = (( 1) d a 0 ) e Tr K/Q (α) = ea d 1, where X d + a d 1 X d a 1 X + a 0 is the NMP of α over Q and e = [K : Q(α)]. Conjugates and embedddings Let K = Q(α) be a number field of degree n and let f Q[X] be the NMP of α. Then f(x) = n (X α i ) i=1 1

2 where the α i, the conjugates of α, are all distinct. For each α i there is a corresponding embedding σ i : K C sending α to α i, and these are all the embeddings of K into C. We write r 1 for the number of real roots of f, and r 2 for the number of pairs of complex conjugate roots. Then n = r 1 + 2r 2. The norm and trace of any β K may be computed in terms of its conjugates, as n N K/Q (β) = σ i (β) Tr K/Q (β) = i=1 n σ i (β), i=1 since i(β) is diagonalizable over K, with diagonal elements σ i (β). Discriminants Let K = Q(α) be a number field and let f be the NMP of α. Then the discriminant of f is disc(f) = α 1 α n 1 1 (α i α j ) 2 α 1 α 2 α n 1 α 2 α n 1 2 = = det A 1 i<j n... α1 n 1 α2 n 1... αn n 1 1 α n αn n 1 where A = (A ij ) and A ij = n k=1 α i+j k = Tr K/Q (α i+j ) = Tr K/Q (α i α j ). Let ω 1,..., ω n be a basis for K/Q. The discriminant of this basis is D(ω 1,..., ω n ) = det A, where A = (A ij ) and A ij = Tr K/Q (ω i ω j ). We have D(1, α, α 2,..., α n 1 ) = disc(f). If we have a change of basis, given by an element g GL n (Q), then A is replaced by g T Ag and the discriminant is multiplied by det(g) 2. Thus we define the discriminant Disc(K/Q) as the discriminant of any basis, modulo squares, that is Disc(K/Q) = D(ω 1,..., ω n ) (mod Q 2 ) Q/Q 2, which does not depend on the choice of basis. Note that for a number field K, Disc(K/Q) 0. A useful formula is N Q(α)/Q (f (α)) = = n f (α i ) i=1 n (α i α j ) i=1 j i = ( 1) n(n 1)/2 (α j α i ) 2 1 i<j n = ( 1) n(n 1)/2 disc(f). 2

3 Algebraic Integers The ring of integers Given a number field K, we want to identify a subring O K to be an analogue of the subring Z of Q. We want O K to be finitely generated as a Z-module, and to be maximal subject to this constraint. We notice that any subring R which is finitely generated as a Z-module has the property that for all α R there exists a monic polynomial f Z[X] such that f(α) = 0. With this in mind, we define an element α K to be an algebraic integer of K if α is the root of some monic polynomial in Z[X], and we denote the set of all algebraic integers in K by O K. An element α K is an algebraic integer if and only if all the coefficients of the NMP of α are (rational) integers. Therefore, if α O K, the trace and norm of α are (rational) integers. Integral bases Let K be a number field of degree n. We say that a basis α 1,..., α n for K over Q is an integral basis if O K = Zα Zα n. We shall show that every number field has an integral basis. First, however, we must show that O K is a subring. To do this we need the following lemma. Lemma Let K be a number field and let α K. Then the following are equivalent: 1. α O K, 2. The additive group Z[α] is finitely generated, 3. There is a vector space V over K and a non-zero, finitely generated abelian subgroup M = Zv Zv m V such that αm M. Using this lemma, we may prove the following theorem. Theorem Let K be a number field. Then 1. If α 1,..., α n O K and f Z[X 1,..., X n ] then f(α 1,..., α n ) O K. 2. O K is a subring of K. 3. If β K is a root of X n + α 1 X n α n, where α 1,..., α n O K, then β O K. In now remains to show that K has an integral basis. First we prove the following theorem, which gives us a method of approximating O K. 3

4 Theorem Let K be a number field of degree n, with α 1,..., α n O K a basis for K over Q. Then where d = D(α 1,..., α n ) Z. Zα Zα n O K Z α 1 d + + Zα n d, In particular, if K = Q(α), where α O K, and f is the NMP of α, then where d = D(1, α,..., α n 1 ) = disc(f). Z[α] O K 1 d Z[α], We are now able to prove that any number field has an integral basis. So O K is a subring which is finitely generated as a Z-module, and since we have seen that every element of a ring which is finitely generated as a Z-module is an algebraic integer, it is clear that O K is maximal. Thus O K is indeed the ring we set out to define. Subgroups of Z n Let GL n (Z) = {g M n (Z) det g = ±1} be the group of linear automorphisms of Z n. A general Z-basis of Z n is of the form e 1,..., e n, where (e 1 e n ) GL n (Z). More generally, if v 1,..., v n Z n set g = (v 1 v n ) M n (Z) and let L = Zv Zv n Z n be the lattice generated by the v i. Then { (Z n det g if det g 0 : L) = if det g = 0. This follows from the Theorem on Elementary Divisors. Z-lattices Let K be a number field. A subgroup A of the additive group of K is called a Z-lattice in K if there exists a basis α 1,..., α n of K over Q such that A = Zα Zα n, or equivalently, if A is finitely generated and contains a basis of K over Q. The discriminant of a Z-lattice The discriminant of a Z-lattice A in K is Disc(A/Z) = D(α 1,..., α n ) for a Z-basis α 1,..., α n of A. This is independent of the choice of Z-basis. The discriminant of a number field K is D K = Disc(O K /Z) = D(α 1,..., α n ) for any integral basis α 1,..., α n. If A and B are Z-lattices in K with B A, then Disc(B/Z) = Disc(A/Z) (A : B) 2. Therefore, if A is a Z-lattice in K with squarefree discriminant, then A = O K. 4

5 Units We wish to describe the group of units OK of O K. If α O K, then α OK if and only if N K/Q (α) = ±1. Note, however, that there exist elements α K \ O K with norm ±1. Dirichlet s Theorem on Units Let K be a number field, with r 1 and r 2 as defined as above. Let r = r 1 + r 2 1 and let µ(k) denote the group of roots of unity in K. Then O K = µ(k) Z r. Thus there are elements ɛ 1,..., ɛ r OK, called the fundamental units of O K, such that each u OK has a unique expression of the form where ζ µ(k) and n i Z. Units in imaginary quadratic fields u = ζɛ n 1 1 ɛnr r, Let K be an imaginary quadratic field. Then r 1 = 0 and r 2 = 1, and so r = 0. Then O K is K = Q( 1) O K = {±1, ±i} K = Q( 3) O K = {±1, ±ρ, ±ρ 2 } K = other O K = {±1}. Units in real quadratic fields Let K be a real quadratic field. Then r 1 = 2 and r 2 = 0, and so r = 1. µ(k) = {±1}, and so where ɛ is the fundamental unit of O K. O K = {±ɛ r r Z}, An order in a number field K is a subring which is also a Z-lattice. A subring R K is an order if and only if R O K and (O K : R) <. Thus O K is the unique maximal order in K. In a quadratic field K, every order is of the form R f = Z + fo K for a unique f {1, 2, 3,...}. R f is called the order of conductor f. 5

6 Algorithm for computing ɛ The following algorithm for computing ɛ is based on the properties of continued fractions. Let K = Q( d), where d 2 is squarefree, and let { d if d 1 (mod 4) θ = 1+ d 2 if d 1 (mod 4). Let f 1 and let α 0 = α = f θ. We want to compute the continued fraction expansion of α, namely [a 0, a 1,..., a m ]. To do this, we let a n = α n and α n+1 = 1 α n a n for each n 0. Note that a n 1 for each n. We continue until we find that α m+1 = α 1, at which point the sequence repeats. Then we recursively compute the convergents to α, that is the values of p n and q n such that p n /q n = [a 0, a 1,..., a n ] with gcd(p n, q n ) = 1 and q n 1, by using the formulae and building up a table like the one below: p n = p n 1 a n + p n 2 q n = q n 1 a n + q n 2 n a n a 0 a 1 a 2 a 3 a 4 p n 0 1 q n 1 0 Then the fundamental unit in R f is ɛ f = p m 1 + q m 1 fθ. 6

7 Ideals and Unique Factorisation If K is a number field then it is not necessarily the case that O K is a UFD. To make up for this, we consider factorization of ideals in O K. We shall show that the non-zero ideals in O K factorise uniquely as a product of non-zero prime ideals. Summary of properties of ideals An ideal I in a ring R is a non-empty subset which is closed under addition, and closed under multiplication from outside. Ideals are precisely the kernels of ring homomorphisms. I is a prime ideal if I R and ab I a I or b I. I is a maximal ideal if I R and the only ideal J I is J = R. I is a prime ideal iff R/I is a domain and I R. I is a maximal ideal iff R/I is a field (and so I R necessarily). Thus every maximal ideal is prime. If I and J are ideals, then so are I J, I + J and IJ I J. J = (β 1,..., β m ) are finitely generated, then so are If I = (α 1,..., α n ) and I + J = (α 1,..., α n, β 1,..., β m ) IJ = (α 1 β 1,..., α n β m ). Ideals behave in a similar manner to integers. We can think of the inclusion I J as meaning I J. Then I J represents lcm(i, J) and I + J represents hcf(i, J). Furthermore, if p is a prime ideal and p IJ, then p I or p J, so prime ideals behave like prime elements. Properties of O K Our proof of unique factorisation of ideals below holds in fact for any Dedekind ring. O K is a Dedekind ring, which means, among other things, that 1. O K is a domain (this is obvious). 2. O K is Noetherian (and hence factorisation into irreducibles is possible). 3. The prime ideals in O K are just (0) together with all the maximal ideals. Some ring theory In any ring, primes are always irreducible. In a domain in which factorisation into irreducibles is possible in particular, in O K factorisation is unique iff every irreducible is prime. Any Euclidean domain is a PID, and any PID is a UFD. A number field is a UFD iff it is a PID, but this is not easy to prove it is a consequence of the proof below (check this). A motivating example (taken from Stewart) In Q( 15) we have the following situation: 2 5 = (5 + 15)(5 15), 7

8 where all four of these factors are irreducible. Thus we do not have unique factorisation. In a sense, the problem is that we have irreducible elements which aren t prime if 2, say, were prime then 2 would divide one of the factors on the RHS of the equation and then that factor wouldn t be irreducible. If we could introduce 5 into the system then we could split up the factors as 2 = ( 5 + 3)( 5 3) (5 + 15) = ( 5)( 5 + 3) 5 = ( 5)( 5) (5 15) = ( 5)( 5 3) and we see that the two possible factorisations of 10 above were just given by different groupings of our four new factors. So if we extend Q( 15) to Q( 5, 3) then we have unique factorisation of elements in Q( 15) into primes in Q( 5, 3). Now consider the situation from the perspective of ideals. We have that any a Q( 15) can be written uniquely as a = p 1 p n for some primes p i Q( 3, 5). Hence we have (a) = (p 1 p n ) = (p 1 ) (p n ), a factorisation of a principal ideal in Q( 3, 5) as a product of more principal ideals. Now we can intersect each ideal above with O Q( 15) to get a factorisation of ideals in Q( 15) but these might not be principal ideals, for example we could get (a) = (b 1, b 2 )(b 3, b 4 ), so this factorisation of ideals doesn t necessarily give rise to a factorisation of the element a. The non-principal ideals are like the 5 factors we need to introduce. Fractional ideals A fractional ideal in K is a subset of the form αi K, where α K and I O K is a non-zero ideal. There is an obvious multiplication defined on fractional ideals, by This is well-defined, as (αi)(βj) = αβ(ij). 1. If α, β K, then αβ K, and if I and J are non-zero ideals of O K, then so is IJ. 2. If α 1 I 1 = α 2 I 2 and β 1 J 1 = β 2 J 2, then α 1 β 1 (I 1 J 1 ) = α 2 β 2 (I 2 J 2 ). Furthermore, R = 1(1) is the identity element for this multiplication, and so the fractional ideals in K form a monoid. In fact, the fractional ideals form a group, with inverses given by I 1 = {x K xi O K }. This is a fractional ideal, for if α I, αi 1 is easily seen to be an ideal. The three main stages in proving that the fractional ideals are a group are summarised below: 1. If II 1 = O K for all non-zero prime ideals p O K then it holds for all fractional ideals. 2. Let p O K be a non-zero prime ideal. Then p 1 O K. 3. pp 1 = O K. 8

9 Proof of unique factorisation of ideals Existence. Let S = {I O K I is a non-zero ideal, I p 1 p r for any r 0 and non-zero prime ideals p i }. If S then there exists a maximal element (w.r.t. inclusion) I S, since O K is noetherian. Since I O K there exists a maximal ideal p such that I p. Since p is maximal, it is also prime. Set J = Ip 1 O K ; then I = Jp J. But then the maximality of I implies that J / S and so J = p 1 p r. But then I = p 1 p r p a contradiction. Uniqueness. Suppose that p 1 p r = q 1 q s. Then p 1 q 1 q s and so p 1 q i for some i wlog we may assume that i = 1. But since p 1 and q 1 are both maximal ideals it must be the case that p 1 = q 1. Multiplying by p 1 1 we see that p 2 p r = q 2 q s. The result follows by induction. The Chinese Remainder Theorem Let R be a ring and let I 1,..., I n R be ideals such that hcf(i i, I j ) = I + J = R for every i and j. Then R/(I 1 I n ) R/I 1 R/I n is an isomorphism. In particular, if p 1,..., p n O K are distinct non-zero prime ideals then the canonical map O K /p a 1 1 pa n n O K /p a 1 1 O K/p a n n is an isomorphism. Valuations Let K be a number field and let x K. Then (x) = p a i i for some distinct non-zero prime ideals p i and n i Z, and we define ord p has the following properties: 1. ord p (xy) = ord p (x) + ord p (y). 2. ord p (x + y) min(ord p (x), ord p (y)). ord pi (x) = n i. 3. x O K \ {0} ord p (x) 0 for all non-zero prime ideals p. Norms of ideals If I O K is a ideal, then the norm of I is defined by { 0 if I = (0) N(I) = (O K : I) if I (0). The norm has the following two properties: 1. N((α)) = N K/Q (α) for all α O K. 2. N(IJ) = N(I)N(J). For any n Z, there are only finitely many ideals in O K with norm n. 9

10 Decomposition of primes in O K Let p be a non-zero prime ideal in O K. The residue field of p is k(p) = O K /p. This is a finite field, of characteristic p > 0 for some prime p Z. We say that p lies above p, and write p p. The degree of p is f(p) = deg(p) = [k(p) : F p ], and so N(p) = p f(p). Observe that if n Z then p (n) n p n = 0 k(p) p n. So p (p) but p (q) for all primes q p. Now fix a prime p and decompose (p) as (p) = p e 1 1 per r, where the p i are distinct non-zero prime ideals. Then the p i are precisely the prime ideals lying above p. We define the ramification index of p i to be e(p) = e i. We say that p i is ramified if e i > 1, or unramified otherwise. p is called ramified if there exists a p lying above p such that p is ramified. Finally, if (p) = p p p e(p) as above, then e(p)f(p) = [K : Q] = n. p p 10

11 The Ideal Class Group The ideal class group of K, written Cl K, is the group of equivalence classes of fractional ideals in K, where two fractional ideals I, J are said to be equivalent, written I J, if there exists α K such that I = (α)j. Every ideal class has a representative I O K. The ideal class group is always finite. The class number of K is h K = Cl K. Minkowski s Theorem Suppose S R n is centrally symmetric, convex and measurable. If Γ R n is a lattice such that vol(s) > 2 n vol(r n /Γ) then there exists a non-zero point α Γ S. Moreover, if S is also compact then such an α exists when vol(s) = 2 n vol(r n /Γ). Proof of the finiteness of the ideal class group See lecture notes. The Minkowski bound Every class in Cl K is represented by an ideal I O K with N(I) n! ( ) 4 r2 n n D K 1/2. π The Minkowski bound gives us a lower bound on the discriminant of a number field. The Kummer Dedekind Theorem Let K = Q(α) be a number field with α O K. Let f be the minimal polynomial for α over Q and let p be a prime number such that p (O K : Z[α]). Write f = ḡ e 1 1 ḡe r r in F p [X], where ḡ i are distinct irreducible monic polynomials. Choose representatives g i Z[X] for the ḡ i and put p i = (p, g i (α)) O K. Then p 1,..., p r are distinct prime ideals in O K with f(p i ) = deg(p i ) = deg(ḡ i ), and (p) decomposes as (p) = p e 1 1 pe r r. Consequences 1. Under the assumptions of the Kummer Dedekind Theorem, p is ramified in K/Q iff p D K. 2. Only finitely many primes p ramify in K/Q. 11

12 Quadratic Fields There follows a collection of results regarding quadratic fields. Quadratic extensions Let K/Q be a quadratic extension. Then K = Q(α), where α K has minimal polynomial f(x) = X 2 + bx + c over Q. Since f is irreducible, b 2 4c is not a square in Q. Thus α = ( b ± b 2 4c)/2 and so in fact K = Q( d), where d = b 2 4c Q. Furthermore, we may assume that d Z, by multiplying by the square of the denominator of d, and we may assume that d is squarefree, by dividing by any repeated factor. The resulting d cannot be 0 or 1 since otherwise d would have to have been a square originally. Conversely, if d Z \ {0, 1} is squarefree, then d has minimal polynomial f(x) = X 2 d over Q and hence Q( d)/q is a quadratic extension. Therefore the quadratic number fields are just Q( d), where d Z \ {0, 1} is squarefree. If we have two such values d 1 d 2 then it is easy to see that Q( d 1 ) Q( d 2 ). In what follows d is assumed to satisfy this condition and K is taken to be Q( d). The ring of integers Let α = a + b d K, where a, b Q. Then either 1. b = 0, in which case α O K iff a Z, or 2. b 0, in which case α satisfies (X a) 2 b 2 d = 0, and so since α / Q the minimal polynomial of α is X 2 2aX + (a 2 b 2 d). But α O K iff the minimal polynomial of α is in Z[X], and so α O K iff Now either 2a Z a 2 b 2 d Z. (a) a Z, in which case b 2 d Z and, since d is squarefree, b Z, or (b) a Z + 1 2, in which case b2 d Z But then (2b)2 d 4Z + 1 and so b Z and d 1 (mod 4). Therefore, if d 1 (mod 4) then α O K iff a, b Z, and if d 1 (mod 4) then α O K iff a, b Z or a, b Z We may summarise this as { Z + Z d if d 1 (mod 4) O K = Z + Z 1+ d 2 if d 1 (mod 4). If we define { d if d 1 (mod 4) θ = 1+ d 2 if d 1 (mod 4) then O K = Z + Zθ and so {1, θ} is an integral basis for K. 12

13 The discriminant The minimal polynomial for θ is f(x) = and so the discriminant of K is { X 2 d if d 1 (mod 4) X 2 X + 1 d 4 if d 1 (mod 4). D K = { 4d if d 1 (mod 4) d if d 1 (mod 4). Norm and trace Write a + b d to mean a b d, the conjugate of a + b d. Then and N K/Q (x + yθ) = (x + yθ)(x + yθ) = (x + yθ)(x + y θ) { x 2 dy 2 if d 1 (mod 4) = x 2 + xy + ( ) 1 d 4 y 2 if d 1 (mod 4) Tr K/Q (x + yθ) = x Tr K/Q (1) + y Tr K/Q (θ) { 2x if d 1 (mod 4) = 2x + y if d 1 (mod 4). A simpler expression is N K/Q (a + b d) = a 2 db 2 Tr K/Q (a + b d) = 2a. Units Let K be an imaginary quadratic field (d < 0) and let α = x + yθ. N K/Q (α) = ±1. Now if d 1 (mod 4) then Then α is a unit iff N K/Q (α) = x 2 + ( d)y 2 = ±1 and so x = ±1, y = 0, or d = 1 and x = 0, y = ±1. If d 1 (mod 4) then N K/Q (α) = x 2 + xy + ( ) 1 d 4 y 2 = ±1 (2x + y) 2 + ( d)y 2 = ±4 and so x = ±1, y = 0, or d = 3 and either x = 0, y = ±1, or x = 1, y = 1, or x = 1, y = 1. To summarise, the units in an imaginary quadratic field are where ρ = {±1, ±i} if d = 1 {±1, ±ρ, ±ρ 2 } if d = 3 {±1} otherwise 13

14 Now let K be a real quadratic field (d > 0). The only roots of unity in O K are ±1, since K R. Therefore by Dirichlet s Units Theorem, the units in O K are O K = {±ɛ r r Z}, where ɛ is a fundamental unit, computed using the algorithm described on page 6. The ideal class group Here are the class numbers of some quadratic fields: h gives the class number of Q( d) and h gives the class number of Q( d). d h h d h h d h h d h h In fact, the only imaginary quadratic fields which are UFDs are Q( d) where d = 1, 2, 3, 7, 11, 19, 43, 67 or 163. If d = 1, 2, 3, 7 or 11 then Q( d) is norm-euclidean; if d = 19, 43, 67 or 163 then Q( d) is not Euclidean. The real norm-euclidean quadratic fields are precisely those with d = 2, 3, 5, 6, 7, 11, 13, 17, 19, 21, 29, 33, 37, 41, 55 or 73. It is not known whether there exists a real quadratic field which is Euclidean but not norm-euclidean. Decomposition of primes: the Kummer Dedekind Theorem Let β = d, so the minimal polynomial of β is g(x) = X 2 d and (O K : Z[β]) 2. Let p be an odd prime. Then 1. If p d then X 2 d X 2 (mod p). 2. If p d and d is not a quadratic residue modulo p then X 2 d is irreducible modulo p. 3. If d a 2 (mod p) then X 2 d (X a)(x + a) (mod p). Thus by the Kummer Dedekind Theorem, 1. In case (1) we have that (p) = (p, d) In case (2) we have that (p) is prime. 3. In case (3) we have that (p) = (p, d a)(p, d + a). 14

### Ideal Class Group and Units

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

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### Factoring of Prime Ideals in Extensions

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

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### Unique Factorization

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

### The Ideal Class Group

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

### FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,

### 3 1. Note that all cubes solve it; therefore, there are no more

Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if

### ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY HENRY COHN, JOSHUA GREENE, JONATHAN HANKE 1. Introduction These notes are from a series of lectures given by Henry Cohn during MIT s Independent Activities

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### Algebraic Number Theory

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

### First and raw version 0.1 23. september 2013 klokken 13:45

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

### 1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### FACTORING AFTER DEDEKIND

FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

### Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

### Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

### 11 Ideals. 11.1 Revisiting Z

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(

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

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

### OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

### 3 Factorisation into irreducibles

3 Factorisation into irreducibles Consider the factorisation of a non-zero, non-invertible integer n as a product of primes: n = p 1 p t. If you insist that primes should be positive then, since n could

### Factorization in Polynomial Rings

Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### 7. Some irreducible polynomials

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

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### calculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,

Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials

### EXERCISES FOR THE COURSE MATH 570, FALL 2010

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

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

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

### Introduction to Modern Algebra

Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

### Continued Fractions and the Euclidean Algorithm

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

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

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

### Die ganzen zahlen hat Gott gemacht

Die ganzen zahlen hat Gott gemacht Polynomials with integer values B.Sury A quote attributed to the famous mathematician L.Kronecker is Die Ganzen Zahlen hat Gott gemacht, alles andere ist Menschenwerk.

### The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

### Cyclotomic Extensions

Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

### 8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS

8430 HANDOUT 3: ELEMENTARY THEORY OF QUADRATIC FORMS PETE L. CLARK 1. Basic definitions An integral binary quadratic form is just a polynomial f = ax 2 + bxy + cy 2 with a, b, c Z. We define the discriminant

### Introduction to Algebraic Number Theory. F. Oggier

Introduction to Algebraic Number Theory F. Oggier 2 A few words These are lecture notes for the class on introduction to algebraic number theory, given at NTU from January to April 2009 and 2010. These

### Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com

Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

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

### DIVISORS IN A DEDEKIND DOMAIN. Javier Cilleruelo and Jorge Jiménez-Urroz. 1 Introduction

DIVISORS IN A DEDEKIND DOMAIN Javier Cilleruelo and Jorge Jiménez-Urroz 1 Introduction Let A be a Dedekind domain in which we can define a notion of distance. We are interested in the number of divisors

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Field Fundamentals. Chapter 3. 3.1 Field Extensions. 3.1.1 Definitions. 3.1.2 Lemma

Chapter 3 Field Fundamentals 3.1 Field Extensions If F is a field and F [X] is the set of all polynomials over F, that is, polynomials with coefficients in F, we know that F [X] is a Euclidean domain,

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### ALGEBRA HW 5 CLAY SHONKWILER

ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear

### Galois representations with open image

Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group

### 15. Symmetric polynomials

15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.

### The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,

### Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### LECTURES ON ALGEBRAIC NUMBER THEORY. Yichao TIAN

LECTURES ON ALGEBRAIC NUMBER THEORY Yichao TIAN Yichao TIAN Morningside Center of Mathematics, 55 Zhong Guan Cun East Road, Beijing, 100190, China. E-mail : yichaot@math.ac.cn LECTURES ON ALGEBRAIC NUMBER

### Some applications of LLL

Some applications of LLL a. Factorization of polynomials As the title Factoring polynomials with rational coefficients of the original paper in which the LLL algorithm was first published (Mathematische

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### 3. Prime and maximal ideals. 3.1. Definitions and Examples.

COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,

### Computing Cubic Fields in Quasi-Linear Time

Computing Cubic Fields in Quasi-Linear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.u-bordeaux.fr Cubic fields

### NUMBER RINGS. P. Stevenhagen

NUMBER RINGS P. Stevenhagen Universiteit Leiden 2012 Date of this online version: September 24, 2012 Please send any comments on this text to psh@math.leidenuniv.nl. Mail address of the author: P. Stevenhagen

### Notes on Factoring. MA 206 Kurt Bryan

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

### Lecture Notes on Polynomials

Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex

### 6. Fields I. 1. Adjoining things

6. Fields I 6.1 Adjoining things 6.2 Fields of fractions, fields of rational functions 6.3 Characteristics, finite fields 6.4 Algebraic field extensions 6.5 Algebraic closures 1. Adjoining things The general

### a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x

### Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

Math 345-60 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field 1. Throughout this section, F is a field and F [x] is the ring of polynomials with coefficients in F. We will

### Polynomial Factorization Algorithms over Number Fields

J. Symbolic Computation (2002) 11, 1 14 Polynomial Factorization Algorithms over Number Fields Xavier-François Roblot roblot@euler.univ-lyon1.fr Institut Girard Desargues, Université Claude Bernard, Lyon,

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### 9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role

### Factorization Algorithms for Polynomials over Finite Fields

Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### RESULTANT AND DISCRIMINANT OF POLYNOMIALS

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

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### Primality - Factorization

Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### Non-unique factorization of polynomials over residue class rings of the integers

Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### ZORN S LEMMA AND SOME APPLICATIONS

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

### Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}

### ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

### Zeros of Polynomial Functions

Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

### Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions

Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International

### Chapter 1. Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes

Chapter 1 Search for Good Linear Codes in the Class of Quasi-Cyclic and Related Codes Nuh Aydin and Tsvetan Asamov Department of Mathematics, Kenyon College Gambier, OH, USA 43022 {aydinn,asamovt}@kenyon.edu

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

### 1 Lecture: Integration of rational functions by decomposition

Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

### The cyclotomic polynomials

The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =

### MODULES OVER A PID KEITH CONRAD

MODULES OVER A PID KEITH CONRAD Every vector space over a field K that has a finite spanning set has a finite basis: it is isomorphic to K n for some n 0. When we replace the scalar field K with a commutative

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### FACTORIZATION IN INTEGRAL DOMAINS

FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK Contents Introduction 2 1. Norm functions 3 1.1. Weak multiplicative norms and multiplicative norms 3 1.2. Abstract number rings 3 1.3. Dirichlet rings 5