ALGEBRA HW 5 CLAY SHONKWILER


 Alyson Hampton
 1 years ago
 Views:
Transcription
1 ALGEBRA HW 5 CLAY SHONKWILER 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 with at least one linear factor. This, in turn, implies that at least one root of x 3 must be in F. Now, if we let ζ = 1 + 3, then the roots of x3 are 3, 3 ζ, 3 ζ, where ζ is the complex conjugate of ζ. Now, elements of F can be written in the form a + b 1, where a, b Q. Clearly, then, none of the roots of x 3 is in F, so x 3 is irreducible over F. Similarly, if x 3 3 is not irreducible over F, then one of its roots must lie in F. However, the roots of x 3 3 are 3 3, 3 3ζ, 3 3ζ, so, again, none of its roots lie in F, meaning x 3 3 is also irreducible over F Let F be a field of characteristic. Let D 1 and D be elements of F, neither of which is a square in F. Prove that F ( D 1, D ) is of degree 4 over F if D 1 D is not a square in F and is of degree over F otherwise. When F ( D 1, D ) is of degree 4 over F the field is called a biquadratic extension of F. Proof. D 1 is of degree over F, the degree of the extension F ( D 1, D )/F ( D 1 ) is at most and is precisely if and only if x D is irreducible over F ( D 1 ). Since this polynomial is of degree, it is reducible if and only if it has a root on F ( D 1 ), which is to say that D F ( D 1 ). If this is the case, then D = a + b D 1 for some a, b F. Squaring both sides of this expression, we get D = (a + D 1 b ) + ab D 1. If ab 0, then we could solve for D 1 in terms of elements of F ; since D 1 is not a square, this is not possible. Hence, we see that either a = 0 or b = 0. If b = 0, then we see that D = a ; since D is not a square, this is impossible. On the other hand, if a = 0, then D = D 1 b, 1
2 CLAY SHONKWILER meaning D = b D 1. Now, multiplying both sides by D 1, we see that this can only be the case if D1 D = D 1 D = b D 1 F. If D 1 D is not a square in F, then, since all of our implications go both ways, we see that x D is irreducible over F ( D 1 ), meaning [F ( D 1, D ) : F ( D 1 )] =. In this case, [F ( D 1, D ) : F ] = [F ( D 1, D ) : F ( D 1 )][F ( D 1 ) : F ] = = 4. On the other hand, if D 1 D is a square in F, then the degree of F ( D 1, D )/F ( D 1 ) is less than two; that is, the degree of this extension is 1. In this case, we see that [F ( D 1, D ) : F ] = [F ( D 1, D ) : F ( D 1 )][F ( D 1 ) : F ] = 1 = Let F be a field of characteristic. Let a, b be elements of the field F with b not a square in F. Prove that a necessary and sufficient condition for a + b = m + n for some m, n F is that a b is a square in F. Use this to determine when the field Q( a + b) is biquadratic over Q. Proof. ( ) Suppose a b is a square in F. Then a b F. Now, let m = a + a b n = a a b. Then n, m F since char(f ). Now, m = a + a b = (a + b) + a b + (a ( b) a + b + a ) b =, 4 meaning On the other hand n = a a b meaning Hence, a + b + m + n = a + b + a b m =. = (a + b) a b + (a b) 4 a + b a b n =. a b a + b + ( a + b a ) b =, a b = a + b.
3 ALGEBRA HW 5 3 Now, with this proof in hand, we have the exact conditions under which Q( a + b) = Q( m + n). Since Q( m + n) = Q( m, n), we can use problem above to conclude that Q( a + b) is biquadratic if and only if a b is a square in F and mn = a + a b a a b = b 4 is not a square in F. Since b is not a square in F, we see that Q( a + b) is biquadratic precisely when a b is a square in F Suppose F = Q(α 1, α,..., α n ) where α i Q for i = 1,,..., n. Prove that 3 / F. Proof. Our basic tactic is to demonstrate that the degree of the extension F/Q is a power of and then to demonstrate thatany field containing 3 must be of degree divisible by 3 over Q. To that end, first we prove the following lemma: Lemma 0.1. If F = Q(α 1, α,..., α n ) where αi Q for i = 1,..., n, then the degree of the extension F/Q is k for some k N. Proof. By induction. Suppose n = 1. Then F = Q(α 1 ) for some α 1, where α 1 Q. If, in fact, α 1 Q, then F = Q and so [F : Q] = 1 = 0. If α 1 / Q, then m α1,q(x) = x α 1, so [F : Q] = = 1. Now, suppose [Q(α 1,..., α n ) : Q] = k for all n < j, j where the α i are as above. Let F = Q(α 1,..., α j ). Since α j Q, α j is of degree 1 or over Q, depending on whether or not α j Q. Hence, [F : Q(α 1,..., α j 1 )]. Since this leaves only two choices for [F : Q(α 1,..., α j 1 )], 1 and, we see that [F : Q] = [F : Q(α 1,..., α j 1 )][Q(α 1,..., α j 1 ) : Q] = [Q(α 1,..., α j 1 ) : Q] or [F : Q] = [F : Q(α 1,..., α j 1 )][Q(α 1,..., α j 1 ) : Q] = [Q(α 1,..., α j 1 ) : Q]. In either case, since [Q(α 1,..., α j 1 ) : Q] = k for some k N, we see that [F : Q] = m, where m = k or m = k + 1.
4 4 CLAY SHONKWILER Now, suppose 3 F. Since any field containing 3 must contain Q( 3 ), we see that the following tower of containments holds: F Q( 3 ) Q Now, since [Q( 3 ) : Q] = 3, we see that [F : Q] = [F : Q( 3 )][Q( 3 ) : Q] = 3[F : Q( 3 )] meaning 3 divides [F : Q]. However, by the lemma, [F : Q] = k for some k N. From this contradiction, then, we conclude that 3 / F Let k be a field and let k(x) be the field of rational functions in x with coefficients from k. Let t k(x) be the rational function P (x) Q(x) with relatively prime polynomials P (x), Q(x) k[x], with Q(x) 0. Then k(x) is an extension of k(t) and to compute its degree it is necessary to compute the minimal polynomial with coefficients in k(t) satisfied by x. (a) Show that the polynomial P (X) tq(x) in the variable X and coefficients in k(t) is irreducible over k(t) and has x as a root. Proof. P (X) tq(x) certainly has x as a root, since P (x) tq(x) = P (x) P (x) Q(x) = P (x) P (x) = 0. Q(x) Now, k(t) is the field of fractions of the UFD k[t], so, by Gauss Lemma, P (X) tq(x) is irreducible in (k(t))[x] if and only if it is irreducible over (k[t])[x]. Now, (k[t])[x] = (k[x])[t], so we can check for irreducibility in (k[x])[t]. Since P (X) tq(x) is linear in (k[x])[t] it is certainly irreducible in (k[x])[t] and, hence, in (k(t))[x]. Therefore, we conclude that P (X) tq(x) is irreducible over k(t). (b) Show that the degree of P (X) tq(x) as a polynomial in X with coefficients in k(t) is the maximum of the degrees of P (x) and Q(x). Proof. Let n = max{deg(p (x)), deg(q(x))}. Then P (x) = p n x n p 1 x + p 0 and Q(x) = q n x n q 1 x + q 0 for p i, q j k for i = 0,..., n where at least one of p n, q n is nonzero. Now, certainly deg(p (X) tq(x)) n; we need only show that the coefficient on
5 ALGEBRA HW 5 5 X n is nonzero. However, the coefficient on X n in the polynomial P (X) tq(x) is p n tq n. Now, p n, q n k and it is not the case that both are zero. Furthermore, t k(x) but t / k so it cannot be the case that p n = tq n. Hence, p n tq n 0. Therefore, we see that deg(p (X) tq(x)) n. Since we ve shown inequalities in both directions, we conclude that deg(p (X) tq(x)) = n = max{deg(p (x)), deg(q(x))}. (c) Show that [k(x) : k(t)] = [k(x) : k( P (x) Q(x) )] = max(deg P (x), deg Q(x)). Proof. In part (a) above we demonstrated that P (X) tq(x) is irreducible over k(t) and has x as a root, so it must be the case that P (X) tq(x) is the minimal polynomial of x over k(t). Hence, k(x) (k(t)[x])/(p (X) tq(x)) and, using our result from part (b), we see that [k(x) : k(t)] = deg(p (X) tq(x)) = max{deg(p (x)), deg(q(x))} Let K 1 and K be two finite extensions of a field F contained in the field K. Prove that the F algebra K 1 F K is a field if and only if [K 1 K : F ] = [K 1 : F ][K : F ]. Proof. ( ) Suppose K 1 F K is a field. Then the dimension of K 1 F K as a free module over F is equal to the degree of the extension K 1 F K /F. However, we know the dimension of K 1 F K as a free module: it is the product of the dimensions of the K i as F modules for i = 1,. By the definition of the degree of an extension, we know that the dimension of K i as an F module (i.e. an F vector space) is simply [K i : F ]. Hence, if K 1 F K is a field, then [K 1 F K : F ] = [K 1 : F ][K : F ]. Now, define φ : K 1 K K 1 K, where φ(a, b) = ab. Then, if a, a 1, a K 1, b, b 1, b K and r F, φ((a 1, b)+(a, b)) = φ(a 1 +a, b) = (a 1 +a )b = a 1 b+a b = φ(a 1, b)+φ(a, b), φ((a, b 1 )+(a, b )) = φ(a, b 1 +b ) = a(b 1 +b ) = ab 1 +ab = φ(a, b 1 )+φ(a, b ) and φ(ar, b) = (ar)b = a(rb) = φ(a, rb)
6 6 CLAY SHONKWILER since r F K 1 K. Hence, φ is bilinear, so, by the universal property of the tensor product, it induces a module homomorphism Φ : K 1 F K K 1 K. Now, we know K 1 F K is a field, so we must check that this homomorphism preserves products. Let a b, c d K 1 F K. Then Φ((a b)(c d)) = Φ(ac bd) = acbd = abcd = Φ(a b)φ(c d). Hence, Φ is a field homomorphism. Since field homomorphisms are necessarily injective, we need only check that Φ is surjective to confirm that it is a field isomorphism. However, this is clear: if ab K 1 K, where a K 1, b K, then a b K 1 F K and Therefore, we conclude that Φ(a b) = ab. [K 1 K : F ] = [K 1 F K : F ] = [K 1 : F ][K : F ]. ( ) On the other hand, suppose [K 1 K : F ] = [K 1 : F ][K : F ]. Then, since [K 1 K : F ] = [K 1 K : K 1 ][K 1 : F ], we see that [K 1 K : K 1 ] = [K : F ]. That is to say, for any a K, either a F or a / K 1. Now, we know that K 1 F K is an F algebra. Furthermore, just as above, we can construct the F algebra homomorphism Φ : K 1 F K K 1 K. Now, since K 1 K = F, every element in K 1 K can be written uniquely as either a product of an element in K 1 with an element of K or as an element of F. Now, we define Ψ : K 1 K K 1 F K in the following way. Let a K 1 K. Then either a = bc for b K 1 and c K or a F. If a / F, define If a F, then define Ψ(a) = Ψ(bc) = b c. Ψ(a) = a 1. Then Ψ is certainly an F algebra homomorphism; we want to demonstrate that it is the inverser of Φ. To that end, let ab K 1 K. Then ({ }) a b ab / F Φ Ψ(ab) = Φ(Ψ(ab)) = Φ = ab. ab 1 ab F On the other hand, let a b K 1 F K. Then { a b ab / F Ψ Φ(a b) = Ψ(Φ(a b)) = Ψ(ab) = ab 1 ab F. Now, if ab / F, then we have nothing to worry about. If ab F and b F, then ab 1 = a b, so again we have no problems. However, it cannot be the case that ab F and b / F, since K 1 K = F. Therefore, we conclude that Φ Ψ Id and Ψ Φ Id,
7 ALGEBRA HW 5 7 meaning that Ψ is an F algebra isomorphism. Since K 1 K is a field, this implies that K 1 F K is a field as well Determine the splitting field and its degree over Q for x 6 4. Answer: First, note that x 6 4 = (x 3 )(x 3 + ). Hence, the splitting field K for x 6 4 must contain the splitting fields for x 3 and x 3 +. Now, using the same notation as in problem above, the roots of x 3 are 3, 3 ζ, 3 ζ and the roots of x 3 + are 3, 3 ζ, 3 ζ. It is clear that 3 = 3, so we see that the roots of x + are contained in the splitting field of x 3. Hence, all of the roots of x 6 4 are contained in the splitting field of x 3, meaning K is contained in the splitting field of x 3. Since we already knew that K must contain the splitting field of x 3, we see that, in fact, K is equal to the splitting field of x 3. Now, as we ve seen in class, the splitting field of x 3 is simply Q( 3, ζ), which is of degree 6 over Q. Therefore, K = Q( 3, ζ) and [K : Q] Let φ denote the Frobenius map x x p on the finite field F p n. Prove that φ gives an isomorphism of F p n to itself. Prove that φ n is the identity map and that no lower power of φ is the identity. Proof. Since F p n is a field of characteristic p, we know that the Frobenius map is necessarily an injective homomorphism. However, since F p n is finite, any injective endomorphism must also be surjective, so we see that φ gives an automorphism of F p n. Now, to see that φ n is the identity map, let a F p n. If a = 0, then φ n (a) = φ n (0) = 0. If a 0, then a F p n. Now, F p n is an abelian group of order pn 1, meaning that for all b F p n, bpn 1 = 1. Therefore, φ n (a) = a pn = aa pn 1 = a(1) = a. Therefore, we see that φ n is the identity. Now, suppose there exists some k < n such that φ k is also the identity on F p n. Then, for all b F p n, φ k (b) = b pk = b, which implies that each element of F p n is a root of the polynomial x pk x over F p. However, x pk k has only p k distinct roots; since k < n and F p n = p n, this is clearly impossible.
8 8 CLAY SHONKWILER From this contradiction, then, we conclude that there is no such k, so no lower power of φ is the identity. DRL 3E3A, University of Pennsylvania address:
Galois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More informationMath 504, Fall 2013 HW 3
Math 504, Fall 013 HW 3 1. Let F = F (x) be the field of rational functions over the field of order. Show that the extension K = F(x 1/6 ) of F is equal to F( x, x 1/3 ). Show that F(x 1/3 ) is separable
More informationit 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 information1 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 information7. 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(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
More information50. Splitting Fields. 50. Splitting Fields 165
50. Splitting Fields 165 1. We should note that Q(x) is an algebraic closure of Q(x). We know that is transcendental over Q. Therefore, p must be transcendental over Q, for if it were algebraic, then (
More information10 Splitting Fields. 2. The splitting field for x 3 2 over Q is Q( 3 2,ω), where ω is a primitive third root of 1 in C. Thus, since ω = 1+ 3
10 Splitting Fields We have seen how to construct a field K F such that K contains a root α of a given (irreducible) polynomial p(x) F [x], namely K = F [x]/(p(x)). We can extendthe procedure to build
More informationsome algebra prelim solutions
some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no
More informationChapter 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
More informationMath 34560 Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field
Math 34560 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
More informationSOLUTIONS TO PROBLEM SET 3
SOLUTIONS TO PROBLEM SET 3 MATTI ÅSTRAND The General Cubic Extension Denote L = k(α 1, α 2, α 3 ), F = k(a 1, a 2, a 3 ) and K = F (α 1 ). The polynomial f(x) = x 3 a 1 x 2 + a 2 x a 3 = (x α 1 )(x α 2
More informationModern 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)
More informationcalculating 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
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationIntegral Domains. As always in this course, a ring R is understood to be a commutative ring with unity.
Integral Domains As always in this course, a ring R is understood to be a commutative ring with unity. 1 First definitions and properties Definition 1.1. Let R be a ring. A divisor of zero or zero divisor
More informationPart V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS
CS131 Part V, Abstract Algebra CS131 Mathematics for Computer Scientists II Note 29 RINGS AND FIELDS We now look at some algebraic structures which have more than one binary operation. Rings and fields
More informationHomological Algebra  Problem Set 3
Homological Algebra  Problem Set 3 Problem 1. Let R be a ring. (1) Show that an Rmodule M is projective if and only if there exists a module M and a free module F such that F = M M (we say M is a summand
More informationA NOTE ON FINITE FIELDS
A NOTE ON FINITE FIELDS FATEMEH Y. MOKARI The main goal of this note is to study finite fields and their Galois groups. Since I define finite fields as subfields of algebraic closure of prime fields of
More informationPOLYNOMIAL 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 informationUnique 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 informationGeneric Polynomials of Degree Three
Generic Polynomials of Degree Three Benjamin C. Wallace April 2012 1 Introduction In the nineteenth century, the mathematician Évariste Galois discovered an elegant solution to the fundamental problem
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationA 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 information36 Fields of Rational Functions
36 Fields of Rational Functions The reader might have missed the familiar quotient rule (\f(f,g)) = f g fg in Lemma 35.5. It was missing because f is not a polynomial. g We now introduce these quotients
More informationa 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
More informationProof. The map. G n i. where d is the degree of D.
7. Divisors Definition 7.1. We say that a scheme X is regular in codimension one if every local ring of dimension one is regular, that is, the quotient m/m 2 is one dimensional, where m is the unique maximal
More informationMATH10040 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 informationEXERCISES 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 information3 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 information13 Solutions for Section 6
13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution
More informationCyclotomic 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 informationThe 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 information1 = (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 realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationCopy 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,...}
More informationAppendix A. Appendix. A.1 Algebra. Fields and Rings
Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.
More information4.1 Modules, Homomorphisms, and Exact Sequences
Chapter 4 Modules We always assume that R is a ring with unity 1 R. 4.1 Modules, Homomorphisms, and Exact Sequences A fundamental example of groups is the symmetric group S Ω on a set Ω. By Cayley s Theorem,
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationSince [L : K(α)] < [L : K] we know from the inductive assumption that [L : K(α)] s < [L : K(α)]. It follows now from Lemma 6.
Theorem 7.1. Let L K be a finite extension. Then a)[l : K] [L : K] s b) the extension L K is separable iff [L : K] = [L : K] s. Proof. Let M be a normal closure of L : K. Consider first the case when L
More informationIntroduction 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
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 20110503 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationfg = f g. 3.1.1. Ideals. An ideal of R is a nonempty ksubspace I R closed under multiplication by elements of R:
30 3. RINGS, IDEALS, AND GRÖBNER BASES 3.1. Polynomial rings and ideals The main object of study in this section is a polynomial ring in a finite number of variables R = k[x 1,..., x n ], where k is an
More information3. 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 informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationDIFFERENTIAL GEOMETRY HW 2
DIFFERENTIAL GEOMETRY HW 2 CLAY SHONKWILER 2 Prove that the only orientationreversing isometries of R 2 are glide reflections, that any two glidereflections through the same distance are conjugate by
More information2 The Euclidean algorithm
2 The Euclidean algorithm Do you understand the number 5? 6? 7? At some point our level of comfort with individual numbers goes down as the numbers get large For some it may be at 43, for others, 4 In
More informationIdeal 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 informationI. 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 informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationRevision of ring theory
CHAPTER 1 Revision of ring theory 1.1. Basic definitions and examples In this chapter we will revise and extend some of the results on rings that you have studied on previous courses. A ring is an algebraic
More informationFOUNDATIONS 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 informationFactorization 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
More informationFACTORING 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 informationQuotient 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 informationFactoring 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 informationMath 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 informationCHAPTER 5: MODULAR ARITHMETIC
CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called
More informationSection IV.21. The Field of Quotients of an Integral Domain
IV.21 Field of Quotients 1 Section IV.21. The Field of Quotients of an Integral Domain Note. This section is a homage to the rational numbers! Just as we can start with the integers Z and then build the
More informationFactoring 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 informationMarch 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationCLASS NOTES. We bring down (copy) the leading coefficient below the line in the same column.
SYNTHETIC DIVISION CLASS NOTES When factoring or evaluating polynomials we often find that it is convenient to divide a polynomial by a linear (first degree) binomial of the form x k where k is a real
More informationMATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.
MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An mbyn matrix is a rectangular array of numbers that has m rows and n columns: a 11
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationFACTORING 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 informationSolutions A ring A is called a Boolean ring if x 2 = x for all x A.
1. A ring A is called a Boolean ring if x 2 = x for all x A. (a) Let E be a set and 2 E its power set. Show that a Boolean ring structure is defined on 2 E by setting AB = A B, and A + B = (A B c ) (B
More informationMatrix 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 informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationMath 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 informationCancelling an a on the left and a b on the right, we get b + a = a + b, which is what we want. Note the following identity.
15. Basic Properties of Rings We first prove some standard results about rings. Lemma 15.1. Let R be a ring and let a and b be elements of R. Then (1) a0 = 0a = 0. (2) a( b) = ( a)b = (ab). Proof. Let
More informationz = i ± 9 2 2 so z = 2i or z = i are the solutions. (c) z 4 + 2z 2 + 4 = 0. By the quadratic formula,
91 Homework 8 solutions Exercises.: 18. Show that Z[i] is an integral domain, describe its field of fractions and find the units. There are two ways to show it is an integral domain. The first is to observe:
More informationGalois 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 informationModule 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
More informationQuadratic Equations in Finite Fields of Characteristic 2
Quadratic Equations in Finite Fields of Characteristic 2 Klaus Pommerening May 2000 english version February 2012 Quadratic equations over fields of characteristic 2 are solved by the well known quadratic
More informationPYTHAGOREAN 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 informationZeros 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
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationMOP 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
More informationCONTINUED 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.
More informationThe Inverse of a Square Matrix
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for inclass presentation
More informationModule MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions
Module MA1S11 (Calculus) Michaelmas Term 2016 Section 3: Functions D. R. Wilkins Copyright c David R. Wilkins 2016 Contents 3 Functions 43 3.1 Functions between Sets...................... 43 3.2 Injective
More informationAlgebra I Notes Review Real Numbers and Closure Unit 00a
Big Idea(s): Operations on sets of numbers are performed according to properties or rules. An operation works to change numbers. There are six operations in arithmetic that "work on" numbers: addition,
More information3. QUADRATIC CONGRUENCES
3. QUADRATIC CONGRUENCES 3.1. Quadratics Over a Finite Field We re all familiar with the quadratic equation in the context of real or complex numbers. The formula for the solutions to ax + bx + c = 0 (where
More information2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.
Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,
More informationminimal 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 informationby 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 yaxis We observe that
More informationPOWER SETS AND RELATIONS
POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationComputer Algebra for Computer Engineers
p.1/14 Computer Algebra for Computer Engineers Preliminaries Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/14 Notation R: Real Numbers Q: Fractions
More informationProblem Set 1 Solutions Math 109
Problem Set 1 Solutions Math 109 Exercise 1.6 Show that a regular tetrahedron has a total of twentyfour symmetries if reflections and products of reflections are allowed. Identify a symmetry which is
More informationTHE 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 informationBABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS
BABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS SETH SHELLEYABRAHAMSON Abstract. These are notes for a talk in the MITNortheastern Spring 2015 Geometric Representation Theory Seminar. The main source
More informationNOTES 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 informationInverses and powers: Rules of Matrix Arithmetic
Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3
More informationFinite Fields and ErrorCorrecting Codes
Lecture Notes in Mathematics Finite Fields and ErrorCorrecting Codes KarlGustav Andersson (Lund University) (version 1.01316 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationPROBLEM 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
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationT ( 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 informationSubsets 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
More information