Homework 7 Solutions to Selected Problems
|
|
- Tracey O’Brien’
- 6 years ago
- Views:
Transcription
1 Homework 7 Solutions to Selected Prolems May 9, 01 1 Chapter 16, Prolem 17 Let D e an integral domain and f(x) = a n x n a 0 and g(x) = m x m e polynomials with coecients in D, where a n and m are nonzero. Then f(x) has degree n and g(x) has degree m. Their product is f(x)g(x) = a n m x n+m, and since a n and m are nonzero, a n m is nonzero since D is an integral domain (in D, the product of two nonzero elements is nonzero). Hence f(x)g(x) has degree n + m. What if we had a commutative ring that had zero-divisors? For example consider these two polynomials with degree 1 in Z 4 [x]: f(x) = x, g(x) = x + 1. Their product is ( )x + x = 0x + x = x, which has degree 1, less than deg(f(x)) + deg(g(x)) = =. In general, the degree of a product f(x)g(x) can e less than the sum of the degrees of f(x) and g(x) if the leading coecients of f(x) and g(x) are zero-divisors whose product is zero. Chapter 16, Prolem 3 Let us nd one nonzero polynomial rst. If p(x) has a as a zero for a = 0, 1, in Z 3, then p(x) has degree at least 3, and x, x 1, and x divide p(x). Thus, we can start with p(x) = x(x 1)(x ) = x 3 + x. Let g(x) e any other polynomial in Z 3 [x]. Then for a = 0, 1,, p(a) = 0, so g(a)p(a) = g(a) 0 = 0. Therefore, there are innitely many polynomials f(x) in Z 3 [x] such that f(a) = 0 for a = 0, 1,. They are polynomial multiples of any polynomial p(x) I[x]. We know there is an innite amount, since x n Z 3 [x] for any positive integer n. 1
2 3 Chapter 16, Prolem 38 Let I e an ideal of a commutative ring R (see the note to this prolem). Then I is closed under sutraction and multiplication y anything in R: a, I imply a I, a I, r R imply ra I. We need to prove that I[x] is an ideal of R[x]. We note that the constant polynomial that equals zero is in I[x], so we need to show: f(x), g(x) I[x] imply f(x) g(x) I[x], f(x) I[x], r(x) R[x] imply r(x)f(x) I[x]. Let f(x) = a n x n a 0, g(x) = m x m e polynomials with coecients in I (so they are in I[x]). Let s e the maximum of m and n, a i = 0 for i > n, and i = 0 for i > m. Since I is an ideal, 0 I, and a i i I for 0 i s. Therefore f(x) g(x) = (a s s )x s (a 0 0 ) I[x], so I[x] is closed under sutraction. Let r(x) = r l x l r 0 e any polynomial in R[x] (the coecients might not e in I). Then for any 0 i l, 0 j n, Therefore, for k = 0,..., n + l, so Thus, I[x] is an ideal of R[x]. Note: r i a j I. c k = r k a 0 + r k 1 a r 1 a k 1 + r 0 a k I, r(x)f(x) = c n+l x n+l c 0 I[x]. Although the prolem does not specify that R is a commutative ring, e aware that the ook has only dened polynomial rings over a commutative ring. What happens if we try to make polynomials over a ring that is not commutative? You have to e more careful when multiplying polynomials. In Z[x], we can write (x)(3x ) = ( 3)x x = 6x 3, allowing the 3 and an x to switch places, ut if the coecients are matrices, then for example, y denition, [ ] [ ] ([ ] [ ]) [ ] x x = x = x 3, [ ] 1 1 ut we are not making x and switch places. 1 1
3 4 Chapter 16, Prolem 40 In prolem 38, we have shown that I[x] is an ideal. Now suppose that I is a prime ideal of R as well. To show that I[x] is a prime ideal of R[x], we need to show that given f(x), g(x) R[x], if f(x)g(x) I[x], then f(x) or g(x) is in I[x]. We will proceed y induction on the sum of the degrees of f(x) and g(x). 4.1 Base Case: f(x) and g(x) oth have degree zero We have f(x) = a 0 and g(x) = 0, and suppose f(x)g(x) = a 0 0 I[x]. Then the constant term a 0 0 must e in I. Since I is a prime ideal, a 0 or 0 is in I, so either f(x) or g(x) has its constant term in I. Hence either f(x) or g(x) is in I[x]. 4. Induction Step Suppose that if the sum of the degrees of f(x) and g(x) is at most n, then f(x)g(x) I[x] implies f(x) or g(x) is in I[x]. That is, if the coecients of f(x)g(x) are in I, then all the coecients of either f(x) or g(x) are elements of I. Now let f(x) and g(x) e polynomials with coecients known to e in R, and say f(x) has degree k and g(x) has degree n + 1 k, so their degrees sum to n + 1. f(x) = a k x k + a k 1 x k a 0, and a k, n+1 k are nonzero. Then g(x) = n+1 k x n+1 k , f(x)g(x) = a k n+1 k x n a 0 0. Suppose f(x)g(x) I[x]. Then all the coecients of f(x)g(x) are in I. In particular, the coecient of x n+1, namely a k n+1 k, must e in I (the other coecients of f(x)g(x) can involve sums of products, and are more complicated). Hence either a k or n+1 k is in I, and without loss of generality, assume a k is the coecient in I. Since a k I, this implies that the polynomial a k x k I[x]. Then since I[x] is an ideal of R[x] (y prolem 38), it is closed under multiplication y any other polynomial in R[x]. Hence ( a k x k) g(x) I[x]. In addition, I[x] is closed under sutraction, so f(x)g(x) I[x] and ( a k x k) g(x) I[x] imply f(x)g(x) ( a k x k) g(x) I[x], so y distriuting, ( f(x) a k x k) g(x) = ( a k 1 x k a 0 ) g(x) I[x]. Let f 1 (x) = f(x) a k x k = a k 1 x k a 0. Its degree is at most k 1 (it could e smaller since some of the coecients like a k 1 could equal zero). Now we can use our inductive hypothesis on the two polynomials f 1 (x) and g(x), since the sum of their degrees are at most k 1 + n + 1 k = n: either f 1 (x) or g(x) is in I[x]. If f 1 (x) I[x], then since a k x k I[x], f(x) = f 1 (x) + a k x k I[x]. Otherwise, g(x) is in I[x], so either way, f(x) or g(x) is in I[x]. 3
4 4.3 Conclusion By induction, given f(x), g(x) R[x], if f(x)g(x) I[x], then f(x) or g(x) is in I[x]. Therefore, I[x] is a prime ideal. 4.4 Note If R is an integral domain, we can actually perform induction on the degree of f(x)g(x) y Prolem Chapter 16, Prolem Method 1: Mimic the proof that is irrational Before we egin, let us look at the rings involved. Let F (x) denote the eld of fractions of F [x], where F is a eld. Then elements of F (x) are of the form f(x)/g(x) where f(x), g(x) F [x] and g(x) is not the constant polynomial that always equals zero. Furthermore, f 1 (x)/g 1 (x) = f (x)/g (x) in F (x)if and only if f 1 (x)g (x) = g 1 (x)f (x) in F [x]. Now we will solve the prolem. We will use a proof y contradiction and assume there is an element in F (x) whose square is x/1 (where 1 denotes a constant polynomial that equals the unity of F, although y prolem 8 from the previous homework, we do not have to worry aout the distinction). That is, there exist polynomials f(x), g(x) in F [x] with g(x) 0 and (f(x)/g(x)) = f(x) /g(x) = x/1. If f(x) and g(x) had any zeros in common, y Corollary on page 98, if a is a common zero of f(x) and g(x), then f(x) = (x a)f 1 (x) and g(x) = (x a)g 1 (x). Hence f(x)/g(x) = f 1 (x)/g 1 (x), ecause f(x)g 1 (x) = (x a)f 1 (x)g 1 (x) = (x a)g 1 (x)f 1 (x) = g(x)f 1 (x). Therefore, we can cancel any common zeros (common factors of the form (x a)), and we can assume f(x) and g(x) have no zeros in common. Essentially, we are assuming that f(x)/g(x) is in lowest terms. Now, f(x) /g(x) = x/1 implies 1f(x) = f(x) = xg(x). Hence x divides f(x), so there exists a polynomial a n x n a 0 such that f(x) = (a n x n a 0 ) x = a n x n a 0 x + 0. Most importantly, the constant term of f(x) is zero. Now suppose f(x) = m x m Could 0 e nonzero? By denition, f(x) = f(x)f(x) = m m x m = a n x n a 0 x + 0, 4
5 so 0 and 0 = 0. Since F is a eld, it has no zero-divisors, so 0 = 0. Hence f(x) = m x m x + 0 = ( m x m ) x, so x divides f(x). Hence x 0 is a factor of f(x), so 0 F is a zero of f(x). ( However, since f(x) ) = m x m x, f(x) = mx m x = m x m x, so f(x) = xg(x) implies ( m x m ) 1 x = xg(x). Since F [x] is an integral domain and x is not the additive identity of F [x], we can cancel an x on oth sides: ( m x m ) 1 x = g(x). Hence x divides g(x), and y a similar argument for f(x), we have x = x 0 is a factor of g(x). But that means g(x) also has 0 as a zero, contradicting the assumption that f(x) and g(x) had no zeros in common. Therefore, there is no element in F (x) which squares to x/1. 5. Method : Use Prolem 17 and compare degrees We will use a proof y contradiction and assume there is an element in F (x) whose square is x/1. That is, there exist polynomials f(x), g(x) in F [x] with g(x) 0 and (f(x)/g(x)) = f(x) /g(x) = x/1. Now, f(x) /g(x) = x/1 implies 1f(x) = f(x) = xg(x). Suppose f(x) has degree n and g(x) has degree m. By Prolem 17, f(x) has degree n, while g(x) has degree m. Hence xg(x) has degree 1 + m = m + 1. Then f(x) = xg(x) implies their degrees are equal, so n = m+1 for some integers n and m. However, there is no integer which is oth even (n) and odd (m+1). Thus, f(x) and g(x) do not exist, and there is no element in F (x) which squares to x/1. 5
Section 19 Integral domains
Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There
More informationHomework 9 Solutions to Selected Problems
Homework 9 Solutions to Selected Problems June 11, 2012 1 Chapter 17, Problem 12 Since x 2 + x + 4 has degree 2 and Z 11 is a eld, we may use Theorem 17.1 and show that f(x) is irreducible because it has
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More information+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4
Math 4030-001/Foundations of Algebra/Fall 2017 Polynomials at the Foundations: Rational Coefficients The rational numbers are our first field, meaning that all the laws of arithmetic hold, every number
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
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 information2 (17) Find non-trivial left and right ideals of the ring of 22 matrices over R. Show that there are no nontrivial two sided ideals. (18) State and pr
MATHEMATICS Introduction to Modern Algebra II Review. (1) Give an example of a non-commutative ring; a ring without unit; a division ring which is not a eld and a ring which is not a domain. (2) Show that
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationContents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains
Ring Theory (part 4): Arithmetic and Unique Factorization in Integral Domains (by Evan Dummit, 018, v. 1.00) Contents 4 Arithmetic and Unique Factorization in Integral Domains 1 4.1 Euclidean Domains and
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More informationCHAPTER 14. Ideals and Factor Rings
CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements
More informationMTH310 EXAM 2 REVIEW
MTH310 EXAM 2 REVIEW SA LI 4.1 Polynomial Arithmetic and the Division Algorithm A. Polynomial Arithmetic *Polynomial Rings If R is a ring, then there exists a ring T containing an element x that is not
More informationPolynomials. Henry Liu, 25 November 2004
Introduction Polynomials Henry Liu, 25 November 2004 henryliu@memphis.edu This brief set of notes contains some basic ideas and the most well-known theorems about polynomials. I have not gone into deep
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 informationPolynomial Rings. i=0
Polynomial Rings 4-15-2018 If R is a ring, the ring of polynomials in x with coefficients in R is denoted R[x]. It consists of all formal sums a i x i. Here a i = 0 for all but finitely many values of
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationHOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS
HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS 1. Chapter 3, Problem 18 (Graded) Let H and K be subgroups of G. Then e, the identity, must be in H and K, so it must be in H K. Thus, H K is nonempty, so we can
More informationCHAPTER 10: POLYNOMIALS (DRAFT)
CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More informationSimplifying Rational Expressions and Functions
Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written
More informationSection IV.23. Factorizations of Polynomials over a Field
IV.23 Factorizations of Polynomials 1 Section IV.23. Factorizations of Polynomials over a Field Note. Our experience with classical algebra tells us that finding the zeros of a polynomial is equivalent
More informationPart IX. Factorization
IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect
More informationChapter 4. Remember: F will always stand for a field.
Chapter 4 Remember: F will always stand for a field. 4.1 10. Take f(x) = x F [x]. Could there be a polynomial g(x) F [x] such that f(x)g(x) = 1 F? Could f(x) be a unit? 19. Compare with Problem #21(c).
More information17 Galois Fields Introduction Primitive Elements Roots of Polynomials... 8
Contents 17 Galois Fields 2 17.1 Introduction............................... 2 17.2 Irreducible Polynomials, Construction of GF(q m )... 3 17.3 Primitive Elements... 6 17.4 Roots of Polynomials..........................
More informationMath1a Set 1 Solutions
Math1a Set 1 Solutions October 15, 2018 Problem 1. (a) For all x, y, z Z we have (i) x x since x x = 0 is a multiple of 7. (ii) If x y then there is a k Z such that x y = 7k. So, y x = (x y) = 7k is also
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 informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
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 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 information8 Appendix: Polynomial Rings
8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients
More information6.1 Polynomial Functions
6.1 Polynomial Functions Definition. A polynomial function is any function p(x) of the form p(x) = p n x n + p n 1 x n 1 + + p 2 x 2 + p 1 x + p 0 where all of the exponents are non-negative integers and
More informationRoots of Unity, Cyclotomic Polynomials and Applications
Swiss Mathematical Olympiad smo osm Roots of Unity, Cyclotomic Polynomials and Applications The task to be done here is to give an introduction to the topics in the title. This paper is neither complete
More informationCOMMUTATIVE RINGS. Definition 3: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition 1: 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
More informationName: MAT 444 Test 4 Instructor: Helene Barcelo April 19, 2004
MAT 444 Test 4 Instructor: Helene Barcelo April 19, 004 Name: You can take up to hours for completing this exam. Close book, notes and calculator. Do not use your own scratch paper. Write each solution
More informationFurther linear algebra. Chapter II. Polynomials.
Further linear algebra. Chapter II. Polynomials. Andrei Yafaev 1 Definitions. In this chapter we consider a field k. Recall that examples of felds include Q, R, C, F p where p is prime. A polynomial is
More informationRings, Integral Domains, and Fields
Rings, Integral Domains, and Fields S. F. Ellermeyer September 26, 2006 Suppose that A is a set of objects endowed with two binary operations called addition (and denoted by + ) and multiplication (denoted
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 information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
More informationSolutions for Math 225 Assignment #4 1
Solutions for Math 225 Assignment #4 () Let B {(3, 4), (4, 5)} and C {(, ), (0, )} be two ordered bases of R 2 (a) Find the change-of-basis matrices P C B and P B C (b) Find v] B if v] C ] (c) Find v]
More information12 16 = (12)(16) = 0.
Homework Assignment 5 Homework 5. Due day: 11/6/06 (5A) Do each of the following. (i) Compute the multiplication: (12)(16) in Z 24. (ii) Determine the set of units in Z 5. Can we extend our conclusion
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
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 informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationU + V = (U V ) (V U), UV = U V.
Solution of Some Homework Problems (3.1) Prove that a commutative ring R has a unique 1. Proof: Let 1 R and 1 R be two multiplicative identities of R. Then since 1 R is an identity, 1 R = 1 R 1 R. Since
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered 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 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 informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More information3 Solutions of congruences
3 Solutions of congruences 3.1 The Chinese Remainder Theorem revisited Let f(x) be a polynomial with coefficients in Z. A congruence equation is of the form f(x) 0 (mod m), where m is a positive integer.
More informationGroup Theory. 1. Show that Φ maps a conjugacy class of G into a conjugacy class of G.
Group Theory Jan 2012 #6 Prove that if G is a nonabelian group, then G/Z(G) is not cyclic. Aug 2011 #9 (Jan 2010 #5) Prove that any group of order p 2 is an abelian group. Jan 2012 #7 G is nonabelian nite
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationProof by Contradiction
Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving
More informationClass Notes; Week 7, 2/26/2016
Class Notes; Week 7, 2/26/2016 Day 18 This Time Section 3.3 Isomorphism and Homomorphism [0], [2], [4] in Z 6 + 0 4 2 0 0 4 2 4 4 2 0 2 2 0 4 * 0 4 2 0 0 0 0 4 0 4 2 2 0 2 4 So {[0], [2], [4]} is a subring.
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationAnswers and Solutions to Selected Homework Problems From Section 2.5 S. F. Ellermeyer. and B =. 0 2
Answers and Solutions to Selected Homework Problems From Section 2.5 S. F. Ellermeyer 5. Since gcd (2; 4) 6, then 2 is a zero divisor (and not a unit) in Z 4. In fact, we see that 2 2 0 in Z 4. Thus 2x
More informationSection 18 Rings and fields
Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)
More informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
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 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 information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationDiscrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:
Discrete valuation rings Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that: 1. v is surjective. 2. v(ab) = v(a) + v(b). 3. v(a + b) min(v(a), v(b)) if a + b 0. Proposition:
More informationAlgebraic Cryptography Exam 2 Review
Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Exercise 11. Rings: definitions, units, zero divisors, polynomial rings
D-MATH 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 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 information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
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 informationContents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces
Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and
More informationAnalytic Geometry and Calculus I Exam 1 Practice Problems Solutions 2/19/7
Analytic Geometry and Calculus I Exam 1 Practice Problems Solutions /19/7 Question 1 Write the following as an integer: log 4 (9)+log (5) We have: log 4 (9)+log (5) = ( log 4 (9)) ( log (5)) = 5 ( log
More information6x 3 12x 2 7x 2 +16x 7x 2 +14x 2x 4
2.3 Real Zeros of Polynomial Functions Name: Pre-calculus. Date: Block: 1. Long Division of Polynomials. We have factored polynomials of degree 2 and some specific types of polynomials of degree 3 using
More informationNotes 6: Polynomials in One Variable
Notes 6: Polynomials in One Variable Definition. Let f(x) = b 0 x n + b x n + + b n be a polynomial of degree n, so b 0 0. The leading term of f is LT (f) = b 0 x n. We begin by analyzing the long division
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationREDUNDANT TRINOMIALS FOR FINITE FIELDS OF CHARACTERISTIC 2
REDUNDANT TRINOMIALS FOR FINITE FIELDS OF CHARACTERISTIC 2 CHRISTOPHE DOCHE Abstract. In this paper we introduce so-called redundant trinomials to represent elements of nite elds of characteristic 2. The
More informationLecture 8 - Algebraic Methods for Matching 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 1, 2018 Lecture 8 - Algebraic Methods for Matching 1 In the last lecture we showed that
More informationPrime Rational Functions and Integral Polynomials. Jesse Larone, Bachelor of Science. Mathematics and Statistics
Prime Rational Functions and Integral Polynomials Jesse Larone, Bachelor of Science Mathematics and Statistics Submitted in partial fulfillment of the requirements for the degree of Master of Science Faculty
More informationLECTURE 10, MONDAY MARCH 15, 2004
LECTURE 10, MONDAY MARCH 15, 2004 FRANZ LEMMERMEYER 1. Minimal Polynomials Let α and β be algebraic numbers, and let f and g denote their minimal polynomials. Consider the resultant R(X) of the polynomials
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 informationGauss s Theorem. Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R.
Gauss s Theorem Theorem: Suppose R is a U.F.D.. Then R[x] is a U.F.D. To show this we need to constuct some discrete valuations of R. Proposition: Suppose R is a U.F.D. and that π is an irreducible element
More informationMath 117: Algebra with Applications
Math 117: Algebra with Applications Michael Andrews UCLA Mathematics Department June 4, 2016 Contents 1 Rings and fields 3 1.1 The definition........................................ 3 1.2 Lots of examples......................................
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 10 1 Polar Multiplication of Complex Numbers [PMCN] 2 De Moivre s Theorem [DMT] 3 Complex Exponential Function 4 Complex nth Roots
More informationNotes on Galois Theory
Notes on Galois Theory Paul D. Mitchener October 16, 2007 Contents 1 Introduction 2 2 Extensions 2 3 Euclidean Rings 3 4 Polynomials 4 5 Polynomials with Integer Coefficients 6 6 Algebraic Elements 8 7
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationMath 121 Homework 3 Solutions
Math 121 Homework 3 Solutions Problem 13.4 #6. Let K 1 and K 2 be finite extensions of F in the field K, and assume that both are splitting fields over F. (a) Prove that their composite K 1 K 2 is a splitting
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 informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of f(x)
More information15. Polynomial rings Definition-Lemma Let R be a ring and let x be an indeterminate.
15. Polynomial rings Definition-Lemma 15.1. Let R be a ring and let x be an indeterminate. The polynomial ring R[x] is defined to be the set of all formal sums a n x n + a n 1 x n +... a 1 x + a 0 = a
More informationDivisor matrices and magic sequences
Discrete Mathematics 250 (2002) 125 135 www.elsevier.com/locate/disc Divisor matrices and magic sequences R.H. Jeurissen Mathematical Institute, University of Nijmegen, Toernooiveld, 6525 ED Nijmegen,
More information2 ALGEBRA II. Contents
ALGEBRA II 1 2 ALGEBRA II Contents 1. Results from elementary number theory 3 2. Groups 4 2.1. Denition, Subgroup, Order of an element 4 2.2. Equivalence relation, Lagrange's theorem, Cyclic group 9 2.3.
More informationSolution to Set 7, Math 2568
Solution to Set 7, Math 568 S 5.: No. 18: Let Q be the set of all nonsingular matrices with the usual definition of addition and scalar multiplication. Show that Q is not a vector space. In particular,
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationIRREDUCIBLES AND PRIMES IN COMPUTABLE INTEGRAL DOMAINS
IRREDUCIBLES AND PRIMES IN COMPUTABLE INTEGRAL DOMAINS LEIGH EVRON, JOSEPH R. MILETI, AND ETHAN RATLIFF-CRAIN Abstract. A computable ring is a ring equipped with mechanical procedure to add and multiply
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 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 informationLinear Algebra, 3rd day, Wednesday 6/30/04 REU Info:
Linear Algebra, 3rd day, Wednesday 6/30/04 REU 2004. Info: http://people.cs.uchicago.edu/laci/reu04. Instructor: Laszlo Babai Scribe: Richard Cudney Rank Let V be a vector space. Denition 3.. Let S V,
More informationKevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings
MTHSC 412 Section 3.1 Definition and Examples of Rings A ring R is a nonempty set R together with two binary operations (usually written as addition and multiplication) that satisfy the following axioms.
More informationMany of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation.
12. Rings 1 Rings Many of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation. Example: Z, Q, R, and C are an Abelian
More informationϕ : Z F : ϕ(t) = t 1 =
1. Finite Fields The first examples of finite fields are quotient fields of the ring of integers Z: let t > 1 and define Z /t = Z/(tZ) to be the ring of congruence classes of integers modulo t: in practical
More information