Math 120 HW 9 Solutions


 Alexis Parker
 3 years ago
 Views:
Transcription
1 Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z which satisfies x 2 11 (mod 35). One way to solve for such an element systematically is to work separately modulo 5 and 7. The solutions to x 2 11 (mod 5) are x ±1, and the solutions to x 2 11 (mod 7) are x ±2. Putting these possibilities together using the Chinese Remainder Theorem, the four solutions to x 2 11 (mod 35) are x 9, 16, 19, 26 (mod 35). Picking any of these, say x = 9, we get a ring homomorphism f : R S given by f(a + b 11) = a + 9b by sending 11 to 9. Question 2 Let R R[x] be the subring of R[x] consisting of polynomials whose coefficient of x is 0: R = {f(x) = a 0 + a 2 x a n x n a i R}. You proved in HW8 Q1 that R is not a PID. Is R a UFD? Prove or disprove. No, R is not a UFD. For example, x 6 = x 2 x 2 x 2 = x 3 x 3, and neither x 2 nor x 3 can be factored further (by degree considerations) in R. Thus x 6 has two different factorizations into irreducibles in R. Question 3 Given a polynomial p(x) R[x] and an element a R, we say that a is a root of p(x) if p(a) = 0 R. Prove that if R is a domain and p(x) has degree n, then p(x) has at most n roots in R. We start with a zero theorem for polynomials over a general commutative ring. Lemma 1. If R is a commutative ring, p(x) R[x], and a R is a root of p(x), then p(x) = (x a)q(x) for some q R[x]. Proof. Induct on the degree of p(x). If deg p = 0, then p(x) is a nonzero constant function, so it can t have roots. Suppose the lemma is true for all polynomials of degree at most n 1, and let deg p = n. If the leading term of p is a n x n, then p(x) = a n x n 1 (x a) + r(x) for some r(x) of strictly smaller degree. By induction, r(x) is a multiple of (x a), so p(x) is as well. Now, suppose for the sake of contradiction that R is a domain and p(x) has degree n but n + 1 roots a 1,..., a n+1. Then, by the lemma, p(x) = (x a 1 )p 1 (x) for some p 1 (x) R[x] of degree n 1. Since p(a i ) = 0 for all i, p(a i ) = (a i a 1 )p 1 (a i ) = 0 1
2 for all i. But R is a domain and has no zero divisors, so since (a i a 1 ) 0, we conclude that p 1 (a i ) = 0 for all i = 2,..., n + 1. Applying the lemma to p 1 next, we find p(x) = (x a 1 )(x a 2 )p 2 (x), where p 2 has all the roots a 3,..., a n+1. Continuing in this manner, we find that p(x) = (x a 1 ) (x a n+1 )p n+1 (x) for some polynomial p n+1 (x) R[x]. But such a product has degree at least n + 1, which is a contradiction. Thus p(x) had at most n roots to begin with. Question 4 Let p(x) C[x] be a nonzero polynomial. Consider the following two properties of p(x): (A) The quotient ring C[x]/(p(x)) is isomorphic to a product ring C C. (B) The polynomial p(x) has no repeated roots. Prove that these two properties are equivalent: (A) (B). Write C n for the nfold product ring C C. Suppose first that p(x) has no repeated roots. By the fundamental theorem of algebra, p(x) factors as p(x) = u(x α 1 ) (x α n ) where u 0 and α i C are all distinct. Then, consider the map φ : C[x]/(p(x)) C n, given by evaluating at each of the roots of p: φ(f) = (f(α 1 ), f(α 2 ),..., f(α n )). Then, φ(f) = (0,..., 0) if and only if f(α i ) = 0 for all i. This happens if and only if f (p(x)), so indeed ker φ = (p(x)) and φ is welldefined. Note that φ is just the product of n different evaluation maps, which we have shown (e.g. HW7 Q3) are individually ring homomorphisms. Thus φ is a ring homomorphism. It remains to show that φ is an isomorphism. By the argument before, ker φ = (p(x)) exactly so φ is injective. To prove surjectivity, pick any (z 1,..., z n ) C n. There exists by Lagrange interpolation a polynomial q(x) C[x] for which q(α i ) = z i. Explicitly, n j i q(x) = z (x α j) i j i (α i α j ). i=1 For this polynomial q, φ( q) = (z 1,..., z n ). Thus φ is bijective and therefore an isomorphism of rings, as desired. Conversely, suppose the quotient ring C[x]/(p(x)) is isomorphic to some product C n. Define a nilpotent element of a ring R to be an element r R for which some power vanishes: r m = 0 for some m N. We claim that C n has no nonzero nilpotents. Indeed, if (z 1,..., z n ) C n, then multiplication is coordinatewise, so (z 1,..., z n ) m = 0 iff all of the z i are zero. Thus, C[x]/(p(x)), being isomorphic to C n, must also have no nonzero nilpotents. Write by the fundamental theorem of algebra p(x) = u(x α 1 ) m1 (x α 2 ) m2 (x α r ) mr where now the α i are the distinct roots of p but the multiplicities m i are not necessarily 1. In fact, if p(x) has repeated roots, then some m i 1, and so the function q(x) = (x α 1 )(x α 2 ) (x α r ) is not a multiple of p, so q 0 in C[x]/(p(x)). But q(x) M is a multiple of p, where M = max(m 1,..., m r ), so q(x) M = 0 in C[x]/(p(x)), and therefore q would be a nonzero nilpotent in C[x]/(p(x)). Since C[x]/(p(x)) has no nonzero nilpotents, it follows that all the m i = 1 and p(x) has no repeated roots, as desired. Question 5 Let R = Z/5 Z (just like the ring Z/10 Z from HW6, but in base 5 instead). (a) Prove that R = Z/5 Z is a domain. One way of explicitly describing the elements r R is to identify them with infinite sequences (r 1, r 2,...) where r i Z/5 i Z and r i r i 1 (mod 5) i 1, where addition and multiplication is coordinatewise. Suppose r, s R are identified with sequences (r 1, r 2,...) and (s 1, s 2,...), and r, s 0. We want to show that rs 0. But if rs = 0, then r i s i 0 (mod 5) i for all i. In particular, for each i, one of r i or s i is divisible by 5 i/2. Since r i r i/2 (mod 5) i/2 and s i s i/2 (mod 5) i/2, it follows that for all i, either r i/2 0 (mod 5) i/2 or s i/2 0 (mod 5) i/2. 2
3 In particular, one of (r 1, r 2,...) and (s 1, s 2,...) has infinitely many terms equal to zero (in the appropriate ring Z/5 i Z). But then every term before each zero must also be zero. Thus, one of r, s is zero, and there are no nontrivial zero divisors in R, as desired. (b) Describe which elements of R = Z/5 Z are units. The answer is all elements for which r 1 0 (mod 5). Concretely, in base 5 this includes all infinite base5 integers which do not end in zero. To prove this rigorously, one must construct an s for each such r for which rs = 1  in other words, to give a sequence (s 1, s 2,...) for which r i s i (mod 5) for all i. This turns out to be a special case of an important result known as Hensel s Lifting Lemma. (c) Let K be the fraction field of domain R = Z/5 Z. Give a concrete description of K. What are its elements? What are the operations of addition/multiplication on these elements? Can one easily see from your description that every nonzero element is invertible, or is that difficult to see? Sketch a proof that your description is correct. One way of defining K is as the set of fractions 5 n u where n Z and u R is a unit, together with 0. By part (b), every element r R can be written as 5 n u for some n 0 and some unit u by dividing r by the highest power of 5 dividing r. Addition and multiplication work in the obvious ways. If 5 m u and 5 n v are two elements for which m n (without loss of generality), 5 m u + 5 n v = 5 m (u + 5 n m v), where the latter addition is addition in R. It is possible for powers of 5 to appear in the sum u + 5 n m v if n = m; in this case, factor out the largest power of 5 dividing u + v and combine it with 5 m. Multiplication is just (5 m u)(5 n v) = 5 m+n (uv). Every nonzero element 5 n u has an inverse 5 n u 1 since u is a unit in R. The point is that the only elements not invertible already in R are multiples of 5, and so inverting 5 is all that s necessary to obtain the fraction field. Question 6 Suppose that R is a commutative ring which contains Z. (a) Prove that if P R is a prime ideal of R, then P Z is a prime ideal of Z. Certainly, P Z is an ideal of Z, since P itself must be closed under multiplication by Z R. Suppose for the sake of contradiction that P is prime but P Z is not prime in Z. Then, since the ideals of Z are just nz and are prime iff n is prime, this implies that P Z = nz for a composite n. Pick any nontrivial factorization n = ab of z. Since a, b Z R as well, it follows that ab P but a, b P,so P is not a prime ideal. This is the contradiction we were looking for. (b) Part (a) defines a function β : {prime ideals of R} {prime ideals of Z}. Construct an explicit commutative ring R containing Z such that the image of β is imβ = {(0), (5), (7), (11), (13),...} i.e. all prime ideals except (2) and (3). Prove (or at least sketch a proof) R has this property. One such ring is R = Z[ 1 6 ] = { a 2 m 3, a Z, m, n N}. This ring certainly contains Z. Also, note that n (p) R is still a prime ideal for every p Z prime which is not 2 and 3, and (0) R is as well since R is a domain. For these, it is easy to check that β(pr) = pz and β(0r) = 0Z. Thus, imβ {(0), (5), (7), (11), (13),...}. It remains to show that (2) and (3) are not in this image. If (2) imβ, there is some prime P R for which P Z = 2Z. But then P 2, and 1 2 lies in R, so P = 1. Thus P must be the entire ring, contradicting the fact that P Z = 2Z. Similarly, P Z 3Z for any P R. Question 7 (a) Let F be a field, and let R F be a subring with the property that for every x F, either x R or 1 x R (or both). Prove that if I and J are two ideals of R, then either I J or J I. 3
4 Suppose for the sake of contradiction that there exist two ideals I, J neither of which contains the other. Then, there are elements x I\J and y J\I. Since all ideals contain 0, we have x, y 0. Thus, x/y F, and the property given tells us that either x/y or its inverse y/x lies in R. Without loss of generality, x/y R. Then, since J is an ideal of R, x = (x/y) y J, contradicting the assumption x J. Thus one of I, J contains the other. (b) Construct a proper subring R Q such that for every x Q, either x R or 1 x R (or both). Let R = { a Q, 2 b}, b i.e. the ring of all fractions with odd denominator. Sums and products of such fractions also have odd denominator, so R is a subring of Q, and it is proper because 1 2 R. For any x Q, x can be written as a/b, where a, b are coprime. Thus, at least one of a and b is odd, so at least one of a/b and its inverse b/a lies in R, as desired. Question 8 Given an abelian group A, we say the 10dual A is the abelian group of homomorphisms f : A Z/10Z under pointwise addition. We call an abelian group 10invisible if A = 0, i.e. if there are no nonzero group homomorphisms f : A Z/10Z. (a*) Compute A for A = Z, A = Z/6Z, and A = Z/10Z. As abelian groups, the answers are Z Z/10Z, (Z/6Z) Z/2Z, and (Z/10Z) Z/10Z. These can be computed using the fact that a homomorphism between cyclic groups is determined by the image of a generator. (b) We know from class (or will soon) that every finitelygenerated abelian group A is isomorphic to A = Z r Z/n 1 Z Z/n 2 Z Z/n k Z for a unique r 0 and a unique sequence of positive integers n 1 n 2 n k. In terms of this description, which finitelygenerated abelian groups are 10invisible? If there is a nonzero homomorphism f : G i Z/10Z from any single factor in a direct sum G i of abelian groups to Z/10Z, then there is a nonzero homomorphism from the whole sum to Z/10Z, given by first projecting an element (a 1,..., a n ) G i onto the ith coordinate a i and then applying f. Thus it suffices to check which cyclic groups Z or Z/nZ are 10invisible. The answer is exactly the groups Z/nZ for which (n, 10) = 1, which we show now. First, if (n, 10) = 1, then any homomorphism f : Z/nZ Z/10Z must send 1 to an element with order dividing n. But no nonzero element of the range has order dividing n, so f = 0. Conversely, if 2 n, there exists a nonzero homomorphism f : Z/nZ Z/10Z given by sending 1 to 5. Similarly, if 5 n, one can simply send 1 to 2. As a result, the finitelygenerated 10invisible abelian groups are exactly those finite abelian groups of the form Z/n 1 Z Z/n 2 Z Z/n k Z where n 1 n 2 n k, and (n k, 10) = 1. (c) Choose two of the following abelian groups A, and for each, describe as best you can the abelian group A : (i) A = Q, We show Q = 0. If not, some f : Q Z/10Z is nonzero, and sends a/b n for 10 n and a/b Q. But then it must send a/10b to an element m Z/10Z for which 10 m = n, which is absurd. (ii) A = Z[ 1 6 ], We show (Z[ 1 6 ]) Z/5Z. In fact, the five homomorphisms are f i, 0 i 4, where f i (a/6 k ) = 2ai (mod 10). It is easy to check that these maps are homomorphisms  note that 6 m m (mod 10) for any even m. Conversely, to show that these are the only homomorphisms can be reduced to checking that if f(1) = 0 then f = 0. 4
5 Suppose there is a nonzero group homomorphism f for which f(1) = 0. Then, 6 k f(1/6 k ) = 0, so f(1/6 k ) is an element divisible by 5 in Z/10Z, i.e. f(1/6 k ) { 0, 5}. But if f(1/6 k ) = 5, then 6f(1/6 k+1 ) 5 (mod 10), which is absurd since 5 is odd. Thus, f(1/6 k ) = 0 for all k. It now follows that f(a/6 k ) = 0 for all a, k, as desired. (iii) A = Q/Z, Any group homomorphism Q/Z Z/10Z can be precomposed with the quotient map Q Q/Z to give a homomorphism Q Z/10Z. By (i) there are no such nonzero maps, so (Q/Z) = 0 as well. (iv) A = Z/10 Z. We claim that (Z/10 Z) Z/10Z, and the ten maps are given by f i (r) = ir (mod 10) for each of i = 0,..., 9. These are certainly homomorphisms; it remains to check that they are all possible ones. Note that f(10r) = 10f(r) 0 (mod 10), so every multiple of 10 is sent to zero in Z/10Z. Also, every r Z/10 Z can be written as r r 1 where r 0 {0,..., 9} is the ones digit and r 1 Z/10 Z. Thus, for f to be a group homomorphism, f(r) = f(r r 1 ) = r 0 f(1) + 10f(r 1 ) = r 0 f(1). Thus, f is uniquely determined by f(1), and we re done. 5
RINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 1113 of Artin. Definitions not included here may be considered
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationAlgebraic structures I
MTH5100 Assignment 110 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a nonempty set. Let + and (multiplication)
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationIUPUI Qualifying Exam Abstract Algebra
IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order
More informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM  FALL SESSION ADVANCED ALGEBRA I.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM  FALL SESSION 2006 110.401  ADVANCED ALGEBRA I. Examiner: Professor C. Consani Duration: take home final. No calculators allowed.
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationPRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.
PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
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 UFD. Therefore
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationDMATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings
DMATH Algebra I HS 2013 Prof. Brent Doran Exercise 11 Rings: definitions, units, zero divisors, polynomial rings 1. Show that the matrices M(n n, C) form a noncommutative ring. What are the units of M(n
More informationCongruences and Residue Class Rings
Congruences and Residue Class Rings (Chapter 2 of J. A. Buchmann, Introduction to Cryptography, 2nd Ed., 2004) Shoichi Hirose Faculty of Engineering, University of Fukui S. Hirose (U. Fukui) Congruences
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationMath 210B: Algebra, Homework 1
Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many nonassociate irreducible polynomials. Recall that by Homework 9, Exercise 8 of
More informationThe group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.
The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct
More informationCSIR  Algebra Problems
CSIR  Algebra Problems N. Annamalai DST  INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli 620024 Email: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationLecture 7.3: Ring homomorphisms
Lecture 7.3: Ring homomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 7.3:
More informationMath 4400, Spring 08, Sample problems Final Exam.
Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that
More informationMath 210B: Algebra, Homework 4
Math 210B: Algebra, Homework 4 Ian Coley February 5, 2014 Problem 1. Let S be a multiplicative subset in a commutative ring R. Show that the localisation functor RMod S 1 RMod, M S 1 M, is exact. First,
More information1.5 The Nil and Jacobson Radicals
1.5 The Nil and Jacobson Radicals The idea of a radical of a ring A is an ideal I comprising some nasty piece of A such that A/I is wellbehaved or tractable. Two types considered here are the nil and
More informationAlgebra Exam Syllabus
Algebra Exam Syllabus The Algebra comprehensive exam covers four broad areas of algebra: (1) Groups; (2) Rings; (3) Modules; and (4) Linear Algebra. These topics are all covered in the first semester graduate
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationPh.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018
Ph.D. Qualifying Examination in Algebra Department of Mathematics University of Louisville January 2018 Do 6 problems with at least 2 in each section. Group theory problems: (1) Suppose G is a group. The
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013
18.78 Introduction to Arithmetic Geometry Fall 013 Lecture #4 1/03/013 4.1 Isogenies of elliptic curves Definition 4.1. Let E 1 /k and E /k be elliptic curves with distinguished rational points O 1 and
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationMath 762 Spring h Y (Z 1 ) (1) h X (Z 2 ) h X (Z 1 ) Φ Z 1. h Y (Z 2 )
Math 762 Spring 2016 Homework 3 Drew Armstrong Problem 1. Yoneda s Lemma. We have seen that the bifunctor Hom C (, ) : C C Set is analogous to a bilinear form on a Kvector space, : V V K. Recall that
More informationBackground Material in Algebra and Number Theory. Groups
PRELIMINARY READING FOR ALGEBRAIC NUMBER THEORY. HT 2016/17. Section 0. Background Material in Algebra and Number Theory The following gives a summary of the main ideas you need to know as prerequisites
More informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationQuizzes for Math 401
Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that
More informationPolynomial Rings. (Last Updated: December 8, 2017)
Polynomial Rings (Last Updated: December 8, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from Chapters
More informationMATH 403 MIDTERM ANSWERS WINTER 2007
MAH 403 MIDERM ANSWERS WINER 2007 COMMON ERRORS (1) A subset S of a ring R is a subring provided that x±y and xy belong to S whenever x and y do. A lot of people only said that x + y and xy must belong
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationHandout  Algebra Review
Algebraic Geometry Instructor: Mohamed Omar Handout  Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much
More informationSample algebra qualifying exam
Sample algebra qualifying exam University of Hawai i at Mānoa Spring 2016 2 Part I 1. Group theory In this section, D n and C n denote, respectively, the symmetry group of the regular ngon (of order 2n)
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationAbstract Algebra: Chapters 16 and 17
Study polynomials, their factorization, and the construction of fields. Chapter 16 Polynomial Rings Notation Let R be a commutative ring. The ring of polynomials over R in the indeterminate x is the set
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:0010:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:0010:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationSolutions of exercise sheet 8
DMATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationMath Introduction to Modern Algebra
Math 343  Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More information38 Irreducibility criteria in rings of polynomials
38 Irreducibility criteria in rings of polynomials 38.1 Theorem. Let p(x), q(x) R[x] be polynomials such that p(x) = a 0 + a 1 x +... + a n x n, q(x) = b 0 + b 1 x +... + b m x m and a n, b m 0. If b m
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning  F is closed under
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More information2a 2 4ac), provided there is an element r in our
MTH 310002 Test II Review Spring 2012 Absractions versus examples The purpose of abstraction is to reduce ideas to their essentials, uncluttered by the details of a specific situation Our lectures built
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationISOMORPHISMS KEITH CONRAD
ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition
More informationIRREDUCIBILITY TESTS IN Q[T ]
IRREDUCIBILITY TESTS IN Q[T ] KEITH CONRAD 1. Introduction For a general field F there is no simple way to determine if an arbitrary polynomial in F [T ] is irreducible. Here we will focus on the case
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationDMATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
DMATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More informationA few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in
A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationModern Computer Algebra
Modern Computer Algebra Exercises to Chapter 25: Fundamental concepts 11 May 1999 JOACHIM VON ZUR GATHEN and JÜRGEN GERHARD Universität Paderborn 25.1 Show that any subgroup of a group G contains the neutral
More informationMath 581 Problem Set 7 Solutions
Math 581 Problem Set 7 Solutions 1. Let f(x) Q[x] be a polynomial. A ring isomorphism φ : R R is called an automorphism. (a) Let φ : C C be a ring homomorphism so that φ(a) = a for all a Q. Prove that
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. PIDs Definition 1 A principal ideal domain (PID) is an integral
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More informationPublickey Cryptography: Theory and Practice
Publickey Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationIn Theorem 2.2.4, we generalized a result about field extensions to rings. Here is another variation.
Chapter 3 Valuation Rings The results of this chapter come into play when analyzing the behavior of a rational function defined in the neighborhood of a point on an algebraic curve. 3.1 Extension Theorems
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationSolutions to oddnumbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to oddnumbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
More informationMath 553 Qualifying Exam. In this test, you may assume all theorems proved in the lectures. All other claims must be proved.
Math 553 Qualifying Exam January, 2019 Ron Ji In this test, you may assume all theorems proved in the lectures. All other claims must be proved. 1. Let G be a group of order 3825 = 5 2 3 2 17. Show that
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:1011:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationRing Theory Problems. A σ
Ring Theory Problems 1. Given the commutative diagram α A σ B β A σ B show that α: ker σ ker σ and that β : coker σ coker σ. Here coker σ = B/σ(A). 2. Let K be a field, let V be an infinite dimensional
More informationDMATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
DMAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the nth cyclotomic polynomial
More informationHomework 10 M 373K by Mark Lindberg (mal4549)
Homework 10 M 373K by Mark Lindberg (mal4549) 1. Artin, Chapter 11, Exercise 1.1. Prove that 7 + 3 2 and 3 + 5 are algebraic numbers. To do this, we must provide a polynomial with integer coefficients
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. padic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationGroups of Prime Power Order with Derived Subgroup of Prime Order
Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More information