RINGS OF ZERO-DIVISORS



Similar documents
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

Continued Fractions and the Euclidean Algorithm

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.

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

RINGS WITH A POLYNOMIAL IDENTITY

3. Prime and maximal ideals Definitions and Examples.

THE DIMENSION OF A VECTOR SPACE

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

NOTES ON LINEAR TRANSFORMATIONS

Mathematics Course 111: Algebra I Part IV: Vector Spaces

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

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

Quotient Rings and Field Extensions

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

it is easy to see that α = a

11 Ideals Revisiting Z

SMALL SKEW FIELDS CÉDRIC MILLIET

Factorization in Polynomial Rings

Matrix Representations of Linear Transformations and Changes of Coordinates

Commutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald

Unique Factorization

H/wk 13, Solutions to selected problems

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

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

Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Systems of Linear Equations

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

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 ]

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

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

LEARNING OBJECTIVES FOR THIS CHAPTER

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

1 Sets and Set Notation.

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

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

8 Divisibility and prime numbers

Notes on Algebraic Structures. Peter J. Cameron

Factoring of Prime Ideals in Extensions

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

Factoring Polynomials

MATH10040 Chapter 2: Prime and relatively prime numbers

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

How To Prove The Dirichlet Unit Theorem

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

26 Ideals and Quotient Rings

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

1 if 1 x 0 1 if 0 x 1

PYTHAGOREAN TRIPLES KEITH CONRAD

8 Primes and Modular Arithmetic

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

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

Prime Numbers and Irreducible Polynomials

ZORN S LEMMA AND SOME APPLICATIONS

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

6. Fields I. 1. Adjoining things

Chapter 13: Basic ring theory

Ideal Class Group and Units

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Algebraic Structures II

GROUPS ACTING ON A SET

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.

Math 4310 Handout - Quotient Vector Spaces

Section Inner Products and Norms

ADDITIVE GROUPS OF RINGS WITH IDENTITY

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

TOPIC 4: DERIVATIVES

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

Fundamentele Informatica II

Similarity and Diagonalization. Similar Matrices

Cartesian Products and Relations

LINEAR ALGEBRA W W L CHEN

3. Mathematical Induction

Finite dimensional C -algebras

Math 319 Problem Set #3 Solution 21 February 2002

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

CONTENTS 1. Peter Kahn. Spring 2007

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

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

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

The Mean Value Theorem

Practice with Proofs

The Ideal Class Group

Real Roots of Univariate Polynomials with Real Coefficients

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

Galois Theory III Splitting fields.

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

Lecture 3: Finding integer solutions to systems of linear equations

5. Linear algebra I: dimension

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

1 Local Brouwer degree

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

Group Theory. Contents

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

3 Factorisation into irreducibles

Transcription:

RINGS OF ZERO-DIVISORS P. M. COHN 1. Introduction. A well known theorem of algebra states that any integral domain can be embedded in a field. More generally [2, p. 39 ff. ], any commutative ring R with unit-element can be embedded in a ring 5 with the same unit-element as 7?, such that any element of S is either invertible or the product of an invertible element by a zero-divisor of 7?. The following statement can, in a very rough sense, be regarded as a "dual": Any commutative ring R with unit-element can be embedded in a ring S with the same unit-element as 7? such that every element of S is either a zero-divsor or an invertible element of 7?. This statement will be proved in 2 (Theorem 1) and as in the theorem quoted we have the corollary that any commutative ring with a unit-element 1, which has no invertible elements other than 1, can be embedded in a ring in which every element ^1 is a zerodivisor. We are thus led to consider commutative rings with unitelement 1, in which every element 9*1 is a zero-divisor. Such rings will be called O-rings for short. It is clear that every Boolean ring with a unit-element is an O-ring, and Theorem 1 shows without difficulty that G-rings exist which are not Boolean; this answers a question raised by Kaplansky.1 An O-ring may be regarded as an algebra over the field of two elements and thus is a special case of an O-algebra, viz. an algebra with unit-element over a field F in which every element not in F is a zero-divisor. Again any algebra with no invertible elements other than those of F can be embedded in an O-algebra, and some theorems on the structure of these algebras are proved in 3. In particular, any O-algebra R over a field F is a subdirect product of extension fields of F; the number of components is infinite unless 7? = F or R is Boolean. Moreover, in any representation of 7? as such a subdirect product, and for any element a of 7? and any equation (in one indeterminate) over F, there are infinitely many components of a satisfying this equation, unless a is a scalar or F is the field of two elements and a is idempotent. Nevertheless, (non-boolean) O-rings exist which are countable. It is also noted that any O-algebra, which is regular in the sense of von Neumann, is of dimension 1 or Boolean. Received by the editors March 14, 1958. 1 Communicated to the writer by M. P. Drazin. It was this question which gave rise to the present note. 909

910 P. M. COHN [December 2. The embedding theorem. Throughout this note, we take "ring" to mean "commutative ring with unit-element"; further, to say "P is a subring of R" is understood to mean "subring with the same unitelement," and similarly, to embed R in a ring 5 means to embed as a subring, i.e. with the same unit-element.2 The common unit-element will always be denoted by 1. These conventions apply in particular when R is an algebra over a field F, so that in this case F may be considered as a subalgebra of R. The result to be proved may now be stated as follows: Theorem I. Any ring R may be embedded in a ring S such that any element s of S is a zero-divisor unless ser and s has an inverse in R. If R is an algebra over a field F then S may also be taken to be an algebra over F. The essential step towards establishing this theorem is the proof of Lemma 1. Let R be any ring and a any element of R which has no inverse in R. Then there exists a ring R' containing R as a subring such that (i) R' contains an element a'7^0 satisfying aa' =0, (ii) any invertible element of R' belongs to R and is already invertible in R. Proof. Let R[x] be the ring of polynomials in an indeterminate x with coefficients in R. Since R has a 1, every proper ideal of R is contained in a maximal ideal. Now a has no inverse, therefore the principal ideal generated by a is proper and hence is contained in a maximal ideal, M say, of R. Let M' be the ideal of R[x] generated by the elements mx(mem). Then M' consists precisely of the elements mxu (mem, m 2c[x]), and it follows that (1) M' C\ R = 0, (2) x E M'. Equation (1) is clear, since an equation of the form b = mxu, b E R, m E M,uE R[x] implies b = 0, by a comparison of the terms of degree zero. To prove (2), let us suppose that xem', so that (3) x = mxu, where mem and u = uo+uxx+ +unxn (UiCR), say; by com- 2 This amounts to regarding the unit-element as 0-ary operator for the class of rings considered.

i958] RINGS OF ZERO-DIVISORS 911 paring the terms of degree 1 in (3) we obtain 1 =mu0, which contradicts the fact that M is proper. We now put R'=R[x]/M'. By (1), the natural homomorphism of R[x] onto R', when restricted to 7?, is one-one; we may therefore identify 7? with a subring of 7?'. If we write a' for the image of x under the natural homomorphism, then (2) shows that a' 9*0, while aa' = 0, because axem. It only remains to show that any invertible element of 7?' belongs to 7?. Let u' then be an element of 7?' with inverse v', so that u'v' = l. Going back to 7?[x], we find elements u, v mapping onto u', v' respectively, i.e. we have an equation of the form (4) uv = 1 + xmw w E R[x\. Let w= 52M»X*> v== y.fl.#'. w= y,w,:x\ where m,-, Vi, WiER- If u is of degree 0, then uer, and by comparing the terms independent of x in (4) we find that uvo = 1; thus u belongs to 7? and is invertible in 7?, and hence the same is true for u'. In what follows we may therefore suppose that u is of positive degree, r say. By symmetry, v may also be taken to have positive degree, s say. Now urxrem' whenever urem, and since we are only interested in the residue class of m (mod M'), we may assume utem. Similarly svs ik7 and since M is maximal, urv,em. Equating coefficients of xr+" in (4) we find UrVs = WWr+»-l M, a contradiction. This shows that all the invertible elements of 7?' belong to 7? and have their inverses in 7?, and the lemma is established. It is now easy to prove Theorem 1, using a Steinitz tower construction. Given any ring 7? and any aer which has no inverse we can by Lemma 1, embed 7? in a ring in which a becomes a zero-divisor, without increasing the set of invertible elements. By transfinite induction we can embed 7? in a ring 7?' without increasing the set of invertible elements, and such that every element of 7? which is not invertible becomes a zero-divisor in 7?'. Starting with Ra = R, we now define Rn inductively by the equation i?n+i=7^. In this way we obtain an ascending sequence of rings RCRiCRtC" The union S of these rings is again a ring; this ring contains 7? and by construction, every invertible element of 5 belongs to 7? and is invertible in 7?. Further, any element of 5 which is not invertible belongs to Rn lor some n, and hence is a zero-divisor in Rn+i; a fortiori it is a zero-divisor in 5, and this completes the proof of the theorem

912 P. M. COHN [December in the case of rings. If R is an algebra over a field F, all the rings occurring become algebras over F and the proof goes through unchanged. From the proof of Theorem 1 it is clear that 5 has the same cardinal as R or ft0, whichever is the greater. In particular, if R is countable, then so is 5. If in Theorem 1 we replace elements by finite subsets, we obtain the following generalization: Theorem 1'. Any ring R may be embedded in a ring S such that (i) S has no invertible elements other than those of R, (ii) every proper ideal of R generates a proper ideal of S and (iii) every finitely generated proper ideal of S has a nontrivial annihilator. Clearly this includes Theorem 1, since an element a- of 5 either generates a proper ideal, in which case it is a zero-divisor, by (iii), or it is invertible and then both a and its inverse belong to R, by (i). As we shall not have occasion to use Theorem 1', we omit the proof which is very similar to that of Theorem 1. 3. Algebras without nontrivial units and O-algebras. Let 2? be a ring in which no element ^1 is invertible. Since 1 necessarily has an inverse, we have 1 = 1, whence 2x = 0 for all xer- Therefore R can be regarded as an algebra over F = GF(2), the field of two elements, and R has no "units" other than the nonzero elements of F. More generally, we shall say that an algebra R over a field F has no nontrivial units if the only invertible elements of R are the nonzero elements of F.3 If moreover, all the elements of R except those in F are zero-divisors, we call R an O-algebra. From Theorem 1 and the remark following it we now obtain Theorem 1. Any algebra R over F without nontrivial units may be embedded in an O-algebra 5. If R is countable, so is S. Taking the groundfield to be GF(2), we obtain the Corollary. Any ring with no invertible elements other than 1 may be embedded in an O-ring, which is countable if the given ring was countable. Returning to algebras without nontrivial units, we have the following structure theorem. * We recall that R contains 1 and hence all the elements of F. The observation that the arguments as originally presented for the case i7=gf(2) carry over to the general case is due to the referee.

1958] RINGS OF ZERO-DIVISORS 913 Theorem 3. Let R be an algebra over F without nontrivial units. Then R is a subdirect product* of extension fields of F, and every element x of R which is not in F is transcendental over F, unless F = GF(2) and x is idempotent.6 If, moreover, R has finite dimension over F, then either R = F or R is a Boolean algebra. Proof. We begin by showing that /, the Jacobson radical of 7?, is zero. Let aej, then 1 +a has an inverse and so belongs to F, whence aef; this shows that JQF. But l J, so that J is a proper ideal in 7? and therefore also in F, whence 7 = 0. It follows6 that 7? is a subdirect product of fields which in our case are algebras over F, i.e. extension fields of F. If 7? is of finite dimension then the number of factors is finite and 7? is in this case a direct product of extension fields of F.7 Since R has no nontrivial units, this is possible only if (i) R F or (ii) F = GF(2) and 7? is the direct sum of a finite number of copies of F, i.e. if 7? is a Boolean algebra. This proves the last part; to complete the proof, we consider an element x of 7? which is algebraic over F. Then the subalgebra F[x] generated by x is finite-dimensional and has no nontrivial units, whence by the part just proved, either F[x] = F, i.e. xef, or F[x] is Boolean, in which case F = GF(2) and x2 = x, which is what we wished to show. It is clear that a Boolean algebra is an O-ring, since each x satisfies x(l x) =0. To obtain an O-ring which is not Boolean, we take a non- Boolean algebra over GF(2) without nontrivial units, e.g. the algebra of polynomials in a single variable over GF(2). By Theorem 2, Corollary, this algebra may be embedded in an G-ring, which is not Boolean since it contains elements which are not idempotent. Moreover it is countable. In a similar way we obtain for a general field F an O-algebra different from F and of cardinal max(ts0, card F). We note that an algebra R over F without nontrivial units which is regular8 either coincides with F or is Boolean. For by the regularity there exists for each a 7? an element x 7? such that xa^ = a. Hence (l+a(l-x))(l-xa(l-x))=l, so that l+a(l-x)=yef. Now a=y+ax 1, and multiplying by a we find that a2 =ya+ xa2 a =ya, which shows that a is algebraic over F; the result stated now follows from Theorem 3. 4 The term "product" is used here in the sense of Bourbaki. 6 I am indebted to the referee for the assertion about elements of R, which allows some of the later proofs to be shortened. «McCoy [1, p. 135]. 7 This follows from Theorem 32 of McCoy [l, p. 125]. 8 I.e., to every a i? there corresponds an xer satisfying axa a. M. P. Drazin has proved, somewhat more generally, that in any (not necessarily commutative) ring with 1 and no other invertible elements, every regular element is idempotent.

914 P. M. COHN From the proof of the last assertion of Theorem 3 we see that for an algebra over F without nontrivial units which is not equal to F itself or Boolean, any representation as a subdirect product must contain infinitely many factors. In the case of O-algebras we can say rather more. Theorem 4. Let R be any O-algebra over F, and a an element of R which is transcendental over F. Then in any representation of R as a subdirect product of fields and for any equation (5) /( = 0 of positive degree over F, there are infinitely many components of a satisfying (5). An O-algebra has no nontrivial units, so that R can be written as a subdirect product of fields, by Theorem 3. This shows that the assertion is never vacuous. To prove it, we consider first the special case /( ) =, i.e. we show that infinitely many components of a are zero. For if there is a transcendental element of R with only finitely many components equal to zero, let a (at) (iei) be such an element, with components a,-, where9 ax = a2 = = ak = 0, at f^ 0 (i^l, 2,, k). We may suppose a chosen so that k has its least value (k^o). Since a ( 2*", there exists ber, b^o, such that ab=0. This equation shows that for each iei either o, = 0 or >; = 0. In particular bi = 0 except possibly ior i = l,, k, and since b^o, some bi must be different from zero, which shows that k>0. Now the element a+b has fewer than k components equal to 0, since at+bi = 0 only if O; = &, = 0. By the hypothesis on k, a+b is algebraic over F; therefore either a+b=yef and ab=a2 ya = 0, or P = GF(2) and a+b is idempotent. But then each at (and each &,-) is either 0 or 1, so that we have a2 = a. In either case we have found an equation satisfied by a, which contradicts the fact that a was chosen transcendental. To complete the proof, suppose that a has only finitely many components satisfying (5). This means that f(a) has only finitely many components equal to zero, and by what has been proved,/(a) is algebraic over F, i.e. either/(a) =yef or f(a)2=f(a). In either case a is algebraic over F, and this establishes the theorem. References 1. N. H. McCoy, Rings and ideals, New York, 1948. 2. D. G. Northcott, Ideal theory, Cambridge, 1953. The University, Manchester, England 9 To save notation we suppose that the appropriate factors in the product have been indexed by the integers from 1 to k.