MATH Algebra for High School Teachers Integral Domains

Similar documents
COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

Applications of Fermat s Little Theorem and Congruences

Chapter 13: Basic ring theory

Math 319 Problem Set #3 Solution 21 February 2002

(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

H/wk 13, Solutions to selected problems

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Factoring Polynomials

it is easy to see that α = a

26 Integers: Multiplication, Division, and Order

Properties of Real Numbers

Algebraic Structures II

Introduction to Finite Fields (cont.)

Handout #1: Mathematical Reasoning

CONTENTS 1. Peter Kahn. Spring 2007

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

minimal polyonomial Example

Basics of Polynomial Theory

Quotient Rings and Field Extensions

V Quantitative Reasoning: Computers, Number Theory and Cryptography

MATH10040 Chapter 2: Prime and relatively prime numbers

11 Ideals Revisiting Z

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

3.6 The Real Zeros of a Polynomial Function

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

Factorization in Polynomial Rings

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

How To Prove The Dirichlet Unit Theorem

SOLUTIONS FOR PROBLEM SET 2

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.

SOLVING POLYNOMIAL EQUATIONS

Today s Topics. Primes & Greatest Common Divisors

The Factor Theorem and a corollary of the Fundamental Theorem of Algebra

GREATEST COMMON DIVISOR

Factorization Algorithms for Polynomials over Finite Fields

k, then n = p2α 1 1 pα k

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

Groups in Cryptography

Lecture 13 - Basic Number Theory.

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic. Theoretical Underpinnings of Modern Cryptography

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

3 1. Note that all cubes solve it; therefore, there are no more

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

The Mean Value Theorem

8 Divisibility and prime numbers

PROBLEM SET 6: POLYNOMIALS

7. Some irreducible polynomials

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

26 Ideals and Quotient Rings

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Unique Factorization

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

by the matrix A results in a vector which is a reflection of the given

Math 55: Discrete Mathematics

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Math Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

4. FIRST STEPS IN THE THEORY 4.1. A

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

Chapter 8 Integers 8.1 Addition and Subtraction

DIVISORS IN A DEDEKIND DOMAIN. Javier Cilleruelo and Jorge Jiménez-Urroz. 1 Introduction

If n is odd, then 3n + 7 is even.

FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

A New Generic Digital Signature Algorithm

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

Factoring Cubic Polynomials

PYTHAGOREAN TRIPLES KEITH CONRAD

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

So let us begin our quest to find the holy grail of real analysis.

Notes on Algebraic Structures. Peter J. Cameron

mod 10 = mod 10 = 49 mod 10 = 9.

Non-unique factorization of polynomials over residue class rings of the integers

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS

NOTES ON LINEAR TRANSFORMATIONS

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Stupid Divisibility Tricks

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov

How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)

Homework until Test #2

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Continued Fractions and the Euclidean Algorithm

FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

Practice with Proofs

Rolle s Theorem. q( x) = 1

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Chapter 3. if 2 a i then location: = i. Page 40

Lecture Notes on Polynomials

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

r + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.

8 Primes and Modular Arithmetic

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Basic Algorithms In Computer Algebra

Notes on metric spaces

Transcription:

MATH 57091 - Algebra for High School Teachers Integral Domains Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 8

Cancellation We showed previously that if ab ac (mod m) and (a, m) = 1), then b c (mod m). In Z m, this translates to if [a][b] = [a][c] and (a, m) = 1, then [b] = [c]. Of course, in Z m, (a, m) = 1 implies [a] is a unit; e.g., if [2]x = [6] in Z 15, then [2] 1 = [8], and so [8][2]x = [8][6], hence x = [48] = [3]. But we also solved the equation 2x = 6 over the ring of integers, Z, without resorting to multiplicative inverses: If 2x = 6, then 2x 6 = 0, and so 2(x 3) = 0. For a, b Z, ab = 0 implies a = 0 or b = 0. Therefore, 2(x 3) = 0 implies x 3 = 0, and so x = 3. The key over Z is that 2 is not 0 and is not a zero divisor. The same method works over Z 15, because (2, 15) = 1 implies [2] is not [0] and is not a zero divisor. D.L. White (Kent State University) 2 / 8

Cancellation In a general ring, the key to cancelling a common factor is that the common factor must not be 0 or a zero divisor. It need not be a unit, but if it is a unit, then it is not 0 or a zero divisor. We do, however, need to be careful to allow for the possibility of non-commutativity in a general ring. We have the following theorem. Theorem Let R be a ring and let a, b, and c be elements of R, such that a 0 R and a is not a zero divisor. If a b = a c, then b = c. If b a = c a, then b = c. NOTE: If R is non-commutative and a b = c a, then even if a is a unit we cannot conclude b = c. For example, in M 2 (Z), [ ] [ ] [ ] [ ] [ ] 2 1 1 1 5 4 2 1 2 1 =, but is a unit. 3 2 0 1 9 7 3 2 3 2 D.L. White (Kent State University) 3 / 8

Cancellation Proof of Theorem: We prove the first statement and leave the second as an exercise. Let a b = a c and assume a 0 R and a is not a zero divisor. Adding (a c) to both sides of the equation, we have a b a c = 0. By the left distributive law, we obtain a (b c) = 0. But a 0 R and a is not a zero divisor. Therefore, b c = 0; that is, adding c to both sides, b = c. D.L. White (Kent State University) 4 / 8

Definition We now generalize the very nice property of having no zero divisors enjoyed by the ring of integers Z (as well as fields). Definition An integral domain is a commutative ring with 1, with no zero divisors. Thus in an integral domain, if ab = 0 then a = 0 or b = 0. Equivalently, if a 0 and b 0, then ab 0. The next result is a corollary of the cancellation theorem and the definition. Corollary Let R be an integral domain and let a, b, c R such that a 0 R. If a b = a c, then b = c. Note that since an integral domain is commutative, the order of multiplication on each side does not matter. D.L. White (Kent State University) 5 / 8

Examples 1 The ring of integers, Z, is an integral domain. In fact, Z is the prototype for integral domains. All integral domains behave much like Z in essential ways. Even the name reflects the fact that they are integer-like rings. 2 Every field is an integral domain; e.g., Q, R, Z p with p prime. 3 Z m is an integral domain if and only if it is a field; i.e., if and only if m is prime. D.L. White (Kent State University) 6 / 8

Examples 4 Let R be a commutative ring with 1. The polynomial ring R[x] is an integral domain if and only if R is an integral domain. Proof: Since R is a commutative ring with 1, so is R[x]. Hence we need to prove that R[x] has no zero divisors if and only if R has no zero divisors. Suppose R[x] has no zero divisors. Since R is contained in R[x], R cannot have any zero divisors. Suppose R has no zero divisors. Let f (x) = a m x m + + a 1 x + a 0 and g(x) = b n x n + + b 1 x + b 0 be non-zero polynomials in R[x], with a m 0 and b n 0. The leading term of f (x) g(x) is a m b n x m+n. Since R has no zero divisors and a m 0, b n 0, we have a m b n 0, and so f (x) g(x) 0. Therefore, R[x] has no zero divisors. D.L. White (Kent State University) 7 / 8

Finite Integral Domains We have seen that if Z m is an integral domain, then Z m is actually a field. In general, we have: Theorem If R is a finite integral domain, then R is a field. Proof: If R is an integral domain, then R is a commutative ring with 1. We need to show that every non-zero element is a unit. Let 0 R u R. Since R is finite, we can write R = {r 1, r 2,..., r n }, where the r i are distinct elements of R, and r k = 1 R for some k. Consider the subset R = {u r 1, u r 2,..., u r n } of R. Suppose u r i = u r j for some i, j. Since R is an integral domain and u 0 R, this implies r i = r j, so i = j. Hence all of the u r i are distinct and R contains n distinct elements of R. Thus R = R, and so 1 R is in R ; that is, 1 R = u r i for some i. Therefore u is a unit. D.L. White (Kent State University) 8 / 8