THE DIFFERENT IDEAL. Then R n = V V, V = V, and V 1 V 2 V KEITH CONRAD 2 V

Size: px
Start display at page:

Download "THE DIFFERENT IDEAL. Then R n = V V, V = V, and V 1 V 2 V KEITH CONRAD 2 V"

Transcription

1 THE DIFFERENT IDEAL KEITH CONRAD. Introduction The discriminant of a number field K tells us which primes p in Z ramify in O K : the prime factors of the discriminant. However, the way we have seen how to compute the discriminant doesn t address the following themes: (a) determine which prime ideals in O K ramify (that is, which p in O K have e(p p) > rather than which p have e(p p) > for some p), (b) determine the multiplicity of a prime in the discriminant. (We only know the multiplicity is positive for the ramified primes.) Example.. Let K = Q(α), where α 3 α = 0. The polynomial T 3 T has discriminant 3, which is squarefree, so O K = Z[α] and we can detect how any prime p factors in O K by seeing how T 3 T factors in F p [T ]. Since disc(o K ) = 3, only the prime 3 ramifies. Since T 3 T (T 3)(T 0) mod 3, (3) = pq. One prime over 3 has multiplicity and the other has multiplicity. The discriminant tells us some prime over 3 ramifies, but not which ones ramify. Only q does. The discriminant of K is, by definition, the determinant of the matrix (Tr K/Q (e i e j )), where e,..., e n is any Z-basis of O K. By a finer analysis of the trace, we will construct an ideal in O K which is divisible precisely by the ramified primes in O K. This ideal is called the different ideal. (It is related to differentiation, hence the name I think.) In the case of Example., for instance, we will see that the different ideal is q, so the different singles out the particular prime over 3 that ramifies. While the discriminant lies downstairs in Z, the different lies upstairs in O K. The ideal norm of the different is the absolute value of the discriminant, and this connection between the different and discriminant will tell us something about the multiplicity of primes in the discriminant. So the different ideal gives answers to both (a) and (b) above (only a partial answer in the case of (b)). The main idea needed to construct the different ideal is to do something in number fields that is analogous to the classical notion of a dual lattice in Euclidean space. We will start off in Section describing dual lattices in R n and some of their basic properties. Armed with that intuition, we will meet the analogous construction in number fields in Section 3 and then construct the different ideal in Section 4.. The Z-dual of a lattice in R n In R n, the standard dot product gives a notion of orthogonal complement: when V R n is a subspace, we set V = {w R n : w V } = {w R n : w V = 0}. Then R n = V V, V = V, and V V V V.

2 KEITH CONRAD A lattice in R n is, by definition, the Z-span of a basis of R n. The standard lattice is Z n, for instance. There is a concept for lattices in R n somewhat like the orthogonal complement of a subspace. Definition.. For a lattice L R n its Z-dual is L = {w R n : w L Z}. This Z-dual of a lattice is not an orthogonal complement. The condition for a vector to lie in the Z-dual of L is to have integral dot product against all elements of L, not to have dot product 0 against all elements of L. Some similarities with properties of orthogonal complements will be seen in Corollary.7. If e,..., e n is a Z-basis of L, then to have w v Z for all v L it suffices to check w e i Z for i =,..., n since every element of L is a Z-linear combination of the e i s. Here are three examples of dual lattices in R. Example.. Let L = Z = Z ( ( 0) + Z 0 ). For w R, w L if and only if w ( 0) Z and w (0 ( ) Z. Writing w = a b), the two dot products are a and b, so L = Z = L. The lattice Z is self-dual. Example.3. Let L = Z ( ( 0) + Z ( ). Then a b) is in L when a Z and a + b Z, which is equivalent to a Z and b (/)Z, so L = Z ( ) ( 0 + Z 0 /). Example.4. Let L = Z ( ) + Z ( 3). To say ( a b) L is equivalent to a + b Z and a + 3b Z. The system of equations a + b = x a + 3b = y is equivalent to so Thus L = Z ( 3/5 /5 a = 3 5 x 5 y b = 5 x + 5 y, ( ) ( ) ( a 3/5 /5 = x + y b /5 /5 ) ( + Z /5 ). /5 Theorem.5. If L = n i= Ze i is a lattice in R n then its Z-dual is L = n i= Ze i, where {e i } is the dual basis to {e i} relative to the dot product on R n : e i e j = δ ij. In particular, L is a lattice. Proof. For w R n, write it in the dual basis {e,..., e n} as w = n i= c ie i. Then w e i = c i, so to say w L is equivalent to the coefficients c i being integers. Therefore L is the Z- span of the e i s. Topologically, the lattices in R n are the subgroups Λ such that Λ is discrete and R n /Λ is compact. The Z-dual is the dual space of L as a Z-module: every Z-linear map L Z has the form v w v for a unique w L. ).

3 THE DIFFERENT IDEAL 3 Example.6. Let L = Z ( ( 0) + Z ( ), as in Example.3. The dual basis to ( 0) and ) is ( ) ( / and 0 ) /, so by Theorem.5, L = Z ( ) ( / + Z 0 /). If we do a change of basis, replacing ( ) ( / with ) ( / + 0 ( /) = ) ( 0 and keeping 0 /) then we recover the spanning set for L in Example.3. Corollary.7. For lattices in R n, the following properties hold: () L = L, () L L L L, (3) (L + L ) = L L, (4) (L L ) = L + L. Proof. (): Theorem.5 and double duality of vector spaces tells us L = L since the dual basis of a dual basis is the original basis, whose Z-span is the original lattice. (): It is easy to see from the definitions that if L L then L L. Applying this to the inclusion L L gives us L L, so L L. (3): If v (L + L ) then v has integral dot product with any vector in L + L, and hence with any vector in L and any vector in L. Thus v L and v L, so v L L. We have shown (L + L ) L L. The reverse inclusion is just as easy to check. (4): Rather than directly verify that (L L ) = L + L, we will check the two sides are equal by checking their dual lattices are equal. That means, by double duality, we want to check L L = (L + L ). From (3), (L + L ) = L L = L L, so we are done. One property of orthogonal complements that is not shared by dual lattices is V V = R n. The lattices L and L are not complementary in the direct sum sense. Both a lattice and its dual lattice have rank n. 3. Lattices in Number Fields The ideas about lattices in R n will not literally be used, but they are the motivation for what we do now in number fields. Replace R n and its dot product (v, w) v w with a number field K and the operation (x, y) Tr K/Q (xy) on it, which we ll call the trace product. 3 The trace product has values in Q. Instead of being concerned with vectors having a dot product in Z, we will look at algebraic numbers having a trace product in Z. Definition 3.. In a number field K of degree n, a lattice in K is the Z-span of a Q-basis of K. Examples of lattices in K include O K, fractional ideals, and orders. Definition 3.. Let L be a lattice in K. Its dual lattice is L = {α K : Tr K/Q (αl) Z}. As with lattices in Euclidean space, where one can check membership in a dual lattice by checking the dot products with a basis of the lattice are all in Z, to check α L it suffices to check its trace products with a basis of L are all in Z: Tr K/Q (αe i ) Z for some Z-basis e,..., e n of L. 3 The usual term is trace pairing, not trace product. But since we re trying to emphasize the similarity to the dot product on R n, the term trace product seems helpful.

4 4 KEITH CONRAD Example 3.3. Let K = Q(i) and L = Z[i] = Z + Zi. For a + bi Q(i), a + bi L when Tr Q(i)/Q (a + bi) Z and Tr Q(i)/Q ((a + bi)i) Z. This is equivalent to a Z and b Z, so Z[i] = Z + Zi = Z[i]. Taking L = ( + i)z[i] = Z( + i) + Z( + i), calculations like those in Example.4 (but using trace products instead of dot products) lead to ( L = Z 0 i ) ( +Z 5 5 i ) = Z i 0 0 +Z i = i 0 0 (Z Zi) = ( + i) Z[i]. This calculation shows a relation between the dual lattice and the inverse ideal. Writing a for L = ( + i), an ideal, the calculation of L says a = a. Theorem 3.4. For a number field K and a lattice L K with Z-basis e,..., e n, L = n i= Ze i, where {e i } is the dual basis to {e i} relative to the trace product on K/Q. In particular, L is a lattice. Proof. This is virtually identical to Theorem.5, except for the use of the trace product in place of the dot product. Corollary 3.5. For lattices in K, the following properties hold: () L = L, () L L L L, (3) (L + L ) = L L, (4) (L L ) = L + L, (5) (αl) = α L for α K. Proof. The first four properties are proved in the same way as the proof of Corollary.7, and the last one is left to the reader. Example 3.6. For any quadratic field K = Q( d), with a squarefree integer d, we use Theorem 3.4 to compute L for the lattices Z + Z d and Z + Z + d. (The second lattice isn t a ring unless d mod 4, but it is a lattice for all d, so we can speak of its dual lattice in all cases.) The dual basis of {, d} for K/Q relative to the trace product on K is {, }, so d (Z + Z d) = Z + Z d = d (Z d + Z) = d (Z + Z d). The dual basis of {, + d } relative to the trace product on K is { + a calculation yields (Z + Z + d ) = d (Z + d + Z) = d (Z + Z + d ). d, d d d}, and The next theorem tells us the dual basis of a power basis of K (a basis consisting of powers of a single element). In terms of dual lattices, a tight connection between dual lattices and differentiation is revealed. Theorem 3.7. Let K = Q(α) and let f(t ) be the minimal polynomial of α in Q[T ]. Write f(t ) = (T α)(c 0 (α) + c (α)t + + c n (α)t n ), c i (α) K. The dual basis to {, α,..., α n } relative to the trace product is { c 0(α) f (α), c (α) f (α),..., c n (α) f (α) }. In particular, if K = Q(α) and α O K then (Z + Zα + + Zα n ) = f (α) (Z + Zα + + Zαn ).

5 THE DIFFERENT IDEAL 5 Proof. Let α,..., α n be the Q-conjugates of α in a splitting field, with α = α. A beautiful polynomial identity of Euler says n f(t ) f =. (α i ) T α i i= Indeed, both sides are polynomials of degree less than n that are equal at n values. By the same argument, n αi k f(t ) f = T k (α i ) T α i i= for 0 k n. Comparing coefficients of like powers of T on both sides, n αi k f (α i ) c j(α i ) = δ jk. i= The left side is Tr K/Q (α k (c j (α)/f (α))), so {c j (α)/f (α)} is the dual basis to {α j } and To show (Z + Zα + + Zα n ) = f (α) (Zc 0(α) + Zc (α) + + Zc n (α)). Zc 0 (α) + Zc (α) + + Zc n (α) = Z + Zα + + Zα n when α O K, we find a formula for c j (α), the coefficient of T j in f(t )/(T α). Letting f(t ) = a 0 + a T + + a n T n + a n T n Z[T ], where a n =, f(t ) T α f(t ) f(α) = T α n T i α i = a i T α = = i= n i= n j=0 α i j T j a i i j=0 n i=j+ a i α i j T j, so c j (α) = n i=j+ a iα i j, whose top term is α n j (since a n = ). A transition matrix from, α,..., α n to c n (α),..., c (α), c 0 (α) is triangular with integral entries and s on the main diagonal, so it is invertible over Z and shows the Z-span of the two sets is the same. Example 3.8. Returning to Example 3.6, we recompute (Z + Zα) for α = d or + d, with f(t ) = T d or T T + d 4, respectively. In the first case f (α) = d, and in the second case f (α) = + d = d. The formula (Z + Zα) = f (α)(z + Zα) from Theorem 3.7 recovers the formulas for the dual lattices in Example 3.6. The most interesting lattice in K is O K. What can we say about O K = {α K : Tr K/Q (αo K ) Z}?

6 6 KEITH CONRAD First of all, O K is not the elements of K with integral trace. It is smaller than that. To lie in O K, the trace product with all elements of O K must lie in Z. This includes the condition the trace of the element is in Z only as a special case (taking the trace product with ). Since algebraic integers have integral trace, O K O K, so O K always contains O K. We saw earlier that Z[i] = Z[i], for instance. The next theorem says the dual lattice of O K is a fractional ideal that controls the dual lattice of any fractional ideal. Theorem 3.9. For any fractional ideal a in K, a is a fractional ideal and a = a O K. This formula explains a = a from Corollary 3.5 in the special case of fractional ideals. Proof. By definition, a = {α K : Tr K/Q (αa) Z}. First we check a is a fractional ideal. We know it is finitely generated as a Z-module (any dual lattice is a lattice), so the key point is that it is preserved by multiplication by O K. For α a and x O K, xα a since, for any β a, Tr K/Q ((xα)β) = Tr K/Q (α(xβ)) Z, as xβ a and α a. To show a = a O K, pick α a. For any β a, Tr K/Q (αβo K ) Z since βo K a. Therefore αβ O K. Letting β vary in a we get αa O K, so α a O K. Thus a a O K. The reverse inclusion is left to the reader. Theorem 3.0. The dual lattice O K is the largest fractional ideal in K whose elements all have trace in Z. Proof. For a fractional ideal a, a = ao K. Thus Tr K/Q (a) Z if and only if Tr K/Q (ao K ) Z, which is equivalent to a O K. This theorem isn t saying O K is the set of all elements in K with integral trace. It s the largest fractional ideal whose elements have integral trace. The set of all elements with integral trace is an additive group, but it is not a fractional ideal. Example 3.. Since Z[i] = Z[i], any fractional ideal whose elements have integral trace is inside Z[i]. All the elements of Q(i) with integral trace are Z + Qi, which isn t a fractional ideal at all. 4. The Different Ideal The construction of O K provides us with an interesting canonical fractional ideal in K other than O K. Because O K O K, the inverse of O K is a fractional ideal inside O K, hence is an integral ideal. Definition 4.. The different ideal of K is D K = (O K) = {x K : xo K O K }. Example 4.. Since Z[i] = Z[i] by Example 3.3, D Q(i) = Z[i]. Theorem 4.3. If O K = Z[α] then D K = (f (α)), where α has minimal polynomial f(t ) Z[T ]. Proof. Use Theorem 3.7. Example 4.4. For a quadratic field K = Q( d) with squarefree d Z, O K is Z[ d] or Z[( + d)/], depending on d mod 4. Using Example 3.8, { ( d), if d mod 4, (4.) D Q( d) = ( d), if d mod 4.

7 THE DIFFERENT IDEAL 7 Remark 4.5. It is not true in general that O K = Z[α] for some α, so the different can t be calculated as a principal ideal (f (α)) all the time. However, the different does divide ideals of this type. Specifically, for any α O K, D K (f α(α)) where f α (T ) is the characteristic polynomial of α in Q[T ]. This is automatic if Q(α) K since f α(α) = 0, as f α (T ) is a proper power of the minimal polynomial of α. If Q(α) = K and α O K, then Z[α] is a lattice in K and the inclusion Z[α] O K implies O K Z[α], which is equivalent to D K f α(α) Z[α], so D K f α(α) O K. Inverting ideals, (f α(α)) D K, so D K (f α(α)). If we let α vary then D K divides the ideal generated by f α(α) as α runs over O K. It can be shown that D K is equal to the ideal generated by all f α(α) for α O K. This is in marked contrast to the situation for discriminants: disc(o K /Z) does not always equal the greatest common divisor of all disc(f α (T )) as α ranges over algebraic integers in K. Theorem 4.6. For any number field K, N(D K ) = disc(k). Proof. Let e,..., e n be a Z-basis for O K, so O K = n i= Ze i. Then D K The norm of an ideal is its index in O K, so N(D K ) = [O K : D K ] = 4 [D K : O K] = [O K : O K ]. = O K = n i= Ze i. To compute the index [O K : O K], recall that for finite free Z-modules M M of equal rank, [M : M ] = det(a) where A is a matrix expressing a Z-basis of M in terms of a Z-basis of M. For our application, with M = O K and M = O K, let s write the e i s in terms of the e i s: if e j = n i= a ije i, the meaning of being dual bases relative to the trace product is that a ij = Tr K/Q (e j e i ) = Tr K/Q (e i e j ). Therefore (a ij ) = (Tr K/Q (e i e j )). The determinant of this matrix, by definition, is disc(k), so N(D K ) = disc(k). Theorem 4.6 tells us that in the inclusions of lattices D K O K O K each successive inclusion has index disc(k). In particular, O K is strictly larger than O K if and only if disc(k) >. That inequality holds for all K Q (Minkowski s theorem), so O K is not its own dual lattice when K Q. The different ideal could be considered a measure of how much O K fails to be self-dual as a lattice in K. Example 4.4 and Theorem 4.6 recover the formulas for (the absolute value of) the discriminant of a quadratic field from the norm of the different of a quadratic field: (4.) disc(q( { 4 d, if d mod 4, d)) = N(D Q( d) ) = d, if d mod 4. Theorem 4.6 suggests, from experience with the discriminant, there should be a relation between the different and ramified primes. We will show the prime ideal factors of the different are the ramified primes in K. Lemma 4.7. For a nonzero ideal a in O K, a D K if and only if Tr K/Q (a ) Z. Proof. Since divisibility is the same as containment for integral ideals, a D K if and only if a D K = (O K ), which is equivalent to O K a. By Theorem 3.0, this last containment is equivalent to Tr K/Q (a ) Z. 4 For fractional ideals a, b, and c, with a b, ac/bc = a/b as OK-modules. When c is a nonzero ideal, using a = c and b = O K gives us O K/c = c /O K. Thus [O K : c] = [c : O K].

8 8 KEITH CONRAD Here is the central theorem about the different ideal. It not only tells us the prime ideal factors of the different, but also the multiplicities in most cases. Theorem 4.8 (Dedekind). The prime ideal factors of D K are the primes in K that ramify over Q. More precisely, for any prime ideal p in O K lying over a prime number p, with ramification index e = e(p p), the exact power of p in D K is p e if e 0 mod p, and p e D K if p e. When p e, the theorem does not tell us the exact multiplicity of p in D K, but only says the multiplicity is at least e. Proof. If we grant that p e D K, any ramified prime in K divides D K. If p is unramified over Q, so e =, then the last part of the theorem says p doesn t divide D K since p doesn t divide. Therefore it remains to check the two divisibility relations. To show p e D K, write (p) = p e a. Since p e (p), p a. To say p e D K is equivalent, by Lemma 4.7, to saying Tr K/Q (p (e ) ) Z. Since p (e ) = p a, Tr K/Q(p (e ) ) Z if and only if Tr K/Q (a) pz, which is the same as Tr K/Q (α) 0 mod p for all α a. This congruence is what we will actually show. For α a, Tr K/Q (α) = Tr OK /Z(α) and Tr OK /Z(α) mod p = Tr (OK /(p))/f p (α). This last trace is the trace of multiplication by α on O K /(p) as an F p -linear map, and α is a general element of a/(p). (The quotient a/(p) makes sense since a (p) by the definition of a.) Since a is divisible by every prime ideal factor of (p) (including p), a high power of a is divisible by (p). Therefore a high power of α is 0 in O K /(p), which means multiplication by α on O K /(p) is nilpotent as an F p -linear map. Nilpotent linear maps have trace 0, so Tr (OK /(p))/f p (α) = 0. That completes the proof that p e D K. Now we want to show p e D K if and only if p e. Write (p) = p e b, so b is not divisible by p. To say p e D K is equivalent to Tr OK /Z(b) pz by Lemma 4.7, which is equivalent to (4.3) Tr (OK /(p))/f p (β) = 0 for all β b. We will break up O K /(p) into a product of two rings and analyze the trace separately on both. Since p e and b are relatively prime, O K /(p) = O K /p e O K /b as rings by the natural map, so (4.4) Tr (OK /(p))/f p (x) = Tr (OK /p e )/F p (x) + Tr (OK /b)/f p (x) for all x O K, where x on the left is x mod (p) and x on the right is x mod p e and x mod b. (Both O K /b and O K /p e contain F p since p e and b both divide (p), so p is 0 in both rings.) If x b, then x = 0 in O K /b, so Tr (OK /(p))/f p (x) = Tr (OK /p e )/F p (x). For any y O K, there is an x O K satisfying x y mod p e and x 0 mod b, so Tr (OK /p e )/F p (y) = Tr (OK /p e )/F p (x) = Tr (OK /(p))/f p (x). Therefore proving (4.3) is equivalent to proving (4.5) Tr (OK /p e )/F p (y) = 0 for all y O K. Unlike (4.3), which is quantified over the ideal b, (4.3) runs over O K. We will show (4.5) happens if and only if p e. To study the trace down to F p of y on O K /p e, we will filter O K /p e by subspaces made from powers of p: O K /p e p/p e p /p e p e /p e p e /p e = {0}.

9 THE DIFFERENT IDEAL 9 Each power p i is an ideal, so multiplication by y is a well-defined linear operator on each p i /p e (0 i e). We now appeal to a result from linear algebra: if V is a finite-dimensional vector space over a field F, A: V V is a linear operator and W is a subspace of V such that A(W ) W, then Tr(A: V V ) = Tr(A: V/W V/W ) + Tr(A: W W ). (This identity is proved by a matrix calculation, using a basis of V/W lifted to V together with a basis of W to form a basis of V. The matrix for A on V in this basis is block triangular.) Taking F = F p, V = O K /p e, W = p/p e, and A to be multiplication by y, Tr (OK /p e )/F p (y) = Tr(m y : O K /p e O K /p e ) = Tr(m y : O K /p O K /p) + Tr(m y : p/p e p/p e ). In a similar way, using multiplication by y on the vector space p i /p e and subspace p i+ /p e, where 0 i e, Tr(m y : p i /p e p i /p e ) = Tr(m y : p i /p i+ p i /p i+ ) + Tr(m y : p i+ /p e p i+ /p e ). Using this recursively for i = 0,,..., e, we get e (4.6) Tr (OK /p e )/F p (y) = Tr(m y : p i /p i+ p i /p i+ ). i=0 The traces in the sum take values in F p. We will show the traces are all equal. Choosing π p p, (π i ) is divisible by p i but not by p i+, so p i = (π i ) + p i+. Therefore O K /p = p i /p i+ as O K -modules by x mod p π i x mod p i+. This O K -module isomorphism commutes with multiplication by y on both sides, so Thus (4.6) becomes Tr(m y : p i /p i+ p i /p i+ ) = Tr(m y : O K /p O K /p). (4.7) Tr (OK /p e )/F p (y) = e Tr (OK /p)/f p (y) for any y O K, so (4.5) is true if and only if e Tr (OK /p)/f p (y) = 0 for all y O K /p. Since O K /p is a finite field, the trace map from O K /p to F p is not identically 0, so (4.5) holds if and only if e = 0 in F p, i.e., p e. Up to now the fact that the prime numbers dividing disc(k) are the ramified primes in K hasn t been used (outside of Example.). Theorem 4.8 leads to a new proof of that result. Corollary 4.9. The prime factors of disc(k) are the primes in Q that ramify in K. Proof. Since disc(k) = N(D K ), if p is a prime dividing disc(k) then D K must have a prime ideal factor whose norm is a power of p, which means (p) is divisible by a prime factor of D K, so p ramifies in K. Conversely, if p ramifies in K then D K is divisible by a prime ideal factor of (p), so N(D K ) is divisible by p. Corollary 4.0. Write po K = p e peg g and f i = f(p i p). If no e i is a multiple of p then the multiplicity of p in disc(k) is (e )f + + (e g )f g = n (f + + f g ). If some e i is a multiple of p then the multiplicity of p in disc(k) is larger than this amount.

10 0 KEITH CONRAD Proof. The multiplicity of p in disc(k) is determined by the multiplicities of the p i s in D K, since the norm of the different is the discriminant (in absolute value). By Theorem 4.8, p e p eg g is a factor of D K. Applying the ideal norm, p (e )f + +(e g )f g is a factor of disc(k). If no e i is a multiple of p then p i appears in D K with multiplicity e i, so this power of p is the full power of p in disc(k). If some e i is a multiple of p then p i appears in D K with multiplicity larger than e i, so the p-multiplicity of disc(k) is larger than what we just computed. Example 4.. In Q( 0), the prime numbers that ramify are and 5: () = p and (5) = p 5. By Example 4.4, the different of Q( 0)/Q is D = ( 0) = p 3 p 5. The multiplicity of p 5 in D is e(p 5 5) =, and the multiplicity of p is at least e(p ) =, which is consistent with Theorem 4.8 since e(p 5 5) is not a multiple of 5 and e(p ) is a multiple of. Notice the p -multiplicity in D is in fact greater than e(p ). Example 4.. Let K = Q(α), where α 3 α = 0. Since O K = Z[α] and disc(k) = 3, D K has norm 3. Therefore D K is a prime ideal. Since (3) = pq and q must divide D K by Theorem 4.8, D K = q. The multiplicity of q in the different is = e(q 3), as expected. Example 4.3. Let K = Q( 3 ), so Z[ 3 ] O K. We will use Theorem 4.8 to prove O K = Z[ 3 ]. Since disc(z[ 3 ]) = [O K : Z[ 3 ]] disc(o K ) and disc(z[ 3 ]) = 08 = 4 7, it suffices to show disc(o K ) = 08. The only prime factors of 08 are and 3, so the only primes that can ramify in K are and 3. The polynomials T 3 and (T ) 3 = T 3 3T + 3T 3 are Eisenstein at and 3 with roots generating K, so both and 3 are totally ramified in O K : () = p 3 and (3) = q 3. By Theorem 4.8, D K is divisible by p q 3. Taking norms, disc(o K ) is divisible by 3 3 = 08. We already knew disc(o K ) is a factor of 08, so disc(o K ) = 08 and O K = Z[ 3 ] (and D K = p q 3 ). Example 4.4. If p has exactly one prime lying over it, say (p) = p e, then D K is divisible by p e, so disc(k) is divisible by N(p) e = p f(e ). If e 0 mod p then p f(e ) is the exact power of p in disc(k). Example 4.5. Let K = Q( 3 75). Using our knowledge of the multiplicity of primes in the discriminant, based on the connection between the different and discriminant, we will determine O K and then prove O K does not have a power basis. A more general example along these lines is treated in [, pp ] and [3, Exer. 0B, pp. 0-0]. View K as a subfield of R, so there is no ambiguity about the meaning of cube roots. Set α = Since 75 = 5 7, K also contains = 35/α. Set β = The minimal polynomials for α and β over Q are T and T 3 5 7, which are Eisenstein at 5 and 7, so 5 and 7 are both totally ramified in O K : (5) = p 3 and (7) = q 3. Therefore D K is divisible by p 3 q 3 = p q, so disc(o K ) is divisible by N(p q ) = 5 7. Moreover, (T + ) 3 75 = T 3 + 3T + 3T 74 is Eisenstein at 3, so 3 is totally ramified in K: (3) = p 3 3. Since e(p 3 3) is a multiple of 3, disc(o K ) is divisible by 3 3, not just 3, so disc(o K ) is a multiple of The lattice Z + Zα + Zβ lies inside O K and is a ring: (4.8) α = 5β, β = 7α, αβ = 35.

11 THE DIFFERENT IDEAL Using these equations and the formulas Tr K/Q (α) = 0 and Tr K/Q (β) = 0, the matrix of trace products for the Q-basis {, α, β} of K is , whose determinant is Therefore = disc(z + Zα + Zβ) = [O K : (Z + Zα + Zβ)] disc(o K ). Since we know disc(o K ) is a multiple of , the index [O K : (Z + Zα + Zβ)] must be, so O K = Z + Zα + Zβ. Next we show disc(z[γ]) disc(o K ) for any γ O K Z, so O K doesn t have a power basis. From the computation of O K, we can write γ = a + bα + cβ with integers a, b, and c, where b and c are not both 0. Using PARI, Tr K/Q (γ) = 3a, Tr K/Q (γ ) = 3a + 0bc, Tr K/Q (γ 3 ) = 3a b c abc, and so disc(z[γ]) = det Tr K/Q (γ 4 ) = 3a ab ac b c + 60a bc, Tr K/Q () Tr K/Q (γ) Tr K/Q (γ ) Tr K/Q (γ) Tr K/Q (γ ) Tr K/Q (γ 3 ) Tr K/Q (γ ) Tr K/Q (γ 3 ) Tr K/Q (γ 4 ) = (5b 3 7c 3 ). In order that disc(z[γ]) = disc(o K ) we need 5b 3 7c 3 = ±. Then 5b 3 ± mod 7, but 5 mod 7 is not a cube. So we have a contradiction, which concludes this example. Theorem 4.8 gives us an exact formula for the multiplicity of p in D K if e(p p) 0 mod p, but not if e(p p) 0 mod p. Ramification when e(p p) 0 mod p is generally easier to study than when e(p p) 0 mod p. For this reason, when e(p p) 0 mod p we say p is tamely ramified over p, and when e(p p) 0 mod p we say p is wildly ramified over p. If every prime over p in K is tamely ramified then we say p is tamely ramified in K. Any unramified prime is tamely ramified, but ramified primes can also be tamely ramified. For example, is tamely ramified in Q( 3 ) (() = p 3 ), but is wildly ramified in Q(γ), where γ 3 + γ + 4 = 0 (() = pq ). Upper and lower bounds for the multiplicity of a nonzero prime ideal p in D K are e ord p (D K ) e + e ord p (e), where p p and e = e(p p). The lower bound was proved by Dedekind (Theorem 4.8), who conjectured the upper bound, which was later proved by Hensel as one of the first applications of p-adic fields to number theory. In the ideal class group of K, Hecke proved the ideal class of D K is always a square. For a proof in the number field and function field settings, see []. References [] J. V. Armitage, On a theorem of Hecke in number fields and function fields, Invent. Math. (967), [] H. Hasse, Number Theory, Springer-Verlag, 980. [3] P. Samuel, Algebraic Theory of Numbers, Dover, 008.

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

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number 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

More information

OSTROWSKI FOR NUMBER FIELDS

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

More information

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. 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,

More information

FACTORING AFTER DEDEKIND

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

More information

Ideal Class Group and Units

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

More information

Factoring of Prime Ideals in Extensions

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

More information

How To Prove The Dirichlet Unit Theorem

How To Prove 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

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN TRIPLES KEITH CONRAD PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

More information

11 Ideals. 11.1 Revisiting Z

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(

More information

Quotient Rings and Field Extensions

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.

More information

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

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

More information

Continued Fractions and the Euclidean Algorithm

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

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices 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

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

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

More information

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

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

More information

Unique Factorization

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

More information

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

More information

THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

More information

The Ideal Class Group

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

More information

MODULES OVER A PID KEITH CONRAD

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

More information

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:

Partial Fractions. Combining fractions over a common denominator is a familiar operation from algebra: Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than

More information

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

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

More information

EXERCISES FOR THE COURSE MATH 570, FALL 2010

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

More information

Solution to Homework 2

Solution to Homework 2 Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

More information

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

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

More information

by the matrix A results in a vector which is a reflection of the given

by the matrix A results in a vector which is a reflection of the given Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

More information

The van Hoeij Algorithm for Factoring Polynomials

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

More information

ZORN S LEMMA AND SOME APPLICATIONS

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

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

Notes on Determinant

Notes on Determinant 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

More information

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i. Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

More information

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

More information

Solving Linear Systems, Continued and The Inverse of a Matrix

Solving Linear Systems, Continued and The Inverse of a Matrix , Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

CONSEQUENCES OF THE SYLOW THEOREMS

CONSEQUENCES OF THE SYLOW THEOREMS CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.

More information

ALGEBRAIC NUMBER THEORY AND QUADRATIC RECIPROCITY

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

More information

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

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

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

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

More information

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function 17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):

More information

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

More information

it is easy to see that α = a

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

More information

ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

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. [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

More information

DIVISIBILITY AND GREATEST COMMON DIVISORS

DIVISIBILITY AND GREATEST COMMON DIVISORS DIVISIBILITY AND GREATEST COMMON DIVISORS KEITH CONRAD 1 Introduction We will begin with a review of divisibility among integers, mostly to set some notation and to indicate its properties Then we will

More information

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

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

More information

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively. Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes 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

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces 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

More information

Introduction to Finite Fields (cont.)

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

More information

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

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,

More information

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

= 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

More information

BILINEAR FORMS KEITH CONRAD

BILINEAR FORMS KEITH CONRAD BILINEAR FORMS KEITH CONRAD The geometry of R n is controlled algebraically by the dot product. We will abstract the dot product on R n to a bilinear form on a vector space and study algebraic and geometric

More information

Introduction to Algebraic Number Theory. F. Oggier

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

More information

Cyclotomic Extensions

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

More information

Algebraic Number Theory

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

More information

T ( a i x i ) = a i T (x i ).

T ( a i x i ) = a i T (x i ). Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

More information

k, then n = p2α 1 1 pα k

k, then n = p2α 1 1 pα k Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

More information

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

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,

More information

So let us begin our quest to find the holy grail of real analysis.

So let us begin our quest to find the holy grail of real analysis. 1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Applied Linear Algebra I Review page 1

Applied Linear Algebra I Review page 1 Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties

More information

Notes on Factoring. MA 206 Kurt Bryan

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

More information

Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

More information

Factoring Polynomials

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

More information

How To Understand The Relation Between Quadratic And Binary Forms

How To Understand The Relation Between Quadratic And Binary 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

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why

More information

GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD 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

More information

Galois representations with open image

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

More information

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)! Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

Matrix Representations of Linear Transformations and Changes of Coordinates Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under

More information

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION 4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

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

More information

MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers 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

More information

minimal polyonomial Example

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

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Computing exponents modulo a number: Repeated squaring

Computing exponents modulo a number: Repeated squaring Computing exponents modulo a number: Repeated squaring How do you compute (1415) 13 mod 2537 = 2182 using just a calculator? Or how do you check that 2 340 mod 341 = 1? You can do this using the method

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of

More information

Integer roots of quadratic and cubic polynomials with integer coefficients

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

More information

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

More information

Section 4.4 Inner Product Spaces

Section 4.4 Inner Product Spaces Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer

More information

4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

More information

1 Sets and Set Notation.

1 Sets and Set Notation. 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

More information

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

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).

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

7. Some irreducible polynomials

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

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Row Ideals and Fibers of Morphisms

Row Ideals and Fibers of Morphisms Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

More information

Name: Section Registered In:

Name: Section Registered In: Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

More information

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

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

More information

BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBERT SPACE REVIEW BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

More information

26 Ideals and Quotient Rings

26 Ideals and Quotient Rings Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed

More information

THE SIGN OF A PERMUTATION

THE SIGN OF A PERMUTATION THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written

More information

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

More information

The last three chapters introduced three major proof techniques: direct,

The last three chapters introduced three major proof techniques: direct, CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

More information

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m) Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

More information

Polynomial Factorization Algorithms over Number Fields

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,

More information