Handout - Algebra Review

Similar documents
Section III.6. Factorization in Polynomial Rings

Math 547, Exam 2 Information.

Factorization in Polynomial Rings

A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

2a 2 4ac), provided there is an element r in our

Polynomial Rings. i=0

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains

(Rgs) Rings Math 683L (Summer 2003)

Polynomial Rings. (Last Updated: December 8, 2017)

Math 611 Homework 6. Paul Hacking. November 19, All rings are assumed to be commutative with 1.

1. Algebra 1.5. Polynomial Rings

Math 120 HW 9 Solutions

7.4: Integration of rational functions

Polynomials, Ideals, and Gröbner Bases

Computations/Applications

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

8 Appendix: Polynomial Rings

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

RINGS: SUMMARY OF MATERIAL

Total 100

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS

MODEL ANSWERS TO HWK #10

Solutions to Assignment 1

+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4

Polynomials. Chapter 4

Chapter 4. Remember: F will always stand for a field.

Eighth Homework Solutions

Homework 8 Solutions to Selected Problems

TROPICAL SCHEME THEORY

Rings. EE 387, Notes 7, Handout #10

Name: MAT 444 Test 4 Instructor: Helene Barcelo April 19, 2004

MTH310 EXAM 2 REVIEW

Algebra Homework, Edition 2 9 September 2010

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

Lecture 2. (1) Every P L A (M) has a maximal element, (2) Every ascending chain of submodules stabilizes (ACC).

Factorization in Integral Domains II

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism

Algebraic structures I

Mathematical Olympiad Training Polynomials

Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours

Selected Math 553 Homework Solutions

(a + b)c = ac + bc and a(b + c) = ab + ac.


ALGEBRA QUALIFYING EXAM SPRING 2012

MATH 361: NUMBER THEORY TENTH LECTURE

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Math Introduction to Modern Algebra

50 Algebraic Extensions

Chapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

36 Rings of fractions

Recall, R is an integral domain provided: R is a commutative ring If ab = 0 in R, then either a = 0 or b = 0.

Math Introduction to Modern Algebra

Rings. Chapter Definitions and Examples

Part IX. Factorization

1. Group Theory Permutations.

POLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

where c R and the content of f is one. 1

MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions

1.3 Algebraic Expressions. Copyright Cengage Learning. All rights reserved.

2. THE EUCLIDEAN ALGORITHM More ring essentials

Groups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

Lecture 7.3: Ring homomorphisms

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Sample algebra qualifying exam

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

R.5 Factoring Polynomials 1

Math 412, Introduction to abstract algebra. Overview of algebra.

Factorization in Polynomial Rings

Contents. 4 Arithmetic and Unique Factorization in Integral Domains. 4.1 Euclidean Domains and Principal Ideal Domains

Abstract Algebra: Chapters 16 and 17

Homework 10 M 373K by Mark Lindberg (mal4549)

g(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.

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35

Algebra Review 2. 1 Fields. A field is an extension of the concept of a group.

Rings and Fields Theorems

Factorization in Domains

August 2015 Qualifying Examination Solutions

Tenth Bit Bank Mathematics Real Numbers

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

MTH 310, Section 001 Abstract Algebra I and Number Theory. Sample Midterm 1

Solutions of exercise sheet 8

Polynomials over UFD s

Lecture 7: Polynomial rings

Permutations and Polynomials Sarah Kitchen February 7, 2006

Exercise Sheet 3 - Solutions

Problem 1.1. Classify all groups of order 385 up to isomorphism.

8. Prime Factorization and Primary Decompositions

ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS

Homework 6 Solution. Math 113 Summer 2016.

Math 418 Algebraic Geometry Notes

Simplifying Rational Expressions and Functions

U + V = (U V ) (V U), UV = U V.

6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree

Practice problems for first midterm, Spring 98

Math 210B: Algebra, Homework 1

Transcription:

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 of this handout as you can. Some of the concepts may not be review but will be good to know, and we will revisit some of these concepts as they come up. We start with a few definitions that will be used throughout the course: A ring will always mean a commutative ring with a multiplicative identity. A ring homomorphism φ : R S (where R, S are rings) is a function that preserve addition and multiplication in the respective rings. That is φ(r + r ) = φ(r) + φ(r ) and φ(rr ) = φ(r)φ(r ) for all r, r R A domain (also called an integral domain) is a ring (with at least two elements) in which the cancellation law holds. That is for any x, y, z 0 in R, xy = xz y = z. A field is a domain in which every nonzero element is a unit. That is, every nonzero element has a multiplicative inverse. We will use Z, Q, R, C to denote the ring of integers, rational numbers, real numbers and complex numbers (under their usual operations), respectively. 1. Determine all integers n 2 for which Z/nZ, under its usual addition and multiplication (modular arithmetic), is a domain. 2. If φ : R S is a ring homomorphism, prove that ker(φ) is an ideal of R. (Recall ker(φ) = {r R φ(r) = 0}.) 1

Let R be a ring. The ring of polynomials in n variables of R is typically written as R[x 1,..., x n ]. When n = 2 or 3 we often write R[x, y] and R[x, y, z] respectively. The monomials in R[x 1,..., x n ] are the polynomials x i 1 1 x in n where i j is a nonnegative integer for all j. Every polynomial f R[x 1,..., x n ] can be written uniquely as a sum a (i) x (i) where x (i) is some monomial in x 1, x 2,..., x n and a (i) R. We say F is homogeneous or a form of degree d if all the coefficients a (i) are zero except for when x (i) is a monomial of degree d. Any polynomial can be written as a sum of homomgeneous polynomials f = f 0 + f 1 + + f d where f i is a form of degree i and f d 0. The integer d is called the degree of f and is denoted deg(f). If R is a domain, deg(fg) = deg(f) + deg(g) for any f, g R[x 1,..., x n ]. 1. Is the product of two homogeneous polynomials in R[x 1, x 2,..., x n ] necessarily homogeneous? 2. If R is a domain, prove R[x 1,..., x n ] is a domain. 2

Recall that a nonzero element u in a ring R is a unit if there is some other nonzero element v R for which uv = vu = 1. An element a in a ring R is irreducible if it is not a unit and not zero, and for any factorization a = bc with b, c R, either b or c is a unit. A domain R is a unique factorization domain, written UFD, if every nonzero element in R can be factored uniquely into a product of irreducible elements (up to multiplication by units and the ordering of factors). For example, let R = Z. The units in R are ±1. Suppose a R. If a is prime and a = bc then one of b or c is ±1. Furthermore if a is compositive, then it can be written as a product bc where neither b nor c is ±1. Hence the irreducible elements in R are the primes. Now any integer can be written as a product of primes uniquely, up to multiplication by ±1 and reordering of the primes. If R is a UFD, then one can prove R[x] is also a UFD. Hence, for any field k, k[x 1,..., x n ] is a UFD (since we can repeatedly appeal to the fact that for any m, k[x 1, x 2,..., x m ] = (k[x 1, x 2,..., x m 1 ])[x m ]. 1. The ring k[x, y] is a UFD. Factor y 3 x 4 y in k[x, y] into irreducibles. Explain why your irreducible elements are indeed irreducible. 3

Rings have various types of ideals that we will come across. These include: principal ideals: I is principal if there is some r R for which I = (r). maximal ideals: I is maximal if the only ideals J in R for which I J R are J = I and J = r. prime ideals: I R is prime ideal of R if for any ab I, either a I or b I. As an example, consider the ring C[x]. Every ideal in this ring is a principal ideal. Indeed, if I C[x] is an ideal that is not the 0 ideal, then any polynomial p(x) with smallest degree in I must generate the ideal I (that is, I = (p(x)). To see why, suppose otherwise. Then I contains some polynomial a(x) that is not a multiple of p(x). By the Division Algorithm, there exists q(x), r(x) C[x] where 0 < deg(r(x)) < deg(p(x)) such that a(x) = b(x)p(x) + r(x). But then r(x) = a(x) b(x)p(x) I and has smaller degree than p(x), a contradiction. As another example, consider the ring Z. By the same argument as in C[x], every ideal in Z is a principal ideal. Suppose I is an ideal in Z and I = (m) for some m Z. How can we determine if m is a prime ideal? First, observe that if m = ±1 then I = R so we rule this out by definition. Suppose first that m is composite, say m = ab and neither a nor b is ±1. Then ab I, but neither a nor b is in I, so I is not a prime ideal. Now suppose m is prime. Then if ab I, we have m ab and since m is prime, m a or m b and hence a I or b I. 1. Determine all maximal ideals in the ring k[x] where k is a field. 2. Suppose I = (p(x)) for some p(x) k[x], p(x) 0. Prove I is a prime ideal if and only if p(x) is an irreducible polynomial. 4

Let I be an ideal of a ring R. The quotient ring R/I (pronounced R modulo I ) is the set of equivalence classes of elements in R under the equivalence relation a b if a b I. The equivalence class containing an element a is often written as a or a + I. We will use the notation a to be consistent with Fulton s book. The multiplication and addition in R/I are formed in a way as to make the reduction map π : R R/I a ring homomorphism. In other words, if r, s R/I then r s = rs, r + s = r + s For example, let k be a field, and I be the ideal I = (x 3 + x + 1) in k[x]. Then k[x]/i = {a + bx + cx 2 a, b, c k} (Why? Hint: divide any polynomial by x 3 + x + 1.) If p(x) = 1 + x + x 2 and q(x) = 1 x + x 2 in k[x]/i then p(x)q(x) = 1 + x + x 2 1 x + x 2 = x 4 + x 2 + 1 = x(x 3 ) + x 2 + 1 = x( x 1) + x 2 + 1 = x + 1. 1. If k is a field, briefly explain why k[x 1, x 2,..., x n ]/I is a k-vector space for any ideal I in k[x 1, x 2,..., x n ]. 2. Find a basis for the k-vector space k[x, y]/(xy 1). 3. Let R be a ring and I be an ideal of R. (a) Prove that I is maximal if and only if R/I is a field. (b) Prove that I is prime if and only if R/I is a domain. 5