5.1 Commutative rings; Integral Domains
|
|
|
- Flora Harrington
- 9 years ago
- Views:
Transcription
1 5.1 J.A.Beachy Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following statements (listed in Section 5.1): (d) a 0 = 0 for all a R; Solution: Since 0 is the additive identity element, we have = 0. To connect this property to multiplication, we need to use the distributive law. We have a 0 = a (0+0) = a 0+a 0, and then we can subtract a 0 from both sides of the equation to get 0 = a 0. (e) ( a) = a for all a R; Solution: This holds in any group. (f) ( a) ( b) = ab for all a,b R. Solution: Because we are proving a relationship between addition (since a is defined to be the additive inverse of a) and multiplication, we need to use the distributive law. We have ab + a( b) = a(b b) = a 0 = 0, and so a( b) = (ab). Similarly, ( a)b = ab, and then ( a)( b) = (a( b)) = ( ab) = ab. 24. (a) Is Z 2 a subring of Z 6? Solution: No, because Z 2 is not even a subset of Z 6. (b) Is 3Z 6 a subring of Z 6? Solution: The set 3Z 6 = {[0] 6,[3] 6 } is closed under addition, since we know it is a subgroup of the underlying additive group of Z 6. Furthermore, 3Z 6 is easily checked to be closed under multiplication. But our definition of a subring requires that the subset must contain the identity element of the ring, and since [1] 6 3Z 6, we conclude that 3Z 6 is not a subring of Z 6. Comment: Be careful here, because some authors do not require that a subring of a commutative ring with 1 must have the same identity element. In fact, we changed our definition between the second and third editions of our text Abstract Algebra. 25. (a) Show that the ring of Gaussian integers is an integral domain. Solution: It is easy to check that the set Z[i] = {m+ni m,n Z} is closed under addition and multiplication and contains 1. It follows that Z[i] is a subring of C, and so Theorem implies that Z[i] is an integral domain. (b) Show that Z[ 2] = {m+n 2 m,n Z} is an integral domain. Solution: As in part (a), Z[ 2] is a subring of C and so it follows from Theorem that Z[ 2] is an integral domain. Comment: The details of the proofs that Z[i] and Z[ 2] are subrings of C can be found in Examples and of Abstract Algebra.
2 5.1 J.A.Beachy Let R be a commutative ring. Prove that the intersection of any collection of subrings of R is a subring of R. Solution: To use Proposition 5.1.4, let a and b beelements in the intersection. Then a and b each belong to every subringin the collection, so a+b, ab, and a also belong to every subring in the collection. Therefore a+b, ab, and a belong to the intersection. Finally, the multiplicative identity of R belongs to each subring, so it also belongs to the intersection. 27. Show that in an integral domain the only idempotent elements are 0 and 1. Solution: Let D be an integral domain, and suppose that e D is idempotent. Then e e = e 2 = e = e 1, and so if e 0, then e = 1 since the cancellation law holds in D. Since 0 and 1 are idempotent, they are the only idempotent elements in D. 28. Show that if n = p k (p prime), then in Z n the only idempotent elements are 0 and 1. Solution: If e 2 = e in Z n, then p k e(e 1), and since gcd(e,e 1) = 1, this implies the either p k e, and e = 0, or else p k (e 1) and e = In Z 24, (a) find all nilpotent elements; Solution: We have x n 0 (mod 24) if and only if 3 x and 2 x. Thus the list of nilpotent elements is {0,6,12,18} = 2 3. (b) find all idempotent elements. Solution: If e Z 24 is idempotent, then 24 e(e 1). Since gcd(e,e 1) = 1 this implies that 3 e or 3 e 1, or else 8 e or 8 e 1. The list of elements e with 8 e or 8 e 1 is {e e = 0,1,8,9,16,17}. Adding the condition that 3 e or 3 e 1 reduces the list to {0,1,9,16}. 30. Let R be the set of all 3 3 matrices of the form (a) Show that R is a commutative ring. b a 0 with a,b,c Z. Solution: From linear algebra we know that addition and multiplication of matrices satisfy all of the axioms of a commutative ring, except the commutative law. Therefore it is enough to show that the given set satisfies the commutative law, and satisfies the conditions of a subring given in Proposition First, it is clear that the set is closed under addition, is closed under forming additive inverses, and contains the identity matrix. The following calculations verify closure and commutativity of multiplication. b a 0 d 0 0 e d 0 f e d = ad 0 0 bd+ae ad 0 cd+bd+af bd+ae ad
3 5.1 J.A.Beachy 3 d 0 0 e d 0 f e d b a 0 (b) Find the units of R. = d ea+db da 0 fa+eb+dc ea+db da Solution: Because the entries are from Z, in which only 1 and 1 are invertible, a matrix in R is invertible if and only its determinant is ±1. Thus an element is invertible if and only if it has either 1 or 1 on the main diagonal. (c) Find the nilpotent elements of R. Solution: The nilpotent matrices in R are the strictly lower triangular matrices. 31. Let R and S be commutative rings. Prove or disprove the following statements. (a) An element (a,b) R S is idempotent if and only if a an idempotent in R and b is idempotent in S. Solution: Since (a,b) 2 = (a 2,b 2 ), it is clear that (a,b) 2 = (a,b) if and only if a 2 = a and b 2 = b. (b) An element (a,b) R S is nilpotent if and only if a nilpotent in R and b is nilpotent in S. Solution: This clearly holds since (a,b) n = (a n,b n ). Comment: If m and k are the smallest positive integers with a m = 0 and b k = 0, respectively, thenthesmallestpositiveinteger nwith(a,b) n = (0,0) isn = max{m,k}. (c) An element (a,b) R S is a zero divisor if and only if a is a zero divisor in R and b is a zero divisor in S. Solution: This part is false since (1,0) is a zero divisor in Z Z because (1,0)(0,1) = (0,0), but 1 is certainly not a zero divisor in Z. 32. In the ring Z Z, let R = {(x,y) x y (mod 2)}. (a) Show that R is a subring of Z Z. Comment: Although the definition of a direct sum was first given in Exercise of the text, there is also a formal definition in Section 5.2. Solution: To show that R is a subring we will use Proposition If (a,b) and (c,d) belong to R, then a b (mod 2) and c d (mod 2), so it follows that a + c b + d (mod 2) and ac bd (mod 2), and thus R is closed under addition and multiplication. Furthermore, a b (mod 2) implies (a,b) R, and it is clear that the identity (1,1) of Z Z is in R. (b) Is R an integral domain? Solution: No, because (2,0) (0,2) = (0,0). (c) Find all idempotent elements of R. Solution: An element of a direct sum of commutative rings is idempotent if and only if each component is idempotent. Thus the idempotent elements of Z Z are (0,0), (1,1), (1,0), (0,1), and of these only (0,0) and (1,1) belong to R.
4 5.1 J.A.Beachy Find a commutative ring with zero divisors a,b such that a+b is not a zero divisor and a+b 0. Solution: In Z 2 Z 2 we have (1,0) (0,1) = (0,0), so (1,0) and (0,1) are zero divisors, but their sum (1,0)+(0,1) = (1,1) is not a zero divisor. 34. Although the set Z 2 [x]/ x 2 +1 is not a field, Proposition shows that addition and multiplication of congruence classes of polynomials is well-defined. Show that in this set the cancellation law for multiplication does not hold. Solution: Since x , we have x Therefore we have x(1 + x) = x+x 2 x+1. The cancellation law does not hold since for the nonzero elements 1, x and 1+x we have x(1+x) = 1(1+x) but x Recall that Z 3 [x]/ x 2 +1 is a field (this follows from Theorem since x 2 +1 is irreducible over Z 3 ). Find the order of each element in its group of units. Solution: The nonzero elements are 1, 1, x, x+1, x 1, x, x+1 = (x 1), and x 1 = (x+1). Of course, 1 has order 2. Since x 2 1, we have x 3 x and x 4 1. It follows that x and x have order 4, while x 2 has order 2. We have (x+1) 2 = x 2 x+1 x, so x+1 has order 8, making it a generator of the group of units. Starting over again and calculating powers of x+1, we have the following. (x+1) 2 x (x+1) 3 (x+1)( x) x 2 x x+1 (x+1) 4 ( x) 2 1 (x+1) 5 (x+1) (x+1) 6 (x+1) 2 x (x+1) 7 x(x+1) x 1 (x+1) 8 ( 1) 2 1 Thus the congruence classes of ±x±1 have order 8, while those of ±x have order 4. Finally 1 has order 2 and 1 has order 1. Comment: Review Proposition if you have questions about finding the order of an element of a cyclic group. 36. Let p be an odd prime number that is not congruent to 1 modulo 4. Prove that the ring Z p [x]/ x 2 +1 is a field. Hint: A root of x 2 = 1 leads to an element of order 4 in Z p. Solution: We must show that x 2 +1is irreducibleover Z p, or, equivalently, that x 2 +1 has no root in Z p. Supposethataisarootofx 2 +1inZ p. Thena 2 1 (mod p), andsoa 4 1 (mod p). The element a cannot be a root of x 2 1, so it does not have order 2, and thus it must have order 4. By Lagrange s theorem, this means that 4 is a divisor of the order of Z p, which is p 1. Therefore p = 4q +1 for some q Z, contradicting the assumption.
5 5.1 J.A.Beachy Let S be a commutative ring. (a) Let R = {n 1 n Z}. Show that R is a subring of S. Solution: If m,n Z, we have m 1+n 1 = (m+n) 1 by the associative law for addition, and (m 1) (n 1) = (mn) 1 by the distributive law. Finally, 1 = 1 1, and so R is subring of S. (b) Find the subring defined in part (a) for the ring given in Problem 30 and for the field given in Problem 35. Solution: In the ring b a 0 with a,b,c Z defined in Problem 27, the identity element is the identity matrix. The subring defined in part (a) is therefore the set of all scalar matrices. In the field Z 3 [x]/ x 2 +1 defined in Problem 30, the elements are the congruence classes represented by linear polynomials. The identity element is the constant polynomial [1] 3, and so the subringdefined in part (a) is the set of all constant polynomials. 38. (a) Let S be a set that satisfies all of the axioms of commutative ring, with the possible exception of the commutative law for multiplication. Show that the set R = {r S rs = sr for all s S} is a commutative ring. Note: The ring R is called the center of S. Solution: Since all of the axioms except the commutative law hold, we can use the proof of Proposition to simplify the calculations. If r 1,r 2 R, then (r 1 +r 2 )s = r 1 s + r 2 s = sr 1 + sr 2 = s(r 1 + r 2 ), and (r 1 r 2 )s = r 1 (r 2 s) = r 1 (sr 2 ) = (r 1 s)r 2 = (sr 1 )r 2 = s(r 1 r 2 ). Furthermore, ( r 1 )s = (r 1 s) = (sr 1 ) = s( r 1 ). Finally, by definition 1 R, and since it is clear that elements in R commute with each other, we are justified in concluding that R is a commutative ring. (b) Find the center of the set M 2 (R) of all 2 2 matrices with real entries. Comment: I need to comment on the following calculations, so that they don t just look like a trick. It would be natural to start out by just writing down an element in the center and seeing what you get by letting it commute with a general element of M 2 (R). In fact (you can try it), you would get four equations in four unknowns, with four general (undetermined) constants, and the situation is quite out of hand. The point is to take these equations and carefully choose some of the constants so that you can get some meaningful equations. The best way to do this seems me to be to pick (carefully) a couple of elements of M 2 (R) and see what specific information you get. My choice of elements is based on trial and error. [ ] a b Solution: Let belong to the center. In particular, it must commute with c d [ ] [ ][ ] [ ][ ] 1 0 a b a b the element, and so we must have =. 1 1 c d c d This yields four equations, and the useful ones are a+b = a, which shows that b has to be zero, and c+d = a+c, which shows that a = d. Next, any such element must
6 5.1 J.A.Beachy 6 [ ] [ ][ ] [ ][ ] 1 1 a a 0 also commute with, so we get =. Now 0 1 c a c a we get a = a+c, and so c = 0. We conclude that any element in the center of M 2 (R) must be a scalar matrix. On the other hand, it is clear that any scalar matrix is in the center, and so the center is precisely the set of scalar matrices. ANSWERS AND HINTS 42. Let R and S be commutative rings. Show that (R S) = R S (as groups). Hint: Define φ : R S (R S) by φ((u,v)) = (u,v) and verify that (u,v) is a unit of R S if and only if u is a unit in R and v is a unit in S. 44. Let R be a Boolean ring with 16 elements. Find R. Answer: R = {1}. Note: the number 16 is a red herring. 45. Let R be the ring of continuous functions from R to R. (Remember that R is a ring under multiplication of functions, not composition of functions.) (b) Characterize the units of R. Answer: Either f(x) > 0 for all x R, or f(x) < 0 for all x R. (d) Characterize the nilpotent elements of R. Answer: The only nilpotent element is the zero function. 48. Let R be a commutative ring. (a) Can R[x] have nilpotent elements of positive degree? Hint: Look at Z 4 [x]. (b) Can R[x] have idempotent elements of positive degree? Hint: Look at Z 6 [x].
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.
COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
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
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
Chapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
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
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
Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
Groups in Cryptography
Groups in Cryptography Çetin Kaya Koç http://cs.ucsb.edu/~koc/cs178 [email protected] Koç (http://cs.ucsb.edu/~koc) ucsb cs 178 intro to crypto winter 2013 1 / 13 Groups in Cryptography A set S and a binary
Properties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
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
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
(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
Boolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
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
a 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
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
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
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(
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
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
Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
Homework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
= 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
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
CONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
Chapter 3. if 2 a i then location: = i. Page 40
Chapter 3 1. Describe an algorithm that takes a list of n integers a 1,a 2,,a n and finds the number of integers each greater than five in the list. Ans: procedure greaterthanfive(a 1,,a n : integers)
PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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
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
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
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
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
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
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
Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
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
Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov [email protected]
Polynomials Alexander Remorov [email protected] Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
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
Notes on Algebraic Structures. Peter J. Cameron
Notes on Algebraic Structures Peter J. Cameron ii Preface These are the notes of the second-year course Algebraic Structures I at Queen Mary, University of London, as I taught it in the second semester
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,
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
8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
H/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
Introduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
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
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
SUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
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
SECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
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
Abstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the
Geometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
r + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography
V55.0106 Quantitative Reasoning: Computers, Number Theory and Cryptography 3 Congruence Congruences are an important and useful tool for the study of divisibility. As we shall see, they are also critical
Section 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
Factorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
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.
Applications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
Math 223 Abstract Algebra Lecture Notes
Math 223 Abstract Algebra Lecture Notes Steven Tschantz Spring 2001 (Apr. 23 version) Preamble These notes are intended to supplement the lectures and make up for the lack of a textbook for the course
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
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
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
Linear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
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
Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter 4 described a mathematical system
CHAPTER Number Theory FIGURE FIGURE FIGURE Plus hours Plus hours Plus hours + = + = + = FIGURE. Clock Arithmetic and Modular Systems Clock Arithmetic The introduction to Chapter described a mathematical
Factorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18 of Gallian s Contemporary Abstract Algebra. Most of the important
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
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
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
MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao [email protected]
Integer Polynomials June 9, 007 Yufei Zhao [email protected] 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
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
Solutions Manual for How to Read and Do Proofs
Solutions Manual for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve
2. 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,
4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
Orthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
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
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
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
A New Generic Digital Signature Algorithm
Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study
Algebraic Structures II
MAS 305 Algebraic Structures II Notes 12 Autumn 2006 Factorization in integral domains Lemma If a, b, c are elements of an integral domain R and ab = ac then either a = 0 R or b = c. Proof ab = ac a(b
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
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,
Chapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
calculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
Solutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
CS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
Test1. Due Friday, March 13, 2015.
1 Abstract Algebra Professor M. Zuker Test1. Due Friday, March 13, 2015. 1. Euclidean algorithm and related. (a) Suppose that a and b are two positive integers and that gcd(a, b) = d. Find all solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions
A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25
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
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)
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
Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 [email protected].
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 [email protected] This paper contains a collection of 31 theorems, lemmas,
