Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:

Size: px
Start display at page:

Download "Discrete valuation rings. Suppose F is a field. A discrete valuation on F is a function v : F {0} Z such that:"

Transcription

1 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: The set R = {0} {r R : v(r) 0} is a ring, which we will call the valuation ring of v. Def: An integral domain will be called a discrete valuation ring if it is the valuation ring of a discrete valuation of its quotient field. 1

2 Proof of the Proposition: We have to show that R is closed under subtraction and multiplication, and that 1 R. Note first that v(1) = v(1 1) = v(1) + v(1) forces v(1) = 0, so 1 R. Then v( 1) + v( 1) = v( 1 1) = v(1) = 0 so v( 1) = 0 and 1 R. If a, b R, then v(a) 0 and v(b) 0. We get v(ab) = v(a) + v(b) 0 so ab R. Also, v(a b) v(a)+v( b) = v(a)+v( 1)+v(b) 0 so a b R and we re done. 2

3 Theorem: Discrete valuation rings (D.V.R. s) are Euclidean. Proof: We define N : R Z 0 by N(0) = 0 and N(r) = v(r) if 0 r R. To show the Euclidean property, suppose a, b R and 0 b. We have to find q, r R with a = qb + r and r = 0 or N(r) < N(b). If v(a) v(b) then v(a/b) = v(a) v(b) 0 so q = a/b R and we can let r = 0. Suppose v(a) < v(b). This case is easy: let q = 0 and r = a. 3

4 Example: Suppose p is a rational prime. There is a discrete valuation defined by letting v p : Q Z v p ( a b ) = ord p(a) ord p (b) for all non-zero integers a, b, where ord p (a) is the exponent of the highest power of p which divides a. The valuation ring of v p is just the localization Z (p) = { a b Q : a, b Z, p b} It will be a homework problem on the next homework assignment to check that every discrete valuation of Q has the form v p for some prime p. 4

5 Example: Suppose F = C(t) is the rational function field in one variable. If α C, we can define a discrete valuation by if v α : C(t) Z v α (f(x)) = n f(x) = (x α) n s(x) t(x) with s(α) 0 t(α). The discrete valuation ring of v α is the localization C[x] (x α) = { h(x) g(x) : h(x), g(x) C[x], g(α) 0} and all the discrete valuations of C(t) have the form v α for some α C. 5

6 Example: If p is a prime, the p-adic integers Z p form the valuation ring of the discrete valuation v p : Q p Z defined in the following way. Let v p (r) = n if rp n is a unit of Z p. This is equivalent to saying that r can be represented in the form r = p n i=0 a i p i with a i {0,..., p 1} for all i and a

7 Greatest common divisors Def: Suppose R is a commutative ring and that a, b R. An element d R is called a G.C.D. (greatest common divisor) for a and b if: 1. d a in the sense that a = dd for some d R, and d b. 2. If d is any other element of R such that d a and d b then d d. Write gcd(a, b) for the set of all G.C.D. s for a and b. Example: The elements d of R = Z which are G.C.D. s for a = 2 and b = 3 are ±1. This illustrates the fact if d gcd(a, b) then du gcd(a, b) for all units u R. 7

8 Theorem: Suppose that a, b R and that the ideal Ra + Rb equals Rd for some d R. Then d gcd(a, b). Proof: If d a and d b then Ra + Rd Rd. So Rd = Ra + Rb Rd and d = fd for some f R. This means d d in R. Warning: The converse is not true. For example, suppose R = Z[x], a = 2 and b = x. We claim that d = 1 is in gcd(a, b), but Ra + Rb Rd. It s clear that 1 a and 1 b. So to show 1 gcd(a, b) it will suffice to show that if d a and d b in R, then d 1, which is the same as saying d R. If d 2, then d must be a constant polynomial, and d {±1, ±2}. But d x implies d {±2}. So d = ±1 is a unit in R, and 1 gcd(2, x). 8

9 The ideal Ra + Rb = R 2 + R x is not equal to R 1 = R, though, since the constant term of every element of R 2 + R x is an even integer. Corollary: If R is a P.I.D, then every pair of elements a, b of R has a G.C.D. If one of a or b is nonzero, then all the elements of gcd(a, b) differ from each other by multiplication by a unit. Proof: Given a, b R we know Ra + Rb = Rd for some d R since R is a P.I.D, and d gcd(a, b) by the previous Theorem. If of a or b is not zero, then d must be non-zero as well. If d is some other element of gcd(a, b), then d d and d d. So d = ud and d = vd for some u, v R. Then d = uvd so d(1 uv) = 0. Since d 0 and R is an integral domain, this forces uv = 1, so u, v R. 9

10 The Euclidean algorithm Theorem: Suppose R is a Euclidean domain with Euclidean norm N : R Z 0. Let a and b be elements of R, and suppose 0 b. Construct a sequence of pairs (q i, r i ) of elements of R using the Euclidean property of N: a = qb + r 1 with r 1 = 0 or N(r 1 ) < N(b) b = q 1 r 1 + r 2 with r 2 = 0 or N(r 2 ) < N(r 1 ) r 1 = q 2 r 2 +r 3 with r 3 = 0 or N(r 3 ) < N(r 2 ) r k = q k+1 r k The last non-zero remainder r k+1 in this sequence is in gcd(a, b). Note: The sequence terminates because the norms N(r i ) form a decreasing sequence of non-negative integers. 10

11 Proof: We know that R is a P.I.D., so gcd(a, b) is non-empty. An element c of R divides both a and b if and only if it divides both b and r 1 = a qb. So by induction, gcd(a, b) = gcd(b, r 1 ) = gcl(r 1, r 2 ) = gcd(r k, r k+1 ) However, by assumption, r k+1 divides r k, so we find r k+1 gcd(r k, r k+1 ) = gcd(a, b) Note: We can write the equations in the Euclidean algorithm in reverse order and use them to find c, d R such that ca + db = r k+1. For example, r k+1 = r k 1 q k r k = r k 1 q k (r k 2 q k 1 r k 1 ) = q k r k 2 + (1 + q k q k 1 )r k 1 = q k r k 2 + (1 + q k q k 1 )(r k 3 q k 2 r k 2 ) = ca + db 11

12 Principal ideal domains We ve seen that Euclidean domains are P.I.D. s. At the end of section 8.1 of Dummit and Foote s book, there is a proof that the ring ( ) R = Z + Z 2 is a P.I.D. which is not Euclidean with respect to any norm. One way to determine that a ring R is not a P.I.D. is to use the following result: Theorem: Suppose R is a P.I.D.. Then every non-zero prime ideal of R is maximal. Example: The ring C[x, y] = A is not a P.I.D.. This is because the ideal P = Ax is prime, because A/P is isomorphic to the polynomial ring C[y], which is an integral domain. But P is not maximal, since it s property contained in the maximal ideal Ax + Ay. 12

13 Proof of the Theorem: Let P be a non-zero prime ideal. Then P = Ra for some 0 a R since R is a P.I.D.. Suppose P is not a maximal ideal. Then P is properly contained in some maximal ideal M. Write M = Rm for some m, again using that R is a P.I.D.. Then P = Ra M = Rm implies a = m m for some m R. If we can show m, m P, this will contradict the fact that P is prime and we ll be done. We have m P since P = Ra Rm = M. If m P then m = za for some z R, and a = m m = mza. But then a (1 mz) = 0 so a 0 implies 1 mz = 0 since R is an integral domain. But then m is a unit, so M = Rm = R, which is impossible since M is a maximal ideal. 13

14 Def: Supppose R is a commutative ring. A function N : R Z 0 is a Dedekind Hasse norm on R if for all a, b R, either a Rb or there is an element r Ra + Rb such that N(r) < N(b). Comment: Any Euclidean norm is a Dedekind Hasse norm. Theorem: R is a principal ideal domain if and only if it is an integral domain and has a Dedekind Hasse norm. 14

15 Proof: In one direction, suppose that R has a Dedekind Hasse norm N. Let A be any nonzero ideal of R. Let b be an element of A of minimal norm. We claim A = Rb. If not, there is an a A not in Rb. The property of D-H norms then says there is an element r Ra + Rb A with N(r) < N(b), contradicting the definition of b. We ll postpone proving the other part of the Theorem until after we ve discussed unique factorization domains. 15

16 Unique Factorization Domains Def: Suppose R is an integral domain. 1. An element r R is irreducible if r 0, r is not a unit, and whenever r = ab for some a, b R, one of a or b is a unit. 2. An element r R is called a prime element if Rr is a prime ideal. 3. If a, b R {0} and a = bu for some unit u R, say that a and b are associate. This defines an equivalence relation on R. Note: A non-zero prime element r is irreducible. This is because r = ab and Rr prime implies a Rr or b Rr. If a = ur for some u R, then a = ur = uab, so a(1 ub) = 0. But a 0 since r 0, so 1 ub = 0 and b is a unit. 16

17 Def: An integral domain R is a U.F.D. (unique factorization domain) if the following is true for each non-zero r R: 1. There are (possibly not distinct) irreducible elements p 1,, p n of R and a unit u R such that r = u n p i i=1 2. The factorization in (1) is unique up to rearranging the p i, replacing them by associate elements of R and replacing u by a different unit u. Example: Z is a U.F.D.. Each irreducible is a prime element; these have the form ±p. 17

18 Theorem: If R is a P.I.D. then it is a U.F.D.. Proof: We first have to show that each nonzero r R has a factorization into a finite product of irreducible elements. If r can t be written as a finite product of irreducibles, then there has to be a factorization r = st in which neither s or t are units. Furthermore one of s or t can t be written as a finite product of irreducibles. The ideal Rr is properly contained in each of Rs and Rt. For example, if Rr = R(st) = Rs, we would get s = stu for some u, and s(1 tu) = 0 would imply t is a unit, a contradiction. Let r 1 be an element of {s, t} which is not a finite product of irreducibles. Then Rr is properly contained in Rr 1. On replacing Rr by Rr 1 and continuing this argument, we produce an infinite chain of ideals Rr Rr 1 Rr 2 such that Rr i Rr i+1 for all i. 18

19 The ideal i Rr i is principal, since R is a P.I.D. Writing i Rr i = Rd for some d, we see that d Rr j for some j, But then Rr j+1 Rd Rr j a contradiction. So every r R can be written as a finite product of irreducibles. To prove the essential uniqueness of the factorization of r into irreducibles, suppose that r = up 1 p n = vq 1 q m (1) for some integers n, m 0 and some irreducibles p i and q j and some units u and v. We claim Rp 1 is a maximal ideal. If not, then Rp 1 is properly contained in M = Rm for some maximal ideal M and some m R. But then p 1 = mm and neither m nor m is a unit, so p 1 is not irreducible. We ve thus shown Rp 1 is maximal, and hence a prime ideal. 19

20 Now (1) shows q 1 q m Rr Rp 1 so one of the q i must be in Rp 1. Then p 1 divides q i for some i, but this implies p 1 and q i are associates since they are irreducible. Because R is an integral domain, we can then cancel p 1 and q i from the left and right sides of up 1 p n = vq 1 q m after adjusting the units u and v. We now continue by downward induction on n + m; this proves the essential uniqueness of factorizations into irreducibles. 20

Math 547, Exam 2 Information.

Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

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

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going

Example: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)

Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative

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

Part 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

Chapter 14: Divisibility and factorization

Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter

2. THE EUCLIDEAN ALGORITHM More ring essentials

2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there

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.

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

1. Factorization Divisibility in Z.

8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that

Lecture 7.5: Euclidean domains and algebraic integers

Lecture 7.5: Euclidean domains and algebraic integers Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley

Computations/Applications

Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x

Lecture 7.4: Divisibility and factorization

Lecture 7.4: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

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.

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

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. PIDs Definition 1 A principal ideal domain (PID) is an integral

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

Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)

Euclidean Domains. Kevin James

Suppose that R is an integral domain. Any function N : R N {0} with N(0) = 0 is a norm. If N(a) > 0, a R \ {0 R }, then N is called a positive norm. Suppose that R is an integral domain. Any function N

However another possibility is

19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS. In this handout we wish to describe some aspects of the theory of factorization.

ALGEBRA HANDOUT 2.3: FACTORIZATION IN INTEGRAL DOMAINS PETE L. CLARK In this handout we wish to describe some aspects of the theory of factorization. The first goal is to state what it means for an arbitrary

a + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:

5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.

Polynomial 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

NOTES ON SIMPLE NUMBER THEORY

NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,

MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it

Introduction Non-uniqueness of factorization in A[x]... 66

Abstract In this work, we study the factorization in A[x], where A is an Artinian local principal ideal ring (briefly SPIR), whose maximal ideal, (t), has nilpotency h: this is not a Unique Factorization

CHAPTER 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)

be 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

Part IX ( 45-47) Factorization

Part IX ( 45-47) Factorization Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 45 Unique Factorization Domain (UFD) Abstract We prove evey PID is an UFD. We also prove if D is a UFD,

(Rgs) Rings Math 683L (Summer 2003)

(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that

Math 547, Exam 1 Information.

Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)

LECTURE 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

Factorization 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,

Prime 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

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

Math 210B: Algebra, Homework 1

Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many non-associate irreducible polynomials. Recall that by Homework 9, Exercise 8 of

MATH FINAL EXAM REVIEW HINTS

MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any

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

9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.

RINGS: SUMMARY OF MATERIAL

RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered

Divisibility. Def: a divides b (denoted a b) if there exists an integer x such that b = ax. If a divides b we say that a is a divisor of b.

Divisibility Def: a divides b (denoted a b) if there exists an integer x such that b ax. If a divides b we say that a is a divisor of b. Thm: (Properties of Divisibility) 1 a b a bc 2 a b and b c a c 3

Homework 6 Solution. Math 113 Summer 2016.

Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x

1 Absolute values and discrete valuations

18.785 Number theory I Lecture #1 Fall 2015 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

Commutative Algebra and Algebraic Geometry. Robert Friedman

Commutative Algebra and Algebraic Geometry Robert Friedman August 1, 2006 2 Disclaimer: These are rough notes for a course on commutative algebra and algebraic geometry. I would appreciate all suggestions

A few exercises. 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in

A few exercises 1. Show that f(x) = x 4 x 2 +1 is irreducible in Q[x]. Find its irreducible factorization in F 2 [x]. solution. Since f(x) is a primitive polynomial in Z[x], by Gauss lemma it is enough

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

Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S

Total 100

Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4

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

Lecture 2 1. Noetherian and Artinian rings and modules Let A be a commutative ring with identity, A M a module, and φ : M N an A-linear map. Then ker φ = {m M : φ(m) = 0} is a submodule of M and im φ is

Factorization in Integral Domains II

Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and

12 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

NOTES ON INTEGERS. 1. Integers

NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).

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

PRACTICE PROBLEMS: SET 1

PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if

11. Finitely-generated modules

11. Finitely-generated modules 11.1 Free modules 11.2 Finitely-generated modules over domains 11.3 PIDs are UFDs 11.4 Structure theorem, again 11.5 Recovering the earlier structure theorem 11.6 Submodules

Section III.6. Factorization in Polynomial Rings

III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)

Local Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments

Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic

MTH310 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

1 Overview and revision

MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction

Selected Math 553 Homework Solutions

Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that

8. Prime Factorization and Primary Decompositions

70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings

A COURSE ON INTEGRAL DOMAINS

A COURSE ON INTEGRAL DOMAINS ALGEBRA II - SPRING 2004 Updated - March 3, 2004 1. The Fundamental Theorem of Arithmetic My son who is in the 4 th grade is learning about prime numbers and cancelling prime

Rings. Chapter Homomorphisms and ideals

Chapter 2 Rings This chapter should be at least in part a review of stuff you ve seen before. Roughly it is covered in Rotman chapter 3 and sections 6.1 and 6.2. You should *know* well all the material

x 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

Abstract 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

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty

Prof. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.

1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and

Additively Regular Rings and Marot Rings

Palestine Journal of Mathematics Vol. 5(Special Issue: 1) (2016), 90 99 Palestine Polytechnic University-PPU 2016 Additively Regular Rings and Marot Rings Thomas G. Lucas Communicated by Ayman Badawi MSC

Informal Notes on Algebra

Informal Notes on Algebra R. Boyer Contents 1 Rings 2 1.1 Examples and Definitions................................. 2 1.2 Integral Domains...................................... 3 1.3 Fields............................................

Notes for Math 345. Dan Singer Minnesota State University, Mankato. August 23, 2006

Notes for Math 345 Dan Singer Minnesota State University, Mankato August 23, 2006 Preliminaries 1. Read the To The Student section pp. xvi-xvii and the Thematic Table of Contents. 2. Read Appendix A: Logic

Homework 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

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

D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.

Finite Fields. Mike Reiter

1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

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,

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

x = π m (a 0 + a 1 π + a 2 π ) where a i R, a 0 = 0, m Z.

ALGEBRAIC NUMBER THEORY LECTURE 7 NOTES Material covered: Local fields, Hensel s lemma. Remark. The non-archimedean topology: Recall that if K is a field with a valuation, then it also is a metric space

36 Rings of fractions

36 Rings of fractions Recall. If R is a PID then R is a UFD. In particular Z is a UFD if F is a field then F[x] is a UFD. Goal. If R is a UFD then so is R[x]. Idea of proof. 1) Find an embedding R F where

University of Ottawa

University of Ottawa Department of Mathematics and Statistics MAT3143: Ring Theory Professor: Hadi Salmasian Final Exam April 21, 2015 Surname First Name Instructions: (a) You have 3 hours to complete

Integral Extensions. Chapter Integral Elements Definitions and Comments Lemma

Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients

Polynomial Rings : Linear Algebra Notes

Polynomial Rings : Linear Algebra Notes Satya Mandal September 27, 2005 1 Section 1: Basics Definition 1.1 A nonempty set R is said to be a ring if the following are satisfied: 1. R has two binary operations,

Polynomial 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

Chapter 1. Greatest common divisor. 1.1 The division theorem. In the beginning, there are the natural numbers 0, 1, 2, 3, 4,...,

Chapter 1 Greatest common divisor 1.1 The division theorem In the beginning, there are the natural numbers 0, 1, 2, 3, 4,..., which constitute the set N. Addition and multiplication are binary operations

Finitely Generated Modules over a PID, I

Finitely Generated Modules over a PID, I A will throughout be a fixed PID. We will develop the structure theory for finitely generated A-modules. Lemma 1 Any submodule M F of a free A-module is itself

Matlis reflexivity and change of rings

March 11, 2017 Matlis duality This is joint work with Doug Dailey. Let R be a semilocal ring with maximal ideals m 1,..., m t and J the Jacobson radical of R. Let E = E R (R/m 1 ) E R (R/m t ). Let ( )

MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

Rings and groups. Ya. Sysak

Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...

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

1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

MINKOWSKI THEORY AND THE CLASS NUMBER

MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the

Basic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series

Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony

Homework 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

ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman

International Electronic Journal of Algebra Volume 22 (2017) 133-146 DOI: 10.24330/ieja.325939 ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL

5: The Integers (An introduction to Number Theory)

c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset

Places of Number Fields and Function Fields MATH 681, Spring 2018

Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote

φ(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 =

CHAPTER 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

Solutions to Homework 1. All rings are commutative with identity!

Solutions to Homework 1. All rings are commutative with identity! (1) [4pts] Let R be a finite ring. Show that R = NZD(R). Proof. Let a NZD(R) and t a : R R the map defined by t a (r) = ar for all r R.

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

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime

Polynomial 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

0 Sets and Induction. Sets

0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

Lecture 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