Solutions A ring A is called a Boolean ring if x 2 = x for all x A.

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

3. Prime and maximal ideals Definitions and Examples.

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

Commutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald

Chapter 13: Basic ring theory

it is easy to see that α = a

Matrix Representations of Linear Transformations and Changes of Coordinates

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

calculating the result modulo 3, as follows: p(0) = = 1 0,

1 Homework 1. [p 0 q i+j p i 1 q j+1 ] + [p i q j ] + [p i+1 q j p i+j q 0 ]

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

Quotient Rings and Field Extensions

Unique Factorization

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

MATH PROBLEMS, WITH SOLUTIONS

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Mathematics Course 111: Algebra I Part IV: Vector Spaces

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

3 Factorisation into irreducibles

Gröbner Bases and their Applications

University of Lille I PC first year list of exercises n 7. Review

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

PROBLEM SET 6: POLYNOMIALS

FIBER PRODUCTS AND ZARISKI SHEAVES

The Greatest Common Factor; Factoring by Grouping

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

Algebraic Geometry. Keerthi Madapusi

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

ZORN S LEMMA AND SOME APPLICATIONS

Factoring of Prime Ideals in Extensions

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

Polynomial Invariants

EXERCISES FOR THE COURSE MATH 570, FALL 2010

Introduction to Modern Algebra

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.

Factorization in Polynomial Rings

Factoring Trinomials: The ac Method

GROUP ALGEBRAS. ANDREI YAFAEV

ADDITIVE GROUPS OF RINGS WITH IDENTITY

Boolean Algebra Part 1

1. Prove that the empty set is a subset of every set.

MATH Fundamental Mathematics IV

SMALL SKEW FIELDS CÉDRIC MILLIET

fg = f g Ideals. An ideal of R is a nonempty k-subspace I R closed under multiplication by elements of R:

INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 16

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

26 Ideals and Quotient Rings

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

How To Prove The Dirichlet Unit Theorem

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

Mathematics Review for MS Finance Students

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

College Algebra - MAT 161 Page: 1 Copyright 2009 Killoran

Vector and Matrix Norms

Group Theory. Contents

Cartesian Products and Relations

Linear Equations in One Variable

MATH10040 Chapter 2: Prime and relatively prime numbers

Practice with Proofs

GROUPS ACTING ON A SET

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

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

ALGEBRA HW 5 CLAY SHONKWILER

T ( a i x i ) = a i T (x i ).

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Math 312 Homework 1 Solutions

Algebra I Vocabulary Cards

Notes on Algebraic Structures. Peter J. Cameron

1 Sets and Set Notation.

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

4.5 Linear Dependence and Linear Independence

Row Ideals and Fibers of Morphisms

RINGS OF ZERO-DIVISORS

Using the ac Method to Factor

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

minimal polyonomial Example

RINGS WITH A POLYNOMIAL IDENTITY

G = G 0 > G 1 > > G k = {e}

4. How many integers between 2004 and 4002 are perfect squares?

SOLUTIONS FOR PROBLEM SET 2

5. Linear algebra I: dimension

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

SOLVING POLYNOMIAL EQUATIONS

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES

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.

Introduction to Topology

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

LEARNING OBJECTIVES FOR THIS CHAPTER

Vector Spaces. Chapter R 2 through R n

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

SPECIAL PRODUCTS AND FACTORS

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

9 MATRICES AND TRANSFORMATIONS

Transcription:

1. A ring A is called a Boolean ring if x 2 = x for all x A. (a) Let E be a set and 2 E its power set. Show that a Boolean ring structure is defined on 2 E by setting AB = A B, and A + B = (A B c ) (B A c ) (superscript c denotes complementation). Solution: Easy. (b) Prove that every Boolean ring is commutative and such that x + x = 0 for all x A. (Hint. First consider (x + x) 2 and then (x + y) 2.) Solution: (x+x) = (x+x) 2 = x 2 +xx+xx+x 2 = x+x+x+x = (x+x)+(x+x). Hence, x + x = 0 for all x A. Now, (x + y) = (x + y) 2 = x 2 + xy + yx + y 2 = x + y + xy + yx. This implies that xy + yx = 0. But, yx = yx from what we just proved. Therefore, xy yx = 0 and hence xy = yx for all x, y A. (c) Prove that every Boolean ring is commutative and such that x + x = 0 for all x A. (Hint. First consider (x + x) 2 and then (x + y) 2.) Solution: (x+x) = (x+x) 2 = x 2 +xx+xx+x 2 = x+x+x+x = (x+x)+(x+x). Hence, x + x = 0 for all x A. Now, (x + y) = (x + y) 2 = x 2 + xy + yx + y 2 = x + y + xy + yx. This implies that xy + yx = 0. But, yx = yx from what we just proved. Therefore, xy yx = 0 and hence xy = yx for all x, y A. (d) Prove that if a Boolean ring contains no divisors of 0 it is either {0} or is isomorphic to Z/(2) (show that xy(x + y) = 0 for all x, y A). Deduce that in a Boolean ring every prime ideal is maximal. Solution: Since, A is Boolean it is commutative and x + x = 0 for all x A. Let x, y A be non-zero. Now, xy(x + y) = x 2 y + xy 2 = xy + xy = 0. Hence, either A has a divisor of zero or x + y = 0 for every non-zero x, y A. In the latter case, x = y = y and A can have only one non-zero element. Hence, A = Z/(2). If P A is a prime ideal. Then, A/P is also a Boolean ring with no zero divisors (because P is prime). But then, A/P = Z/(2) which is a field and hence P must be maximal. (e) Prove that in a Boolean ring every ideal I A is the intersection of the prime ideals containing I. Solution: Since x 2 = x for every x A, we have that x n = x for all n > 0. Hence, every ideal I of A is equal to its radical. Now apply the result of the previous problem. 2. Let A be a ring such that x 3 = x for all x A. The goal is to prove that A is commutative. (a) Show that 6A = {0} and that 2A and 3A are two-sided ideals such that 2A+3A = A and 2A 3A = {0}. Deduce that it can be assumed that either 2A = {0} or 1

3A = {0} (for the purpose of this problem). Solution: We have that (x + x) = (x + x) 3 = x 3 + 3x 2 x + 3xx 2 + x 3 = 8x. Hence, 6x = 0 for all x A. It is very easy to show that 2A and 3A are two-sided ideals. To show that 2A + 3A = A, consider any element x A. Now, 6x = 0. Hence, x = 5x = 5( x) = 2( x) + 3( x). To show that 2A 3A = {0}, consider any element x 2A 3A. Then, there exists a, b A such that x = 2a = 3b. But, then 3x = 6a = 2x = 6b = 0. Hence, x = 3x 2x = 0. In order to show that A is commutative we have to show that xy = yx for all x, y A. Suppose that x 2A, y 3A. Since, 2A, 3A are two-sided ideals xy, yx 2A 3A and hence both equal to 0. Therefore, we need only to consider products of the form xy with x, y 2A or x, y 3A. But, 2A is a sub-ring with x 3 = x for all x 2A and such that 3(2A) = 0. Similarly, 3A is a sub-ring with x 3 = x for all x 3A and such that 2(3A) = 0. Thus, if we prove commutativity of all rings with x 3 = x and 2A = 0 and the same with 3A = 0 then we are done. (b) If 2A = 0, calculate (1 + x) 3 to deduce that x 2 = x for all x A and conclude by means of the previous problem. Solution: (1 x) = (1 x) 3 = 1 3x + 3x 2 x 3 = 1 + (x + 2x) (x 2 + 2x 2 ) x. From which we get that, x x 2 = 0 or x = x 2. Now apply the result of the previous problem. (c) If 3A = {0}, calculate (x + y) 3 and (x y) 3 to show that x 2 y + xyx + yx 2 = 0. Now left multiply by x to deduce that xy yx = 0. Solution: (x + y) = (x + y) 3 = (x + y)(x 2 + xy + yx + y 2 ) = x 3 + x 2 y + xyx + xy 2 + yx 2 + yxy + y 2 x + y 3. Thus, x 2 y + xyx + xy 2 + yx 2 + yxy + y 2 x = 0. Similarly, (x y) = (x y) 3 = (x y)(x 2 xy yx + y 2 ) = x 3 x 2 y xyx + xy 2 yx 2 + yxy + y 2 x y 3, from which we get that, x 2 y xyx + xy 2 yx 2 + yxy + y 2 x = 0. Subtracting second from the first equation, we get 2(x 2 y + xyx + yx 2 ) = 0. Hence, x 2 y + xyx + yx 2 = 3(x 2 y + xyx + yx 2 ) 2(x 2 y + xyx + yx 2 ) = 0. Left multiplying by x we have that, x 3 y + x 2 yx + xyx 2 = xy + (x 2 y + xyx)x = 0. Now, x 2 y + xyx = yx 2. Substituting back we get that, xy yx 2 x == xy yx = 0. 3. Let A be a commutative ring. Recall that A is a local ring if it has a unique maximal ideal. Prove that the following is an alternative definition. A is local iff for every element a A either a or 1 + a is invertible. Solution: Let A be a local ring and let M be its unique maximal ideal. We first show 2

that x A is invertible iff x M. Let x M. If ax = 1 for some a A, it would imply that 1 M and thus M = A. This is impossible and hence x is not invertible. If x A \ M. We claim that in this case (x) = A and hence x is invertible. Suppose not. Consider the set S of ideals containing x but not equal to A partially ordered by inclusion. Then, S is non-empty and every chain has a maximal element. Then S has a maximal element by Zorn s lemma. This maximal element is a maximal ideal and by uniqueness has to be M. but then x M, a contradiction. Finally note that for any element a A, either a M and hence is invertible. Else, a M but in this case 1 + a M because otherwise 1 M. So in this case 1 + a is invertible. Now, let A be a commutative ring with the property that for every element a A either a or 1 + a is invertible. Let M be the subset of A consisting of all non-invertible elements. We claim that M is the unique maximal ideal and hence A is local. We first check that M is an ideal. If a, b M, then we claim a + b is also non-invertible. Assume otherwise, Then, there must exist c A such that (a + b)c = 1 and hence ac = 1 bc. But, b and hence bc is non-invertible. Therefore 1 bc must be invertible which would make a invertible - a contradiction. It is clear that M is the unique maximal ideal since for any other ideal N and x N, x M would imply that x is invertible and hence N = (1) = A. 4. Let k be a field and k[[x]] denote the ring of formal power series in x with coefficients in k. Show that k[[x]] is a local ring. What is its unique maximal ideal? (Hint. Use the result proved in the previous problem). Solution: The invertible elements of k[[x]] are exactly those with constant terms not equal to 0. Hence, its clear that for every element a A either a or 1 + a is invertible, making k[[x]] a local ring. The unique maximal ideal of k[[x]] consists of all the non-invertible elements, namely the elements with constant term 0. 5. Consider the following commutative diagram of A-modules and homomorphisms such that each row is exact. M 1 M 2 M 3 M 4 M 5 a b c d e N 1 N 2 N 3 N 4 N 5 Prove (by diagram chasing) that if a, b, d, e are isomorphisms then so is c. Solution: Let φ i (resp. ψ i ) for 1 i 4 be the horizontal homomorphisms M i M i+1 (resp. N i N i+1 ). We first show that c is injective. Let c(x 3 ) = 0 for some x 3 M 3. Then dφ(x 3 ) = 0 φ 3 (x 3 ) =, because d is an isomorphism. Hence, x 3 ker(φ 3 ) = Im(φ 2 ). Let x 2 M 2 3

be such that x 3 = φ 2 (x 2 ). But then, ψ 2 b(x 2 ) = 0 b(x 2 ) ker(ψ 2 ) = Im(ψ 1 ). Let y 1 N 1 be such that ψ 1 (y 1 ) = b(x 2 ). Since a is an isomorphism there exists x 1 M 1 such that y 1 = a(x 1 ) and ψ 1 a(x 1 ) = b(x 2 ) = bφ 1 (x 1 ). Since b is an isomorphism this implies that x 2 = φ 1 (x 1 ), and thus x 3 = φ 2 φ 1 (x 1 ) = 0. Next we show that c is surjective. Let y 3 N 3. Since d is surjective there exists x 4 M 4 such that ψ 3 (y 3 ) = d(x 4 ). Now, ψ 4 ψ 3 (y 3 ) = 0 = eφ 4 (x 4 ). Since e is injective this implies that x 4 ker(φ 4 ) = Im(φ 3 ). Let x 3 M 3 be such that x 4 = φ 3 (x 3 ). Then, dφ 3 (x 3 ) = ψ 3 c(x 3 ) = ψ 3 (y 3 ). Hence, c(x 3 ) y 3 ker(ψ 3 ) = Im(ψ 2 ). Let y 2 N 2 be such that ψ 2 (y 2 ) = c(x 3 ) y 3. There exists x 2 M 2 such that ψ 2 b(x 2 ) = c(x 3 ) y 3 = cφ 2 (x 2 ). But then, c(x 3 φ 2 (x 2 )) = y 3 showing that c is surjective. 6. Let k be a field. The ring k[x, y] can be viewed as a k-module, as a k[x]-module, as a k[y]-module, or as a k[x, y]-module. Illustrate the differences between these structures by providing non-trivial examples of maps from k[x, y] to itself which are: (a) k-module homomorphism but not a k[x], k[y], k[x, y]-module homomorphisms; Solution: Example: the homomorphism that sends f(x, y) to the polynomial f(y, x) is an example of such a homomorphism. (b) a k[x]-module homomorphism but not a k[y], k[x, y]-module homomorphisms; Solution: Example: the homomorphism that send f(x, y) to the polynomial f(x, y 2 ). (c) a ring homomorphism but not a k[x, y]-module homomorphism. Solution: The example in part (a). 7. Let A be a commutative ring and let X = SpecA. Recall that for each subset E of A, V (E) = {p X E p}. For each f A, let X f be the complement of V (f) in X. The sets X f are open in the Zariski topology. Show that, (a) the sets X f form a basis of open sets for the Zariski topology (that is every open set is a union of some of the sets X f ); Solution: An open set U is the complement of a closed set V (E). Now, V (E) = f E V f. Hence, U = f E X f. (b) X f X g = X fg ; Solution: By definition, X f = {p SpecA f p} and X g = {p SpecA g p}. Thus, X f X g = {p SpecA f p, g p}. Also, X fg = {p SpecA fg p}. Now, for prime ideals p, fg = p if and only if f p, g p. Hence, X f X g = X fg. (c) X f = iff f is nilpotent; Solution: X f = implies that f p for every p SpecA. This, implies that f p SpecA = nilradical(a). Hence, f is nilpotent. Converesely, if f is nilpotent then it is contained in every prime ideal of A and hence X f is empty. (d) X f = X iff f is a unit; Solution: X f = X implies that f is not contained in any prime ideal of f. But, 4

then (f) = (1), otherwise the maximal ideal containing (f) would be proper, prime and would contain f. Conversely, if (f) = (1) then f cannot be contained in any prime ideal as otherwise that prime ideal would have to contain 1. (e) X f = X g iff (f) = (g); Solution: Suppose X f = X g. Now, (f) is the intersection of all prime ideals containing (f) and equals p Vf p. Similarly, (g) is the intersection of all prime ideals containing (g) and equals p Vg p. But X f = X g implies that V f = V g and hence, (f) = (g). Conversely, suppose that (f) = (g). If p X f then f p. Suppose that g p. Then, p contains (g) = (f), and hence, f p, a contradiction. Hence, g p and hence, p X g. Thus, X f X g and hence X f = X g. (f) X is quasi-compact (that is every open covering of X has a finite subcovering). Solution: By part (a) it suffices to consider open covers using sets of the form X f. Suppose that X = α A X fα. Consider the ideal I generated by (f α ) α A. Now, if I (1) then there would exist a proper maximal ideal p containing I, and p would be prime. But, then f α p for every α A, and hence, p X fα for every α A, Thus, p α A X fα, which is a contradiction. Thus, I = (1). Therefore, 1 = i I f ig i, for some finite subset I A. We claim that X = i I X fi. Let p be a prime ideal. Suppose f i p for every i I. Then, 1 p a contradiction. Hence, p f i for some i I, and p X fi. This shows that indeed X = i I X fi. 5