Ring Theory Volume I
This is volume 127 in PURE AND APPLIED MATHEMATICS H. Bass and S. Eilenberg, editors A list of titles in this series appears at the end of this volume.
Ring Theory Volume I
Louis H. Rowen Department of Mathematics and Computer Science Bar IIan University Ramat Can, Israel
ACADEMIC PRESS, INC. Harcourt Brace Jovanovich, Publishers
Boston San Diego New York Berkeley London Sydney Tokyo Toronto
Copyright 0 1988 by Academic Press, Inc. All rights reserved. No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher.
ACADEMIC PRESS, INC. 1250 Sixth Avenue, San Diego, CA 92101
United Kingdom Edition published by
ACADEMIC PRESS, INC. (LONDON) LTD. 24-28 Oval Road, London NW1 7DX
Library of Congress Cataloging-in-Publication Data Rowen, Louis Halle. Ring theory. (Pure and applied mathematics; v. 127-128) Includes bibliographies and indexes. 1. Rings (Algebra) I. Title. 11. Series: Pure and applied mathematics (Academic Press) ; 127-128. 87-14536 QA3.P8 VOI. 127-128 510 s [512’.4] CQA2471 ISBN 0-12-599841-4 (v. 1) ISBN 0-12-599842-2(v. 2)
88899091 9 8 7 6 5 4 3 2 1 Printed in the United States of America
Contents ...
Foreword
Xlll
Introduction: An Overview of Ring Theory
xvii
Table of Principal Notation
xxiii
Chapter 0 General Fundamentals 0.0 Preliminary Foundations Monoids and Groups Rings and Modules Algebras Preorders and Posets Upper and Lower Bounds Lattices Modular Lattices Zorn’s Lemma Well-ordered Sets and Transfinite Induction Fields First Order Logic
1 1 2 5 6 6 7 8 10 11 12 12
0.1 Categories of Rings and Modules Monics and Epics Functors
13 15 16
0.2 Finitely Generated Modules, Simple Modules, and Noetherian and Artinian Modules Finitely Generated Modules
18 18
V
Contents
vi
Cyclic Modules Simple Rings and Modules Chain Conditions Noetherian and Artinian Modules 0.3 Abstract Dependence Algebraic and Transcendental Elements
19 19 21 22 23 25
Exercises
26
Chapter 1 Construction of Rings 1.1
Matrix Rings and Idempotents Matrices and Matrix Units Subrings of Matrix Rings Matrices Whose Entries Are Not Necessarily in Rings Idempotents and the Peirce Decomposition Idempotents and Simple Modules Primitive Idempotents Lifting Matrix Units and Idempotents
29 29 32 33 35 37 39 39
1.2 Polynomial Rings Monoid Rings Polynomial Rings Rings of Formal Power Series and of Laurent Series Digression: More General Constructions A Supplement: Ordered Groups
42 42 43 48 51 51
1.3 Free Modules and Rings Free Modules Independent Modules and Direct Sums Modules Over Division Rings Are Free Free Objects Free Rings and Algebras Free Commutative Ring Diagrams Universals Invariant Base Number Weakly Finite Rings A Supplement: The Free Group
53 54 54 55
1.4 Products and Sums Direct Products and Direct Sums
66 66
56
57 59 60 60 61 63 64
vii
Contents
Exact Sequences Split Exact Sequences Reduced Products Ultraproducts Products and Coproducts B Supplement: Free Products and Amalgamated Sums C Supplement: Categorical Properties of Modules: Abelian Categories 1.5
Endomorphism Rings and the Regular Representation Endomorphism Rings Endomorphisms as Matrices The Dual Base Adjunction of 1
67 68 69 71 73 76 78 81 81 84 86 87
1.6 Automorphisms, Derivations, and Skew Polynomial Rings Automorphisms Derivations, Commutators, and Lie Algebras Skew Polynomial Rings and Ore Extensions Principal Left Ideal Domains (PLID’s) Skew Polynomial Rings (Without Derivation) Over Fields Differential Polynomial Rings Over Fields The Weyl Algebra Skew Power Series and Skew Laurent Series Skew Group Rings
88 88 89 92 93 96 97 98 100 101
1.7 Tensor Products Tensor Products of Bimodules and of Algebras Properties of the Tensor Operation Tensors and Centralizing Extensions Tensor Products Over Fields Tensor Products and Bimodules
101 103 105 106 108 110
1.8 Direct Limits and Inverse Limits Direct Limits D Supplement: Projective Limits The Completion
111 112 115 116
1.9 Graded Rings and Modules Tensor Rings B Supplement: Constructing Free Products
118 121 124
viii
Contents
1.10 Central Localization (also, cf. 92.12.9ff.) Structure Passing From R to S-’R Examples of Central Localization Central Localization of Modules
129 132 134 134
Exercises
137
Chapter 2 Basic Structure Theory 2.1 Primitive Rings Jacobson’s Density Theorem Prime Rings and Minimal Left Ideals Finite-Ranked Transformations and the Socle Examples of Primitive Rings E Supplement: A Right Primitive Ring Which Is Not Primitive
150 151 153 154 158 159
2.2 The Chinese Remainder Theorem and Subdirect Products Subdirect Products Semiprime Rings
162 163 164
2.3 Modules with Composition Series and Artinian Rings The Jordan-Holder and Schreier Theorems Artinian Rings Split Semisimple Artinian Algebras Central Simple Algebras and Splitting Zariski Topology (for Finite Dimensional Algebras)
165 165 167 171 173 174
2.4 Completely Reducible Modules and the Socle
176
2.5 The Jacobson Radical Quasi-Invertibility Examples Idempotents and the Jacobson Radical Weak Nullstellensatz and the Jacobson Radical The Structure Theoretical Approach to Rings “Nakayama’s Lemma” The Radical of a Module F Supplement: Finer Results Concerning the Jacobson Radical Wedderburn’s Principal Theorem F Supplement: Amitsur’s Theorem and Graded Rings F Supplement:The Jacobson Radical of a Rng Galois Theory of Rings
179 180 182 183 184 186 188 189 189 192 194
196 198
Contents
ix
2.6 Nilradicals Reduced Rings Nilpotent Ideals and Nilradicals The Nilradical of Noetherian Rings Bounded Index Derivations and Nilradicals Nil Subsets G Supplement: Koethe’s Conjecture
199 20 1 202 205 206 207 207 209
2.7 Semiprimary Rings and Their Generalizations Chain Conditions on Principal Left Ideals Passing from R to eRe and Back Semiperfect Rings Structure of Idempotents of Rings H Supplement: Perfect Rings G Supplement: Left x-Regular Rings
21 1 212 215 217 219 22 1 224
2.8 Projective Modules (An Introduction) Projective Modules Projective Versus Free Hereditary Rings Dual Basis Lemma Flat Modules Schanuel’s Lemma and Finitely Presented Modules H Supplement: Projective Covers Categorical Description of Projective Covers
225 225 227 228 229 230 232 233 236
2.9 Indecomposable Modules and LE-Modules The Krull-Schmidt Decomposition Uniqueness of the Krull-Schmidt Decomposition Applications of the Krull-Schmidt Theorem to Semiperfect Rings Decompositions of Modules Over Noetherian Rings I Supplement: Levy’s Counterexample C Supplement: Representation Theory The Brauer-Thrall Conjectures Quivers and f.r.t. The Multiplicative Basis Theorem and the Classification Problem The Categorical Language
237 238 240 242 244 245 249 25 1 259 260 26 1
X
Contents
2.10 Injective Modules Divisible Modules Essential Extensions and the Injective Hull Criteria for Injectivity and Projectivity J Supplement: Krull-Schmidt Theory for Injective Modules
26 1 263 266 26 8
2.11 Exact Functors Flat Modules and Injectives Regular Rings Faithfully Flat Modules
270 273 276 278
2.12 The Prime Spectrum Localization and the Prime Spectrum Localizing at Central Prime Ideals The Rank of a Projective Module K Supplement: Hilbert’s Nullstellensatz and Generic Flatness Comparing Prime Ideals of Related Rings LO and the Prime Radical Height of Prime Ideals
280 282 283 285
2.13 Rings with Involution The Category of Rings with Involution Involutions of Rings with Minimal Left Ideals Simple Rings with Involution (*)-Radical and (*)-Semiprime
296 299 30 1 304 306
Exercises
308
269
286 29 1 294 296
Chapter 3 Rings of Fractions and Embedding Theorems 3.1 Classical Rings of Fractions Properties of Fractions Localizations of Modules
348 352 355
3.2 Goldie’s Theorems and Orders in Artinian Quotient Rings Annihilators ACC (Ann) Goldie Rings Goldie Rank and Uniform Dimension
356 356 357 358 36 1
xi
Contents
Annihilator Ideals in Semiprime Rings Digression: Orders in Semilocal Rings Embedding of Rings Universal Sentences and Embeddings Embeddings into Primitive and Semiprimitive Rings L Supplement: Embeddings into Matrix Rings L Supplement: Embedding into Division Rings L Supplement: Embedding into Artinian Rings Existentially Closed Rings
363 367 368 368 369 37 1 372 3 74 377
3.3 Localization of Nonsingular Rings and Their Modules Johnson’s Ring of Quotients of a Nonsingular Ring The Injective Hull of a Nonsingular Module Carrying Structure of R to ff
377 378 380 382
3.4 Noncommutative Localization Digression: The Maximal Ring of Quotients The Martindale-Amitsur Ring of Quotients INC Revisited C Supplement: Idempotent Filters and Serre Categories
3 84 385 386 389 39 1
3.5 Left Noetherian Rings 394 Constructing Left Noetherian Rings 395 The Reduced Rank 396 The Principal Ideal Theorem 399 Heights of Prime Ideals 400 Digression: Decomposition Theorems of Noetherian Rings 40 1 Artinian Properties of Noetherian Rings: Prelude to Jacobson’s Conjecture 403 Jacobson’s Conjecture 405 D Supplement: Noetherian Completion of a Ring 409 Krull Dimension for Noncommutative Left Noetherian Rings 414 Other Krull Dimensions 418 Critical Submodules 420 M Supplement: Basic Dimension 42 1 M Supplement: The Noncommutative Forster-Swan Theorem 425 J Supplement: Jategaonkar Theory 433 N Supplement: Gabriel Dimension 44 1 Exercises
443
Contents
XU
Chapter 4 Categorical Aspects of Module Theory 4.1 The Morita Theorems Categorical Notions Digression: Two Examples Morita Contexts and Morita’s Theorems Proof of Morita’s Theorem and Applications Digression: Simple Noetherian Rings
467 469 470 47 1 475 476
4.2 Adjoints Adjoint Pairs and Universals
477 479
Exercises
48 1
Appendix A. The Proof of Magnus’ Theorem and the Magnus-Witt Theorem (Theorem 1.3.38) Exercise
485
Appendix B. Normed Algebras and Banach Algebras
490
Exercises
493
The Basic Ring-Theoretic Notions and Their Characterizations
495
Major Ring- and Module-Theoretic Results Proved in Volume I (Theorems and Counterexamples; also cf. “Characterizations”)
499
References
507
Bibliography of Books Collections of Papers Bibliography of Articles Subject Index
490
507 510 512 531
Foreword (Obligatory) The theory of rings originally developed as a collection of brilliant insights for proving and improving diverse theorems in algebra, by extracting the essence of the theorems divested of superfluous hypotheses. This approach was startlingly successful and led to the search for solutions from “first principles”; moreover, there was a unifying structure theory due principally to Jacobson, and his book Structure of Rings (1956, rev. 1964) remains one of the principal references in the literature. (The other classic references are Herstein’s Carus Monograph Noncommutative Rings and, for the homological point of view, Cartan- Eilenberg’s book Homological Algebra.) However, as more and more “elementary” proofs found their way into the folklore, the structure of rings began to resemble a tower of Babel, where ring theorists speak such diverse languages (ring theory, module theory, category theory, etc.) that at times we cannot communicate effectively with one another. In the last few years there have been many very successful books in special topics, which are sometimes used as texts, notably Passman’s book The Algebraic Structure of Group Rings. However, any specialized book necessarily presents the subject vertically rather than horizontally; i.e., the selection of topics and proofs reflects the particular needs of the subject area instead of the broader picture, and the reader must often plow through technical results in order to arrive at theorems of more general interest. On the other hand, the basic theorems are often proved in an almost offhand fashion, to leave space for the author’s main objective. For example, any book concerned with finite dimensional algebras must deal with the Wedderburn- Artin theorem, that any finite dimensional simple algebra is isomorphic to a ring of matrices over a division algebra. One of several short, direct proofs is presented, although the reader thereby loses the opportunity of seeing Wedderburn’s theorem in one
xiii
xiv
Foreword
of two important broader contexts-the Jacobson structure theory and/or the Morita theory. The principal object of these two volumes is to present the mainstream of ring theory, being a source both of results and of proofs. The first volume deals with general structural results and could serve as an introductory text; the second focuses on the classes of rings that have occupied most attention in the literature. On the other hand, efforts were made to hold the material to readable size, leading to the following hierarchy: Main Text Supplementary material Appendices Exercises Digressions Chapter 1 deals mostly with constructions needed throughout the text but might well be skipped and referred to as needed. Thus a graduate course should probably start with Chapter 2, the structure theory (of both rings and modules), which is relatively easy to assimilate and lies at the heart of ring theory. From there one might proceed to Sections 3.1 and 3.2, in order to cover Goldie’s Theorem; then one might read Section 4.1 for Morita’s theorems. Parts which are needed less frequently are designated as “Supplements” and could be skipped on the first reading. In this manner one could progress quite far even in the first 150 pages of reading. The supplements are designed as a means of continuing a specific thread throughout the text. Thus “A Supplement” deals with ordered groups and their uses in ring theory, and occurs in &1.2,1.3; “B Supplement,”dealing with free products, occurs in R1.4,1.9. The two appendices are akin to supplements,but are put off until the end, in order not to disrupt the flow of the text. The exercises are designed as a secondary extension of the text, and often their “hints” are virtually complete proofs. One aim of the exercises is to present interesting theorems (such as the Popescu-Gabriel theorem) which, although important, are not needed later in the text proper. With one exception (Bass’ theorem on “big” projective modules in $5.1, which uses Kaplansky’s theorem that non-f.g. projective modules over a local ring are free), I do not know of any result in the text whose proof relies on an exercise. Also appearing as exercises are several interesting examples dispersed throughout the literature (many due to G. Bergman), so the reader is urged at least to peruse the exercises.
Foreword
xv
Parts of the text are labeled as “digressions.” These are paragraphs that do not bear directly on the remainder of the text and often are given scant explanation, in order not to distract the reader from the intended thrust of the exposition. The larger digressions point to a major area of recent interest. The shorter digressions are asides. Notwithstanding these various attempts to hold down the size of the main text, several worthy subjects have been slighted. The original intention was to give a fairly detailed account of the representation theory of Artin algebras, but lack of space required it to be shrunk to the rather meager sketch at the end of Section 2.9. Other areas have been similarly misrepresented. In contrast to the fundamental aspect of Volume I, the goal of Volume I1 is to give the flavor of the subjects of current research, although in most areas the results fall a few years behind latest work. The reader should also take note of the various indices, which are intended in part as aids to help organize the material. The issue of acknowledgments is very delicate, since so many people have graciously aided me in this project. Ami Braun, P. M. Cohn, Marie-Paule Malliavin, and Jean-Pierre Tignol have spotted many flaws in earlier versions of the manuscript. Bill Blair gave instrumental advice in bringing Volume I to final form. On the other hand, I am always indebted to my mentor Nathan Jacobson, as well as to S. A. Amitsur. Other colleagues and friends who provided useful help and advice include Ephraim Armendariz, Maurice Auslander, Miriam Cohen, S. Dahari, Dan Farkas, Ed Formanek, Larry Levy, John McConnell, Chris Robson, Shmuel Rosset, David Saltman, Lance Small, and Robert Snider. Thanks are also due to Tony Joseph and Rudolf Rentschler for pointing out the highlights of the theory of enveloping algebra. Small’s excellent compilations of reviews (Reoiews in Ring Theory, Amer. Math. SOC.(1980, 1984)) have been an invaluable tool. Finally, I would like to thank Klaus Peters of Academic Press for his efforts in bringing the work to fruition.
This Page Intentionally Left Blank
Introduction: An Overview of Ring Theory
In the solar system of ring theory the Sun is certainly the semisimple Artinian ring, which can be defined most quickly as a finite direct product of matrix rings over division rings. Much of ring theory is involved in measuring how far a ring is from being semisimple Artinian, and we shall describe the principal techniques. The numbers in parentheses refer to locations in these two volumes.
The Structure Theory of Rings Any simple ring (with 1)having minimal nonzero left ideal is of the form M,,(D), by the celebrated result known as the Wedderburn- Artin theorem (2.1.25’). The general structure theory begins with Jacobson’s density theorem (2.1.6), which generalizes the essence of the Wedderburn- Artin theorem to the class of prirnitioe rings; using subdirect products (52.2) one can then pass to semiprimitive rings. The passage from semiprimitive rings to arbitrary rings leads one to the study of various radicals, which are intrinsically-defined ideals which when 0 make the ring much easier to analyze. Thus the radical is the “obstruction” in the structure theory. In the general structure theory there are several radicals, which we consider in order of decreasing size. The biggest, the Jacobson radical (52.5) denoted Jac(R), is 0 iff the ring is semiprimitive. Since Jac(R) is often nonzero, one
xvii
xviii
Introduction
considers various nilradicals (#2.6), so called because their elements are nilpotent. The largest nilradical is called the upper nilradical Nil(R) and the smallest nilradical is called the prime radical or lower nilradical and is the intersection of the prime ideals; a ring is semiprime iff its lower nilradical is 0. Even in the classical case of finite dimensional algebras over fields (for which semiprimitive rings become semisimple Artinian (42.3) and for which the radicals all coincide), the structure of the radical itself is extremely complicated; often the radical is considered an encumbrance to be removed as soon as possible. Thus the various structure theorems which enable us to “shrink” the radical take on special significance; most prominent is Amitsur’s theorem (2.5.23), which says that if Nil(R) = 0 then Jac(R[A]) = 0, where A is a commuting indeterminate over R. Other such results are considered in 42.6. Certain classes of rings are particularly amenable to the structure theory. If a ring R is Artinian then Jac(R) is nilpotent and R/Jac(R) is semisimple Artinian; furthermore, one can “lift” the idempotents from R/Jac(R) to R to obtain more explicit information about R ($2.7). There are other instances when Jac(R) is nil (42.5). One of the principal classes of noncommutative rings is Noetherian rings (43.5), for which Nil(R) is nilpotent. Fortunately for semiprime Noetherian rings one has Goldie’s theorem (43.2), which shows that the classical ring of fractions exists and is semisimple Artinian; this result makes available the Wedderburn- Artin theorem and thereby rounds out the WedderburnArtin-Noether-Jacobson-Levitzki-Amitsur-Goldie structure theory. Goldie’s theorem also applies to prime rings with polynomial identities (Chapter 6). Rings of fractions have been generalized to rather broad classes of rings, as described in Chapter 3. Since the structure theory revolves around primitive and prime rings, one is interested in the set of primitive ideals (of a ring) and the set of prime ideals. These sets are called the primitiue and prime spectra and have a geometry of considerable interest (42.12).Recent research has focused on the primitive and prime spectra of certain classes of rings. Since any ring is a homomorphic image of a free ring, the Cohn- Bergman school has conducted research in studying free rings in their own right. Such a project is of immense difficulty, for the very reason that the theory of free rings necessarily includes all of ring theory. Occasionally one wants to consider an extra bit of structure for a ring, the inuolution (42.13),which generalizes the transpose of matrices. The structure theory carries over fairly straightforwardly to rings with involution, with involutory analogues of the various structural notions.
Introduction
xix
The Structure Theory of Modules Semisimple Artinian rings are also characterized by the property that every module is a direct sum of simple modules (2.4.9), and, furthermore, there are only a finite number of isomorphism classes of simple modules (2.3.13). This raises the hope of studying a ring in terms of its modules, and also of studying a module in terms of simple modules. The “best” modules to study in this sense are Artinian Noetherian modules, for they have composition series ($2.3), and these are essentially “unique.” Unfortunately there is no obvious way of building a module from its simple submodules and homomorphic images, so one turns to building modules as direct sums of indecomposable modules, thereby leading us to the “Krull-Schmidt” theorem (2.9.17), which says that every module with composition series can be written “uniquely” as a direct sum of indecomposables. Unfortunately this leaves us with determining the indecomposables (52.9), which is a tremendous project even for Artinian rings and which largely falls outside the scope of this book. Thus one is led to try more devious methods of studying modules in terms of simple modules, such as the noncommutative Krull and Gabriel dimensions (53.5). The Krull dimension has become an indispensible tool in the study of Noetherian rings.
Category Theory and Homology When studying rings in terms of their modules, one soon is led to categories of modules and must face the question of when two rings have equivalent categories of modules. Fortunately there is a completely satisfactory answer of Morita (54.1). Every module is a homomorphic image of a free module, and perhaps one could learn more about modules by studying free modules. It turns out that a more natural notion from the categorical point of view is projective module (52.8), and indeed a ring R is semisimple Artinian iff every module is projective (2.11.7). The interplay between projective and free is very important, leading to the rank of a projective module (2.12.19) and the K O theory (55.1). The path of projective modules can take us to projective resolutions and homological dimension of modules (g5.1, 5.2). Homological dimension is most naturally described in terms of category theory, which lends itself to dualization; thus one also gets injective modules (52.10), which also play an important role in the more general theories of fractions (@3.3,3.4).Homology (and cohomology) lay emphasis on two important functors, YU,~ and &xt, which are derived respectively from the tensor functor and from the functor Xom. These latter two functors are an example of an adjoint pair (4.2).
xx
Introduction
Special Classes of Rings (Mostly Volume 11) Certain classes of rings are of special interest and merit intensive research. Classically the most important are finite dimensional algebras over a field; these fall inside the theory of Artinian rings, but much more can be said. The role of the radical is made explicit by Wedderburn’s principal theorem (2.5.37) when the base field is perfect; Wedderburn’s result has been recast into the cohomology of algebras (45.3). Much of the theory of finite dimensional algebras carries over to the more general realm of rings with polynomial identities (PI-rings, chapter 6). Deep results of representation theory can be obtained using the PI-theory by means of elementary arguments. Moreover, PI-theory is not tied to a base field, and so various generic techniques are available to enrich the PI-theory; relatively free PI-algebras have commanded considerable attention. It turns out that there is just enough commutatively in the PI-theory to enable one to obtain a satisfactory version of much of the theory of commutative algebras and, indeed, to build a noncommutative algebraic geometry (which however lies largely outside the realm of this book). In a different direction, commutative algebraic geometry leads us to consider a@ne algebras over a field, by definition finitely generated as algebras. Although not much can be said about affine algebras in general, affine algebras become more manageable when they have finite Gevand- Kirillov dimension (46.2); in particular, affine PI-algebras have finite Gelfand-Kirillov dimension and are a very successful arena for generalizing results from the commutative theory. Returning to the Wedderburn- Artin theorem, a very natural question is, “What can be said about the division ring D in M,(D)?” This remains one of the more troublesome questions of research today, because tantalizingly little is known about arbitrary division rings. When D is finite dimensional over a field however, a whole world opens up, comprising the theory of (finite dimensional) central simple algebras and the Brauer group (Chapter 7). Much recent research on division algebras is from the standpoint of noncommutative arithmetic and K-theory, but we deal mostly with the general structure theory of division algebras. Most of the exposition is given to understanding the algebraic content of several special cases of the amazing MerkurjevSuslin theorem. Our final chapter (8) is about those rings which arise most in representation theory, namely, group rings and enveloping algebras of Lie algebras. These rings in fact contain all the information of the respective representation theories, and therefore provide a key link from “pure” ring theory to the
Introduction
xxi
outside world. Both areas naturally lie on the border of algebra, drawing also on analysis and geometry. Nevertheless, the ring theory provides a guide to directions of inquiry; the question of central interest in enveloping algebra theory has been to determine the primitive ideals, for these correspond to the irreducible representations. Pure ring theory also yields a surprising amount of information, and much of the theory can be cast in the general framework of Noetherian rings (58.4).(The structural foundation is laid in 92.12.) Another topic in modern research is the Galois theory of rings. Jacobson developed a Galois theory to study extensions of division rings, in a similar manner to the Galois theory of extensions of fields. This has led to the study of fixed subrings under groups of automorphisms (end of 52.5), and more recently to Hopf algebras, which are treated in $8.4 as a simultaneous generalization of group rings, enveloping algebras, and algebraic groups. A word about current research-whereas the 1960s and early 1970s was the era of abstraction and beautiful general theories, the late 1970s and 1980s have displayed a decided return to specific examples. Thus considerable recent attention has turned to Weyl algebras and, more generally, rings of differential polynomials, and the theory of the enveloping algebra of sI(2, n) has produced many interesting examples and a few surprises.
This Page Intentionally Left Blank
Table of Principal Notation Note: ! after page reference means the symbol is used differently in another part of the text.
1 l! 2 3 3 3 4 4 5 5 6 6 6 14 14 14 16 16 16 17 18
18! 19 19 22 29 29 30 32 43 43 44 44 48 51 51 53! 55 55 56 59 66
xxiii
Table of Principal Notation
67 67 70 73! 74 77 82 93 93 97 98 100 101! 103 104 112 112 115 117! 119 121 121 123 124 129! 129! 134
273 280 280 292 292 296 297 299 300 306 349 355 356 378 379! 388! 393 396 402 409 409!
41 1 41 5 42 1 424 425 426 421 429 442 47 1 471! 478 477! 49 1
0
General Fundamentals
50 Preliminary Foundations The object of this section is to review basic material, including the fundamental results from ring theory. The proofs are sketched, since they can be found in the standard texts on abstract algebra, such as Jacobson [SSB]. Two important conventions: N denotes the natural numbers including 0; also, given a function f:A + B we shall often use fa instead of the more standard notation f(a), and similarly fA denotes {fa:a E A}. Given sets A, I define A' = {functions f:I -,A}, which can be identified with the Cartesian product n { A :i E I } . A special case is I = { 1,. . .,n } ; in this case we denote A' as A("), which can be identified with A x x A (taken n times) under the bijection sendingf to ( f l , ...,fn ).
Monoids and Groups A monoid is a semigroup S which has a unit element 1, such that 1s = sl = s for each s in S. If a semigroup S lacks a unit element we can adjoin a formal element 1 to produce a monoid S' = S u { l } by stipulating 1s = sl = s for all s in S. In verifying that a monoid S is a group, one need only check that each element is left invertible, i.e., for each s there is s' such that s's = 1. (Indeed,
1
General Fundamentals
2
take a left inverse s" of s'. Then s" = ~"(s's)= (s"s')s = s proving ss' = 1 and s' is also the right inverse of s, i.e., s' = s-'.) Sym(n) denotes the group of permutations, i.e., of 1: 1 functions from { 1,. ..,n} to itself; Sym(n)is a submonoid of A A where A = { 1,. . .,n } . Although we have used the multiplicative notation for groups, we shall usually write abelian groups additively, with + for the group operation, 0 for the unit element, and - g for the inverse of g . Fundamental Theorem of Abelian groups: Eoery finitely generated abelian group is isomorphic to a finite direct sum of cyclic subgroups.
An element of a group is torsion if it has finite order. The set of torsion elements of an abelian group G is obviously a subgroup, and we say G is torsion-free if its torsion subgroup is 0. Since any cyclic group is isomorphic either to (Z, +) or some (Z/nZ, +) for some n in Z, we have Corollary: Eoery finitely generated abelian group is the direct sum of a torsion-fiee abelian group and a j n i t e abelian group.
Rings and Modules A ring is a set R together with operations +, (called addition and multiplication) and distinguished elements 0 and 1, which satisfy the following properties: (R, +, 0) is an abelian group. (R, .,1) is a monoid. a(b + c) = ab + acand (b + c)a = ba
+ cafor all a,b,cin R.
If ab = ba for all a, b in R, we say R is commutatiue, common examples being Z, Q, R, and C, as well as rings of polynomials over these rings; matrix rings (cf., $1.1) provide examples of noncommutative rings. The singleton (0) is a ring called the trioial ring. In all other rings 1 # 0 (since if 1 = 0 then any r = r 1 = r 0 = 0). A subring of a ring is a subset which is itself a ring having the same distinguished elements 0, 1; thus (0) is not a subring of any nontrivial ring. Unless explicitly stated otherwise, rings will be assumed to be nontrivial. Suppose R, T are rings. A ring homomorphism f: R + T is an additive group homomorphism satisfying f(rlr2) = (frl)(fr2) and f l = 1. By domain we mean a (nontrivial) ring in which each product of nonzero elements is nonzero; R is a division ring (or skew-field) if (R - {O},., 1) is a group, i.e., each nonzero element is invertible. A commutative domain is
.
3
$0 Preliminary Foundations
usually called an integral domain (or entire); a commutative division ring is called a field. Given a ring R we define a ( l e f )R-module to be an abelian group M (written additively), together with composition R x M + M called scalar multiplication, satisfying the following laws for all ri in R and xiin M: r(xl
+ x 2 ) = rxl + rx,;
( r l r 2 ) x= r l ( r 2 x ) ;
(rl
+ r 2 ) x = r l x + r,x;
l x = x.
In other words, every possible associative law and distributive law involving scalar multiplication holds. A right R-module M is an abelian group with scalar multiplication M x R + R satisfying the right-handed version of these laws. The motivating examples: (i) R is a left (or right) R-module, where the addition and scalar multiplication are taken from the given ring operations of R. (ii) The modules over a field F are precisely the vector spaces over F. Suppose M, N are R-modules. A module homomorphism f: M + N , also called a map, is a group homomorphism “preserving” scalar multiplication in the sense f ( r x ) = rfx for all r in R and x in M. In analogy to rings, a map is an isomorphism if it has an inverse which is also a map; clearly, this is the case iff the map is bijective. However, maps have additional properties. Write Hom,(M, N) for {maps from M to N}, made into an Abelian group under “pointwise” addition of maps, i.e., (f + g)x = f x + gx. The zero map sends every element of M to 0. Moreover, composition of functions provides a map from Hom(N, K ) x Hom(M, N) to Hom(M, K), which is bilinear in the sense (91 + 92)fl = S l f i
+92f2
and
Sl(f1
+ fi) = S l f l + 9 2 f 2
for any maps h: M + N and g i : N + K. A submodule of an R-module M is an additive subgroup N closed under the given scalar multiplication; in this case N is itself a module and we write N < M. A submodule N is proper if N < M. Viewing R as R-module as above, we say L is a lefi ideal of R if L I R; in other words, a left ideal is an additive subgroup L satisfying rx E L for all r in R and x in L. Note that for any x in a left R-module M we have Rx IM. The case M = R has special interest, because a left ideal L is proper iff 1 # L. In particular, for r E R we have Rr c R iff r has no left inverse. Right ideals analogously are defined as right submodules of R. A is a proper ideal of R (written A 4 R) if A is a proper left and right ideal of R. If f is a ring homomorphism or a module homomorphism, we define its kernel kerf to be the preimage of 0. Then rudimentary group theory shows kerf = 0 iff f is 1: 1. Consequently, f is an isomorphism iff f is onto with
General Fundamentals
4
kerf = 0. Note for a map f : M N that kerf is a submodule of M and is proper iff f is nonzero; on the other hand, i f f : R T is a ring homomorphism then kerf 4 R. Let us try now to characterize kernels structurally. First take R-modules N I M . Forming the abelian group M / N in the usual way, as {cosets of N } , we can define scalar multiplication by --f
--f
r(x + N ) = rx
+N
for r E R and x E M ,
thereby making M / N a left R-module called the quotient module (or residue module or factor module). There is a canonical map cp: M + M / N given by x + x + N , and N = ker cp. In this way we see every submodule of M is the kernel of a suitable map. Moreover, we have Noether's isomorphism theorems: Proposition 0.0.1: Suppose f: M + M' is a map of R-modules whose kernel contains a submodule N of M . Then there is a map f: M / N + M' given b y f ( x + N ) = f x , with kerf = (kerf )IN. In particular, i f f : M + M' is onto and kerf = N then f is an isomorphism. Proof(Sketch): These facts are standard for abelian groups, so one need merely check scalar multiplication is preserved. Q.E.D. Corollary 0.0.2: If M , , M , I M then MI and ( M , M , ) / M , x M l / ( M l n M,).
+
+ M, I M
and M , n M , I M ,
Proofi Define f : M , + ( M , + M , ) / M , by f x = x + M a . Clearly f is onto and kerf = {x E M , : x + M , = 0 } = M I n M , so apply the proposition. Q.E.D. Corollary 0.0.3: If K IN I M then ( M / K ) / ( N / K )x M I N .
Proofi The canonical map M + M / N yields an onto map M / K + M / N Q.E.D. with kernel N I K , so apply the proposition.
One also obtains similar results for rings. Given 14 R we define the quotient ring (also called factor ring or residue ring) R/I to have the usual additive group structure (of cosets) together with multiplication (r,
+ I)(r, + I) = r1r2 + 1.
This can be easily verified to be a ring, and there is a canonical ring homomorphism rp: R + R / I given by cpr = r + I .
$0 Preliminary Foundations
5
Proposition 0.0.4: Suppose f: R + T is a ring homomorphism whose kernel contains an ideal A. There is a ring homomorphism f: RIA + T given by f ( r + A) = f r , and kerf = (kerf )/A. If f is onto and kerf = A then is an isomorphism.
7
Corollary 0.0.5: If B E A are proper ideals of R then (A/B) 4 R/B and (R/B)/(AIB) !z R/A. If f:M + N is a map of R-modules then fM is a submodule of N; thus f is onto iff N / f M = 0, providing a useful test. For rings one sees for any homomorphism f:R + T that f R is a subring of T. Since fR is not an ideal of T we do not have the parallel test for rings, but anyway we shall find it useful at times to replace T by fR, thereby making f onto.
Algebras In the text C usually denotes a commutative ring. A C-algebra (or algebra over C) is a ringR which is also a C-module whose scalar multiplication satisfies the extra property c ( r l r 2 )= (crl)r2= r1(cr2)
for all c in C, and r l , r2 in R.
Any ring R is also a Z-algebra, by taking nr to be r + . * . + r (taken n times); the formal correspondence is given more formally in example 0.1.10 below. In general the theories of algebras and of rings are very similar. Indeed, if R is a C-algebra and A 4R is a ring then A .c R as C-module (since ca = c( l a ) = ( c l ) a E A for all c in C and a in A). Thus the ring RIA also has a natural C-module structure, with respect to which RIA is in fact a C-algebra. Put more succinctly, any ring homomorphic image of R is also naturally a C-algebra. Define the center of a ring, denoted Z(R), to be (z E R: rz = zr for all r in R}, clearly a subring of R. Under its ring operations R is an algebra over every subring of Z(R). Conversely if R is a C-algebra then there is a canonical ring homomorphism cp: C + Z(R) given by cpc = c l . (Proof c l E Z(R) since (c1)r = cr = c(r1) = r(c1); cp is a ring homomorphism because ( c l c , ) l = c l ( c 21 ) = c l (l(c21 ) = (cll)(c, l ) . ) In case C is a field we have ker cp 4 C so ker cp = 0, and we may identify C with a subring of R. Often it is easier to prove theorems about algebras over a field, which one then tries to generalize to algebras over arbitrary commutative rings. At times we shall need the following generalization of the center of a ring R. Suppose A c R. The centralizer of A in R, denoted C,(A), is
6
General Fundamentals
{ r E R:ra = ar for all a in A } , a subring of R. We say B centralizes A if B c CR(A).For example C,(R) = Z(R). Note that A G CR(CR(A)).
Proposition 0.0.6: Any maximal commutative subring C of R is its own centralizer. Proofi Let T be the centralizer of C in R. Then C G T. But for any a in T we see C and a generate a commutative subring C' of R; by maximality of C we Q.E.D. have C' = C so a E C ; hence T = C, as desired.
Preorders and Posets A preorder is a relation which is reflexive ( a I a ) and transitive (if a I b and b Ic then a I c). A preorder I on S is called a partial order (or PO for short) if Iis antisymmetric;i.e., a I b and b I a imply a = b. In this case (S, I)is called a poset. We write a < b when a I b with a # b. The following posets are of particular importance to us.
(i) Every set S has the trioial (or discrete) PO defined by declaring any two distinct elements are incomparable (Lea,a I b iff a = b). (ii) The power set B(A)of a set A is the set of subsets of A, ordered by set inclusion. (iii) If M is an R-module, define Y(M)= {submodules of M},partially ordered under I (so N , I N , if N1 is submodule of N,). When R is ambiguous we write 9 ( R M ) for Y(M). One can do the same for {ideals of a ring}.
Upper and Lower Bounds Suppose S is a set with preorder I.An upper bound for a subset S' of S is an element s in S for which s' I s for all s' in S'. Upper bounds need not exist. For example, no pair of distinct elements has an upper bound if I is the trivial PO. On the other hand, we call S directed (by I)if every pair of elements has an upper bound. An upper bound s of S' is called a supremum if s Is' for every upper bound s' of S'. Dually, we define lower bound and say S is directed from below if every pair of elements has a lower bound. A lower bound s of S' is called an injrnum if s 2 s' for every lower bound s' of S'. The supremum (resp. infimum) is denoted as v (resp. A ). The supremum and infimum of S (if they exist) are denoted, respectively, as 1 and 0. For any poset (S, I) we can define the dual poset (S, 2 )by reversing the inequality, i.e., now s1 2 s2 if previously s1 I s,. The technique of passing to
$0 Preliminary Foundations
7
the dual poset is extremely useful and often produces extra theorems with no extra work.
Lattices A lattice is a poset in which every pair of elements has both a supremum and an infimum; the lattice is complete if every subset has both a supremum and an infimum. Passing to the dual reverses v and A , so we see the dual of a (complete lattice is also a (complete) lattice. The following posets are in fact complete lattices:
(i) The power set Y(A),where v is set-theoretic union and A is intersection. (ii) 9 ( M )for an R-module M; here Mi = M iand A M i= M i . In fact, this important example is the raison d'itre for the study of lattice theory by ring theorists, and many purely lattice-theoretic results will have applications throughout the text (cf., exercises 3- 13).
n
v
This language enables us to state certain module-theoretic results more sharply. To see this we need a useful general result. Given posets A , B we say a function f:A -+ B is order-preseruing if a , < a, implies fa, < fa, for all a1,a2in A. If A, B are lattices, we say a function f:A -+ B is a lattice homomorphism if f(a, v a,) = fa, v fa, and f ( a , A a,) = fa, A fa, for all a,, a, in A. Every lattice homomorphism f:A -+ B is order-preserving, since if a, I a, we have fa, = f(a, v a,) = fa, v fa,. Proposition 0.0.7. Suppose f:A -+ B is a lattice bijection. Then f is a lattice isomorphism iff f and f are order-preserving.
-'
Proof: (a) as observed above. ( G )For any a1,a2in A we have fa, I f ( a l v a z ) and fa, I f ( a l v a,) so fa, v fa, I f(al v a,). Applying this argument to f - ' yields a, v a, =
f-'fa,
v
f-lfu,
I f-'(fa,
v fa,) I f-'f(a, v a,) = a, v a,
so equality holds at each stage. The proof for
A
is analogous.
Q.E.D.
We can apply this result to the lattice 9 ( M ) . Proposition 0.0.8: Iff: M N i s onto then there is a lattice isomorphismfrom 9 ( N ) to {submodules of M containing kerf}, given by N ' -+f-'N'. (The inverse correspondence is given by M ' -+ fM'). -+
Proof: Group theory yields us a 1: 1 correspondence from {subgroups of N} to {subgroups of M containing kerf}, and we wish to restrict this
8
General Fundamentals
to submodules. If N‘ IN then f -IN’ I M since f (rx) = r f x E N’ for all r in R and x in f -IN‘; if M‘ I M then clearly f M ‘ I f M = N. Thus we have an order isomorphism, which by proposition 0.0.7 is a lattice isomorphism. Q.E.D. The corresponding result for rings (proposition 0.0.10) can be obtained directly, but for the sake of variety one could make use of the following observation. Remark 0.0.9: (“Change of rings”) Suppose f:R + T is a ring homomorphism. Any T-module M can be viewed as R-module via the scalar multiplication defining rx to be ( f r ) x for r in R and x in M. Thus every submodule of M in T - d u d can be viewed in R - d u d , providing a lattice morphism from 9 ( , M ) to U ( , M ) . When f is onto this lattice morphism also is onto, since any R-submodule of M is also a T-submodule under the corresponding action. In particular, viewing T naturally as T-module we can identify {left ideals of T} = 9(,T) with 9 ( , T ) .
Proposition 0.0.10: Any onto ring homomorphism f: R + T induces a lattice isomorphism of {left ideals of R containing kerf} with {left ideals of T}; likewise for right ideals. In particular kerf Q R, and f induces a lattice isomorphism of {ideals of R containing kerf} and {ideals of T}; the inverse correspondences each are given by f - I . Proofi Proposition 0.0.8 and remark 0.0.9 yield the following composition of lattice isomorphisms: {R-submodulesof R containing kerf } + LQRT)+ 9(,T). The rest is clear.
Q.E.D.
Modular Lattices Since proposition 0.0.8 concerns lattices (of submodules) one is led to look for a more lattice-theoretic approach to modules, which stems from the following observation: Remark 0.0.11: In any lattice 9we have a v (b, A b,) Ia v b, for i = 1,2, so a v (b, A b,) I (a v b,) A (a v b,). In particular, if a I b we have a v (b A c) I b A (a v c).
9
80 Preliminary Foundations
In certain cases equality actually holds. The most important case is the lattice of submodules Y ( M ) , for if MI I M, and x, E M, n (MI + M 3 ) then x, = x 1 + x3 for x i in Mi so x3 = x, - x1 E M,, proving x, E M, + (M, n M 3 ) .We are led to the following definition: Definition 0.0.12: A lattice 9is modular if a v ( b A c) = b a s bin9.
A
(a v c) for all
9 ( M )is thus a modular lattice. A more symmetric condition in verifying the modularity of a lattice is given in exercise 2. Definition 0.0.13: A lattice 9 is complemented if for each a in Y there is a complement a' with a A a' = 0 and a v a' = 1. The lattice 9 ( S ) is complemented. On the other hand, our other major example of a lattice 9 ( M )is in general not complemented. Complements play an important role in module theory because of exercises 12 and 13, which anticipate key structural results in 42.4. Definition 0.0.14: A jilter of a lattice 9is a subset 9satisfying the following three conditions: (i) If a E F and b 2 a then b E 9 (ii) If a, b E F then a
A
bE9
(iii) 0 .$ 9 Filters have several important applications in rings and can be viewed as the "dual" of ideals, c.f., exercises 23J. It is important at times to have maximal filters; these are called ultrajlters, cf., remark 0.0.16 below. Example 0.0.15: (i) For any a E 9, % = { b E 9:b 2 a } is called the principal jilter generated by a. (ii) Suppose 9 = 9 ( S ) for some infinite set S. Then {complements of finite subsets of S ) is a filter, called the Frechet filter, or cojinite filter.
A direct way of obtaining a filter 9 of a lattice Y is by finding B E 9 satisfying properties (ii) and (iii) of definition 0.0.14, i.e., 0 $ B and if b, b' E a then b A b' 2 b" for some b" in B. Then { a E 9:a 2 b for some b in B } is a and a is called the base of the jilter 9.We shall define many filters filter 9, via their bases.
General Fundamentals
10
Zorn ’s Lemma A poset (S, I) is a chain if for all sl, s, in S we have s1 Is, or s, I s,; in this case Iis called a total order; for example, (Z, I)is a chain under the usual one sometimes finds that I induces a (total) order. Given a lattice (S, I), total order on a certain subset of S. For example, if A, E A, E A, E are subsets of A then {A,: i E N } is a chain in ( B ( A ) ,E). This situation is of great interest because of the following result, often called Zorn’s lemma. We say a poset (S, I)is inductive if every chain S’ in S has an upper bound in S. For example, (N, I) is not inductive since there exist chains not bounded from above, but (N, 2 ) is inductive since 0 is an upper bound. The real interval [0,1] is inductive with respect to I,but Q n is not inductive. An element s of a poset S is maximal if there is no element s‘ > s in S. Minimal elements are defined analogously. (Note that S may have many distinct maximal elements, the most extreme example being when the PO is trivial, in which case every element is both maximal and minimal.
[O,a]
(“Zorn’s lemma”): maximal element.
If (S, I)
is an inductive poset then S has at least one
The key application is as follows: Suppose A is a set and S c @ ( A ) such that for any chain {A,: i E I}in S we have A, E S. Then some subset of A is maximal in S. The most basic application of the maximal principle in ring theory is that every proper ideal of a ring R is contained in a maximal proper ideal, called a maximal ideal. Indeed, an ideal A is proper iff 1 $ A, so {proper ideals of R} is inductive. Likewise any (proper) left ideal is contained in a maximal left ideal. Incidentally this does not hold in general if we do not stipulate the existence of the element 1, which is the main reason we deal with rings with 1, cf., exercise 14. However, a ring need not have minimal nonzero left ideals (for example E), since the above argument has no analogue.
u
Remark 0.0.26:
Any filter is contained in an ultrafilter by the maximal
principle. Using remark 0.0.16 one sees that a filter 9 of a comeither a E 9or a‘ E 9. One plemented lattice is an ultrafilter iff for all a in 9, concludes that if a v b is in an ultrafilter 9 then a E 9 or b E 9? Remark 0.0.27:
Another important application of the maximal principle: {commutative subrings of R containing Z ( R ) } is inductive and thus has maximal members.
11
50 Preliminary Foundations
In other words, any ring R has maximal commutative subrings, and these are often useful in the study of R, in view of proposition 0.0.6. The maximal principle is proved by drawing from set theory and, in fact, is equivalent to the axiom of choice, which asserts that for any family {Si:i E I } of sets there is a suitable “choice” function f:I + Siwith f i E Si for each i, i.e., f “chooses” one element from each Si. At first blush this axiom seems obvious; however, the larger cardinality the index set I, the less credible the axiom becomes. P. J. Cohen proved that the axiom of choice is independent of the Zermelo-Fraenkel axioms of set theory, and today it is used freely by algebraists because the maximal principle is so powerful. To understand the connection we must bring in transfinite induction.
u
Well-Ordered Sets and Transjinite Induction Many definitions in general ring theory rely on transfinite induction. To understand this process requires some intimacy with the ordinals, and to this end we bring in some formalism from set theory. It is natural to build sets from the bottom up, starting with the empty set and then building sets whose elements themselves are sets. Thus we formally define the symbols
Z = i u {i} = {a, {a}}, and so forth. The axiom of regularity states for every set S # 0 there is s E S
0 = @,
i = 0 u (0) = {@},
with s n S = 0. This ensures that given two sets S,, S, we cannot have both S, E S, and S , E S , . (Indeed take S = {Sl,S,}.) Thus we can define an antisymmetric relation < on sets by whenever S, E S, or SI = S,. S, < S , Since the elements of a set S are themselves sets, we can view Ias an antisymmetric relation on the elements of S. S is called an ordinal if (S, I) is a chain. If a is an ordinal then a+ = a u { a } is also clearly an ordinal, called the successor of a. In particular 0 = 0, = 0+, 2 = i+, . . . are all ordinals. O n the other hand, there are ordinals which are not successors, the first of which is {E: n E N}; these are called limit ordinals. A chain is well-ordered if every nonempty subset has a minimal element. Every ordinal a is well-ordered under < as defined above; indeed if @ # S c a then any s E S with s n S = 0 is minimal in S. Thus we have the following generalization of mathematical induction: Principle of transfinite induction: Suppose a is an ordinal and S c a has the property for every ordinal a‘ < a that if {fl:fi < a ’ } G S then a’ E S. Then S = a.
12
General Fundamentals
The proof is rather easy, but the applications are wide-ranging; here are some set-theoretic implications we shall need (cf., exercise 15-20): (i) Every set can be put into 1:l correspondence with a suitable ordinal and thus is well-ordered under the corresponding total ordering. (Thus we shall often describe a set S as {s1,s2,. . .} even when S is uncountable); (ii) Zorn’s lemma, as stated above.
Fields In the structure theory of rings one often considers fields as “trivial” since they have no proper ideals # 0; in fact, most results from ring theory hardly require any knowledge of fields. Nevertheless, fields do play important roles in several key topics (such as division rings), and ideas from field theory provide guidelines for generalization to arbitrary rings. When appropriate we shall assume familiarity with the Galois theory of finite dimensional field extensions, including normal and separable extensions, and the algebraic closure of a field.
First Order Logic We shall need some tools from formal logic, in order to deal with certain important constructions, most notably reduced products and ultraproducts. The reader willing to accept these results (1.4.1lff) might well skip this account. On the other hand, some rigor is sacrificed. A j r s t order language 9 consists of constants (or object symbols) which are “designated elements” in the theory (such as 0, 1 and usually denoted as a, b,c,. ..) variables (or dummy symbols) denoting “variables” or “indeterminates” (such as x, y, z ) relative symbols of order n for n = 0, 1,. . . function symbols of order n for n = 0, 1,. . . connectives which are the symbols -I, A , v ,denoting, respectively, “not,” “and,” “or (inclusively),” quantijiers which are the symbols V (denoting “for all”) and 3 (denoting “there exists”)
A term is an expression defined inductively as follows: Every constant or variable is a term, and f ( t l , . . ., t,,) is a term for all terms t l , . ..,t,, and every n-ary function symbol f. An atomic formula is an expression without connectives.
$0.1 Categories of Rings and Modules
13
Formulas and the free oariables of a formula cp (denoted FV(cp)) are defined inductively in terms of rank. If cp is atomic then we say rank(cp)= 0 and FV(cp) is the set of variables used in writing cp. Inductively, if cpi are formulas of rank n, then is a formula of rank n, + 1 whose free variables a;e FV(cp,). cp,), (cp, v cp,), each is a formula of rank n, + n, + 1 whose free variables are FV(cp,) u FV(cp,). (Vx)cp, and (3x)cpl are formulas of rank n, + 1 for any x in FV(cp,), whose free variables are FV(cp,) - {x}. i cp,
(cp,
A
A jirst-order (or elementary) sentence of 8 is a formula without any free variables. A structure Y is a set S together with an assignment of the symbols in 9 to their interpretations in S. Constants are assigned to designated elements of S, relative symbols are assigned to relations on S, n-ary function symbols are assigned to functions S(”) --* S, and variables denote arbitrary elements of S. Let us define when a sentence cp “holds” in 9 Suppose S is the underlying set.
(i) The atomic sentence ( t , = t , ) holds in Y iff the terms t , and t , have the same assignment in S. The atomic sentence R ( t , , . . .,t,) holds in S iff the relation R is satisfied by the assignments of t , , ...,t,. We proceed inductively on rank, having just handled the rank 0 case. (ii) i cp holds (in 9) iff cp does not hold (in Y). (iii) cpl A 41, holds iff cp,, cp, both hold cpl v cp, holds iff cp, and/or cp2 hold (iv) (Vx)cp(x) holds iff cp(s) holds for all elements s in S; (3x)cp(x) holds iff cp(s) holds for some element s in S. Here ~ ( s denotes ) the formula obtained by replacing each occurrence of x by s and is easily seen to be a sentence.
Certain redundancies in the language 8 can be discarded when proving general assertions about the lower predicate calculus. In particular, the quantifier 3 and the connective v are superfluous, as the reader can readily check.
80.1 Categories of Rings and Modules The language of categories is useful, particularly in certain aspects of module theory. We presuppose a nodding acquaintance with this language; Jacobson [80B, Chapter 13 more than suffices for this purpose. In particular, the reader should know the definition of category, subcategory, (covariant)
14
General Fundamentals
functor, contravariant functor, natural transformation (of functors), and natural isomorphism of functors. Given a category W we write Hom,(A, B), or merely Hom(A, B), for the set of morphisms; 1,: A + A denotes the unit morphism. Our interest in categories will focus on R-dud, where R is a given ring; its objects are the R-modules, and its morphisms are the maps of R-modules. , objects are rings and whose morAnother category of note is W i ~ ywhose phisms are ring homomorphisms. R-Aud and W i ~ each y are subcategories of d’e,the category of abelian groups (written in additive notation); d’eis a subcategory of 92,the category of sets. Often the class of objects of a category is “too large” to be a set, for one can construct distinct objects for each ordinal. Such is the case with Wimg and R - A d ,cf., exercise 1.4.1. Accordingly, a category is called small when its class of objects is a set. The next example is quite useful. Example 0.1.1: Any set 1 with preorder I can be made into a small category whose objects are elements of 1, with Hom(i,j) either a singleton or 0 depending on whether or not i I j. Write E: for the morphism from i to j if i 5 j. Then E : = l i and E: = E ~ E ;for all i, j, k in I. Conversely, any small category in which JHom(A,B))I 1 for all objects A, B can be given a preorder (as a set) and can be described as above. If 1 is an arbitrary set then it can be given the trivial preorder, in which case the corresponding small category has Hom(i,j) empty unless i = j, in which case Hom(i, i) = l i . This trivial example is useful in understanding certain constructions of Chapter 1 (e.g., the coproduct). Definition 0.1.2: Given a category V we define the dual category WoP by Ob Vop = Ob W and Hornrpop(A, B) = Hom,(B, A) with composition in Cop given by g f = fg (where f E Homro,(A, B) and g E Homro,(B, C)). In other words, we reverse arrows and write things backwards. (In particular (VO”)”P = W.)
Any general theorem for all categories a fortiori holds for the dual categories; translating back to the original category yields a new theorem, the dual theorem obtained by switching all arrows. The main problem with this approach is that few theorems hold for all categories, and the dual of a wellknown category may be quite bizarre. Nevertheless, there are certain important examples for which the dual is well-known and useful. For example, the dual of example 0.1.1 corresponds to the reverse preorder on S, justifying the customary use of “dual” concerning posets and lattices.
50.1 Categories of Rings and Modules
15
Monics and Epics Recall a morphism f: A + B is monk if f g # f h for any g # h in Hom(C, A), for all objects C; dually f is epic if gf # hf for any g # h in Hom(B, C). Clearly the composition of monics (resp. epics) is monic (resp. epic). In any subcategory of Yet! each 1:l morphism is monic, and each onto morphism is epic; we would like to test the converse for R - A d and Wiltg. Proposition 0.1.3:
In R - A d , monics are 1: 1, and epics are onto.
Pro08 Suppose we are given f: M +N. If f is monic define g, h: kerf --+ M by taking g to be the identity and h = 0; then f g = f h = 0 implying g = h, so kerf = 0 and f is 1:l. If f is epic then define g, h: N + N / f M by g = 0 and hy = y + f M ;then gf = hf = 0, implying g = h so N / f M = 0, i.e., f M = N. Q.E.D. The story ends differently for W i ~ g . Example 0.1.4: A 1:l ring homomorphism which is epic and monic, but not onto. Consider the 1 :1 ring homomorphism f:Z + Q given by f n = n. For any morphism g : Q + R in W i ~ we g have g(mn-’) = (gm)(gn)-’ for all rn, n # 0 in Z, implying g is determined by its restriction to Z; it follows at once that if g # h then g f # hf, so f is epic. In Exercise 1 we see that all monics in Wilt9 are 1:l. Nevertheless, example 0.1.4could be called the tragedy of Wiltg. Perhaps rings categorically should be viewed in terms of the following example. Example 0.1.5: Suppose R is a ring. We form a category with only one object, denoted A, and formally define Hom(A,A) = R where the composition of morphisms is merely the ring multiplication. To differentiate the approach to rings and to modules, we designate ring homomorphisms as “homomorphisms;” a 1 :1 (ring) homomorphism is called an injection, and an onto homomorphism is a surjection. For modules we adopt, respectively, the more categorical terminology of map, monic, and epic. Nevertheless, since an ideal of R is merely a left and right submodule, we would like to introduce another category.
Definition 0.1.6: Suppose R, R’ are rings. An R-R’ bimodule is a left Rmodule M which is also a right R’-module satisfying the associativity
General Fundnmentals
16
condition (rx)r’ = r(xr‘)for all r in R, x in Myand r’ in R’. R-Mud’-R‘ is the category whose objects are R-R‘ bimodules and whose morphisms f: M + M’ are maps both in R-Modand d u d - R ‘ .
Remark 0.1.7: The R-R sub-bimodules of R are precisely the ideals of R.
Functors Certain functors arise continually in the study of R-Mod.Perhaps the most important are the “Hom” functors:
Example 0.1.8: (i) Hom(A,,-): % + Y e t is the functor sending an object A to Hom(A,,A) and sending a morphism f: A + B to the function f#: Hom(A,, A) + Hom(A,, B), defined by f# h = f h for each h in Hom(A,, A). Note Hom(A,,-) is covariant because for all h in Hom(A,,A) and each f:A +Band g:B + C we have
(Sf)#h = gfh = 9#f#h,
so (Sf)# = 9 # f #
(ii) Horn(-, A,): %‘ + Y t is the contraoariant functor sending A to Hom(A, A,) and sending f to the function f : Hom(B, A,) + Hom(A, A,) defined by f ’ h = hf for each h in Horn@, A,).
”
Other functors we need are the identity functor l,, and the “forgetful functors.” A subcategory W of 9 is full if Hom,(A,B) = Hom,(A,B) for any objects A, B in V. Given a full subcategory V of 9 we say the inclusion functor F: W + 9 has a retraction G:.9 + %fif G F = 1,.
Example 0.1.9: (i) .9 = at& and %‘ is the full subcategory of torsion-free abelian groups. Given A E d&define tor(A) = {torsion elements of A}. Then the functor G: .9-+ V given by GA = A/tor(A) is a retraction. This example has been abstracted to the torsion theory of modules, c.f., 53.3 and 53.4. (ii) Given a ring surjection f: R + T, remark 0.0.9 yields a functor F: T-Mud --* R-Mod. If M E T-Mud then viewing M as R-module we have (kerf)M = 0. On the other hand, if M E R-Mud and (kerf)M = 0 then we can reverse the procedure and view M as T-module by putting ( f r ) x to be rx. In this way F yields an isomorphism from T-Mud to the full subcategory W of R-Aod consisting of those modules M such that (ker j ) M = 0. There is a retraction G: R - A d + V given by GM = M/(ker f )M.
$0.1 Categories of Rings and Modules
17
Two categories V, 9 are isomorphic if there exist functors F : V + 9 and G :9 --* V with G F = 1% and F G = l a . This definition is very stringent, but is useful in identifying a pair of theories. Example 0.1.10: d&and Z - A u d are isomorphic categories. (Indeed, let F: Z - A u d + d&be the forgetful functor, and define G: d&+ Z - A d as follows: Given M E d& we view M as Z-module by introducing scalar multiplication nx = x + . * + x , the sum taken n times for n E N, and (- n)x = -(nx). Every group homomorphism then becomes a morphism in Z - A d , so we have the inverse morphism to F.) To identify categories of left and right modules, we need the notion of the opposite ring RoP. Definition 0.1.11: If R is a ring, RoPis the ring obtained by keeping the same additive structure but reversing the order of multiplication, (i.e., the product of rl and r2 in RoPis r2r1). RoPyields the dual category of the category obtained from R in example 0.1.5, thereby justifying the notation. Note (R"P)"P= R. Proposition 0.1.12:
R-Aod and Aud-RoPare isomorphic categories.
Proofi Given M in R-Aod, we define the scalar product of x E M and r E RoPto be rx; reversing the order of all products, we see this new scalar multiplication makes M a right R"P-module. Any morphism f: M , + M 2 in R - A d can be viewed at once as a morphism in Aod-RoP,so we thus have a functor R-Aud+.Mud-RoP. We have an analogous functor Aud-R"P+ (RoP)"P-Aod= R-Mud, and the composition of these two functors is the identity. Q.E.D.
Thus any general theorem about modules is equivalent to a corresponding theorem about right modules. Usually we want to weaken the notion of isomorphism of categories to equioalent categories, c.f., Jacobson [80B, p. 271; we shall see in Chapter 4 that categorical equivalence is a fundamental tool of module theory. We shall also need the following construction from time to time. Example 0.1.13: Suppose I is a small category and V is a category. Then there is a category V' whose objects are the functors from I to %? and whose
General Fundamentals
18
morphisms are the natural transformations, i.e., Hom(F, G) = {natural transformations from the functor F to the functor G}. The composition cq of two natural transformations q: F + G and G H is given by (cn), = 4‘,qA E Hom(FA, HA) for each A in Ob %?.
r:
--f
90.2 Finitely Generated Modules, Simple Modules, and Noetherian and Artinian Modules Returning to modules, we approach one of the nerve centers of the subject and look at the generation of modules by elements. Finitely generated (fag.)modules, also frequently called “finite” and “of finite type,” turn out to be much more tractable than arbitrary modules. In particular, we shall examine cyclic modules, leading us to simple modules. At the end we introduce the important classes of Artinian ’modules and Noetherian modules.
Finitely Generated Modules Given M in R d o d and AGR, SGM, define A S = ~ : , , a , s , : t ~ Na+A, , si E S}; if M E A u d - R we define SA analogously. For S = {s,: i E I } we often write Asi instead of AS. Usually A will be an additive subgroup of R, in which case AS is a subgroup of M for any set S; in fact As = {as:a E A}.
Proposition 0.2.1: Suppose SG M and M E R - A u ~If. L I R then L S I M. RS is the intersection of all submodules of M which contain S. If M E RMod-R’ then RSR’ is the intersection of all sub-bimodules of M containing S. Proofi LS is an additive subgroup of M, and for any r in R, r(LS) = (rL)S E LS proving LS 5 M. In particular RS IM. Now for any N I M with S G N we have RS E RN E N; since RS itself is a submodule containing each element s = 1s of S we get the second assertion. The last assertion is proved similarly. Q.E.D.
We say a module M is spanned by the subset S if M = RS. A module spanned by a finite set is called Jinitely generated, abbreviated as “f.g.” throughout the text. Definition 0.2.2: R - F ~ M uis~ the full subcategory of R - A d whose objects are the f.g. R-modules. Remark 0.2.3: If f: M + N is a map of modules and M is spanned by S then fM is spanned by fS (for if x = E l l s i then f x = c r i (fsi)). In par-
90.2 Finitely Generated, Simple, Noetherinn and Artininn Modules
19
ticular, if M is f.g. then f M is f.g. On the other hand, a submodule of an f.g. module need not be f.g. as seen in the next example. Example 0.2.4: Let Q [ A ] be the ring of polynomials in one commuting indeterminate over Q and let I = 3,Q[3,] and R = Z I c A. Then Id R but 1 4 R-Firnod. (Indeed, given any x l , . . .,x, in I , let the coefficient of 3, in xi be mi/ni and observe (2n, --*n,)-'3,E I Rxi.)
+
Cyclic Modules Of particular interest are modules spanned by a single element. Definition 0.2.5:
M is a cyclic R-module if M = Rx for some x in M.
R = R1 is a cyclic R-module, so remark 0.2.3 shows RIL is cyclic for every L < R. Conversely, every cyclic module has this form, as we shall see shortly. Dejnition 0.2.6: If M E R-Mud and S c M , define Ann,S (the left annihilator of S in R) to be {r E R: rs = 0}, a proper left ideal of R. If R is understood, we write Ann S for Ann, S; we also write Ann x for Ann{x}.
Lemma 0.2.7: If M E R-Mod, then for every x in M there is a map f,: R + M given by f,r = rx; kerf, = Annx, implying RIAnnx w Rx 5 M. Proof: Clearly f, is a map, and kerf, = {r E R: rx = 0} = Ann x, so Rx Q.E.D. f x R w R/ker f , = R/Annx.
=
Proposition 0.2.8: M E R-Mod is cyclic iff M w R / L for some left ideal L of R; in fact, for M = Rx then we can take L = Annx. Proof: As noted above, RIL is cyclic; the converse is lemma 0.2.7.
Q.E.D.
Simple Rings and Modules We shall turn now to a basic philosophy concerning arbitrary categories. One should like to examine objects by taking morphisms to objects whose structure we already know. Then the simplest objects would be those objects from which all morphisms are monic, motivating the following definition. Definition 0.2.9: A nonzero module M is simple if M has no proper nonzero submodules; a ringR is simple if R has no proper nonzero ideals. (Simple modules are called irreducible in the older literature.)
General Fundamentals
20
Remark 0.2.10: In WiBg or in R - ~ ? u d ,an object A is simple iff every nonkerf # A so kerf = 0. (e) Any zero morphism f: A + B is 1: 1. (Proof: (a) morphism A + A/Z is 1:1 so I = 0.)
In particular, we have the following categorical criterion for a module M to be simple: Every nonzero map from M is monic. An analogous criterion holds for W i ~ inf view of exercise 0.1.1, but the dual criterion only works for modules. Remark 0.2.11: An R-module N is simple iff every nonzero map f: M +N is onto. (Proof: (a) 0 # jM < N implies f M = N; (e) if 0 # N' < N then the injection N' + N is not onto.)
There are two immediate difficulties in trying to build a structure theory based on simple rings and/or modules: (i) There must be enough simples to yield general information about rings and modules. (ii) One needs some technique to study the simples. The first difficulty can be dealt with by means of maximal left ideals. Remark 0.2.12: (i) If L is a maximal left ideal of R then R/L is a simple R-module. (Immediate from the lattice correspondences pertaining to R as R-module.) (ii) If I is a maximal ideal of R then R/I is a simple ring.
Surprisingly this remark provides all the simple modules.
Lemma 0.2.13: If M is a simple R-module then M is cyclic. In fact Rx = M for eoery x # 0 in M. Proof: 0 # Rx I M so Rx = M. Proposition 0.2.14: mal left ideal of R.
Q.E.D.
M E R-Aud is simple iff M x R/L for a suitable maxi-
Proof: (=.) Write M = Rx and define cp: R + M by cpr = rx. Then cp is onto so M x Rlkercp, and kercp is a maximal submodule by proposiQ.E.D. tion 0.0.8 (.=) Reverse the argument
Before putting this idea aside, we note an important generalization.
50.2 Finitely Generated, Simple, Noetherian and Artinian Modules
21
Proposition 0.2.15: If M E R-.Fimod and N < M then N is contained in some maximal submodule M’. Consequently M J M ’ is a simple module in which the image of N is 0.
=I:=]
Proof;. Write M R x i , where all x i € M . For any chain M , IM , I... of proper submodules, some xi # Mj for all j (since otherwise all xi E Mj for large enough j, implying M = z R x i E Mj contrary to Mi proper). Thus xi 4 M j , which hence must be proper (and is clearly a submodule). Taking M I = N , we have proved {proper submodules of M which contain N } is inductive and thus by Zorn’s lemma contains maximal members, which must be maximal submodules of M. The rest is clear. Q.E.D.
u
It is difficult to study simple rings without imposing further restrictions because of the intrinsic complexity of ideals. Indeed, the smallest ideal of R containing a given element r is RrR = { = ril rri2: t E N, ril, ri2 E R } which cannot be described in the first-order theory of rings. On the other hand, the smallest left ideal containing r is Rr = {r’r:r’ E R } , which is much more amenable. When r is in the center then in fact RrR = Rr, and the situation is much easier to handle. In general, the classification of simple rings is an immense project, far from completion, but there is the following easy result concerning rings without proper left ideals.
c:
Proposition 0.2.16: (i) Rr = R iff r has a left inverse in R ; (ii) R is a division ring iff R has no proper nonzero left ideals; (iii) if R is simple then Z ( R ) is a Jield.
Proof;. (i) Rr = R iff 1 E Rr iff 1 = r’r for some r’ in R. (ii) (3) follows at once from (i). Conversely if 0 # r E R then Rr = R proving every element of R-{0} has a left inverse, so R-(0) is a multiplicative group. (iii) Rz = R for any z # 0 in Z ( R ) , implying z-l exists and is clearly in Z(R). Q.E.D.
In particular, simple commutative rings are fields.
Chain Conditions A poset ( S , I) satisfies the maximum (resp. minimum) condition if every nonempty subset has a maximal (resp. minimal) element. (S, I) satisfies the
General Fundamentals
22
ascending chain condition (abbreviated ACC) if there is no infinite chain s1 < s2 c s3 < *.., i.e., if every ascending chain is finite; dually (S, I) satisfies DCC if every descending chain is finite.
Proposition 0.2.17: A poset (S, I )satisfies the maximum condition iff it satisfies the minimum condition ifl it satisfies DCC. satisfies ACC. (S, I) Proofi We prove the first assertion; the second is its dual and follows by passing to the dual poset. First note that an ascending chain is finite iff it contains a maximal element. So if (S, I) satisfies the maximum condition then every ascending chain is finite, proving (S, I) satisfies ACC. Conversely, if (S, I) satisfies ACC then every subset s' is inductive (because every chain of S' is finite) and thus has a maximal element. Q.E.D.
Thus to verify a chain is well-ordered, we need only check that there is no infinite descending subchain. Also we see that if a lattice satisfies DCC then every subset is well-ordered.
Noetherian and Artinian Modules The point of studying chain conditions on lattices is in utilizing the lattice Y ( M )of submodules. Defiition 0.2.18: A module M is Noetherian if Y ( M ) satisfies ACC or, equivalently, if Y ( M ) satisfies the maximum condition. M is Artinian if Y ( M )satisfies DCC or equivalently the minimum condition.
Proposition 0.2.19: Suppose M E R-Aud and N I M. M is Noetherian iff N and M I N are Noetherian. M is Artinian iff N and M / N are Artinian. Proofi This is really a fact about ACC and DCC in modular lattices having 0 and 1, i.e., Y ( M ) satisfies ACC (resp. DCC) iff Y ( N ) and Y ( M / N ) satisfy ACC (resp. DCC). (*) ACC and DCC certainly pass to sublattices. But Y ( N )I Y ( M )in the obvious way, and Y ( M / N ) is isomorphic to the sublattice {submodules of M containing N ) by the correspondence M ' / N H M'. (.=) We do ACC; DCC is analogous. Suppose M I 5 M , I in M. Then we have M,nNIM,nNI...
and
(MI
+ N ) / N I( M , + N ) / N I
. . I
23
80.3 Abstract Dependence
in 9 ( N ) and Y ( M / N ) , respectively; so for some m we have Mi n N = Mi+1n N and (Mi + N ) / N = ( M i + , N ) / N for all i 2 m. Thus we need to show that if Mi n N = Mi+ n N and (Mi + N ) / N = (Mi+ + N ) / N then M i = M i + l . Suppose X E M ~ +Then ~ . X E M , + ~ + N = M , + N ;writing x = y i + x ‘ for yi in Mi and X ’ E N we have x ’ = x - y , ~ M ~ + ~ n N = M , n N so x E Mi as desired. Q.E.D.
,
+
,
Corollary 0.2.21: Every f.g. module over a left Noetherian ring R is Artinian) then M is Noetherian).
1:;:
Proofi We prove Noetherian; Artinian is analogous. Let N = 4, which is Noetherian by induction on t. But M / N =(N + N,)/N w N,/(NnN,) Q.E.D. is Noetherian so M is Noetherian by the proposition. We say R is left Noetherian (resp. left Artinian) if R is Noetherian (resp. Artician) as R-module. Corollary 0.2.21: Every f.g. module over a left Noetherian ring R is Noetherian. Every f.g. module over a lejl Artinian ring R is Artinian.
=xi=
Proofi We prove Noetherian. Write M is Noetherian, so M is Noetherian. Q.E.D.
Rx,. Each Rxiw R/Annxi
80.3 Abstract Dependence This discussion is motivated by the observation that modifying the proof in Herstein [64B, Ch.4, corollary 23 shows that all bases of a given vector space over a division ring have the same cardinality.
Definition 0.3.1: A strong dependence relation on a set A is a relation Edcp between elements and subsets of A , satisfying the following axioms for all S,S’
c A:
(i) (ii) (iii) (iv)
If s E S then s E~~~ S. If x Edep S then x Edep S, for some finite S , c S. If x edepS and s Edep S’ for all s in S then x Edep S’. If y Edep S u { x } and y $dep S then x Edep S u { y}.
The fourth axiom, called the (Steinitz) exchange axiom, can be tied in with another idea. Say a set S is independent if s $dep S - {s}for all s in S. Then the exchange axiom implies
General Fundamentals
24
(iv’) If x # d e P S and S is independent then S u { x } is independent. (Indeed, suppose S u {x} is dependent. Then some s Edep (S - {s})u {x} and by hypothesis s #dep S - {s}, so exchanging s and x yields x Edep (S - {s}) u {s} = s. Conditions (i) and (ii) are usually immediate in any candidate for being a strong dependence relation. However, (iii) and (iv) are trickier and may even fail. For example, one customarily says a subset S of a module M is independent if rss = 0 necessarily implies each rs = 0. This definition satisfies (i), (ii) and (iv) but not necessarily (iii). On the other hand, if we instead try to define x Edcp S by x E RS, then (iii) holds but (iv) may fail, e.g., R = M = Z, x = 2, y = 4 and S = 0.)Fortunately, these two definitions coincide when R is a division ring, so we get both (iii) and (iv). Another example of interest to us is {simple submodules of a given Rmodule M}. Then definition 1.3.5 below satisfies (i), (ii), and (iv), cf., argument of remark 1.3.8 below, and (iii) holds because N n 2 Ni# 0 implies N n N, = N (since N is simple) and thus N c N,.
xfinite
Theorem 0.3.2: Suppose 9’ is a set with a strong dependence relation Edep. Then any independent subset of 9’can be expanded to a suitable maximal independent subset B, and s Edep B for every s E Moreover, if B‘ is another maximal independent subset then IBI = IB‘J. Proof: The existence of maximal independent subsets follows from Zorn’s lemma and property (ii), and if s & p B then B u {s} is independent by (iv’), contrary to the maximality of B. Finally, we prove IBI 5 IB’I in two stages. First assume B is finite, i.e., B = {b, ,...,b,}. Then we claim there are (b’, ,...,bb} in B’ such that {b’, ,...,b;,bk+, ,..., b,} is independent, for each k In. Taking k = n this will prove {b’,,. . .,bb} is independent, so IB’I 2 n = (BI. The claim is proved by induction on k. For k = 0 this is clear, so suppose we have found b’,,...,&-, with {b;,...,b,-,,b, ,...,b,} maximal independent; we look for bl. Well b, Edep B’ and b, #dep {b’,,. ..,b:- I , b,, ,,. ..,b,}, so by (iii) we conclude there is some b‘ in B‘ with b’ &ep {b’,,...,blb,, . . .,b,}, and we take b’, to be this b’. {b;,. . .,4,b,, . . .,b,} is independent by (iv’), as desired. Next assume B is infinite. Write B‘ = { b’: i E I ’ } . For each i in I’ take a finite subset B, of B such that b: edepB,. Then bl edep B, for each b’ in B‘. Since b Edep B’ for each b in B, we have b Edep Bi for each b in B, proving Uie,,B, = B. Hence there are an infinite number of B,, proving
,,
,,
uisl,
u
,,
50.3 Abstract Dependence
25
IB’I is infinite, so then letting xo denote the cardinality of N we have IB’I = /B’Ixo 2 (Bil = I u Bil= IBI. We have proved IBI I (B’I in all cases; by symmetry IB’I 5 IBI, so (BI = IB‘I. Q.E.D.
xis,,
Remark 0.3.3: P. M. Cohn has observed that the conclusions of theorem 0.3.2 still are valid if we weaken (iii) by stipulating in its hypothesis that S is also independent. Let us call this a weak dependence relation.
Algebraic and Transcendental Elements One of the standard applications of the theory of abstract dependence is the study of transcendence bases in field theory. Since we shall rely on this theory when examining extensions of rings (first in 42.5 and more extensively in Chapter 7), let us review the fundamentals from the commutative theory. Let C dtf denote the category of algebras over a commutative ring C. Given R in C - d t g and r E R we write C [ r ] for ( c : = , c i r i : c Ei C , t E N). C [ r ] is a commutative subalgebra of R, and there is a surjection q,: C [ I ] --t C [ r ] given by qrl = r, where I is a commuting indeterminate over C ; the elements of ker qr are the polynomials satisjed by r. We say r is transcendental over C if ker qr = 0; otherwise r is algebraic over C, and we say r is integral over C iff r satisfies a monic polynomial. R is integral (resp. algebraic) ouer C if each element of R is integral (resp. algebraic) over C. When C is a field the notions, “algebraic” and “integral” coincide. More generally suppose the elements r l , . . .,r, of R commute with each other. Let CIIl, . .., I , ] denote the algebra of polynomials in the commuting indeterminates Al,.. ., I , over C. Writing C[rl, . . ., r , ] for the (commutative) C-subalgebra of R generated by r l , . . .,rt we have the canonical surjection q : C [ I , ,. . . , I , ] + C[r,,. . ., r , ] given by q I i = ri for 1 5 i I t ; we say r l , . . .,r, are algebraically independent (over C ) if ker q = 0. Example 0.3.4: We are ready to apply theorem 0.3.2 to the following situation: C c H are integral domains, whose respective fields of fractions are denoted F and K. Algebraic dependence over F (in K ) is a strong dependence relation, so any set of algebraically independent elements of K can be expanded to a maximal independent set, which is called a transcendence base of K over F. Moreover, the cardinality of a transcendence base of K over F is unique and is called the transcendence degree of K over F, or tr deg KIF. Note that elements of H are algebraically independent over C iff they are
General Fundamentals
26
algebraically independent over F, seen by “clearing denominators,” so we can also define tr deg HIC to be tr deg KIF. At times it is convenient to have the following generalization of “separable” for field extensions which are not necessarily algebraic; We say K 3 F is separable if either char(F) = 0 or char(F) = 0 and K is linear disjoint from F’Ip, the field obtained by adjoining p-th roots of all elements of F. In other words if al,. ..,a, E K are linearly independent over F then a,: . . .,a,P are also linearly independent over F. It follows that every subfield K O of K finitely generated over F is separably generated in the sense that K O is separably algebraic over a purely transcendental field extension of F. The standard proof, which can be found in Lang (65B, p.265) or Jacobson (80B, p.520) is an induction on the number of generators of K over F. In particular, any extension field of a perfect field is separable. We shall see more general uses of the word “separable” in 52.5 and then 55.3.
Exercises w.0 1. Given a set S with a preorder <, define an equivalence on S by stipulating a = b iff a < b and b Ia. Then the set of equivalence classes is a poset, where [a] I[b]
iff a I b. This observation is useful in generalizing results about posets. 1’. Define < on Z by a s b iff b divides a. Use this to define a PO on N via exercise 1, and identify this poset with Y(Z). 2. A lattice Y is modular iff Y has the property: If a 5 b and a A c = b A c and a v c = b v c then a = b. (Hint: (-=) Let a , = a v (b A c) and a, = b A (a v c). Then a , I a, by remark 0.0.11.To show a2 _< a , one needs only show a , A c 2 a, A c and a , v c 2 a, v c.) 3. We say b covers a if a < b and there is no x with a < x < b. Using exercise 2 show for any a, b in the modular lattice Y there is a lattice isomorphism from the sublattice {x E 9a < x < a v b to the sublattice {x E 4p:a A b < x < b}, given by x -P x A b, with inverse function y + a v y . (Hint: these are order-preserving). Conclude that if a v b covers a then b covers a A b. Many module theoretic results can be proved using lattice theory alone. In the next few exercises we sketch the development of this aspect of lattice theory, foreshadowing results to appear later in the text (esp. in Chapter 2). 4. A complete lattice Y is upper continuous if for every directed subset S of Y we have a A S) = v A s) for each a in 9, lower continuous is defined dually. Show the modular lattice Y ( M )is upper continuous but nor lower continuous. 5. An element a in a complete lattice Y is compact if for each directed set {b,:i E I} with b, 2 a we have some b, 2 a; Y is compactly generated if every element is a supremum of compact elements. Show every (complete) compactly generated lattice is upper continuous. On the other hand, the compact elements of Y ( M ) are the f.g. submodules of M, so Y ( M )is compactly generated.
(v
v
Exercises
27
Modular Lattices In exercises 6 through 13 assume 9 is a modular lattice. 6. The dual of Y is modular. Every interval of Y is a modular lattice, which is complemented if U is complemented. 7. Complements need not be unique in a complemented modular lattice. (Take sP(R‘z’).)However, if a < b in 9then no element can be a complement for both a and b. 8. If (a v b) A c = 0 then a A (b v c) = a A b. (Hint: a A ( b v c) I (a v b) A ( b v c ) = b v ((a v b) A c) = b.) 9. An element a of U is large (also called essential) if a A b # 0 for all b # 0. If b is maximal such that a A b = 0 then a v b is large. (Hint: use exercise 8.) 10. If 9 is upper continuous then for any a, b in Y with a A b = 0 there is c 2 b in Y such that a A c is large. An atom is a cover of 0. A lattice is atomic if for every a # 0 there is an atom a , I a. 11. Suppose Y is compactly generated. 9 is complemented iff every element is a
supremum of a suitable set of atoms. (Hint: (*) Any compact element c has some element b over which c is a cover, so c A b’ is an atom.) 12. The socle of 2, denoted soc(9), is defined as A{large elements of 9). The interval from 0 to soc(9) is a complemented lattice. (Hint: Use exercise 9.) soc(9) 2 V{atoms of U } ,equality holding if Y is compactly generated (by exercise 11). 13. Suppose Y is modular and complemented. Y satisfies ACC iff Y satisfies DCC. (Hint: Given an infinite chain a , > a , > . .. build an infinite ascending chain using complements and exercises 6 thru 9. The reverse direction follows from duality.)
Zorn’s Lemma 14. Let R be the set of polynomials (in one indeterminate 1)over Q having constant term 0. R satisfies all the ring axioms except the existence of the unit element 1. If H is an additive subgroup of Q then (HA R1)a R ; since Q has no maximal
+
15. 16.
17. 18.
19. 20.
additive subgroups, conclude R has no maximal ideals. Prove the validity of transfinite induction. (Hint: If S # a take a‘ minimal in a - S and prove the absurdity a’ E S since fl E S for all /? < a’.) If a # a’ are ordinals then either a < a’ or a’ < a. (Hint: Take a minimal counterexample a’.) Let B = {classof ordinals}. 0 is not a set (for otherwise 0 E 8,which is impossible.) Thus to show a class GR is not a set it suffices to find a 1:l function from 0 to GR. Any set S is in 1:1 correspondence with a suitable ordinal. (Hint: Otherwise define a 1: 1 function f:B + S as follows: fb = so for some so in S and, by transfinite induction, take fa to be some element of S - {ffl:fl E a } for each ordinal a.) Conclude that every set can be well-ordered with respect to suitable total order! For any set S , every function f:S + B ( S ) is not onto. (Hint: {sE S : s $ fs} is not in the image of f.)Consequently there is no 1: 1 function B ( S )+ S. Prove the maximal principle. (Hint: If ( S , I) were an inductive poset without maximal elements take an ordinal a of the same cardinality as B ( S ) and define j a + S by transfinite induction, taking fa‘ to be any element > sup{f/?: fl < a’} for each ordinal a’ < a. Then f is 1:1, contrary to exercise 19.)
General Fundamentals
28
Distributive Lattices and Boolean Rings A ( b v c) = (a A b) v ( a A c) for all a, b, c in Y.Show any distributive lattice satisfies the dual property a v ( b A c) = ( a v b) A (a v c). Y ( Z ) is a distributive lattice, but Y(,M) need not be distributive in general. 22. A lattice is Boolean if it is distributive and complemented. By a misnomer, Boolean lattices are usually called Boolean algebras; they are used in computer science and circuitry. Show any Boolean lattice Y has a ring structure given by ab = a A b and a + b = (a A b’) v (a’ A b). (Hint: The hard axiom to verify is associativity of addition, which is proved by showing the function (a,b,c) + ( a + b) + c is symmetric in a, b, and c. Indeed, a b = (a v b) A (a’ v b‘) so (a + b) + c = ( a A b A c’) v (a’ A b A c’) v (a’ A b’ A c) v ( a A b A c).) 23. An element e of a ring R is idempotent if e’ = e; we say R is a Boolean ring if every element is idempotent. Show every Boolean ring R is commutative, and r + r = 0 for all r in R. (Hint: r l r , = (rl + r$; then take r2 = 1.) Every Boolean lattice gives rise to a Boolean ring by exercise 22. 24. For any ring {idempotents of Z ( R ) }form a Boolean lattice under the partial order el < e, iEe,e, = e,. 25. Suppose Y is a Boolean lattice. Viewing Y as a ring as in exercise 22 show I Y as ring iff I is a filter of the dual lattice of 9. 26. The only Boolean integral domain is Z/2Z since e ( l - e) = 0. But every homomorphic image of a Boolean ringR is Boolean, so for A Q R it follows RIA is an integral domain iff RIA is a field.
21. A lattice 9 is distributive if a
+
+
1. Monics in 9 i ~ are q all 1 : l . (Hint: If f: R + R‘ is monk define a ring structure on
the Cartesian product R x R by componentwise operations and let T = { ( r l r r 2E) R x R: f r , = f r , } . Then in1 = fn, where ni: T+ R is the projection on the i component.) The proof of this exercise introduces two important constructions-the direct product and the pullback. 2. Given an object A of V one can define the constant functor FA:I + V given by F’i = A for all i E I and FAf = 1 , for all morphisms f. Any morphism g : A + B yields the natural transformation g: FA + Fs sending i to g. Now define the diagonal functor 6: V + given by 6A = FA and 6g = g. 3. Interpret example 0.1.13 when I is a set with the discrete PO, viewed as a small category as in example 0.1.1.
1. By comparing annihilators, show Z has nonisomorphic simple modules. 2. If f : M + N is epic and kerf and N are f.g. R-modules then M is also f.g. 3. If M is a f.g. R-module and A Q R is f.g. as left ideal then AM is f.g.
(Hint: If M =
1Rxi then AM = 1Axi.)
1
Constructions of Rings
There are several general constructions of rings and modules which play a central role in the theory of rings and which also provide many interesting examples and applications. In this chapter we consider these basic constructions, along with a little theory needed to shed light on them. The different constructions used are enumerated in the section headings.
$1 Matrix Rings and Idempotents It is fitting to start the main text with a discussion of matrices, since they are undoubtedly the most widely studied class of noncommutative rings. Although matrices are fundamental in the structure theory, we shall postpone most structural considerations until the next chapter, contenting ourselves with examining the elementary properties of matrices. Define the Kronecker delta 6, to be 0, unless i = j , in which case dii = 1.
Matrices and Matrix Units Definition 1.1.1: We define M,,(R), the ring of n x n matrices with entries in a given ring R, as follows: each matrix is written as (rij)where rij denotes the i-j entry for 1 Ii, j I n (with n presumed to be understood); addition and
29
Constructionsof Rings
30
multiplication are given according to the rules:
(ri,?))+ (r:)) = (ri,!’
+ rij’)
and
We delete the verification that M,,(R)is indeed a ring, analogous to the familiar special case when R is a field; moreover, towards the end of 51.2 we shall lay down general principles which at once imply M,(R) is a ring. We obtain a more explicit notation by defining the n x n matric unit eij to be the matrix whose i-j entry is 1, with all other entries 0. Thus (rij)= j = rijeij; addition is componentwise and multiplication is given according to the rule
I:,
(rieijNr2euu) = 4dr1r2)eiv
The set of n x n matric units is a base of M,(R) as R-module (with scalar multiplication given by r(rij)= (rrij)). Note that if a = (rij) we then see rijeuu= euiaej,, a very useful computation which pinpoints the entries of a. A scalar matrix is a matrix of the form reii.The set of scalar matrices is a subring of M,(R) which shall be identified with R under the isomorphism r --t x r e i i , and it is the centralizer of {eij: 1 5 1, j In}. (Indeed if a = (rij) commutes with each eij then ruieuj= aeiJ= eija = r p i , so matching entries we get rui = 0 = rjUunless u = i and u = j. For u = i and u = j we get rii = rjj for all i, j, implying a = rlreii.) In particular, Z(M,,(R)) = { zeii:z E Z(R)} and eii = 1 in M,,(R), leading us to an important internal characterization of matrix rings.
XI=
x:=l
I:=
1
Defnition 1.1.2: A set of n x n matric units of a ring T is a set {eij: 1 5 i, j I n} c T
such that
eii = 1 and eijeku = djkelufor all i, j, k, u.
Surprisingly, the existence of a set of n x n matric units makes any ring T an n x n matrix ring over a suitable ringR; the trick in the proof is to find some intrinsic description of R. Since the idea recurs, let us describe it briefly. If we already know that T = M,,(R) and if a = (rij)E T then clearly euiaeju;also it is useful to note the scalar matrix corresponding to riJ is rijei, = ei,aejj.
Proposition 1.1.3: T has a set of n x n matric units iff T % M,,(R) for a suitable ring R.
81 Matrix Rings and ldempotents
31
Pro08 (e) by definition of the eij.(a) Conversely suppose {eij: 1 Ii, j In} is a given set of matrix units of T. Let R = eulaelu:aE T}. R is a subring because it is closed under subtraction, and 1 = euu= x e u l l e l uE R and ( ~ e u l a e l u ) ( ~ e , l b e=u~l )e u l ( a e l l b ) eEl uR. It remains to define the euiae. = isomorphism cp: T + Mn(R). Given a in T put rij = JU eul(eliaejl)eluE R and define cpa = (rij).Clearly cp is an additive group homomorphism. Moreover,
{c:=
c:=,
I:=,
c:=,
r..e.. v v=
so cp(
n
C e .ae. e.. = 16 .e .ae..= e..ae.. n
u=l
U1
JU
lJ
u= 1
U1
UI
JJ
I1
JJ9
xi, rijeij I;, eiiaejj (Ceii)a( ejj) a, implying is 1 1; likewise, 1rijeij) (rij)so is onto. Finally the i-j term of cp(ab) is =
=
=
=
j=
cp
:
cp
eiiabejj= eiiU
n
n
k= 1
k= 1
1ekkbejj =
(eiiaekk)(ekkbejj)
implying cp(ab) = cpacpb, so cp is a ring isomorphism.
Q.E.D.
There are many close ties between the structure of a ring R and Mn(R), some of which we give now (also, cf., exercise 1). Proposition 1.1.4: Let Mat,, denote the full subcategory of B i ~ g whose objects are rings of n x n matrices. Then there is an isomorphism of categories F : 9 i B g + Aat, given by FR = Mn(R)where for any morphism f:R + R’ we dejine Ff: Mn(R)+ Mn(R’)by (Ff )(rij)= (frij).
Pro08 F f is indeed a ring homomorphism, since It follows at once that F is a functor, and its inverse G is given by GMn(R)= R where for any morphism g: Mn(R)+ M,(R’), Gg is given by the restriction to the scalar matrices. Q.E.D. For any subset S of R we let M J S ) denote the matrices whose entries lie in S. Proposition 1.1.5: There is a lattice isomorphism f: {idealsof R } + {ideals of M,(R)},gioen by f A = Mn(A). Proofi Suppose A 4R. Then Mn(A) is an additive subgroup of R, and the multiplication formula of matrices shows Mn(A)4M,(R). If B c A
32
Constructionsof Rings
then M,,(B) c M,,(A), so f is order-preserving, and it remains to find an order-preserving inverse. If I Q M,,(R) define g l = I n R (identifying R with the scalar matrices). Clearly, gf = 1, and to prove fg = 1 we must show that if a = (ri,) E I then each scalar matrix rijC:= e,,,, E I for every i,j. But Q.E.D. rijz:= euu= euiae,, E I, as desired.
c:=
There is a useful way to reduce the size of matrices, called partitioning, described as follows: Remark 2.1.6: Suppose n = mt. If R = M,(T) there is an isomorphism
f: M,,(T)+ M,,,(R) sending a = (a,,) to the t x t matrix (r,,,) where I,, = 1)+ Cy’r(Vaijeij. (Indeed f is clearly an isomorphism of
xYzt(,,-
additive groups; the straightforward but messy verification that f preserves multiplication is left to the reader. Note that f merely subdivides the matrix a into m 2 matrices, whence the name “partitioning.” The procedure can be done more generally, cf., exercise 3.
M,,(R) has extra structure obtained from the transpose t : M,,(R)+ M,,(R) defined by (rij)‘= (Iji). Rather than go into the structural implications now, we merely note that the transpose is an additive group homomorphism satisfying the properties (ab)‘= bra‘ and (ar), = a for all matrices a and b. The theory of matrices over fields should be familiar to the reader. There are ready extensions of the basic theorems to matrices over arbitrary commutative rings.
Subrings of Matrix Rings As we shall see later, there are large classes of rings which can be viewed as subrings of a matrix ring over a commutative ring. Here we consider examples of such rings. Example 1.1.7: Hamilton’s algebra W of real quaternions over R is defined as the 4-dimensional vector space (over R) having base l,i,j,k, subject to the conditions i 2 = j z = k 2 = - 1 and ij = -ji = k. One could, in fact, prove directly that multiplication is associative and distributive over addition, but it is quicker to display W as an 08-subalgebra of M,(C). Indeed,
taking A =
{(
-Y
!):x, y E C} x
-
c M,(C), where denotes complex con-
jugation, one sees A is a subring of M 2 ( C ) because it is closed under
41 Matrix Rings and Idempotents
33
multiplication, addition and subtraction. Hence A is an R-subalgebra and
so A is Hamilton’s quaternion algebra. This way of viewing
shows quickly that W is a division ring. Indeed,
xx zero element.
+ yy
W also
(-5 ;)(f -:)=
# 0 so we have constructed the inverse of each non-
Example 1.1.8: We give some general classes of subrings of M,(R)
(i) The ring of scalar matrices (isomorphic to R ) (ii) The ring of diagonal matrices (i.e., all i-j entries are 0 except for i = j ) (iii) The ring of (upper) triangular matrices (i.e., all i-j entries are 0 except for i Ij ) (iv) Those matrices (Iij)where rij = 0 unless i =j or i = 1 (v) Those triangular (rij)such that r l l = r Z 2= ... = r,, E Z ( R ) (vi) More generally, if T is a subring of the ring of diagonal matrices and A 4R , take the subring of triangular matrices consisting of each (rij)whose diagonal lies in T and whose off-diagonal entries each lie in A. (vii) Those matrices (rij)with rij = 0 unless nu-, < i, j s nu for suitable u (where 1 u I t and we are given 0 = no < n, < ... < n, = n. These matrices decompose into blocks of lengths nu - nu- .)
Matrices Whose Entries Are Not Necessarily in Rings One should observe that the ring structure of matrices did not require all the entries to lie in a ring. In particular, if we formally consider set of 2 x 2 matrices of the form
(: :)
(;
;),the
where a E A, b E B, c E C , d E D,
we see that addition of matrices require A , B, C, D, to be additive groups; multiplication merely requires various actions on the sets permitting us to define the product, with associativity and distributivity holding wherever possible. More explicitly, we have the following situation. Example 1.1.9: Suppose R, T are rings and M E R - A d - T . Then the mod-
ule operations make
(: ):
into a ring. (Indeed, one can define multi-
plication since if ri E R, x i E M , and si E T we have
34
Constructionsof Rings
and associativity and distributivity come from the given ring and module properties (exactly as usual for matrices). This example provides a wealth of interesting examples, several due to Small and Herstein, so we shall analyze its left ideal structure. Suppose Q is a left ideal of R M If X Y E Q then o z O T
( ). ( ) (7 :)=('
O)t
0 0 0 2 ')cQ
Thus Q = A
+ Le,,,
where A is an R-submodule of
(R ):
(viewed as
R-module by scalar multiplication, as usual) and L is a left ideal of T such that MLe,, G A. Conversely, any such set A + Le,, is a left ideal of
(u"
:)*
Analogously, the right ideals of
(R );
B is a right T-submodule of
+ Pel, where
, P is a right ideal of R, and
PMe,, z B. Consequently, the ideals of
have the form B
(f
F)
have the form
(i r)
where
P Q R, L Q T, and N is an R-T bimodule of M satisfying ML k N and PM E N. The reason we are interested in this example is that when R and T are suitably restricted, the left-right ideal structure is reflected in the bimodule structure of M, which can easily be arranged to be very asymmetric; in this manner one can often find a phenomenon occurring in the left ideal structure
of
(," );
but not in the right ideal structure. This theme will be pursued
35
$1 Matrix Rings and Idempotents
at times in the text; for the time being, the reader is invited to experiment with this example in the following two cases: (i) R E T and M = T; in particular when T is a field. (ii) T is a homomorphic image of R and M = T (viewed as R-module as in remark 0.0.9). Example 1.1.10: (Preview of the Morita Ring) Suppose R, T are rings with M E R-Mod-T and M‘ E T - A d - R . In order to define multiplication on
(L,y )
one needs compositions M x M’ + R and M’ x M + T which
we denote here respectively as ( , ) and [ , 1; i.e., for x E M and x’ E M’ we have (x, x’) E R and [x‘,x] E T. We define addition componentwise and multiplication in the following natural manner:
(a :j(:z): (
1112
= x;rz
+ (x,,x;) + six;
r1xz [x;,x,l
+ XlSZ + SlS2
).
Distributivity of multiplication over addition requires the forms ( , ) and [ , ] to be additive in each component, e.g., (xl + xz,x’) = (xl, x’) + (xz,x’), whereas associativity requires the following extra conditions: r(x, x’) = (rx, x’), (xs, x’) = (x, sx’), (x, x’)r = (x, x‘r) s[x’, x] = [sx’,
XI,
[x’r, x] = [x’, r x ] , [x’,x]s = [x‘, xs].
The Morita ring plays a key role in the structure of R-&ud, in addition to providing a huge class of interesting examples (and in fact yielding example 1.1.9 when we take M’ = 0).
Idempotents and the Peirce Decomposition An element e of R is idempotent if ez = e. Idempotents play an important role in ring theory and are closely linked to matrices since the matric units eii are idempotent. In the next few pages we shall study some general properties of idempotents and their impact on matrices and matric units. First note 0 and 1 are always idempotents and so are called trivial idempotents. Idempotents e and e‘ are orthogonal if ee‘ = e‘e = 0. If e is idempotent then 1 - e is an idempotent orthogonal to e. Lemma 1.1.11: Suppose e E R is idempotent.
(i) If L is a leji ideal of R then L n eR = eL. (ii) If A Q R then A n eRe = eAe.
36
Constructionsof Rings
Proof: (i) If er E L n eR then er = e(er)E eL, proving (C); (2) is obvious. (ii) As in (i). Q.E.D.
Proposition 1.1.12: Suppose e is an idempotent of a ring R. Then eRe is a ring with multiplicative unit e. Moreover, there is an onto lattice map $: {ideals of R} {ideals of eRe} given by A + eAe. Proof: Clearly eRe is a ring. To see $ is a lattice map note $ ( A + B ) = eAe + eBe = $ A + JIB $ ( A n 8) = e ( A n B)e = A n B n e R e = and ( A neRe) n ( B n eRe) = $ A n $B. If I 4 eRe then I = (eRe)I(eRe)= eRIRe = $(RIR), proving $ is onto. Q.E.D.
Thus we see that eRe and likewise ( 1 - e)R(1 - e) are rings whose ideal structures are at least as nice as that of R, and we are led to study R in terms of these rings, One useful link is the following straightforward result. Proposition 1.1.13: (“Peirce decomposition”) I f e is an idempotent of R then R = eRe 0 ( 1 - e)Re Q3 eR(l - e) 0 ( 1 - e)R(1 - e) as Abelian groups. Proof: For r in R take r , = ere, r2 = (1 - e)re, r3 = er(1 - e), and r4 = ( 1 - e)r(l - e); then ( r , r2) (r3 + r4) = re r(1 - e) = r. If r = r; + r; + r; rk is another such decomposition then erge = e((1 - e)Re)e = 0 and likewise erie = erbe = 0 so r; = erie = e(r; + r; r; + rb)e = ere = r,; Q.E.D. likewise r; = ( 1 - e)r;e = (1 - e)re = r2 and so forth.
+
+ +
+
+
Example 1.1.14:
(i) IfR=M,(T)ande=e,, theneRex Tand(1 - e ) R ( l - e ) x M , - , ( T ) , and the Peirce decomposition is the usual partitioning of the matrix. (ii) The Morita ring of example 1.1.10 has an idempotent e = and the Peirce decomposition partitions
G,F)
(: :),
into its components
(although of course this ring does not have a matric unit e12). Thus the Peirce decomposition enables us to analyze rings “resembling” matrix rings. (iii) If e E Z ( R ) then Re x eRe is a ring. In this situation we can refine the Peirce decomposition.
91 Matrix Rings and Idempotents
37
Proposition 1.1.14: R x R1 x x R, as rings ij,T there are pairwise orthogonal idempotents e, in Z ( R ) such that e, = 1 and Ri Re, for each i. Proofi (+) Identifying R with R, x ... x R, take e, = (0,..., 0,1,0, ..., 0) where "1" appears in the i position. Clearly ei E Z(R). (e) Let Ri = Re,, and define cp: R + Ri by r H (rel,. . .,re,). cp is a surjection since ( r ,e, ,. . .,r,e,) = cpf riei);Jl is an injection since if Jlr = 0 then each rei = 0 so r = rCe, = 0. Q.E.D.
1
n:=
Idempotents and Simple Modules Proposition 1.1.15: Suppose e is an idempotent of R. There is a functor F: R - A d + e R e - A o d given by FM = eM where for any map S:M + N , we take F f to be the restriction of f to eM. Moreover, if M is simple in R - A u d with eM # 0 then eM is simple in eRe-Aod (so F "preserves" simple modules not annihilated by e). Proofi The first assertion is immediate since (eRe)eM c e(ReM) 5 eM. To prove the second assertion note for any x in M with ex#O that (eRe)ex= e(Rex) = eM. Q.E.D. There is a converse for idempotents of matrices. Proposition 1.1.16: If M E R - A o d we can view M(") in M,,(R)-Aod by defining addition componentwise (i.e., (XI,.
.. ,x,)
+ (xi,. . . , x i ) = ( x l + x;, ..., x , + xh))
and multiplication by
Thus we get a functor G: R - A u ~ - + M , ( R ) - A by u ~GM = M("),where for any map f:M -+ N we define Gf:M(")-+ N(")componentwise. Proofi First note that the scalar multiplication we have defined is merely as n x 1 matrices, so matrix multiplication if we view the elements of M(") the straightforward verification that M(")E M , , ( R ) - A d is a special case of a well-known matrix argument. (This idea is generalized in exercise 3.) To see that G is a functor we note that G j is a map because putting h = Gf
Constructions of Rings
38
Theorem 1.1.17:
R - A u d and M , ( R ) - A u d are equivalent categories.
Proofi Identifying R with e,,Mn(R)ell let V = R - M u d and 9 = M,(R)A d . By proposition 1.1.15 and 1.1.16 we have functors F: 9 + V (taking e = el 1) and G :V + 9, so we must prove FG and GF are naturally isomorphic, respectively, to 1, and 1,. If M E R - A d then FGM = {(x,O,. . . ,O):x E M } so there is a natural transformation q: 1 + FG given by qHx = (x,O,. . .,O); each qH is clearly an isomorphism. Conversely, if M E M , ( R ) - A o ~then GFM = {((xl,O,...,O),.. ., (x,,O,. . . ,O)): ( x l , ...,x,) E M } so there is a natural isomorphism q': 1 + GF given by ~ t ( x l , . ,.x , ) = ((~1,0,. ..,O),...,(x,,O,.
. .,O)).
Q.E.D.
This is our first example of equivalent categories which are not isomorphic and will be fundamental to the study of equivalent categories (and the Morita theory). Once we know two categories are equivalent we can use the equivalence to transfer various categorical properties from one category to another, as illustrated in the next result. (Many more examples will be given in the treatment of Morita theory.) Corollary 1.1.18: M is simple in R - A u d iff M(")is simple in M , ( R ) - A o d .
M is simple iff each nonzero map f: M + N is monic. Since FG and GF are naturally isomorphic to the respective identities (notation as before), one sees easily that G preserves this categorical property, so M is simple in R - A u d iff M(")= GM is simple in M , ( R ) - A u d . Q.E.D.
Proofi
A more concrete proof of this result is given in exercise 4. The passage from M to M'") can be applied to reduce proofs about f.g. modules to the cyclic case, along the following lines: Remark l.Z.19: If M is spanned over R by the elements x l , . .., x n then M(") is cyclic in M , ( R ) - A u d , spanned by the element Jz = (xl,. ..,xn). (Indeed eijZ has x, in the i-th position.)
$1 Matrix Rings and Idempotents
39
Primitive Idempo tents An idempotent e is primitive if e cannot be written as the sum of two nontrivial orthogonal idempotents.
Remark 2.1.20: If e,,e, are orthogonal idempotents then Re, R(e, + e,) since el = el(el e,) and e2 = e2(el + e,).
+
+ Re, =
,
In particular, we see el is a primitive idempotent of M,,(F) for any field F (because e l , has rank 1). To understand this notion better, we look more closely at orthogonal idempotents. If el,e2 are idempotents with e2el = 0 then (1 - el)e2 is an idempotent orthogonal to e l , by an easy computation.
Proposition 1.1.21: An idempotent e of R is primitive iff there is no idempotent el # 0 such that Re, c Re. In fact, if Re, c Re then there is an idempotent e; such that Re, = Re', and e',, e - e', are orthogonal. Proof: We prove the second assertion, since the first is then an immediate consequence. Take e', =ee,ERe,cRe. Then e;e=e;, so (e;),=e;(ee,)= (e;e)el = e',el = ee: = eel = e', is idempotent. Also el = e: = (ele)el = ele', E Re', so Re, = Re',. Finally, e', = ee;e E eRe implying e - e', is an Q.E.D. idempotent orthogonal to e;.
Lifting Matrix Units and Idempotents Remark 1.2.22: If cp: M,,(R)+ T is a ring homomorphism then T x M,,(R') for a suitable ring R'. (Indeed {cpeij:1 < i,j I n} is a set of n x n matric units of T, so we are done by proposition 1.1.3.) Next we consider the converse: If R = T/A is an n x n matrix ring (i.e., has a set of n x n matric units) then is T a n n x n matrix ring? This question arises often in structure theory and can be handled in three stages. First note for any given set of matric units {eij:1 I i,j I n} that the eii are orthogonal idempotents. Thus we are led to ask (1) if every idempotent e of R has a preimage in T which also is idempotent, i.e., if e can be lifted to an idempotent of T ; (2) if a finite set of (pairwise) orthogonal idempotents can be lifted to orthogonal idempotents; and (3) if we finally can fill in a set of matric units. Surprisingly, the first question is hardest to handle, so we start by assuming it is solved.
40
C o n s ~ t i of o ~Rings
Definition 2.2.23: are satisfied:
A a T is idempotent-lifting if the followingtwo conditions
(i) 1 - a is invertible for all a in A ; (ii) every idempotent of T/A has the form x in T.
+ A for suitable x idempotent
Remark 2.2.24; If A satisfies (i) above then 0 is the only idempotent of A (for if a' = a E A then a = a(1 - a)(l - a)-' = 0).
Proposition 1.1.25: Suppose A 4 T is idempotent-lifting and R = T/A.
+
(i) If x, E T is idempotent and e E R is an idempotent orthogonal to x1 A then e can be lifted to an idempotent of T orthogonal to xi. (ii) Every countable set of (pairwise) orthogonal idempotents of R can be lifted to a set of orthogonal idempotents of T. (iii) Every set of n x n matric units of R can be lifted to a set of n x n matric units of T. Proofi
(i) Take X E T idempotent with e = x + A. Then xxl + A = e(xl + A ) = 0 so xxlEA, and we can form x'=(l -xx,)-'x(l -xxl) which is also idempotent and lies over e. Moreover, since x(l - xxl) = x - xx, = x(l - xl), we see x'xl = 0 so x2 = (1 - xl)x' is idempotent and lies over e, and x2x1 = 0 = X l X ' . (ii) Inductively, suppose we have lifted e l , . ..,e,- to orthogonal idempotents xl,. ..,xu- and want to lift e, to an idempotent xu orthogonal to x l , ...,xu-1.Let x', = xi and e = e,; by (i) we can lift e, to an idempotent xu orthogonal to x i . But for all i I u - 1 we have x;xi = xix: = xi, so x,xi = x,(x;xi) = 0 and xix, = (x,x;)x, = 0. (iii) Having lifted e l l , ...,en, to orthogonal idempotents x1,,. ..,xnn,we must also lift the eij to xij for i # j . Take bij in T with b, + A = eij. Define xil = xiibilxl, and a, = x l l - blixil. Then ai + A = e l , - e l i e i l = 0 so a, E A ; let d, = ( 1 - ai)-' and put xli = diblixii. Then xli lifts e l i and xlixil=dibrixiixil =diblixilxll= d i ( x l l -ai)xl, =d,(l -ai)xll = x l l . Hence ( x i , - xi1x1i)2 = x i - xiixilxli- xilxlixii+ (xilxli)'= xii - xilxli is an idempotent in A so is 0, implying xilxli= x i i . Then put xtj = xilxlj,a set of Q.E.D. matric units lifting eij.
,
c;:,'
The main tool for lifting idempotents involves an algebraicity condition.
81 Matrix Rings and Idempatents
41
Proposition 1.1.26: Suppose r E R and there exists a = x f = o z i r i for zi in Z ( R )such that r" = ar"". Then e = (ar)" is idempotent and, moreover, in any homomorphic image R in which 7 is idempotent we have 2 = E Proofi By induction we have r " = amrm+"for all m 2 1. Hence e2
= (ar)2"= an(anrn+n)= an r n -e.
If Fis idempotent then 2 = iinF2" = F" = E
Q.E.D.
To continue this idea to its conclusion we call an element r of R nilpotent if some power r' = 0; S c R is nil if every element is nilpotent (not necessarily with respect to the same t). If a' = 0 then (1 - a)(l
Remark 2.1.27: invertible.
+ a + ... + a ' - ' )
=1
so 1 - a is
Corollary 1.1.28: Every nil ideal A of a ring R is idempotent-lifting. In fact, i f 7 = r + A is idempotent in RIA then there is an idempotent e in the subring of R generated by r, satisfying Z = E Proof: Condition (i) follows from remark 1.1.27; to see (ii) we note that if x + A is idempotent then x 2 - x E A so 0 = ( x - x2)" = x" - nx"' + ... for suitable n; hence proposition 1.1.26 produces an idempotent lifting x + A. Surprisingly, one may not be able to lift an uncountable set of orthogonal idempotents modulo an idempotent-lifting ideal. Example 2.2.29: (Zelinsky [54]) A ring R with N Q R such that N z = 0 (so that N is idempotent-lifting), where RIN has an uncountable set of idempotents which cannot be lifted to an uncountable set of idempotents of R. Let F be any field and let R be a vector space over F with basis {bij,ei:i, j E I } given multiplication by the rules ez = e,, eiej = bij for i # j , e,bjk = 6,bik, bije, = hjkbi,, and b,b,, = 0. One checks readily R E F - d t g when multiplication is extended by distributivity to all of R. (To verify this the reader could use the criteria given towards the end of the next section.) Moreover, the subspace spanned by the b, is clearly an ideal N with N 2 = 0, and R = R / N has a set = {gi:i E I } of orthogonal idempotents. We shall show S lifts to an orthogonal set of idempotents {di:i E I } only if I is countable. Indeed, suppose we have the d i , and put x , = d , - e , ~ N since Zi=O. Let I ( i ) = { j E I : eixj = 0). Since any xi is a linear combination of a finite number of b,,
s
Constructions of Rings
42
we see by the multiplication table that for any j the set { i E I: eixj # 0} is i ) I. Also finite; hence for any infinite subset K of I we must have U i p K I (= define I’(i) = { j E I : xiej # 0 } which likewise is finite. But for i # j 0 = didj = (ei + xi)(ej+ x j ) = b,
+ eixj + xiej.
I f eixj = 0 then xiej = -bij # 0 so each I ( i ) E l’(i) is finite. Therefore I = UieKZ ( i ) is countable (seen by taking K infinite and countable), as desired. Eckstein [69] has a different method of obtaining the above results (and more) by means of semigroups.
81.2 Polynomial Rings This section features a very important construction, the monoid ring, which leads to huge classes of important examples. Of particular significance is the polynomial ring, a special case. Later on we shall see how to view the monoid ring in a more general setting. We start with a module construction over a ring R. Definition 1.2.1: Given a set S we form the R-module freely generated by S, denoted as RS, to be the set of formal expressions { rss:r, E R, almost all r, = 0}, endowed with addition and scalar multiplication defined “componentwise,” i.e.,
zseS
Cr,s
+ C r i s = C ( r s + r:)s
rCr,s = z(rr,)s,
where r E R. {s E S : r, # 0} is called the support of C r,s. For notational convenience, we identify each element s‘in S with the expression z e s r s s where r,, = 1 and all other rs are 0. Thus we view S as a subset of RS. Remark 1.2.2: RS is indeed a module. (Verifications are componentwise.) Later on we shall identify RS with the “free” module, but let us note that any element f = r,s of RS can now be viewed as the finite sum of those r,s for which s E supp(f); these r,s are called the terms of f, and r, is called the coeflcient of s (in R). Thus any element of RS is written uniquely as a linear combination of elements of S.
1
Monoid Rings We are interested in defining a ring structure on RS. To this end we first define multiplication on terms and extend it to arbitrary elements by distributivity. This is done easily when S is a monoid. Then we define the product
81.2 Polynomial Rings
43
of terms (r,s)(r$) = (r,r;)st
and more generally
where the inner sum is evaluated over all s, t in the respective supports such that st = u. We denote this ring structure as R [ S ] , called the monoid ring. When S is a group R [ S ] is called a group ring.
Proposition 1.2.3: The monoid ring R [ S ] is indeed a ring, whose unit element is lS, the unit element of S. Furthermore if R E C-dif" then R [ S ] is an algebra with scalar multiplication c r,s = E(cr,)s. There is an injection R R [ S ] given by r H rl,; Hence S centralizes R in R [ S ] .
1
We leave the straightforward but messy proof to the reader, noting that it is essentially the same proof the reader has had to plough through to show that the polynomials in one indeterminate over a field form a ring. There is one monoid of special interest. Assume throughout I is a wellordered set. Example 1.2.4: The word monoid on a well-ordered set 1. A word is a formal string w = (il ... i,,,); m is called the length, and max{i,: 1 I u I m} is called the height. Multiplication of words is formed by juxtaposition, i.e., (il * * im)(i',* . . ib)=(il * i,i; .. . ib), and is obviously associative. We get the word monoid by formally adjoining a unit element, written as ( ) and called the blank word. One may think of the blank word as having nothing in it and thus being of length 0, thereby yielding Remark 1.2.5: For any two words w l , w 2 we have length (w1w2)= length w1 + length w2 and height ( w l w 2 )= max(height wl,height w2). In case i repeats in a word, we write i' for i - . . i, taken t times.
Polynomial Rings Example 1.2.6: Suppose I is a singleton {A}. Then every word has the form A' for some i 2 0 (writing ' 1 for the blank word), and putting S = (2: i E N} we write R [ S ] as R I I ] = { C r = , r i A i : u ~ ~ , r i €the R } ,polynomial ring ouer R (in one commuting indeterminate), denoted R[A]. Note that A E Z ( R [ 1 ] ) .
44
Constructionsof Rings
When trying to generalize example 1.2.6 to form polynomials in several indeterminates, one has to decide whether or not one wants the indeterminates to commute with each other. We consider the cases separately. Example 2.2.7: Define X = {Xi:i E I}, where the Xi are formal symbols, called (noncommuting) indeterrninates. Clearly X and I are in 1:l correspondence, so we can well-order X by means of the well-ordering on I and form a word monoid S on X. The words (in the Xi) are called pure monomials; if C is a commutative ring then C[S] is written instead as C{X} = { c(i)Xil. .* Xim(i),where (i) denotes the word i, * im(i)of length m(i) (allowing repetitions), and qi)E C for each (i)}. The elements of C{X} are called noncommutative polynomials and C{X} is called the free C-algebra. In case I is finite, i.e., I = {il ,...,if}, we shall denote C{X} as C{Xl ,...,Xt}. In the current literature C{X} is usually denoted as C(X), cf. example 1.9.22below.
xfinite
To obtain commutative polynomials we could define inductively RCA,,. .., A f ] =(R[A,, . . .,Af- , ] ) [ A f ] , iterating example 1.2.6. However, from our point of view we should like to display this ring as a monoid ring preferably using words. To do this we examine words a little closer. Dejnition 1.2.8: A partial order I on words is defined inductively on the length, as follows: For arbitrary words w=(i, i,) and w'=(i; ih) which are not blank, w < w' if either i, c i', (in I) or i, = i; and (iz... i,) < (i; ib) (defined inductively), 1 . -
1 . .
For example, if I = {A, B, . ..,Z} with the alphabetic ordering then ACT < AT, but ACT and ACTION are not comparable. The reason we do not use the customary lexicographic (total) order is to make the following remark true: Remark 1.2.9: If w c W' and w,, w2 are arbitrary words then w l w c wlw' and wwz c w'wz. Nevertheless, I induces a total order on the set of words of a given length. A word w is basic if for each w' obtained by interchanging two letters, we have w I w'. For example, BEEN is basic since BEEN IEBEN, BEEN, EEBN, NEEB, BNEE, BENE.
Remark 1.2.10: (i, .*aim)is basic iff i, Ii, I ... Ii,; hence for every word w there is a basic word which we call Bw, obtained by rearranging its letters
81.2 Polynomial Rings
45
in increasing order. If w' is obtained by rearranging the letters of w then
Bw' = Bw. Definition 1.2.11: The symmetric word monoid on I is {Bw:w is a word on I } (including the blank word) under multiplication defined by w 1 w 2 =
B(w,WZ). The symmetric word monoid on I is a commutative monoid, since associativity and commutativity follow from remark 1.2.10: B(B(w,w2)w3)= B(w,w2w3)= B(wlB(w2w3))and B(w,w2)= B(w2w1)). Definition 2.2.22: Put 1= {Ai:i E 2 ) and let S be the symmetric word monoid on A. Then R [ S ] is denoted as R[A] and is called the polynomial ring over R on the commuting indeterminates ,Ii, i E 1. The words of S are called pure monomials. If 1= {A,,. ..,A,} we write R[1,,. . .,A,] instead of R[A]. To obtain further results we examine special kinds of monoid rings, introducing the notions of ordered monoid and filtration. Definition 1.2.13: A monoid S is ordered if S has a total ordering Isuch that whenever s < s' we have sls < sls' and ssl < s'sl for all s1 in S. A C-algebra A has a filtration by an ordered monoid S if A is the union of C-submodules {A(s):s E S} such that (i) A(s) =) A(s')
for all s < s' in S,
(ii) A ( s , ) A ( s 2 )s A ( s , s 2 ) (iii)
for all s1,s2 in S,
~ ( s= ) 0. seS
Note that if s1 < s; and s2 < s; then s1s2 < s;s2 < s;s;. Remark 1.2.13': The most important case in the literature is for S=(iZ, +), i.e.; A ( - l ) ? A ( O ) z A ( l ) z . . . . O f t e n A ( O ) = A ( - l ) = A ( - 2 ) = . . . = A, so we actually have a filtration over N. However, there are situations in which A(1) = A(2) = ... = 0, so we have instead a filtration by the negative integers. In the latter case we could write A, for A ( - n ) , and so ( i ) becomes A, G A, for m 5 n. At times this is used as the definition for filtration in the literature. Definition 2.2.14: The filtration of A by S is valuated if for each a # 0 the set {s E S: a E A ( s ) } has a maximal element, which we denote ua, thereby defining a function v : A - ( 0 ) S .
Constructions of Rings
46
In order to include 0 in the domain of u, we adjoin a formal element m to 0000 = m and sm = 00s = co > s for all s in S, and write S, = S u { m}. Putting VO = m we now have a function f: A + S,, where ua = 00 iff a = 0. The point of considering valuated filtrations lies in the following observation: (Sometimes this is called a “pseudo-valuation.”) S with
Remark 1.2.15: For any ai in A, u(ala2)2 (ual)(ua2). If u is a monoid homomorphism then for all nonzero a1,a2 in A, u(ala2) = (ua1)(ua2)E S implying ala2 # 0; thus A is a domain. We shall use this remark to obtain many examples of domains and start by applying it to monoid rings. Example 1.2.16: If R E C-dt’ and S is an ordered monoid then A = R [ S ] has the filtration given by A(s) = x ( R s ’ : s ’ 2 s), which is valuated since for a = r,s we see ua is the minimal s in the support of a; the corresponding r,s will also be called the lowest order term of a.
1
Proposition 1.2.17: If R is a domain and S is an ordered monoid then R [ S ] is a domain. Proofi Let risi denote the lowest order term of ai in A = R [ s ] for i = 1,2. Then ( r l ~ l ) ( r 2 ~ 2 ) = ( r l r 2 ) ( ~ 1 ~and 2 ) #is0 the lowest order term of ala2 since S is ordered. Thus u of remark 1.2.15 is a monoid homomorphism implying RCS] is a domain. Q.E.D. As we see, the idea of using the lowest order term to examine monoid rings (over ordered monoids) is very useful, and we shall also have occasion to use the highest order term.
Example 1.2.18: (Making the word monoid an ordered monoid). Define the following order on words: w <w’ if length ( w ) (length (w’), or if length w =length w’ and w is less than w’ according to definition 1.2.8. In other words, we sort words j r s t according to length and afterwards we order words of the same length. In view of remark 1.2.9 one sees easily that this ordering is total and satisfies the requirement of definition 1.2.13. Moreover, ordering the basic words in this manner, we also see the commutative word monoid also becomes an ordered monoid. Thus the noncommutative polynomial ring and commutative polynomial ring are monoid
51.2 Polynomial Rings
47
rings over ordered monoids, proving Proposition 1.2.19: If R is a domain then R{X} and R [ L ] are domains (Instant application of proposition 1.2.17.)
Some results relating R and R [ S ] do not require any additional assumptions on S. For any A E R we write A [ S ] in place of A S = { z f i n i t e a i s i : a, E A , si E S}. Proposition 1.2.20:
(i) I f 1 4 R then I [ S ] 4 R [ S ] and R [ S ] / I [ S ] M ( R / I ) [ S ] ; (ii) Z ( R [ S ] )E Z ( R ) [ S ] ,equality holding iff S is commutative.
Proof: (i) Define cp: R [ S ] + ( R / I ) [ S ] by c p ( 1 risi) = Fisi where Fi = ri + I . By inspection cp is a ring surjection and I [ S ] = ker cp 4R [ S ] . (ii) Write 2 = Z ( R ) . If I r i s i E Z ( R [ S ] ) then for all r in R , x ( r r i ) s i = ( r l ) I r i s i= ( C r i s i ) r l = I ( r i r ) s i implying rr, = rir for each i, so ri E Z and x r i s i E Z [ S ] . Conversely, for S commutative clearly S E Z ( R [ S ] ) so Z [ S ] G Z(R[S]). Q.E.D.
1
Example 1.2.21: The category ring. We can extend the construction of R [ S ] to an arbitrary semigroup S , but now R [ S ] may lack a unit element. There is one important situation where the unit element exists, and so R [ S ] is indeed a ring. Namely consider a category W with a finite number of objects, and let S be the disjoint union Hom(A, B). S is a semigroup whose multiplication is composition; precisely, given f:A + B and g : A’+B’ we define g f to be the composition when A’ = B and to be 0 otherwise. The unit element is l,, since for any f:A’ + B’ we have (IAEO 1,)f = 1,f = le.f = f‘. The ring R [ S ] is denoted R [ W ] and is especially useful when % is formed from a directed graph. (The objects are the vertices, and the arrows are the morphisms.)
UA,BEObY
xAEObw
To illustrate how wide-ranging this example is, let us display M,,(R) as a category algebra over R. Namely consider the category % having n objects v l , . . . ,v,, such that Hom(vj, I+)is always a singleton, which we denote as eij, with eijejk=eikfor all i,j, k. In R [ % ] we have eijeuU=djue,,,and ~ ~ eii= =1 , as noted above. Thus { e i j }are a set of n x n matric units for R[%] x M,,(R).
Constructions of Rings
48
Rings of Formal Power Series and of Laurent Series Often we are interested in embedding the monoid ring R[S] into a division ring. To this end we want to start with a larger module than RS. The obvious candidate is RS, the Cartesian product of copies of R indexed by S. Denoting a typical element of RS as an “S-tuple” (rJ, we can define R-module operations “componentwise,” i.e., (r,)
+ (r:) = (rs +
I:)
and
r(r,) = (rrs).
(Note RS IRS, equality holding iff S is finite.) If f = ( I , ) we define supp(f )= {s E S: rs # 0). We should like to define a ring multiplication as before, i.e., (r,)(r;)= ( r i ) where rf = ~ s r = u r , rUnfortunately, ~. this sum need no longer be finite, and so is meaningless in R. However, the sum is defined in one important special case. Suppose S has a given order and define R((S)) = { feRS: supp(f) is well-ordered (under the order of S)}. Clearly R((S))
s21 > s,, > since S, is well-ordered this process must terminate after a finite number of steps, proving S; is finite, yielding the claim. Thus we see that the proposed definition of the product does yield an element of RS, whose support we claim is well-ordered. Indeed, otherwise there is an infinite chain s10s20 > slls21> > ... with s l i E S1,s2i E S,. Take u - = ~ 0 and, inductively, given ui- choose ui such that sl,”,is minimal among {slu:u> u ~ - ~Then } . sluoI slulIslU2 I ... implying szuo > sZu1> s,,,~ > is an infinite descending chain, contrary to S2 being well-ordered. We now see the product yields a member of R((S)).To check associativity and distributivity we note that any term in the product involves only a finite - . a ;
49
51.2 Polynomial Rings
number of terms in the multiplicands and hence multiplication works just as in R [ S ] . Associativity and distributivity follow from the corresponding proQ.E.D. perties in RCS]. The rest of the proposition is straightforward. Corollary 1.2.23:
R((S))is a domain for any domain R and ordered monoid S.
Proof: Exactly as in the proof of proposition 1.2.17.
Q.E.D.
The ring R((S))is often useful because it has enough room to invert elements of R [ S ] . For example, the only invertible polynomials in FCA] (for a field F) are the nonzero constants; as we shall see presently, our new construction provides a method for inverting elements of F [ 4 . We shall discuss one case separately, since it is considerably easier but encompasses many examples. Let us say an ordered monoid S is strongly archimedian if given u in S we can find k in N with sk > u for all s > 1 in S. Proposition 1.2.24: Suppose R is a domain, S is an ordered monoid, and f E R((S))has lowest-order term rs. Then f is invertible in R((S))iff r-' E R and s-' E S . Proof: Suppose f-' exists in R((S)) and let r's' denote its lowest order term. Then the lowest order term of f f - ' is rr'ss'. But ff-' = 1 so rr'= 1 and ss' = 1. Likewise r'r = 1 and s's = 1 proving r' = r-' and s' = s-'. Conversely suppose r-' E R and s-' E S and let g = 1 - r - ' s - y . We shall conclude the proof by showing r- 's- 'f = (1 -g) is invertible, for then f-' = (1 - g)-'r-'s-'. For any u in S let r t ) denote the coefficient of u in g i (where go= 1); putting h j = ~ ~ = o g ~ i = ~ u , s ( ~ we ~ = have o r ~ (1 ~ -) gu) h j = h.(l - g) = 1 - gj+' = 1 - C u s S r ~ f " uAs . j -, 00 we shall see that the J hj "approach" (1 - g)-', so the natural candidate for (1 - 9)-' is h = C,,s(C,P"=o r!))u. We claim (1) for each u in S there exists some k(u) in N such that rg) = 0 for all i > k(u) (2) supp(h) satisfies DCC.
Indeed (1) permits us to define h, and (2) then shows h E R((S)),and a term-byterm check using (1) implies (1 - g)h = h( 1 -9) = 1. As we shall see, the proofs of (1) and (2) hinge on the fact that supp(g) = {s-'s':s' E supp(f)} - { l}, i.e., every element of supp(g) is greater than 1. At this point we could give the general proof, but present first an important special case which covers most applications.
Constructions of Rings
50
Special Case. S is strongly archimedian. Take k = k(u) such that wk > u for all w > 1 in S. Then wl. . . wi > (min{wl, ,w ~ }>) ~u for every i > k, so (1) is immediate; likewise if u = u1 2 u2 > in supp(h) then each uj E supp(hk) which is well-ordered (since hk E R((S))), so the chain must be finite, proving (2).
. ..
General Case. Let Q denote the set of finite sequences of elements of supp(g) and, given a sequence q = (sl,s2,. ..,s,), write val(q) = s1 s2 . . .s, E supp(q"), and length(q) = u. Then Q has a partial order given by q1 < q2 if either val(q,) < val(q2) or val(q,) = val(q2)with length(4,) > length (q2). Claim. Q has no infinite descending chain q1 > q2 > Otherwise pick a descending chain such that length(q,) is minimal; of all such possible descending chains we pick one with length(q,) minimal, and so on. Thus we have a chain q1 > q2 > * where (given q,, .. .,4,q, has minimal possible length. Write s, for the first element of q, and q: for the remainder of the sequence. Take uo = 0 and, inductively, given u j - l take uj > uj-l with s, minimal possible. We can do this since supp(g) is well-ordered, and have s,, 5 s,, 5 * * * , implying 41 > * * * > quI- > 4:, > qL2 > . . . is an infinite descending chain. Since q:, has smaller length than q,, we have a contradiction which yields the claim. If (1) were false we would have an infinite sequence i , < i , c in N with u in supp(g'j) for each j; taking qj to be a sequence with length(qj) = ij and val(qj) = o, we get q1 > q2 > q3 > ... contrary to the claim. If (2) were false we would have a chain val(ql) > val(q2) > val(q,) > ... for suitable qi in Q, so q1 > 4 , > q3 > ..- contrary to the claim. Q.E.D. a * . .
- a -
We now have the following immediate corollary: Theorem 1.2.24': r f G is an ordered group and D is a diuision ring then D[G] can be embedded in the division ringD((G)).
This is our first embedding of a ring into a division ring and is quite useful, cf., theorem 1.3.45 below. Embedding into a division ring is a recurring theme in ring theory. Remark 2.2.25: If w1 is a word of length k then for every nonblank word w clearly the length of wk+lexceeds k. This trivial observation shows that the
monoids of the next three examples are strongly archimedian.
Example 2.2.26: Define the monoid S= {A': iEZ} with multiplication given by A i A j = A i + j , ordered by A i c A j if i < j. S is strongly archimedian (as noted
51
$1.2 Polynomial Rings
above). R((S))is denoted R((1)) and called the ring of Laurent series ouer R because every element has the form f = CIP"_,riAi for suitable t in Z corresponding to the minimal element 2 of supp(f). For a field F, we see F((2))is a field containing F [ 4 , so that one could form the field of fractions K of F[1] inside F((I)),and at times we shall use this technique. Note that K c F((1)) since there are Taylor series expansions of functions which are not quotients of polynomials. (For example, take f = x n = o l l " / n !The formal derivative of f is f itself, implying f cannot be the quotient of two polynomials.)
Example 2.2.27: Take S = {Ai: i~ N}, a submonoid of the monoid of example 1.2.26. Now R((S))is denoted R [ [ 1 ] ]and called the ring of formal power series ouer R. Note that R c R[1] c R [ [ 2 ] ]c R((2)). Example 2.2.28: S is the (noncommutative) word monoid, with the strongly archimedian order of example 1.2.18. For any commutative ringC we denote C((S))as C { { X } } .
Digression: More General Constructions In all the examples described above the elements of S centralize R in R [ S ] . However, there are instances where we want to "skew" the multiplication somewhat. In this case we could simply define the product of two arbitrary terms, and extend it via distributivity, i.e.,
In order for us to have a ring the following conditions must hold for all terms
f , 9, h: ( f d h = f(9h);
( f + 9)h = f h + gh;
f ( 9 + h) = fg
+fh.
Also there must be an element 1 for which I f = f l = f for all terms f . Conversely, these conditions guarantee that we will have a ring structure. In $1.6 several important examples are given, although the verification of the ring structure will be done by means of the regular representation (discussed in $ 1 S ) .
A Supplement: Ordered Groups Theorem 1.2.24'is an important method of constructing division rings but to utilize it we must have examples of ordered groups. Thus we are led to a short excursion into group theory.
Constructions of Rings
52
Remark 1.2.30: Every ordered group is torsion free. (If g # 1 then g < 1 or > 1, so assume g < 1; then g" < 1 for all n in N, so in particular g" # 1).
g
The easiest torsion-free group is (Z, +) which obviously is ordered by the usual ordering of real numbers. Remark 1.2.31; (Z, + ) I is an ordered group for any set I. Indeed, we well-order I and compare a = (mi)with b = (ni)by saying a < b if mi < ni for the smallest i at which mi # n,.(This is merely the lexicographic-ordering.) In particular, every finitely generated torsion-free abelian group is ordered.
To study nonabelian groups it is convenient to find a more algebraic description of order. Using multiplicative notation we say an arbitrary group G is partially ordered by I if (G, I)is a poset in which a < b implies ga < gb and ag < bg for all g in G. As noted after definition 1.2.13,we see that if a c a' and b < b' then aa' < bb'. Consequently G has a submonoid P(G)= { g E G : g 2 1) called the positive cone. The following properties are straightforward, writing P-' for {a-':a E P } : (i) P n P-' = {I}. (ii) P is a normal submonoid of G (since for any a E P and g in G we have gag-'
> g1g-'
= 1).
(iii) If Iis a total order than P u P-' = G . Fortunately these above properties characterize positive cones.
Lemma 1.2.32: If P is a normal submonoid of G with P n P-' = { 1) then G has a partial order I for which P = P(G). If, moreover, P v P-' = G then G is ordered by <. Proofi Define I on G by a I b if a - ' b E P. If a Ib and b I c then a-'c = (a-'b)(b-'c) E P, so I is a preorder; moreover, if a I b and b Ia (so that a-'b = (b-'a)-' E P - ' ) we a-'b E PnP-' = (1) so that a = b, proving (G, I) is a poset. To see G is partially ordered by c we first note for a # b that ga # gb and ag # bg by cancellation. Now for a < b and arbitrary g in G we have ga < gb (since (ga)-'gb = a-'b E P) and ag < bg (since (ag)-'bg = g-'(a-'b)g E P ) . If, moreover, P u P-' = G then Iis a total order since either a-' b E P or a-'b E P-', in which case b-'a E P. Q.E.D.
$1.3 Free Modules and Rings
53
Using this algebraic criterion we are ready to consider certain classes of groups. Define the group commutator (y, h) = g-’h-’gh and, writing ( A ,B) for the subgroup of G generated by {(a,b): a E A, b E B}, define the lower central series G = Go 3 G, 3 G2 3 *.. where Gi = ( G , G i - , ) for i 2 1. Note that Gi- , / G i is a central subgroup of GIG,. Proposition 1.2.33: Suppose G = Go 3 G, 3 G2 3 is the lower central series for G. If each Gi-,/Gi is ordered, and if n,20Gi = ( 1 ) then G is ordered.
Proo) Let pi = {g E Gi:ij> in Gi = Gi/Gi+,}. Then en P;’ = 0 and P , u P f ’ = G i - G i + , . Let P = ( u c ) u { l } . Then P i s a normal monoid w i t h P n P - ’ = ( 1 ) a n d P u P - 1 = ( U i ( G i - G i + , ) ) u { l } =G,provingGis Q.E.D. ordered. There are interesting related results on ordered groups which we shall present in the exercises. Proposition 1.2.33 cannot be extended to solvable groups, by exercise 5.
51.3 Free Modules and Rings In this section, we shall study and construct free modules and rings. There is an extensive theory in Cohn [85B], which largely lies outside the scope of this book; in this section we cover only the most basic properties, leaving free products for 51.4 and 51.9. Intuitively, “free” objects in a category are constructed in the most general possible way, without any extra conditions, and thus “lie” above all other objects. It turns out that we have already constructed the free R-modules in 51.2, and we shall also use their properties to understand the nature of “free.” Then we construct the free monoid and the free ring; at the end we construct the free group, which is needed in several ring-theoretic constructions. Every free module has a base, and technical problems arise concerning the uniqueness of the cardinality of a base. This matter is addressed in the concept of IBN (invariant base number) in definition 1.3.24ff. In order to verify the theories we give a category-theoretic definition of free, which is put into context towards the end of the section when we introduce “universals,” which are applicable in a wide variety of situations. However, the reader should already be apprised that the definition is ill-suited to category theory, and in $2.8 we shall discuss a related notion, “projective,” which fits much better into a categoric approach.
Constructionsof Rings
54
Free Modules Since the module freely generated by a set has no superfluous conditions in its construction, we examine it to discover the nature of “free.” Definition 1.3.1: A base for an R-module M is a subset S of M such that r,s where the r, E R are almost all 0 and every element of M has the form are uniquely determined. A module with a base is called free. In order to prove S is a base it is enough to show S spans M and is independent, for then if r,s = rls then c ( r s - r:)s = 0 implying each r, - r: = 0 so r, = ri.
xseS c
Remark 1.3.2: S is a base of the module RS freely generated by S, as noted in definition 1.2.1; thus RS is free.
Proposition 1.3.3: Suppose a module F has a base S = {si:i E I}. For any module M und any { x i : i E I} c M there is a unique map f: F + M such that f s i = xi for all i in I.
c
c
Proofi Any such f must satisfy f( risi) = rif s i = rixi,proving uniqueness, and we can in fact use this formula to define f since S is a base. Clearly f is a map. Q.E.D. Example 1.3.4: (i) MJR) is free in R-Aud with base {eij:1 5 i,j In ) (which has n z elements). (ii) The ring of triangular matrices over R is free in R-.Mud with base {eij:1 I i I j I n } which has n(n + 1)/2 elements. (iii) R[1] is a free R-module, having base { 1’:i E N }. (iv) C{X}is a free C-module having base the words in the alphabet X. (v) R(”)is the free R-module. The concept of dependence of elements can be generalized t o modules, enabling us to understand free modules in terms of “direct sums.”
Independent Modules and Direct Sums Definition 1.3.5: A set { M i :i E I} of submodules of a module M is independent if Mi n Mj = 0 for each i in I; dependent means not independent. If
cj+i
$1.3 Free Modules and Rings
55
cisl
M = Mi and { M i :i E I } is independent we say M is an (internal) direct sum of the Mi and write M = @ M i . If each Mi z M we write M"' for
Oi
E I Mi. Before continuing we want to relate this definition to the prior definition of independence of a subset of a module (40.3).
Proposition 1.3.6: Suppose M E R-Jtod and S c M . S is independent ifl { R s :s E S > is an independent set of submodules with Ann, s = 0 for each s in S . Pro08 (a) If 0 # rs E Rs n x s , + s R s 'then we can write rs in two different ways in terms of the independent set S, which is impossible, so Rs n Rs' = 0. Likewise if r E Ann, s then rs = 0 = 0s so r = 0. (*) If c f i n i , e r = s ~0 then for each s we have r 2 s = - c s , + s r s , so rss E Q.E.D. Rs n f s Rs' = 0; hence rs E Ann s = 0, as desired.
cs,zs
c,,
oSEs
Corollary 1.3.7: If S is a base of M then M = Rs and R z Rs for each s via the map r + rs. In other words, every free module is a direct sum of copies of R . Remark 1.3.8: (i) Every dependent set of submodules can be shrunk to a finite dependent set. (Indeed if Mi n Mj # 0 then 0 # x i = xju for suitable t in N, x i in M i , and x j , in Mju;then {Mi, M j ,,..., M j , } are dependent.) It follows at once that {independent sets of submodules of M} is inductive, and thus each independent set of submodules can be expanded to a maximal independent set. In the same way, each independent set of elements of M is contained in a maximal independent set. (ii) If Y = { M i :i E I } is independent and N c M with N n Mi = 0 then Y u {N} is independent. (We must show Mi n ( N + Mj) = 0 for each i. Taking x j in Mj and y in N suppose xi = y + c j + i x j .Then y = xi - I j t i x j E N " I i E Mi, = 0, implying xi = E j t i x j E M i n C j + iMj = 0, as desired.)
cj+i
Xiel
cj+i
Modules Over Division Rings Are Free Modules over division rings are often called uector spaces since many techniques from linear algebra are applicable, largely because of the following easy results.
Constructiom of Rings
56
Remark 1.3.9: Suppose D is a division ring and M E D-Aod. Then Ann,x = 0 for all x in M. Moreover, if S c M and dx E DS E M with 0 # d E D then x = d - ’ d x E DS. Put another way, if x 4 DS then Dx n DS = 0.
Proposition 1.3.10: Every module M over a division ringD is free. In fact, the following statements are equivalent for any subset S of M : (i) S is a minimal generating set (of M ) . (ii) S is a maximal independent set. (iii) S is a base. Proofi Remark 1.3.8 (i) shows maximal independent sets exist, so if we can establish the equivalence we shall see they are all bases (so M is free).
(i)*(ii) If C d i s i = 0 with some di # 0 then siE cj+iDpj, contrary to minimality. (ii) => (i) For each x in M we have Dx n DS # 0, so x E DS, proving DS = M. Hence S spans M and is minimal since if S’cS then S q ! DS’ (by independence). (i), (ii) * (iii) is true by definition. (iii) =-(ii) S is independent, by definition. For any x E S we still have x E DS, so S u {x} is dependent. Q.E.D.
Free Objects We draw on proposition 1.3.3 to obtain a general definition of free, for any category whose objects are sets (perhaps with extra structure), i.e. there is a forgetful functor from % to %t.We shall call such a category concrete. Definition 1.3.11: A free object ( F ; X ) of % is an object F with a subset X = {Xi: i E I } whereby for every A in 0 6 % and every { a i :i E I } E A there is a unique morphism f:F A such that f X i = ai for all i in I. This definition is not suited to category theory since it deals with elements; in fact we shall see below that “freeness” is itself built from a functor G: % -,%d and is much more cumbersome (in terms of general category theory) than other notions (such as “projectivity”). Nonetheless, many of our results will focus on free objects, largely because of the following result.
Proposition 1.3.12: Suppose %? and I are given. (i) Any two free objects are canonically isomorphic.
$1.3 Free Modules and Rings
57
(ii) If a free object ( F ; X ) exists then every object of cardinality I II( is an image of F under a suitable morphism. Proofi
(i) Suppose (F;X)and (F’; X’)are free, where X’ = {Xi:i E I } . By definition, we have morphisms f:F + F‘ and g: F‘+ F such that f X i = Xi and gXi = X i for all i. Hence gf: F -+ F and fg: F’ + F’ with g f X i = X i and f g X ; = Xi for all i. But we already have 1,: F F with lFXi = X i so by the uniqueness in definition 1.3.11, gf = 1,; likewise, fg = l,,, proving f is an isomorphism. (ii) Index the elements of an arbitrary object A of cardinality 5 11) as {ai:i E I } so that all elements of A appear (possibly with duplication if IAl < 111); then defining f:F + A such that each f X i = a, we have fF = A Q.E.D. --f
We shall now show free objects exist in those other categories of interest to us.
Free Rings and Algebras If C is a commutative ring then C{X}is the free C-algebra. This is intuitively clear since for any C-algebra R and { ri :i E I } E R we can “specialize” X i H r,. We shall prove this fact from the previous module results, aided by the following tool: Dejinition 1.3.13: Suppose cp: R + T is a ring homomorphism, and M E R - A u d and N E T-Aod. An additive group homomorphism f: M + N is called a cp-map if f (rx)= (cpr)fxfor all r in R, x in M. cp-maps are also called semilinear maps. Remark 1.3.14: Any cp-map f : M -,N becomes a module map in the usual sense when N is viewed as R-module by remark 0.0.9 (defining ry as (cpr)yfor y in N). Thus for M free with base S, any function f: S --+ N can be extended uniquely to a cp-map f:M -+ N by putting f( r,s) = x(cpr,)fs.
1
This remark enables us to apply our module-theoretic results to rings, taking M = RCS].
Proposition 1.3.15: Suppose cp: R + T is a homomorphism of C-algebras. Also suppose S is a monoid and f: S -+ T is a monoid homomorphism such that cpR
Conshpetions of Rings
58
centralizes fS. Then there is a unique algebra homomorphism f: R [ S ] + T whose restriction to R is cp and whose restriction to S is f. Proofi By remark 1.3.14 we need check merely that f is a monoid homomorphism, which is true since f((rlsl)(r2s2))=f(rlr2s1s2)=cp(rlr2)f (s1s2)= Q.E.D. ~ 1 ~ 2 f s i f= s z( ~ i f s 1 ) ( ~ 2 f s=2 f) (risi)f(r2~2). If cpR c Z ( T )then the condition of the proposition is satisfied; in particular, this is the case if R = C is commutative, T E C-dt’, and cp: C + T is the canonical homomorphism c cl. This special case is worth restating explicitly: --f
Proposition 1.3.16: Suppose S is a monoid and T is a C-algebra. Any monoid homomorphism f: S -+ T can be extended uniquely t o an algebra homomorphism 3 C [ S ] -+ T. In view of proposition 1.3.16, we expect to find a free ring if we can locate the free monoid.
Proposition 1.3.17: Suppose X is an arbitrary set, and S is the word monoid built from X (i.e., X is the alphabet). Then ( S ; X ) is free in Moa. Moreover, (C{X};X) is free in C-dLy for any commutative ringC, and (Z{X};X) is free in W i ~ g . Proofi For any monoid V and {xi:i E I} z V, define f:S + V by f (Xi,- - * Xi,)= xi, xi,. Clearly, f is a morphism of monoids and is unique such that f X i = xi, proving (S;X) is free. Thus ( C { X } ; X )is free by proposition 1.3.16. Hence (Z{X};X) is free in Z - d f e , which is isomorphic to W i ~ g . Q.E.D. Corollary 1.3.18: Any C-algebra is isomorphic to C { X } / A for suitable A 4 C { X } ,where X is a suitably large set of noncommuting indeterminates.
One can use corollary 1.3.18 as one cornerstone of the study of C-algebras. Given any subset S of R, we write (S) for the ideal RSR, called the ideal generated by S; one views R/(S) as the ring formed by sending the elements of S to 0. Let us examine the situation more closely for R = C{X}. Writing xi for the image of X i in C { X } / ( S ) (where X = { X i : iE I } ) , we can write C{X}/(S) as C{xi: i E I } , or C{x} for short; and we say (xi:i E I } generate C { x }as an algebra (since no proper subalgebra of C{x} contains all the xi).
81.3 Free Modules and Rings
59
On the other hand, any polynomial f in C { X } involves only a finite number of indeterminates X i , say Xi,, . . .,Xi,; we denote the image of f in C { X } / ( S ) as f ( x i , ,. . . , x i , ) , which intuitively should be thought of as “substituting” x i for Xi. Then f ( X i , , . .. ,Xi,) E ( S ) iff f ( x i , ,. . . ,x i t ) = 0, so the elements of S can be thought of as relations among the x i . Thus defining a C-algebra as C { X } / ( S )is sometimes called “defining an algebra by generators and relations.” Such a construction is often very useful but involves the difficulty that perhaps ( S ) is much larger than one might expect and perhaps even ( S ) = C { X } . Sometimes this difficulty can be overcome by building a concrete example to go along with the abstract definition.
Free Commutative Ring When working with commutative rings one would like to have an analogue of corollary 1.3.18 using the free commutative ring, which we shall now identify.
Proposition 1.3.19: (i) The commutative word monoid is free in the category of commutative monoids. (ii) For any ring homomorphism f: R -, R’ and any set { z i :i E I } s Z(R’), there is a unique homomorphism f: R[1] -, R’ whose restriction to R is f , such that f;li = zi for all i. (Here 1 = {Ai: i E I } is a set of commuting indeterminates over R.)
Proofi (i) Let M be the commutative word monoid on the set I . Given a map f: I -,S where S is a commutative monoid, we can extend f to a monoid homomorphism f: M + Sgiven byf(i, ... i,)=(fi,)...f(i,), where i , <...
Corollary 1.3.20: For any set 1 of commuting indeterminates, (C[A],1)is free in the category of commutative C-algebras, and ( Z [ A ] ,A) is free in the category of commutative rings. Any commutative C-algebra has the form C [ A ] / Awhere A a C[A]. Let us exemplify these results. Using well-known properties of polynomials in one indeterminate over Z, one can easily verify Z[i] x Z[A]/(A2 + l),
60
Constructions of Rings
+ +
Z[w] x Z [ I ] / ( 1 2 I 1) for w a primitive cube root of 1, and Z[&] x Z [ I ] / ( A 2 - n) when n is not a square. The ease in handling commutative examples such as these is largely lacking in the noncommutative case.
Diagrams Before continuing our study of modules, let us develop some more abstract theory to enable us to see the border picture. One important new technique is the use of commutative diagrams, cf., Jacobson [80B, p. lo]. A dotted line is drawn to show there exists a morphism such that the ensuing diagram obtained by drawing a solid line is commutative. Thus A-B
f
means there is h: A -,C such that h = gf; we then say h completes this diagram. This notion enables us to put free objects in a general categorical context.
Universals Dejinition 1.3.21: Suppose we are given G:W -, 9 a functor of categories and X E O b ( 9 ) .A universal from X to G is an object U of %? together with a morphism u: X + G U such that for every A in Ob(%?)and every morphism f:X -+ GA there is a unique morphism f I : U + A such that f = (Gf’)u, i.e.,
Gf’completes the diagram X L G U
I
/
In case this definition appears dry, let us whet the reader’s appetite by observing that intuitively U is the “free” object of %? with respect to being built up from X. In particular we have
Example 1.3.22: Let %? be a concrete category and 9 = %Pet. For any set X the free object ( F ; X ) of W is the universal from X to the forgetful functor (where u is the identification of X as a subset of F). Thus the next result generalizes proposition 1.3.12(i).
$1.3 Free Modules and Rings
61
Proposition 1.3.23: (“Abstract nonsense”) Any two universals from X to G are isomorphic. Proof;. Let { U ;u: X + G U } and { U’;u’: X + G U ’ } be two universals. Applying the definition with A = U’ and f = u’ we get f’: U + U‘with u’ = ( G f ’ ) u ; interchanging the roles of U and U’ we get f”: U‘ + U with u = (Gf”)u’. Hence u = (Gf”)(Gf’)u = G ( f ” f ‘ ) u . On the other hand, taking the universal U and A = U and f = u, we get a unique f“’:U + U with u = (Gf”’)u; 1, and f’lf’ each fill this role so 1, = f’lf’. Analogously, l u r = f’f”,proving f’:U + U‘ is an isomorphism. Q.E.D. The reader should realize that there may not exist a universal from X to G . However, universals exist in many settings and help organize seemingly disparate constructions. Note: It is often easier to recognize that an object is a universal than to pinpoint the corresponding functor and category. (This is certainly the case with direct products, to be defined shortly.) Hence it is customary to write a diagram resembling that of definition 1.3.21 and to say a given construction “solves a universal mapping problem” and is therefore unique in this respect (up to isomorphism). It is a good exercise to write down each universal in precise terms. Aside: For any functor G :W + 9 the composite functor Hom(X,-): % + 92 is representable with representative (U,u) iff (U,u) is a universal from X to G , by Yoneda’s lemma, cf., Jacobson [80B, p. 46-47]. Consequently, the term “universal” has faded from category theory literature in light of the advance of representable functors. However, the concept is useful for us, since we shall come across many important examples of universals.
Invariant Base Number We shall find many occasions to deal with free modules and will want a workable “dimension,” usually called rank. The obvious definition of rank is the cardinality of a base, which leads us to the fundamental question of whether different bases can have different cardinalities. Definition 1.3.24: R has invariant base number (abbreviated I B N ) if R‘”) z R(”) implies m = n.
62
Constructiom of Rings
Lemma 1.3.25: R('")x R(") fi there is an rn x n matrix A and an n x rn matrix B, each with entries in R, such that A B = 1, (the identity m x m matrix) and B A = 1,. Proof:
Let x l , . ..,x, be a base of R('") and let y,,
. . .,y,
be a base of R(").
=cy=
(*) Let $: R(m)+R(")be an isomorphism. Put $xi a,,y, _ _ and $-'yi = bjkxk, SO X i = $-'$Xi = aijyj = xaij$-iyj = xj,kaijbjkXk for each i. from which one readilv concludes A B = 1;,.... likewise BA = 1.. aijyj, and ;': R(")--t (-)There are maps $: R'"'4 R'")given by $xi = R ( I )given by $'yj = bjkxk.Then $'$xi = xi for each i, so $'$ = 1 (since
$-'xy=
cy=
the two maps agree on a base). Likewise $'$ = 1 so $ and 1(/' are inverses, proving $ is an isomorphism. Q.E.D. Proposition 1.3.26: R lacks IBN iff there are m # n with an m x n matrix A and an n x m matrix B having entries in R such that A B = 1, and B A = 1,. Corollary 1.3.27:
(i) If R has IBN then M,(R) has IBN. (ii) If R lacks IBN and $: R 4T is a ring homomorphism then T lacks IBN. (iii) Every homomorphic image of a ring lacking IBN also lacks IBN. Proof: (i) Follows at once. (ii) If A , B are matrices over R with A B = 1, and BA = 1, for m # n then applying $I gives the corresponding equations for matrices over T. (iii) Is a special case of (ii). Q.E.D. This last result is very powerful. For example, any field has IBN, by proposition 1.3.26, so any nontrivial commutative ring C has IBN (since C/M is a field for any maximal ideal M). We can refine the method still further.
Definition 1.3.28: A trace map on a ring R is an additive group homomorphism t: R --t H for an abelian group H , satisfying t(rlr2) = t(r2rl) for all ri in R. Proposition 1.3.29: If R has a trace map t such that t l has no Z-torsion then R has IBN.
41.3 Free Modules and Rings
63
Proof: Suppose A = (aij) is an m x n matrix and B = (b,) is an n x m matrix with AB = 1, and BA = In,and suppose e = tl. Then
implying m = n as desired.
Q.E.D.
We shall see examples of trace maps later, particularly in the discussion of group rings. There are, indeed, rings lacking IBN (cf., example 1.3.33 below), and thus their simple homomorphic images lack IBN. O n the other hand, theorem 0.3.2 implies division rings do have IBN, and virtually every class of rings we shall study (Artinian rings, Noetherian rings, PI-rings, etc.) will be seen to have IBN.
Weakly Finite Rings There is a slightly stronger property than IBN which often is easier to verify.
Definition 1.3.30: A ring R is weakly n-finite if for all matrices A, B in M,(R) one has AB = 1 implies BA = 1. R is weakly finite (also called Dedekind finite or uon Neumann finite) if R is weakly n-finite for all n. Remark 1.3.31: If R is weakly finite then R has IBN, by proposition 1.3.26.
In the course of the text we shall see that many classes of rings are weakly finite, and thus satisfy IBN. At the moment let us note that IBN has the following connection to idempotents; further results will be collected in Chapter 3.
Proposition 1.3.32: (Jacobson).If R is not weakly 1-finite then R has an infinite set of orthogonal idempotents. More generally, if ab = 1 and ba # 1 in R then putting eij = b'( 1 - b a ) d we have eijeuu= djueiufor all i, j , u, u. proof: Note ajbj = ai-l(ab)bi-l = &1bj-1 = ... = 1 for all j . Also a(1 - ba) = 0 = (1 - ba)b. Thus .(1 - ba)ajb"(l - ba) = 0 unless j = u, in which case (1 - ba)ajhj(1 - ba) = (1 - ba)' = 1 - ba, so eijeuu= djubi(1 - ba)a"= djueiv.
Q.E.D.
Constructionsof
64
Rings
Example 1.3.33: Let us search for an example of a ring R lacking IBN. Of course it cannot be weakly finite, and proposition 1.3.32 leads us to look for some infinite analog of matrices. Let V be a countably infinite dimensional vector space over a field F, and let R = Hom,(V, V). ?hen R is a monoid under composition of functions and becomes a ring when we define f + g by (f + g)u = fu + go for all u in V. (This construction will be studied shortly in great detail.) Let B = { u i : i E N} be a base of V over F. We claim R is not weakly 1-finite. Indeed, since every map is determined by its action on B we need only find a 1: 1 function f: B + B which is not onto (for then f will have a left inverse which is not a right inverse). Define f to be the right shift,i.e., f u i = ui+ for each i. Actually R lacks IBN; in fact R") x R'" in R-.Mud, for all i , j in N-{O}. To prove this we need only show R x R"). Define CD: R + R(') by defining Of = (f,, fz)for each f in R, where the fi are given according to the following action on B:
,
f,ui = f u z i
and
fzui = f u z i -
for each i in N.
If (f,,f2)= (0,O)then f u i = 0 for all i, implying f = 0, so 0 is 1:1; conversely CD is onto since given (f,, fz)we recover f by putting f u z i = flui and f u z i - = f lui for all i. Clearly CD is a module map and is thus the desired isomorphism.
,
This example is also important in other aspects of ring theory.
A Supplement: The Free Group One other category which has free objects is %fi. We shall describe the free group in some detail because by ordering it we can utilize theorem 1.2.24' to embed the free algebra explicitly into a division ring; this construction is used in the class of Jategaonkar rings built in 62.1. Let us start with an explicit construction. Construction Z.334: (The free group) Take the free monoid M on the alphabet { X i , i E I}.We say two words h , , h z are equivalent if we can obtain h, from h, by successive steps of inserting or cancelling XiK or k;Xi.For example, X,YzXzY3 is equivalent to XlX4Y,Y3since first we can cancel YzX,and then insert X4Y4.It is easy to see the equivalence classes form a monoid (under the induced multiplication), which, in fact, is a group G since inverses are obtained by reversing the order and switching X i and k;. For example, the inverse of the class of X,X3X,Y5X4is the class of Y4X5Y6Y,Y,. Abusing notation slightly we shall write Xifor the equivalence class of Xi,
x:
81.3 Free Modules and Rings
65
x.
XI:' for the equivalence class of (This could be defined most concisely by means of universal algebra applied to monoids, cf., Jacobson [85B,p. 67)]. It is easy to see that G contains canonically the free monoid on {Xi: i EI}, and more information can be obtained by appealing to the basic structure theory of monoids: Proposition 1.3.35:
( G ;X ) is free in Ye#.
Proof;. Suppose H is any group with {hi:i E I } c H.Take the free monoid M on the alphabet {Xi, x : i E I } and define a monoid homomorphism f: M + H by f X i = hi and f Y;. = h i ' . Also define II/:M + G by $Xi = Xi and II/x = X;'. Clearly II/ is onto and ker II/ c kerf, so viewing Mfker II/ as G we have an induced monoid homomorphismf: Mfker II/ + H given by f X i = hi and fX;' = h;'. Since G and H are groups, we see f is a group homomorphism, and the uniqueness of f i s clear. Q.E.D.
Remark 2.3.36: Any element of the free group can be written uniquely in the form g;'...gY for suitable t, where the n, are nonzero integers and the gi E X with any two consecutive gi distinct. An analogous argument enables us to construct the free abelian group, which can be described explicitly as (Z, +)('); when I = { 1,. ..,n } we could rewrite this as the set of words g:' ...g>, ti E Z, where the group operation consists of adding the powers. Remark 2.3.37: Write G' for the commutator subgroup of G; if G is the free group then G/G'is the free abelian group since the condition of definition 1.3.11 clearly is satisfied. Our further study of the free group relies on two celebrated results of group theory whose proofs both involve an interesting interplay with Z{X}, thereby illustrating ring theoretic applications to group theory.
Theorem 1.3.38: Let G denote the free group on {Xi: i E I } written in multiplicative notation and write G =I G, 3 G2 =I for its lower central series.
n
G, = { l } (2) Magnus-Witt Theorem G,-,/G,is a free Abelian group, for each n. (1) Magnus' ITheorem
The proof of these theorems is rather lengthy, but involves an interesting interplay with the free ring Z{X},and is given in Appendix A. .
Constructions of Rings
66
Theorem 1.3.39: The free group can be ordered. Proof: Apply proposition 1.2.33 to theorem 1.3.38.
Q.E.D.
Theorem 1.3.40: I f G is the free group ordered as in theorem 1.3.39 and D is any division ring, then D((G)) is a division ring canonically containing D W . Proofi
By theorem 1.2.24'.
Q.E.D.
Corollary 1.3.41: The free algebra F { X } over a field F can be embedded in a division ring. There are other embeddings, as we shall see, but this embedding can be made explicit, as the reader can check by going through the proof.
51.4 Products and Sums The main theme of this section is direct products and direct sums, two of the most fundamental constructions for rings and modules. This is viewed best in a categorical setting, and exact sequences and split exact sequences are introduced here, leading at the end of this section to an excursion into the more abstract realm of abelian categories. On the other hand, direct products can be generalized using filters; the reduced product (and, more specifically, the ultraproduct) has turned out to be one of the more useful constructions in ring theory, because it can combine properties of disparate examples.
Direct Products and Direct Sums The direct product construction is very straightforward and probably familiar to the reader. Given a set of objects { A i :i E I } in a category %? we can often view the Cartesian product n i s , A i as an object of %,' where the relevant properties are defined componentwise. Rather than formalize this idea now, we present now the two examples of importance to us and defer a formal discussion until the treatment of reduced products. Definition 1.4.1:
n,,,
(i) The direct product of a set { R i : iE I} of rings, denoted R i , is the Cartesian product which is a ring endowed with componentwise operations (ri) + (ri) = (ri + ri) and (ri)(ri)= (rir:)where r i ,r; E Ri for all i.
67
51.4 Products and Sums
(ii) The direct product of a set {Mi:i E I } of R-modulcs, denoted nit, Mi, is the Cartesian product which is in R - d u d when endowed with componentwise operations (xi) + (xi) = (xi + x f ) and r(xi) = (rxi) where r E R and x i , x fE Mi for all i. The same sort of definition "works" in d&, '3+, d u ~and , 9 u a as is easily seen. The following observation is crucial for understanding how direct products work. Remark 1.4.2: Suppose {Ai: i E I } are objects in a category for which direct products have been defined (e.g., g i n g , R - d u d , etc.). For each j in I there Ai -+ Aj given by reading the j-th is an onto projection morphism nj: component i.e., nj(ai)= aj for each (ai) in A i . Moreover, given any object A and morphisms f i : A -+ Ai for each i in I, one has a unique morphism f : A -+ A i such that nif = 1;. for all i in I. (Indeed, such f can be defined by the rule fa = (La), the element whose i-th component is ha, and one sees easily that any such f must satisfy this rule and thus is uniquely determined.)
n,,,
n
n
We turn to the (external) direct sum of modules. The construction involves Mi in R - A u d by taking the direct product, as follows: Define pj:Mj p j x to have all components 0 except the j-th component, which is x. (Here x E Mj.) Then n j p j = l,, and nipi = 0 for all i # j. -+
ni,,
Definition 1.4.3: The direct sum @Mi of a set {Mi:i E I } of R-modules is the sum of the piMi in Mi. In other words, @Mi = {(xi)E Mi: almost all xi are 0). (Thus the direct sum and direct product of { M i :i E I } are the same iff I is finite.)
n
n
Remark 1.4.4: The notation @Mi is justified since @Mi is the internal direct sum of the piMi. (Indeed to see the piMi are independent, note that pix = pini(pix)for any x in Mi, so piMin
C pjMi = pini
j#i
j t i
since the nipj = 0.)
Exact Sequences To understand direct sums better we shall introduce sequences, one of the f' basic tools of category theory. A sequence of maps . . . M' -+ M 9 M" + . . . is exact at M if fM' = kerg; an exact sequence is a sequence exact at each of
Constructions of Rings
68
f
f
its modules. Thus 0 + M + N is exact iff f is monk, and M + N + 0 is exact iff f is epic. It turns out that exact sequences contain precisely the information one needs for proofs. The length of an exact sequence is the number of arrows. Remurk 1.4.5: The following information characterizes exact sequences of length m which start and end with 0. (i) m = 2. O + M + O is exact iff M x 0. (ii) m = 3. 0 + M 4 N + 0 is exact iff f: M + N is an isomorphism. (iii) m = 4. 0 + K % M N -,0 is exact iff g is monic, N = f M , and N x M / K (using g to view K as a submodule of M, and using f to induce the isomorphism). This is called a short exact sequence. (iv) m = 5. 0 - K --t L 4 M + N +Oisexact iff K x kerf and N x M/fL (using the given maps for the identifications).
We should observe that the information becomes weaker as the length increases. On the other hand, any exact sequence starting and ending with zeroes can be made longer by adding extra zeroes and arrows denoting the zero map, enabling us at times to apply results about exact sequences of longer length.
Split Exact Sequences Viewing a commutative diagram as a traffic flow, where the arrows denote one-way streets, one might sometimes want to go the “wrong way” on a oneway street to arrive at a given desired object. More formally, given g: M + N one might want to find h: N + M such that gh = 1, and/or hg = ly. These notions can be formulated most fruitfully for short exact sequences.
fM Definition 1.4.6: An exact sequence 0 + K + i s a m a p i : N + M s u c h t h a t g i = 1,.
N
+0
is split if there
oie,
Definition 1.4.7: If M = Mi we say each Mi is a summand of M and Mj is the complement of Mi. In the literature, summands often are called direct summands.
xj+i
Clearly if Mi is a summand of M then M is a direct sum of Mi and its complement. Thus the case of direct sums of two submodules is of special
51.4 Products and Sums
69
significance, and we shall now consider it closely. Note M = MI 0 M, iff MI and M , are summands of M and complements of each other. Remark 1.4.8: If M = M, 0 M , then any map f:MI -+ N can be extended to a map f: M + N by putting f ( x l x,) = f x , for all xi in M i(i.e., fM,= 0).
+
Lemma 1.4.9: Suppose 9: M -+ N and h: N -+ M are maps with gh Then g is epic; likewise h is monic, and M = ker g 0 hN.
=
1,.
Proofi If f g = f ' g then f = fl, = f g h = f ' g h = f', proving g is epic; likewise h is monic. For any x in M, g ( x - hgx) = gx - ghgx = gx - gx = 0, implying x - hgx E kerg, so M = kerg + hN. On the other hand, if x E (ker 9 ) n hN then writing x = hy we have 0 = gx = ghy = y, implying x = 0. Q.E.D.
Proposition 1.4.10: The following assertions are equivalent for an exact f M 3 N + 0: sequence 0 -+ K -+ (i) (ii) (iii) (iv)
The exact sequence is split. There is a map p : M + K with pf = 1,. fK is a summand of M. M x K 0 N ; in fact M = fK 0 iN for suitable i: N
+M
with gi = 1,.
Proof: (i) 3 (iv). By lemma 1.4.9, taking i: N + M with gi = l,, we have i monic and M = ker g 0 iN. But ker g = fK x K and iN x N. (ii) 3 (iv) is analogous, and (iv) (iii) is a fortiori. So it suffices to assume (iii), and prove (i) and (ii). Write M = fK 0 M'. Since ker g = fK,the restriction of g to M' is a map M' + N which is monic as well as epic and thus has an inverse i: N + M', yielding (i). Likewise, f induces an isomorphism K -+ fK with some inverse p : f K -+ K which extends by remark 1.4.8 to a map p: M + K Q.E.D. with pf = 1, yielding (ii).
In view of this result, we introduce the following terminology: A monic -+ N is split if there exists h: N + M with hf = 1,; an epic 9 : M -+ N is split if there exists h: N + M with gh = 1,.
f:M
Reduced Products We can generalize direct products by using filters. Since this method generates interesting examples and also provides a technique for shortening proofs, we shall examine it in some detail.
Constructions of Rings
70
Definition 1.4.11: Suppose 9 is a given filter of the power set Y(I),and we are given sets { A , :i E I}. The Jiltered product or reduced product of the A , with respect to % written H A i / % is the set of equivalence classes of the Cartesian product A , under the equivalence given by (a,) (a:) iff {i E I: a, = a ; } E 3? (This is seen to be an equivalence as a consequence of the definition of filter.) To simplify notation, we still write (a,) when technically we mean the equivalence class of (ai).
-
n
Note that the reduced product becomes the direct product when 9 is the trivial filter {I}. Of course, we want the reduced product to inherit the algebraic structure of the A , , as illustrated in the following straightforward observation. Remark 1.4.12:
fl
(i) Suppose the A , each are rings. Then A = A i / 9 is a ring under componentwise operations, i.e., 0 = (0), 1 = (I), (ai)(a:)= (a,a:), and (a,) - (a;) = (a,- a;);these are well-defined since filters are closed under finite intersections. (ii) If, moreover, Mi E Ai-Aod then M i ) / 9 E A - A u d by defining scalar multiplication @,)(xi)= @,xi).
(n
The verifications are easy and are examples of the following general considerations: Suppose in general each A , lies in a concrete category W. We want to see when the reduced product A = A , / 9 remains in W. It is convenient to assume W is axiomatizable in a first-order language 9, for then at least we can define a structure in 9 having A as the underlying set, as follows:
n
Any constant symbol is assigned to (ai) in A, where ai is the assignment in A , : Any n-ary relative symbol R is assigned to the relation on A defined by saying R((x,),( y , ) ,(z,),.. .) holds iff {i:R(xi,y i , z i , .. .) holds in A , } E 9; Any n-ary function symbol f is assigned to f:A(")+ A given by f ( ( x i ) , ( y,),(z,), . ..) = ( f(xi, y , , z,, . ..))). Again these definitions are well-defined because filters are closed under finite intersections. Proposition 1.4.13: Suppose cp is an elementary sentence whose only connecA , ) / S fi {i: cp holds in A i } E S tive is A . cp holds in
(n
Pro08 By definition the proposition holds for atomic formulas, so we argue by induction on the rank of cp (given in the definition of elementary sentences):
g1.4 Products and Sums
71
Case I. cp = cp, A cp,. cp holds in A iff cpl and cp, each holds in A , iff (by iff {i: cpl and induction) { i : cpl holds in A i } E B and { i : cp, holds in A i } E 9, cpz holds in A i } E 9 ? Case 11. cp = (3x)q1(x). cp holds in A iff cp,(s) holds for some s = (si) iff (inductively) { i :cpl(si)holds for some si}E E iff { i : ( 3 ~ ) 9 ~holds ( x ) in A i } E 97 Case 111. cp = (Vx)cp,(x). If { i : cp holds in A i } E B then cp holds in A, proved as in Case 11. Conversely, suppose cp holds in A and let J = { i : cp holds in Ai} and J’ = I - J . For each i in J ’ there is si in A i such that cpI(si)does not hold. Taking si arbitrarily in J and s = (sJ, nevertheless, cpl(s) holds; so letting J ” = { i : ‘pI(si)holds in A i ) we have J” E 9 by induction. Since J ” n J’ = 0 by choice of s we conclude J 2 J ” E 9. Q.E.D.
Since the axioms for rings and modules are atomic sentences (suitably quantified) we see that any reduced product of rings (resp. R-modules) is a ring (resp. R-module). Nevertheless, certain sentences do not carry over. For example, the direct product of domains is not a domain. The simplest sentence which does not carry over is the following:
Example 1.4.14: Let R , = 2/22 and R , = 2/32, Then R , and R , each satisfies the sentence (Vx)((2x = 0) v (3x = 0)) which nevertheless fails in R, x R,. A general class of sentences preserved under reduced products is given in exercise 6. Filters and reduced products can be described in purely ringtheoretic terms (cf., exercises 9 through 12) and this interplay enchances both ring theory and the study of filters.
Ultraproducts This technique becomes powerful when we restrict the particular filter under consideration. Recall that any filter can be embedded in a maximal filter, called an ultrafilter. A reduced product A i / 9 is called an ultraproduct when 9is an ultrafilter. Thus we know that ultraproducts are also plentiful, although it is usually near impossible to describe a given ultraproduct precisely. Nevertheless, they are important because of the following result.
n
n
Theorem 1.4.15: (ZoS’s theorem) Suppose A = A J Z where each A i is a structure in the same jirst-order language, and 4 is an ultrafilter. A jirst-order sentence cp holds in A iff {i E I :cp holds in A i } E F
72
Constructions of Rings
Proof: By induction on the rank of cp. Proposition 1.4.13has disposed of every case except cp = -I cpl, which holds in A iff cpl does not hold, iff { i E I: cpl holds in Ai} 4 9 ( b y induction), iff { i E I : i cp, holds in A i } E 9 (by remark 0.0.17). Q.E.D. Remark 2.4.26: The principal ultrafilters are rather dull. If 9is a principal ultrafilter on 9 ( I ) , generated by I, c I, then remark 0.0.17 implies I, is a suitable singleton {io};thus A i / 9 = Ai, and we have nothing new. However, every nonprincipal ultrafilter is interesting, as we see now.
n
Lemma 1.4.17: filter. Proof:
An ultrafilter 9 is nonprincipal iff 9 contains the cofinite
(e) 9does
not have any finite set, so is nonprincipal.
(*) We prove the contrapositive. If 9 does not contain the cofinite filter
and hence its complement is a finite set in then some cofinite set is not in 9, # I, n J E 9, so I, G J 9. Take a finite set I , minimal in 9If J E 9then by hypothesis, proving I, generates 9. Q.E.D. Proposition 1.4.18: Suppose 9 i s a nonprincipal ultrafilter on I , and cp is an elementary sentence holding in almost all A i . Then cp holds in the ultraproduct Ai/E
n
Proof: {i:cp holds in A i } €9by the lemma, so cp holds in A by t o i ’ theorem. Q.E.D. Example 1.4.19: Suppose Riis a ring of characteristic mi for each i E N where rn, < m, < m3 < If 9 is a nonprincipal ultrafilter on N then R i / 9 has characteristic 0. (Indeed for each m > 0 the statement m 1 # 0 holds in almost all Ri.
n
- . a .
.
Proposition 1.4.20: Suppose cp is a first-order sentence which is true for every ring of characteristic 0 in a given axiomatizable category. Then cp is true for all rings in this category having suitably large characteristic. Proofi Otherwise, there is a sequence rn, < m, < . * in N and rings Ri in this theory having characteristic m i in which cp fails. Then cp fails for their ultraproduct, which has characteristic 0. Q.E.D. This is usually called the “compactness argument” in logic and can be
73
41.4 Products and Sums
applied to almost any “finiteness” condition which is not bounded; it shall be refined later on (cf., remark 2.12.37’ and its applications in 88.1 and 88.3). Also of importance is the following tool which often enables us to assume an algebra is finitely generated.
Proposition 1.4.21: Suppose % is a category defined in a first-order language, and % is closed under intersections. Any object A of % can be embedded in an ultraproduct of finitely generated subobjects of A. Proof: Index the finite subsets of A as { S , : i E I } and let Ai be the subobject of A generated by s,,i.e., A, = (){A’ E Ob%:Si s A’ G A } . Now put Ji = { j E I : S, c Aj}. Given i, i‘ in I we have Si u Sir = Sj for suitable j in I ; then j E Ji n J,. so Ji n .Ii. # 0. Thus (4: i E I } is a base for a filter contained in some ultrafilter 9% Put A^ = A,/% and define 9: A + A^ by ga = (ai) where a, = a for all i such that a E A i , and a, = 0 otherwise. (In other words, g is “almost” the diagonal map.) We claim g is the desired embedding. Indeed g is clearly a morphism. To see g is 1:1 suppose a # b in A. Then taking i such that S, is the pair {a,b} we see the i-th components of ga and gb are, Q.E.D. respectively, a and b for each j in Ji. Hence ga # gb.
n
Products and Coproducts We return now to direct products, using remark 1.4.2 to provide the following categorical characterization: Remark 1.4.22: Suppose A,: i E I are rings. Given any ring A and homomorphisms & : A + Ai for each i, there is a unique homomorphism f:A + Ai which simultaneously completes the following diagrams for each i:
n
A
One should bear in mind that the projection morphisms ni go from the direct product to the components. More generally we have A product of objects { A i :i E I } in a category % is an object denoted A i , together with morphisms ni: Ai + Ai such that for any object A and morphisms fi: A + Ai for each i there is a unique morphism f:A + A, with n,f = for each i in I.
n
Definition 1.4.23:
n
n
Constructions of Rings
74
Thus the direct product (in categories for which it is defined) is an example of a product in a category. To get back to direct sums we dualize the notion of product by reversing the arrows. Definition 1.4.24: A coproduct of objects { A i :i E I } in a category % is an object denoted A i , together with morphisms p i : Ai -+ A i , such that for any object A and morphisms fi: A i + A for each i there is a unique morphism f: Ai -+ A with f p i = fi for each i. In other words, f simultaneously completes the diagrams A
Example 1.4.25: (The direct sum as a coproduct) Notation as in definition 1.4.24, we see that @ M i together with the p j : Mi-,@ M i is the coproduct of the M i . (Indeed for any maps f;:Mi + M we define f: Mi + M by fx = c f i x i x , which makes sense since almost all nix = 0; clearly, f is uniquely determined such that 1;: = f p i for all i.)
0
Remark 1.4.26: We shall now view coproducts as universals, in a way which shall be generalized in exercise 1.8.7. Namely, given a category %? and a set I, we view I trivially as a small category (whose only morphisms are the identities i + i). Then the category %I given in example 0.1.13 can be described as follows: The objects are the functions from I to Ob(%),denoted as I-tuples ( A i )where Ai E Ob(%?);the morphisms $(Ai)-+ (Bi)are I-tuples (fi) where each f ; : A i-,Bi is a morphism. Let U = H A i E %? and u = ( p i ) , the morphism in %’ whose i-th component is the canonical morphism pi:Ai -+ A i . Then U and u define the universal from ( A i )to the “diagonal functor” 6: % %’ where 6 is given by 6 A = (A) and 6f = (f), i.e., each component of 6 A (resp. Sf) is A (resp. f).This displays the coproduct as a universal (if it exists), proving the coproduct is unique; by duality the product also is unique. -+
Surprisingly, coproducts of rings may be trivial. R , = 2/22 and R, = 2/32 have coproduct 0 since any ring R having homomorphisms pi:Ri+ R would satisfy 1 + 1 = pl(l 1) = 0 and 1 1 1 = p2(1 + 1 + 1) = 0, implying 1 = 0, so R = 0. In fact, the element 1 is precisely what ruins coproducts for Wiay; this is one of the few instances in which we might rather
+
+ +
gl.4 Products and Sums
75
have defined rings not to have 1, c.f., exercise 1.5.7. Nevertheless, we can construct a ring ‘‘like’’ a coproduct which is very useful in providing examples. Example 2.4.27: (Direct sums of rings) Suppose { R i :i E I } is an infinite set of rings and define the function p j : R j + Ri by taking p j r to have all components 0 except the j-th component, which is r. The p j satisfy all requirements of ring homomorphism except preserving 1; in fact, p j identifies R j with an ideal f i j = p j R j Q R i . Define the direct sum O R i of the R i to be the subring of Ri generated by all the R i . In other words,
n
n
fl
0Ri = {(m)+ xfinite ri: ri R i and rn E
E
H).
Since njpj = 1 and njpi = 0 for all i # j the direct sum satisfies the following universal property: If A: Ri + Tare ring homomorphisms, then there exists a unique ring homomorphism f:O R i -+ T such that 1; = fpi for all i. Indeed, define f by f((m) homomorphism we note
f((rn)
+ x f i n i , e r i=) m + x & n i r i ; to
check f is a
+ 1ri)((rn’) + 1r:) = f ( ( m m ’ )+ C(mri + m’ri + rir:)) = mm’ + x(mfinir; + mxniri + fiq(rir;)) = (rn + xJ;niri)(m’+ 1 f i q t - i ) = f((m)
+ Cri)f((m‘) + xri).
(The other verifications are instant.) This construction foreshadows the adjunction of 1, to be described in 41.5. See exercise 5 for an application. Despite our initial disappointment, coproducts of algebras are quite useful in several instances. We need an example for guidance. Example 1.4.28: Let X be a set of indeterminates and partition X = U X ( ~ ) where the i merely are superscripts. For any commutative ringC, the free C-algebra C { X } is the coproduct of the C ( X “ ’ } in C - d & where the p i : C { X ( ” } - + C { X }are the canonical inclusion maps. (Since C { X ( ” } are free C-algebras, the identity action on X(’’ produces pi.) To see this, suppose we are given g i : C { X “ ’ } -+ R for a C-algebra R ; we want to show there is a unique g : C { X ) + R satisfying J=gpi for each i. Indeed, g and gi must agree on X“’, so for each indeterminate X y ’ in X“’, we define the action of g on X y ’ by gXy’ = Six:’.These combine to give a set-theoretic map g : X + R which uniquely yields the desired homomorphism g : C { X } -,R .
76
Constructions of Rings
Example 2.4.29: For one indeterminate Xi we see C{Xi} is a commutative polynomial algebra in one indeterminate. Thus C{X} = UiE,C{Xi}is a coproduct of free commutative C-algebras. This example merits further study, but first we note an important application. Theorem 1.4.30:
Coproducts exist in C-dl''.
Proofi Given C-algebras { R i :i E I } , write Ri = C{X")}/Ai for suitable disjoint sets of indeterminates X(') and ideals A i of C{X(i)}.Let X = X"), so that C{X} = IJC{X(i)} and let pi:C{X(i)}+ C{X} be the canonical inclusion map (c.f., example 1.4.28). Letting A be the ideal of C{X} generated by the p i A i , we put R = C{X}/A. The composite homomorphism C{X(')}+ C{X} + C{X}/A has kernel which contains A i , so we have an induced homomorphism pi:Ri + R. We claim that R together with the pi is the coproduct of the R i . Suppose we have another C-algebra R' with homomorphisms pi: Ri -+ R'. Then we have the homomorphism vi:C{Xci)}+ R ' given by the composite C{Xci)}+ Ri + R', which yields a unique homomorphism v: C{X} + R' such that vi = vpi for each i. Thus 0 = viAi = v ( p i A i )for each i, implying A C ker v. Hence v induces a homomorphism i? R+R' (since R = C { X } / A ) , and one has pi = Tpi. The uniqueness of T follows from the uniqueness of v, Q.E.D. so we have proved the claim.
u
Like many good results, this theorem raises more questions than it answers. When are the pi injections? More generally, how "big" is A compared to the piAi which generate it? We have seen in the worst case that the coproduct can be 0, so A can be all of C{X}, and now we intend to examine the best case, drawing our inspiration from example 1.4.28.
B Supplement: Free Products and Amalgamated Sums The coproduct is not of much interest to us when it is trivial; we much prefer when the coproduct contains each of its components canonically. Thus we are led to the following definition:
Definition 1.4.32: Suppose W is a concrete category with given objects A and { A i :i E Z}, where A is a subobject of each A i . An object B of W is a (free) amalgamated sum of the Ai over A if the following properties hold: (i) For each i there is a canonical 1 :1 morphism p i : Ai + B fixing A (k., via = pja for all i , j in I and all a in A).
77
$1.4 Products and Sums
(ii) If piai = pjuj for i # j then a, = aj E A. (Intuitively Ai n A j = A.) (iii) If B' and pi: A , -,B' satisfy (i) and (ii) then there is a unique morphism g : B -+ B' satisfying g p , = pi for each i. B is called the free product of the A , if A has no proper subobject. (B should really be called the free sum, but this would contradict the current usage. In group theory the free amalgamated sum is called the free product with amalgamated subgroup.) We shall be most interested in the following situation:
Definition 2.4.32: Suppose W is a ring. W-ging is the category each of whose objects is a ring R together with a given homomorphism fR: W + R; a morphism in W-Bing is a ring morphism g : R + R' satisfying gfR = fR.. (This generalizes the notion of algebra.) Remark 2.4.32': Conditions (i) and (iii) of definition 1.4.31 show that any amalgamated sum over a ring W is a coproduct in W-Wi-y; this approach is most in accord with current practice. Notation as in example 1.4.28 the amalgamated sum of the C{X")} over C is C{X}in B h y , and this is the free product in C - d & Example 2.4.33:
Determining whether an amalgamated sum exists entails constructing a coproduct, which may not be an easy task. The next result shows condition (iii) of definition 1.4.31 is superfluous.
Proposition 1.4.34:
Suppose {Ai:i E I } are rings containing A. The A , have an amalgamated sum over A if there is some ring B satisfying ( i ) and ( i i ) of dejnition 1.4.32. Proof: Suppose v,: A, -+ Ai are the canonical homomorphisms into the coproduct, and let K be the ideal of Ai generated by {via - via: i, j E I and a E A}. We claim P = A i ) / K is the amalgamated sum along with vi: A i+ P given by the composite of vi with the canonical map A , + P. To see this we appeal to definition 1.4.31 using P and v, instead of B and pi.Of course there is a homomorphism g: A i+ B such that gvi = pifor each i. For each i, j E I and a in A we have g(via - vja) = p i a - pja = 0, implying g K = 0; thus g induces a homomorphism P + B and &Fi = pi, verifying condition (iii). Moreover, ker V, G ker pi = 0 so each vi is 1 : 1 and fixes A by definition, verifying (i). Finally if viai = ijaj then piai = %ai = fiaj = pjaj, Q.E.D. so the hypothesis on B implies ai = aj E A, proving (ii).
(ieIu
uic,
a:
Constructions of Rings
78
C Supplement: Categorical Properties of Modules: A belian Categories One of the main uses of category theory is to abstract the properties of the category R - A u d so that in effect one can utilize the module theory in varied settings. Although we shall not pursue this direction of inquiry, it is well worth pausing from time to time to note what happens in greater generality. This will occupy us for the remainder of the section. We say a category W is preadditive if Hom(A, B ) is an abelian group for any objects A, B in W, with respect to an operation + satisfying the following distributivity conditions: (91 + 92)f = 9lf
+ 92f
and
f(h1
+ h2) = f h l + fh2
for all morphisms f:A -,B, gi: B + B‘, and hi:A‘ + A. Another way of stating this requirement is that the composition Hom(B, C) x Hom(A, B ) -+ Hom(A,C) is bilinear for all A , B,C in ObW. (Unfortunately, the word “additive” was used for a less interesting definition of categories.) A functor 9:W -,9 is additive if W, 9 are preadditive categories and the map 9: Hom(A, B ) Hom(9A, 9 B ) is a group homomorphism for every A, B in Ob W. Example 0.1.8 is one of the classic examples of additive functors. We have seen R-Aud is a preadditive category. B h p is not preadditive, but every ring R can be made into a small preadditive category by means of example 0.1.5; conversely, every preadditive category having only one object can be viewed as a ring whose elements are the morphisms. This reinforces our philosophy of studying rings through their elements. There are other examples of preadditive categories which we shall encounter later. Many of the notions of R-Aud can be formulated categorically for an additive category W. A zero object of W is an object 0 such that Hom(A, 0) = (0) = Hom(0,A) for every A in ObW. Clearly, the zero object is unique up to isomorphism if it exists. If the 0 object exists then one can define a zero morphism 0: A + B by 0 = g 0 f where f: A -,0 and g:O -,B. --f
Definition 2.4.35: Given morphisms f i: B , --t A and f2: B2 -+A in a category 59, we say f i I f 2 if f, = f 2 h for some unique morphism h: B , -, B 2 ; f l and f2 are equivalent if h can be taken to be an isomorphism.
f2
Note in this definition that if f l is monic then h is monic; furthermore, if is monic then h is unique (since f, = f 2 h = f2h’ implies h = h’).
Definition 2.4.36: A kernel of a morphism f:A -+ B is a monic k: K -, A with f k = 0, which is the “largest” such in the sense of definition 1.4.35.
79
81.4 Products and Sums
Our goal is to find a class of categories in which all monics are kernels and then to use kernels (and their duals) to obtain a modular lattice generalizing the lattice of submodules LZ(M). The categories which we study turn out to satisfy an important property lacked by R - A d - t h e y are self-dual, where we say a category %‘is self-dual iff %‘ FZ WoP. In a self-dual category, the dual statement of a theorem is also a theorem. This observation is very useful and will be exploited in Chapter 5. Remark 1.4.37: Suppose iff gfl = 0
i.: Bi+ A
are monics and
f2 = kerg. fl
I fi
To proceed further we shall need the dual concept of kernel. The cokernel of a morphism f : A + B, denoted coker f , is an epic h: B --+ C with hf = 0 such that for every h’: B + C‘ with h ’ f = 0 there is a unique g: C + C‘ such that h’ = gh. For example if %‘= R-Mud then coker f = B / f A . There is a good criterion using cokernels for determining when a morphism is a kernel. Remark 1.4.38: If f is a kernel and coker f exists then f seen at once from the following diagram where f = ker g:
=
ker(coker f ) , as
Thus we are interested in categories with many cokernels. One of the first properties one learns about R-.Mod is that every submodule is a kernel. This can be expressed generally as follows. Remark 1.4.39: If f = f i g is monic where g: A + B is a cokernel and f,: B + C is a kernel, then f is equivalent to f l (and so is a kernel). (Indeed, we have f I f l so we must show f i I f. Write g = coker h. Thenfh = f i s h = 0 so h = 0. Hence l B h = 0 so there is 9’: B + A such that gg’ = 1, implying fg’ = f igg’ = f l , as desired.) Definition 1.4.40: A preadditive category V is abelian if %‘satisfies the additional properties:
(i) %‘is closed under finite products (i.e., if A , , . . . ,A, E Ob %‘then Ob 48.).
n
Ai E
Constructionsof Rings
80
(ii) Every morphism has a kernel and a cokernel. (iii) Every morphism f can be written as hg where g is a cokernel and h is a kernel. Clearly R-&d is abelian. Also we have seen that properties (ii) and (iii) show that all the previous remarks (and their duals) hold, and in particular every monic is a kernel. Often (iii) is written in the literature in the following equivalent form (cf., exercise 19): (iii’) Coker(ker f )is isomorphic to ker(coker f ) for every morphism f. Conditions (ii) and (iii) can be utilized in a particularly telling way. Define the image of a morphismf: A + B denoted im f,to be ker(cokerf). Thus f = imf iff f is a kernel. (Images can be defined in a more complicated fashion for arbitrary categories.) Let us view images more intuitively. Remark 1.4.41: Given f = hg where 9: A + C is a cokernel and h: C + B is a kernel we have coker h = coker f (since g is epic) so im f = ker(coker h) = h. Because of this, we write f A for C. Dually one has g = coker(ker f ).
Next we show (i) is self-dual by observing that a certain nice situation in R-Aud is not mere coincidence. Proposition 1.4.42: Suppose %? is a preadditive category with objects A , , .. .,A, which have a product A i , x i ) where I = { 1,. . .,t } . Then A i ,p i ) is the coproduct of A l , . ..,A, for suitable morphisms pi:Ai + A i which p j n j = 1 and nipj = 6 , (where aij:Aj + Ai is 0 unless i = j and satisfy 6ii = l A i . )
(n
zf=,
n
n
(n
Proof: Let A = A i . For each j we have a unique morphism pi: A j + A such that n i p j = 6, for 1 5 i It. Then n i x : = , p j n j = dijnj = ni for all i. Hence pjnj and 1, both complete the same diagram and are thus the same by the universality of the product. It is straightforward now to check ( A , p i )is the coproduct. Q.E.D.
I:=,
Corollary 1.4.43: Objects A , , ...,A, of a preadditive category have a product i f f they have a coproduct, in which case their product and coproduct are isomorphic. Proof: (+) was done; (e) follows by passing to the dual category, which is Q.E.D. also preadditive.
$1.5 Endomorphism Rings and the Regular Representation
81
Note that Corollary 1.4.43implies abelian categories are self-dual. On the other hand, R - A d is not self-dual, because the lattice Y ( M ) is upper continuous but not lower continuous (cf., exercise 0.0.4). The self-duality of abelian categories permits one to take shortcuts in proofs which are not available in R-Ad; yet much of the rich theory of R-Jtud is also available in arbitrary abelian categories, as can be seen in exercises 20ff.
51.5 Endomorphism Rings and the Regular Representation Although we have a fair number of rings at our disposal by now, we lack a unified framework in which to view them. The goal for this section is to introduce endomorphism rings and show that every ring is a subring of a suitable endomorphism ring, thereby providing a theorem parallel to Cayley’s theorem in group theory. The benefits are similar, enabling us to construct rings as subrings of known rings without having to verify associativity and distributivity. We shall also see how matrix rings are a special class of endomorphism rings. The underlying idea has its roots in abelian groups. In the foregoing discussion we always assume M # 0. Any module M can be viewed as an abelian group and thus as Z-module.
Endomorphism Rings Remark 1.5.1: Hom,(M, M) is a ring whose addition is sum of maps and whose multiplication is composition of maps. Moreover M E Hom,(M, M)Aud where the scalar multiplication f x is taken to be the action of f as a map. When M E R-&od we can transfer the elements of R to Hom,(M, M ) as follows: Definition 1.5.2: For M in R - d u d and r E R , define the left multiplication (also called lest homothety) map pr:M + M by prx = rx. Likewise, for M in A d - R define the right multiplication map p i : M + M by p i x = xr.
Remark 2.5.3: For every r in R , the left multiplication map pr is in Hom,(M, M ) , and there is a ring homomorphism p : R -,Hom,(M, M) given by p r = pr; moreover ker p = Ann, M. (Verifications are straightforward.)
82
Constructions of Rings
We should like p to be an injection, which is the case iff Ann, M = 0. Accordingly, we say M is faithful if Ann, M = 0. When M E R - A u d is faithful, we call p the ( l e f ) regular representation of R in Hom,(M, M). This can all be done from the right as well. Namely, if M E Aud-R define p’: R + Hom,(M, M) by p’r = p i . However p’ reverses the order of multiplication ( p ’ ( r , r 2 ) = (p’r,)(p’r,)). Such a map is called an anti-homomorphism. Note that in general a map f: R, + R, is a ring anti-homomorphism iff the induced map J R , + R;p is a homomorphism, so in order to avoid antihomomorphisms one must introduce opposite rings from time to time. For example we shall view the right (regular) representation as a homomorphism p ’ : R + Hom,(M, M)OP. The regular representation has many interesting applications.
Example 1.5.4: Viewing R in R-Mud we have Ann, R = 0 since Ann,{ 1 } = 0. Thus the regular representation identifies R with a subring of Hom,(R, R ) . The regular representation is one of the most important tools in ring theory, and we shall try now to hone it further to obtain many interesting applications. Proposition 1.5.5: If M E R - d u d then Hom,(M, M ) is the centralizer of pR in Hom,(M, M ) , where p: R + Hom,(M, M ) is the regular representation. Proof.- Suppose f E Hom,(M, M ) . Then f E HOM,(M, M ) iff f(rx) = rfx for all r in R, x in M , iff fp, = prf for all r in R. Q.E.D.
In particular, Hom,(M, M ) is a ring. Furthermore, one sees at once that M€R-&od-HOm,(M, MyP.Analogously, if M EA d - T then Hom,(M, M ) is a ring, the centralizer of p’T in Hom,(M, M); consequently, M E Hom,(M,M)-Mud-T. To unify these two situations we make the following definitions. Definition 1S.6: (i) If M is an R-module define End, M to be Hom,(M, M)OP,ie., multiplication in End, M is composition of maps in the reuerse order. (ii) If M is a right T-module define End MT to be Hom,(M, M).
We hope the asymmetry of this definition will not bother the reader, but it makes later assertions flow more smoothly.
83
$1.5 Endomorphism Rings and the Regular Representation
Proposition 1.5.7: Suppose M E R - A d - T is faithful as R-module. Then R E End M , by the (left) regular representation. Proof: By proposition 1.5.3, we have the injection p : R -P Hom,(M, M ) which, by hypothesis, centralizes p’T; so p R G End MT by proposition 1.5.5. Q.E.D. This method gives us many useful techniques and examples. Example 1.5.8: If R E C - d t y then taking M = R and T = C in proposition 1.5.7 (identifying C-Aud and A d - C ) , we have R G End Rc. However, End R, is defined using only the C-module structure of R. Thus, forgetting the original multiplication of R, we see that every possible multiplication on R which makes R a C-algebra produces a suitable subalgebra of End R,. This result can be used to construct the algebra structure by viewing R c End R , in the suitable way, just as Cayley’s theorem is used to construct finite groups. Then distributivity and associativity need not be verified since they are inherited from End Rc. Example 1.5.9: R z End R R for every ring R. (Indeed, it suffices to prove the regular representation p is onto. Take any f in End RR and put r = f 1. For all r’ in R we have
fr’
= f(1r’) = (f1)r’ =
rr’
= prr’,
proving f = p r . Likewise the right regular representation gives an isomorphism from R to (HornRR)OP= End, R. Remark 1.5.10: Taking M = R in proposition 1.5.5 we see the centralizer of p R in Hom,(R, R ) is HomR(R,R ) = p‘R. By symmetry we see the left and right representations of R are the centralizers of each other in Hom,(R, R).
When R is a C-algebra (cf., example 1.5.8), we conclude a fortiori that the left and right representations of R are the centralizers of each other in Hom,(R, R). Thus we see the right regular representation of R gives us a copy of R in End, R, whereas the left regular representation gives a copy of RoP, and these centralize each other. Example 1.5.11: If M E R - d u d is faithful then taking T = End, M we have R E End M,. An important part of the structure theory is the study of
R in terms of End MT, which is called the biendomorphism ring of M for obvious reasons. Example 1.5.12: Suppose M = R and T is a subring of R. Then R 5 EndR,. This is particularly useful when R is f.g. as T-module, as we shall now see.
Endomorphisms as Matrices Theorem 1.5.13: Suppose M E A d - T is spanned by xl,. . .,x,. Then End MT is a homomorphic image of a subring of M,(T). In fact, if {xl,. . .,x,,} is a base of M then End M T !z M,(T). Proof: Write R = { r = (a,) E M,,(T): there exists /3, in End MT with /?,xi = xiaijfor all j } . Note that the matrix r determines the action of /3, on the spanning set {xl,. . .,x,} and thus on all of M, so we have a function cp: R + End MT given by cpr = fir. Moreover, cp is onto since for any /3 in End MT we xiaij for suitable aij in T. have /3xj = To show R is a ring we note for r=(aij)and r’=(aij) that /3,-/3,.=/3,-,. and .3,/ = /3,/3,. since
=
i
i=l
xi(
k=l
aikaij) = /3,,,xj
for all xi.
This verification also shows cp is a homomorphism, so we have displayed End MT as a homomorphic image of R E M,(T), as desired,-If {xl,. . .,x,} is a base then (M; { xl,. ..,x,}) is free so every matrix r = (aij) defines an endo=l =0 morphism fir, implying R = M,(T); moreover, kercp = { ( a i j ) : ~ ~xiaij for all i } = 0, so cp is an isomorphism from M,,(T) to End M T . Q.E.D. Corollary 1.5.14: Suppose R is a ring with subringT, and as a right Tmodule R is free with a base of n elements. Then R E M,(T). Proofi
Example 1.5.12 shows R G End R T
= M,(T).
Q.E.D.
Corollary 1.5.15: Every jinite dimensional algebra over a jield is isomorphic to a subalgebra of a suitable matrix algebra.
81.5 Endomorphism Rings and the Regular Representation
85
Corollary 1.5.16: I f M E D-FimuA for a division ring D then k i d , M x M,(D) for some n. Proo)
Every module over a division ring is free, so apply the theorem.
These important corollaries begin to show us the power of theorem 1.5.13 even in the case when M is free. In fact, the relation between endomorphisms and matrices elevates matrix rings to perhaps the most prominent position in the structure theory of noncommutative rings, leading us to study endomorphisms in terms of matrix properties as in the following remark:
Remark 1.5.17: Suppose M has a base { x l ,..., x,} in A u d - T and (a,) E M,(T). Then xiaij:1 Ij I n} spans M iff (a,) is right invertible (since then we can recover the x i ) .
{I:=
When M # N then HOm,(M, N) is not a ring, but is nevertheless an abelian group which is also of considerable interest.
Remark 1.5.18: Suppose M E R - A u d and N E R-Am!-T. Then HOm,(M,N) becomes a right T-module with the scalar multiplication fa (for f:M -+ N and a E T ) given by ( f a ) x = ( f x ) a for all x in M . (The verifications are straightforward and left to the reader.) Likewise if M E A d - T then Hom,(M, N) E R - A u d with scalar multiplication rf given by (rf )x = r( f x ) . (Incidentally, this latter version “looks like” associativity.)
Finally, if M E R - A d - S and N E R - A d - T then simultaneously we can view Hom,(M, N) as S-module (as above) or as right T-module (as in remark 1.5.18), whereby, in fact, Hom,(M, N) is an S-T bimodule. We continue this brief digression to record a useful generalization of example 1.5.9. Proposition 1.5.19: Hom,(R, M) x M in R - A d where we oiew Hom,(R, M) as R-module via the action r f dejned by ( r f ) x = f ( x r ) for r in R and f :M+R.
Constructions of Rings
86
Proof: Define $: M + Hom,(R, M) by $ y = py where py is right multiplication by y . For all r, x in R we then have $(ry)x = p l y=~xry = p,,(xr)= (rp,,)x so $(ry) = r$y, proving $ is a map. $ is monic since y # 0 implies Q.E.D. 0 # y = py 1; $ is epic because f = p,l for any f:R -+ M.
Proposition 1.5.20: For any n in N and M in R - A d - T there is an isomorphism @:(End, M)'") + Hom,(M("), M) in Mud-T, sending (f l , . . .,f,,) to the map f dejned b y f ( X I , . . .,x,,) = &xi.
c?=
Proofi Write x i :M(")+ M for the projection onto the i-th component, and pi: M + M(") for the map p i x = (0,. . .,0, x,O,. . .,0) where x appears in the i-th component. Then @( fl, ...,f,,) = cl;:ni. Defining Y: HOm,(M'"', M) + (End, M)'") by Yf = (fpl,. . .,fp,,), we see @Yf = fpini = f pini = f and 'Pa(fl,..., f,,)= Y c l ; : n i = (fl ,..., fn). Thus @ = Y - ' and Y,@ are both isomorphisms. Q.E.D.
1
The Dual Base Taking M = R and T = H in proposition 1.5.20 and identifying End, R with R as in example 1.5.9, we see R(")z Hom,(R("),R) as abelian groups. This identification can be made more explicit. Definition 1.5.21: Suppose M E R - A d . Taking N = R E R-M0d-R in the natural way, we put M = Hom,(M, R), viewed in A u d - R as in remark 1.5.18. If M is free in R-Fiwzod with base { x l , .. .,x , } , define jZ in M for each i by 2icj"= I rjxj = ri (so that 2ixj = dij). We call . .,2,} the dual base of x l , . . .,x , . (An analogous construction exists for M in A d - R , in which case M E R-A~A.) Proposition 1.5.22: lf M is free in R-9imud with base { x l ,..., x,,} then . .,2,} is a base of M (so, in particular, M is free in A u A - R ) . Any map f:M - t R in M satisfies f ( ~r i x i~)= x~i i f x, i , so letting aj = f x j E R we have f = I; Zjaj = (because ( c j Z j a j ) ( rci x i )= C 2j( rixi)aj= riai = f rixi)). This proves that 21,.. .,i nspan M. Independence is straightforward; if z j r j = 0 then for each i we have Q.E.D. 0 = (1 i j r j ) x i= l(2jxi)rj= dijrj= r i .
Proof:
c
c (c cy= cj"= cj"=
There is an enlightening connection between M and M using category theory, given in exercises 2, 3. Note that for any map f:M -+ N we have (by example 0.1.8(ii)) a map f 3 + M given by f h = hf for any h: N + R. This
$1.5 Endomorphism Rings and the Regular Representation
87
map is especially important when R is a field and M is a finite dimensional vector space, for then the full force of linear algebra applies. In the literature, $1 is often designated as M * , and we shall also feel free to use the latter notation.
Adjunction of 1 Although we consider only rings with 1, there is an extensive literature on rings without 1 (i.e., all axioms are satisfied except for the existence of I), which forms a category g*zg whose morphisms cp satisfy all requirements of ring homomorphisms except we obviously need not have cpl = 1. Thus the forgetful functor (forgetting that 1 exists) enables us to view Britg as a subcategory of %zg, which is not full since the function p: Z --f Z x Z given by pn = (n,0) is a morphism in 9 ~ but g not in 9i*zf. The first question one may ask is, given a ring R , without 1, what is the universal from R , to the forgetful functor?
Definition 1.5.23: The ring Rb obtained by adjoining 1 formally to R , is the additive group Z0 R , together with multiplication defined by (ml>rI)(m29r2)= (mlm2,mlrZ + m2r1 (The trick here is to think of (m,r ) as m
+ r1r2).
+ r where m E Zand r E R.)
Proposition 1.5.24: The ring Rb is indeed a ring and, together with the canonical injection u: R , Rb given by ur = (0, r), is a universal from R , to the forgetful functor. --f
Proof;. We demonstrate Rb as a ring by means of the regular representa-Namely, for every (m,r) in ZO R , define (m,r) in End@ 0 R , ) by tion. (m,r)(m’, r’) = (mm’,mr’ + m’r + rr’) for all (m’, r’) in Z0 R,. We need to -) that Rb will be identified with a show ( m l , r l ) ( m 2 , r 2=) ( m l , r l ) ( m 2 , r 2so subring of End,@ 0 R,). Well __-
+ + r2r’) = (m,m2m’,m1(m2r’ + m‘r2 + r,r’) + m2m’rl + rl(m2r‘+ m’r2 + r2r’)) = ( m l m 2 , m l r 2+ m2r1 + rlr2)(m’,r’)
(m,,~l)(m2,r2)(m’= , r ‘(ml,r,)(m2m’,m2r’ ) m’r2
= (ml~rl)(m2,r2)(m’,r’)
as desired. Note that (1,O) is the multiplicative unit.
88
Constructions of Rings
To show universality, suppose R is a ring and f:R, + R is a morphism in Wq.We want to extend f to a ring homomorphism f’: Rb + R. Clearly, then, f’(1,O) = 1, so f’(m,r) = m + fr for all r in R,, and we see this in fact defines a homomorphism since f ’ ( ( m l > r m 2 , r 2 ) )= f ‘ ( m , m , , m , r ,
+ m2r1 + r l r 2 )
= m1m2
+ f(rnlr2 + m2rl + r1r2)
= m1m2
+ 4 f r 2 + (f7-1Im2 + fr1fr2
= (ml
+ fr1)(m2+ fr2)
= f’(rn1,r1)f’(m2,r2) Q.E.D.
The importance of the injection u is that it permits us to identify R, as an ideal of Rb. Thus rings without 1 should be viewed instead as ideals of rings. One problem with this construction is that if R, happens to be a ring (with 1) then Rb has a different 1. To correct this problem we call R, nondegenerate if Ann,, R , = 0. In this case the regular representation R, + End,, R, is an injection. Remark 1.5.25: Let T = hd,,R0. By proposition 1.5.24 the regular representation p: Ro + T extends to a homomorphism p‘: R b + T given by p’(m,r) = m + p i , and kerp’ = {(m,r): mr, + rr, = 0 for all ro in R,} = Ann,; R,. Taking R = Rb/kerp’ we have a ring injection R + T. Let ii: R, 4 R be the composite of the canonical homomorphisms u: R, + Rb and Rb + Rb/ker p’ = R. When R, is nondegenerate we have 0 = Ann,,, R, = R, n ker p’ = ker ii, so iiis an injection; we call R the reduced ring with 1 adjoined to R,. This construction has the advantage that if R , happens already to have an element 1 then iil = 1 because (1, - 1)R, = 0, implying U is a ring isomorphism.
a:
51.6 Automorphisms, Derivations, and Skew Polynomial Rings In this section we construct a noncommutative analogue of R[I] which still has many of its nice properties. In order to view the construction in context, we consider automorphisms and derivations of rings (leading to Lie algebras).
A utomorphisms Definition 1.6.1: An automorphism is an isomorphism Q: R + R. Write R“ for { I E R: or = r}, a subring of R called the fixed subring (under Q ) .
$1.6 Automorphisms, Derivations, and Skew Polynomial Rings
89
Remark 1.6.2: Any automorphism a of R restricts to an automorphism of Z(R). (Indeed, for any z in Z(R) and r in R, (az)r = a(za-'r) = o((a-'r)z) = r(az), proving az E Z(R), so a restricts to a homomorphism of Z(R), whose inverse, likewise, is the restriction of K'.) Automorphisms of fields give rise to classical Galois theory. O n the other hand, there are many automorphisms of R which in fact fix Z(R). For example, if a E R is invertible there is an automorphism (pa of R defined by qar = ma-' for all r in R; if z E Z(R) then qaz = aza-' = zaa-' = z. Automorphisms of the form q, for invertible a are called inner automorphisms. Definition 2.6.3: A unit of a ring R is an invertible element. Unit(R) = {units of R}, a multiplicative group; Inn Aut(R) = {inner automorphisms of R}.
Proposition 1.6.4: There is a group homomorphism @: Unit(R) + Aut(R) given by @a = q, (as dejined above). Then @(Unit(R))= Inn Aut(R) and ker@ = Unit(R) n Z(R), implying Inn Aut(R) x Unit(R)/(Unit(R)n Z(R)) as groups. Proofi For any a,b in Unit(R) and all r E R, qaqbr = $,(brb-') = abrb-la-' = qabrproving 0 is a homomorphism; ker@ = { a E R: ma-' = r for all r in R} = Unit(R) n Z(R). The last assertion is now clear. Q.E.D.
Derivations, Commutators, and Lie Algebras Definition 1.6.5: A derivation of a ringR is an additive group homomorphism d : R + R satisfying d ( r l r 2 )= (drl)r2 rldr2. It is important to note that this definition does not depend on the associativity of multiplication, and, in fact, we shall have occasion to deal with derivations of nonassociative algebras, cf., definition 1.6.6.
+
One motivating example is the usual derivative d on the polynomial ring R = W[A] given by d ( C f = ow J i ) = i w i A i - l . However, there is another fundamental class of derivations, for which we now aim. Given a ring R and ri E R, define the commutator [ r l , r 2 ] = rlr2 - r2r1.We shall rely heavily on the following computation:
Xi=,
[rl,r2r31= rlr2r3 - r2r3r1= [rl,r21r3 + r2[rl,r31. In particular, defining the map d,: R + R by d,r = [a, r], we see d, is a derivation, called the inner derivation given by a. Write [a, R] for {[a,r ] :r E R}.
90
Constructions of Rings
Then d, = 0 iff [a,R] = 0 iff a E Z(R). Thus we have a map R -+ Deriv(R) given by a + d,, whose kernel is Z(R). To give this map algebraic significance we introduce a new structure.
Definition 1.6.6: A module M over a given commutative ring C is called a nonassociative algebra if M has binary multiplication satisfying the following properties for all c in C, x i in M : C(X,X,)
= (CXJX,
= x,(cx,).
In other words, nonassociative algebras share all properties of associative algebras except associativity of multiplication and the existence of the multiplicative unit 1.
Definition 1.6.7: A Lie algebra is a nonassociative algebra A where multiplication, written [a,a,] instead of ala2,satisfies the following laws for all a, in A : Calall [[ala2]a3]
+ [[a2a3]a1] + [[aJal]a2]
=0 = 0 (called the
Jacobi identity).
To avoid confusion, sometimes we write [a,,a,] in place of [ a , a,].
Remark 1.6.8: In any Lie algebra, 0 = [ a , + a 2 , a 1+ a,] = [alal] + Ca2a11 + Lala21 + [a2a21 = Ca2a11 + Ca1a21, implying Caza1l = -Ca,a,I for all a,. This is called the anticommutative law. The reason [ 3 is used for multiplication in a Lie algebra arises from the first of the following important examples. Example 2.6.9: Replacing the usual multiplication of an associative algebra A by the commutator [a,,a2] yields a nonassociative algebra, denoted A - . Clearly [a,a] = 0 for all a in A, and, in fact A - is a Lie algebra; the easy verification of the Jacobi identity is left to the reader. For this reason, the commutator is also called the Lie product. Of course, we want to deal with categories, so we need the morphisms.
Definition 1.6.10: If L , , L , are Lie algebras over C,a Lie homomorphism is aC-modulemapf: L , -+ L , satisfying theconditionf[a,a,] = [fa,,fa,] for all a , , a 2 in L,. C - Y his the category whose objects are Lie algebras over C and whose morphisms are Lie homomorphisms. If L E C-Y&, a Lie
41.6 Automorphisms, Derivations, and Skew Polynomial Rings
91
subalgebra of L is a C-submodule which is closed under the Lie multiplication of L (and thus is also in C-Yie, because the conditions of definition 1.6.7 follow a fortiori). When mentioning an associative algebra A in the context of C-LYie, we usually mean A - . For example, a Lie homomorphism f: R + T of (associative) C-algebras is a module map satisfying f [ r l , r 2 ] = [ f r 1 , f r 2 ] .
Example 2.6.12: If R = M J C ) for a commutative ring C, then M,,(C)- has the following Lie subalgebras: (i) the set of matrices of trace 0 (for tr[a, b] = tr(ab) - tr(ba) = 0). (ii) the set of skew-symmetric matrices. Proposition 1.6.12: Deriv(R) is a Lie subalgebra of (End,(R)-, for every algebra R. Proof:
(Note that we shall not use associativity of R.) If d1,d2E Deriv(R)
then
and, symmetrically,
so [ d l , d 2 ] is a derivation.
Q.E.D.
If L is a Lie algebra, define a Lie ideal I to be a submodule satisfying [ L l ] c I , i.e., [ax] E I for all a in L , x in I. It is straightforward then to verify that the quotient module L / I has the natural Lie multiplication [al + I , u2 + I ] = [ a l a 2 ]+ I, under which L / I becomes a Lie algebra; if 0: L + T is an onto Lie homomorphism then ker CD is a Lie ideal and L/ker CD z T as Lie algebras. Proposition 1.6.13: There is a Lie homomorphism CD: R- + Deriv(R) given by a + d, (the inner derivation corresponding to a).Writing Inn Der(R) for the set
Constructions of Rings
92
of inner derivations, we have O(R) = Inn Der(R) and ker O = Z(R), implying Inn Der(R) x R-/Z(R).
Skew Polynomial Rings and Ore Extensions We have noted the polynomial ring R[I] over a domain R satisfies deg(fg) = degf
+ degg
(1)
for all 0 # j,g E RCI], and deg 0 is undefined. In fact, (1) formally implies R[I] is a domain; hence we are led to ask under what general conditions R[I], viewed only as an R-module, can be endowed with multiplication making it a ring T graded by N which satisfies (1). Then T would automatically be a domain and might provide interesting new examples. We start by noting some necessary conditions obtained from polynomials of degree 0 and 1; where ri E R - ( 0 ) are arbitrary: (i) deg(r,r,) = deg(r,) + deg(r,) = 0 + 0 = 0,
so R
c T as domains.
so I r = (ar)I + 6r (ii) deg(Ar) = deg(l) + deg(r) = 1 + 0 = 1, for suitable maps a, 6: R + R with ker a = 0. (iii) a(rlrz)I+ 6(r1r2)= h 1 r 2 = (Ar1)r2 = ((ar,)I + 6rl)r2 = (m1)(mz)I (ar1)6r2 (8rI)rz;
+
+
matching components we get a(rlr2) = (ar1)(ar2)
and
6(r1r2) = (arl)6rz+ (6rl)rz.
In line with definition 1.6.5, we are led to the following definition. Definition 1.6.14: If a: R + R is a homomorphism, a a-derivation is a (E-module) map 6: R + R satisfying 6(rlrz) = (or1)&, (6r1)r2. Thus for a = 1, a a-derivation is merely a derivation. The properties described above in fact characterize T, as we shall now see:
+
Proposition 1.6.15: If the new ring structure on R [ I ] satisfies property (1) above, then for all r in R, I r = (ar)A 6r for a suitable injection cx R + R and suitable a-derivation 6 on R. Conversely, if a: R + R is an injection and 6 : R -,R is a a-derivation, then there is a unique new multiplication on R[I] (extending the R-module action) such that I r = (ar)l + 6r for all r in R ; moreover, this dejnes a ring T satisfying (1) and is thus a domain.
+
$1.6 Automorphisms, Derivations, and Skew Polynomial Rings
93
Proof;. The first assertion was prove above. For the converse we shall use the regular representation to obtain T as a subring of End, R [A]. Define 1in End, R[A] by the rule
Writing Ffor left multiplication by r define T = ( x ; = o c It iE: N, all ri E R } . If CJi = 0 then 0 = FiXi)A = riAi+ so each ri = 0; hence { 1': i E N} is a base of T as module over R = {F r E R).
1
(1
1
'
%=a
implying + 6r. Therefore, T is closed under multiplication and is thus a subring of End, RCA]; identifying R with R we see a t once that T satisfies (1) (and thus is a domain). Uniqueness of the multiplication follows Q.E.D. easily from (1). Definition 1.6.16: Suppose a: R -,R is an injection and 6 is a a-derivation. The Ore extension R[A;o,6] is the ring obtained by giving RCA] the new multiplication Ar = (ar)A + 6r, as in proposition 1.6.15. If 6 = 0 we write R[A;a] for R[A; a, S]; this is called a skew polynomial ring. R[A; l,S] is called a differential polynomial ring in the literature.
Note that an Ore extension of a domain is a domain, by proposition 1.6.15. Remark 1.6.17: A necessary and sufficient condition that each element of R[A;a,6] can be written in the form x i = o A i r iis that CJ is onto (i.e., a is an Airi, then clearly automorphism). (Indeed, if any rA can be written as t = 1, so rA = (ar,)A+ ( 6 r l )+ r o , proving ar, = r and thus a is onto. Conversely, if a is an automorphism then rA = Aa-lr - Ba-lr, and then one sees easily by induction on j that each term rAj can be written in the form Airi,and thus each element of R[A;a,6] can be written in this form.)
Ci=o
Principal Left Ideal Domains (PLID's) Let us now study the structure of skew polynomial rings more closely. Recall that F[A] is a PID (principal ideal domain) whenever F is a field, and this
Constructionsof Rings
94
property is used repeatedly in the commutative theory. The noncommutative analogue is a straightforward generalization, but we shall see later that the asymmetry of the construction of skew polynomial rings gives them some fascinating properties.
Definition 1.6.18: A principal left ideal domain (PLID) is a domain in which every left ideal is principal (i.e., of the form Rr). Every PLID satisfies the left Ore property that Rr, n Rr, # 0 for any nonzero elements r,, r, of R. (Indeed, we are done unless r2 4 Rr,, in which case Rr, + Rr, = Ra with a $ Rr,. Then a = x l r l x 2 r 2 for x i in R with x 2 # 0. But for some r # 0, we have Remark 1.6.19:
+
rl
= ra = r(xlrl
+ x2r2)= rxlrl + rx2r2
implying 0 # rxzr2 = (1 - r x l ) r l E Rr, n Rr,.) The left Ore property is of utmost importance in constructing rings of fractions, c.f., g3.1. The link between skew polynomial rings and PLIDs lies in the Euclidean algorithm.
Remark 1.6.20: Suppose 0 # f,g E R [ l ;c,S] where the leading coefficient of g is invertible in R. Then f = qg + p for suitable q, p in R[A;c,S] such that either p = 0 or degp < degg. (Indeed, let m, n be the respective degrees of f and g. We proceed inductively on m. If n > m then we are done with q = 0 and p = f.Otherwise, letting al", bA" be the respective leading terms of f,g, we note al" = (al"-"b-')bl", so putting h = f - al"-"bb-'g, we see deg h < m and, inductively, h = q'g + p for suitable q', p with p = 0 or deg p < n. Hence f = (al"-"b-' + q')g + p.) Of course, the hypothesis of remark 1.6.20 holds when R is a division ring, leading to the next result.
Proposition 1.6.21: Suppose D is a division ring. Then T = D [ l ; c , 6 ] is a PLID. Moreover, if Tf = Tg then f = dg for some d in D; in particular, deg f = deg g and f,g have the same number of (nonzero) terms. Proof: A left ideal L is generated by any element g in L of lowest degree (since i f f E L we write f = qg p implying p E L so p = 0). Now if Tf = Tg we see f = qg implies deg f 2 deg g; likewise, deg g 2 deg f; hence deg 4 = 0 so q E D as desired. Q.E.D.
+
51.6 Automorphisms, Derivations, and Skew Polynomial Rings
95
It is of interest to check when T is a principal right ideal domain (PRID). Proposition 1.6.22:
The following assertions are equivalent for T = D[A; a,d]:
(i) a is onto. (ii) T is a PRID. (iii) T is right Ore.
Proof: (i) 3 (ii) follows from remark 1.6.17 since the right-handed analogue of proposition 1.6.21 is applicable. (ii) (iii) is remark 1.6.19. (iii) =.(i). For any d in D we have some nonzero h E R T n dlT, so h = if = dAg for suitable f , g in T . Let f , g have leading terms adn and bA", respectively; then the leading term of h is = dabl"", so aa = dab, implying d = o(ab6')E aD,proving a is onto. Q.E.D. A minor modification of the Euclidean algorithm permits us to generalize proposition 1.6.21.
Remark 1.6.23: Suppose 0 # f , g E R[I;a,d] with deg f > degg, and or is invertible in R where r is the leading coefficient of g . Then we can write f = qg + p where either p = 0 or degp I degg. (Indeed, write g = r l n + Elid r i i i . The leading term of Ag is (ar)A"+',so apply remark 1.6.20 to f and lg.) Proposition 1.6.24: If R is a PLID with a(R R[A; a, d] is a PLID.
-
{O}) E Unit(R) then T =
Proofi Given a left ideal L of T let Lo = {leading coefficients of polynomials of L having minimal degree, n } . Then Lo < R so Lo = T r , for some r , in R . Take y E L of degree n having leading coefficient r,,. We claim L = Tg. Indeed take any j ' E L-Ty. Using remark 1.6.23 we may replace f by p and assume deg f = n so the leading coefficient of f is rr,, for some r in R; then f - rg is an element of L of degree < n so f - rg = 0, i.e., f = rg E Tg. Q.E.D. Of course this result only adds interest when a is not onto. However, it is important for two reasons: (i) the converse is true (cf., exercise 3) and the condition a(R - (0)) G Unit(R) permits an iterative construction which provides many interesting examples of Jategaonkar [69]; consequently, the
96
Constructions of Rings
condition is called Jategaonkar's condition. Presently we shall restrict our attention to special cases in order to introduce several important classes of rings.
Skew Polynomial Rings (Without Derivation) Over Fields First we consider the case 6 = 0, i.e., T = K [A; a ] .Clearly, TIi a T for i, and, more generally, TzA' a T for every z in Z ( T ) and all i. Surprisingly enough, every ideal has this form. Let K" denote {a E K : aa = a} Proposition 1.6.25: Suppose K is a jield having an endomorphism T = K [ 1 ; a ] and F = K".
CJ.
Let
(i) Z ( T )= F unless a is an automorphism of order n, in which case Z ( T ) = F[A"]. (ii) Every ideal of T has the form Tp1" for p in Z ( T ) . Proofi
1
(i) Obviously F[A"] E Z ( T ) .Conversely, supposef = a i I i E Z ( T )where ai E K . Then 0 = [ A , f ] = '&zi - ai)Ai+' proving aai = a, so a, E F for each i. Moreover, for every a in K we have 0 = [a,f] = l a i ( a - a'a)A', implying a = d a whenever a, # 0, i.e., oi = 1 so n divides i. Hence f E F[An] as desired. (ii) Suppose A a T and choose f # 0 in A of minimal degree t. By proposition 1.6.21 we have A = Tf and f has the same number of (nonzero) terms as any other polynomial in A of degree t . Replacing f by a;f' we may i+l assume a, = 1. Now [A, f ] = i(aai - a,)A has fewer terms than f and thus must be 0 by the above discussion. Hence each ai E F. Moreover, for every a in K we see (a'a)f - fa has degree It - 1 and is in A, so must be 0, implying (o'a)a, = a p ' a for each i. Hence a', = a'a whenever a, # 0, implying a' - i = 1 so n I ( t - i ) . Taking m to be the degree of the lowest order term of f we Q.E.D. conclude f~ F[A"]I" = Z(T)A".
1:
(The proof given above is redundant, for the proof of (ii) also implies (i). Indeed if f E Z ( T )then Tf U R and thus f = apl" for some a in K and p in F [ A n ] ,from which it readily follows a E F and m = 0. However, the argument of (ii) is also subtler than that of (i).) Example 1.6.26: Let K be a field with an endomorphism a which is not onto, e.g., K = Q(A) and a is given by aA = ,I2. (For a ( f ( I ) g ( A ) - ' )=
81.6 Automorphisms, Derivations, and Skew Polynomial Rings
97
f ( A 2 ) g ( 1 2 ) - 'one ; sees at once A I# O K , for if A = a( fg-') then g ( A 2 ) l = f (A2) contradicting the parities of degree.) K [ A ; a] is a PLID which is not a PRID by proposition 1.6.22; using proposition 1.6.25, we see the ideals only have the form (Ai), so, in particular, the ideals form a chain. Corollary 1.6.27: Suppose a is an automorphism of K of order n, and F = K". If p(A) # A is an irreducible polynomial of F [ l ] , then (p ( A n ) ) is a maximal ideal
of T = K [ A ;a] and T/( p(A")) is a simple ring. Any ideal containing ( ~ ( 2 " )has ) the form Tq(An)Am where q E F[A], so p(A") E Tq(l")l". If f is an irreducible factor of q(A") in F [ A ] then f I p(A"). If there were 9, h in F[A] such that gp hq = I , then g(l")p(A") h(l")q(l")= 1 contrary to the existence off. Hence, p , q are not relatively prime in F[AJ so p I q implying ( ~ ( 2 " )indeed ) is maximal. Q.E.D. Proof:
+
+
Example 1.6.28: (Cyclic algebras) Let R = K [ A ; o ] / ( l " - a ) where a is an automorphism of order n and a E F = K u. Since - a is obviously irreducible in F [ l ] , we see that R is a simple ring which we call the cyclic algebra ( K ,a, a). Let z be the canonical image of A in R and identify K with its image in R . Then R = Kz', and (2,: 0 I i < n} is a base for R as a vector space over K (for if aizi = 0 with some a, # 0 then ~ aiAi ~ E (A" ~ - ,a ) which ' is impossible by a degree comparison). Multiplication is given by the straightforward rule
c;:;
1::;
ifi+jn. In particular, Z" = a E F. Moreover, F = Z ( R ) (for if zyij aizi E Z ( R ) , then 0 = [z, aizi] = c(aai - ai)zi+ showing each a, E F; then 0 = [a, aizi] = c a i ( a - a'a)z' for every a in K , so taking a with aia # a we see a, = 0 for each i # 0.) Now n = [ K : F ] = [ R :K ] so [ R : F ] = n2.
c
',
1
Thus each cyclic algebra is a simple algebra of dimension n2 over its center for suitable n. This construction generalizes W = (C, a, - 1) where a is complex conjugation, and is the key to much of the theory of finite dimensional division algebras, which will be discussed in Chapter 7 in much greater detail.
Diflerential Polynomial Rings Over Fields Now we consider the opposite extreme, where (T = 1. Some of the methods are similar, but first we need to see how a derivation 6 "works" on a ring.
98
Constructions of Rings
Remark 1.6.29: ("Leibniz's formula") The following rule is seen by induction on n:
6"(ab)= i=O
(1) hia6"-'b
Leibniz's formula is used extensively in studying derivations. Our next result relies on the obvious consequence that if 6'a = 0 and 6 J b = 0 then 6"J- '(ab)= 0. Remark 1.6.30: Suppose 6 is a derivation of a ring R, and put Ri = { r E R : di+'r = 0 } and R , = U i c N R E i R . Then R , is a ring and satisfies RiRj E R i + j . In particular, Ro is a subring; if r E R , and r-' E R then r-' E R,. (Indeed, first note 61 = 6(1 1) = 61 61 implying 61 = 0 and R , is a subring. Then 0 = 6(rr-') = (6r)r-' r6r-l = r6r-I for any rin Ro which is invertible, implying 6r- = 0.)
-
'
+
+
Lemma 1.6.31: Notation as in remark 1.6.30. Suppose R = R , T = R [ I ; 1,6]. if A is any subset of T such that [ I ,A ] G A then
and
A n Ro[A] # 0.
(Note Ro[A] is the usual polynomial ring.) Proofi Of all the nonzero elements of A of minimal degree t, take f = riAi such that 6"rt = 0 for n minimal possible. (By hypothesis some hnrt = 0.) Then ~ ~ = , ( 6 r i )=A i[ I , f ] E A and 6"-'(6rt) = 0, so by assumption Q.E.D. we see [ L , f ] = 0, i.e., all 6ri = 0.
I:=,
The Weyl Algebra We are now going to define a ring which is very important both in the structure of enveloping algebras (58.3 below) and also in its own right. Example 1.6.32: Suppose C is a commutative ring. The Weyl algebra dl(C)= C { p , A } / ( A p - pL - 1) where p,A are indeterminates over C . In other words, we have & = 1 in A,(C). More generally, taking pl,... , p n ,A,,. .. , I , to be indeterminates over C , we define d , , ( C )= C { p , ,. , . , pn,I , , . . . ,A,,}/B where B = ([A,, pi] - 1, [ I , ,p j l , [Ai, Ajl,[pi,pjl for all i # .i). When C is understood, we merely write dnfor d n ( C ) .
9+
There is an alternate, more explicit description. Let W, = R[A; 1, 61 where R = C[p]and 6 is differentiation with respect to p. Note that L f - fL = Sj,
99
$1.6 Automorphisms, Derivations, and Skew Polynomial Rings
+
so, in particular, I p = pI 1, and we have a canonical isomorphism d,z W , . Proceeding inductively we put R ( n - l )= d n - , [ p , , ] and have d,, z R,,,- ,,[A,,;1 , 4 ] where 6, is partial differentiation with respect to p,,. a ,. . ., a for Because of this description, the notation C xi,. . .,x,,,
[
~
ax,
-1
ax,,
.d,,(C)has become widespread in the literature. (Thus x i replaces pi, and d / a x i replaces I i .) More generally, there has been increasing algebraic interest in differential operator rings, cf., recent work by K. Brown, J. McConnell, S. P. Smith, and T. Stafford. 1 so d,, = (d,,-,[A,,])[-p,,; 1,SJ On the other hand, -pA = A(-p) where 6; is partial differentiation with respect to A,,. (By convention take do= C ) .This is used to prove the following key result.
+
Proposition 1.6.33: If C is a commutative Q-algebra then every Lie ideal L of d,,intersects C nontrivially. Proof: In the notation of example 1.6.32 we have L n R ( , , - , , # 0 by lemma 1.6.31. But viewing instead d,,as (d,,-,[A,,])[-p,,; l,&] we apply lemma 1.6.31 to L n R , , - , , toget O # ( L n R ( , _ , , ) n d n - l [ A n ]= L n d n - l , a Lie ideal of d,,- Continuing inductively we conclude 0 # L n do= LnC. Q.E.D. Corollary 1.6.34: d , , ( F ) is a simple domain, for any Jield F of characteristic 0. More generally, if C is a commutative Q-algebra then every nonzero ideal B of .d,,(C)is generated by central elements, and d , , ( C ) / Bz d , , ( C / ( Bn C ) ) . Proof: Let B’ = B n C # 0, and write R for d,,(C).The canonical map R -,d , , ( C / B ’ ) ,obtained by taking coefficients modulo B’, clearly has kernel RB’, so R / R B ’ = d , , ( C / B ‘ ) .If RB’ c B then B / R B ’ corresponds to a nonzero ideal of d , , ( C / B ’ ) , which contains a nonzero element of C / B ’ = C / ( R B ‘n C ) x (C + R B ’ ) / R B ’ ,so B contains an element of C - RB’, conQ.E.D. tradiction. Hence RB‘ = B and R I B = d , , ( C / B ’ )as desired. Note d , ( F ) is also a PLID and PRID because of the symmetry given above and, thereby, is used in Chapter 3 as a source of interesting examples. More significantly, Weyl algebras are crucial to the theory of enveloping algebras of Lie algebras, cf., Chapter 8. Also cf., exercise 1.7.1. Let us return to the general setting.
Lemma 1.6.35: Suppose R = D[A; 1,6] where D is a division ring, and 0 # A a R . Then A = Ra for suitable a which centralizes D; if char(D) = 0 then 6 is inner.
Constructionof Rings
100
Proof: By proposition 1.6.21 we have A = Ra where a = 1' + x i 3 ; d i l i . Then for each d in D we have
ad = d1'
+ (t6d + d r - l d ) l ' - ' +
Now ad E A = Ra and deg(ad) = t = deg(a) so ad E Da; comparing coefficients of 1' proves ad = da. Now comparing coefficients of 1I-l shows t6d + d r - l d = dd,-,; so 6d = Q.E.D. [d, t-'d, - ' 1 if t {char@).
Proposition 1.6.36: Suppose 6 is a derivation on a division algebra D . (i) If 6 is inner given by [d,-] then there i s an isomorphism from the polynomial ring D[1] to D [ I ; 1,61 given by 1 -+ I + d , and eoery ideal is generated by a central element. (ii) I f 6 is not inner and char(D) = 0 then D[1; 1,6] is simple. Proof.. (i) [A - d , x d i A i ] = C ( [ l , d i ] A i - [ d , d i ] l ' ) = E(6diAi - 6diAi) = 0, so I - d acts like a commuting indeterminate, and we have the first assertion. Thus the second assertion can be checked in D[A]. Let A 4 D[A]. By the lemma we have A = D[A]a where a centralizes D and thus is in Z ( D [ I ] ) . Q.E.D. (ii) The contrapositive of the lemma.
Skew Power Series and Skew Laurent Series When 6 = 0 we can define a filtration on R[A;a] according to the lowest order monomial, as in example 1.2.26, which leads us to look for a generalization of power series rings and Laurent series in this case. Defnition 1.6.37: The skew power series ring R [ [ I ;a]] has the same additive structure as R[[A]] but with multiplication given by
(We assume 6:R + R is an injection.) Proposition 1.6.38: A = R [ [ I ; a]] is indeed a ring containing R [ I ; 03 canonically and has a filtration defined by putting A(t) = { riAi:ri = 0 for all i < t } . Consequently A is a domain if R is a domain.
,:I
Proof:
We prove A is a ring by using the regular representation as in the
41.7 Tensor Products
101
proof of proposition 1.6.15. The remainder of the proposition follows the discussion of filtrations in $1.2. Q.E.D.
Definition 1.6.39: The skew Laurant series ring R((A;a)),is the ring whose additive structure is that of R((A))= { x z m r i A i : mE Z , r i E R } but with multiplication given by (x,z,riAi)(C,",,r:Ai) = C,"=m+.(cI=",uDur:-u)Ai. There is an important subring denoted R[A, A - ' ; a] consisting of those elements having finite support, i.e., Z ; = m r i L iwhere m In are in h. Unfortunately R [ A , L - ' ; o ] is called a Laurant extension of R in the literature, but at least the notation is unambiguous. We write R[A,A-'] for RCA, A-'; 11.
Skew Group Rings It is easy to check that R[A, 1-'1 is isomorphic to the group ring R [ Z ] , so we are led to try to "skew" the group ring construction.
Definition 1.6.40: Suppose G is a group of automorphisms of R . Define the skew group ring R * G = rgg:r, E R } with multiplication given by the rule (rg)(sh)= (rsg)gh, where g h is the product in G, and sg denotes the element g(s) in R. We leave it to the reader to check that R * G is indeed a ring and that R * ( a ) z R [A,A- ;a] when D is an automorphism of R having infinite order. We shall refer to skew group rings only occasionally in the sequel.
{I,,,
'
61.7 Tensor Products The next construction to be considered in this chapter is the tensor product. This is an extremely important tool, some of whose uses will be outlined following the definition. We start with M in A d - R and N in R - M u d . Given an abelian group A we say II/:M x N -,A is a balanced map if satisfies the three conditions
+
Ill(& + X 2 , Y ) = W 1 , Y l ) + N X 2 7 Y l ) 4 + ( X , , Y l + Y 2 ) = W I ~ Y l+ ) W l l Y 2 ) +(Xlr7Yl) = ~ ( x 1 9 r Y l )
for all x i in M , y i in N , and r in R . This definition closely resembles that of bilinear form (cf., exercise 3). The tensor product turns out to be a universal for a suitable category involving balanced maps.
Constructionsof Rings
102
Definition 1.7.1: The tensor product M Q N is the abelian group GIH, where G is freely generated (as Z-module) by the Cartesian product M x N, and H is the subgroup of G generated by all elements of the form
for xi in M, y i in N , and r in R. Write x Q y for the image of ( x ,y ) in M 6 N. If R is in doubt, we write M BRN in place of M Q N. Digression 1.7.2: Historically, the tensor product arose from a need to “multiply” two finite dimensional algebras A and B over a field F. Explicitly, given respective bases a,, .. .,a,,,and b l , . . .,b, of A and B over F, we could define A B B to be the vector space of dimension mn over F, whose base is written formally as {aiQ b,: 1 I i Im, 1 5 t In}. To define multiplication, one notes that multiplication in A and B are determined, respectively, by aiaj = aijkakand b,bu = &,,b, for suitable aijk,btUuin F ; then one could define
cF=
8 br)(aj @ bu)
(ai
=
k.u
aijkflruuak
0
and extend multiplication distributively to A Q B. The standard present-day treatment is much more general and elegant and still enables us to recover the above construction (cf., corollary 1.7.23 below). The approach is completely different. Whereas the x Q y span M Q N in Z.Mud they are not independent, so we cannot use them to define operations on M Q N. Instead, we rely almost exclusively on the following universal property.
Proposition 1.7.3:
There is a balanced map i,b: M x N -+ M Q N given by i,b(x,y)= x Q y. Moreover, if cp: M x N --* A is any balanced map there i s a unique group homomorphism Cp: M 8 N + A such that
cp(x B Y ) = cp(X,Y). Proof: The balanced map conditions are automatic from definition 1.7.1. To prove the other assertion, note cp extends naturally to a group homomorphism 9:G + A given by cpc(xi,yi)= cp(xi,y,) (notation as in definition
1
103
51.7 Tensor Products
1.7.1);then H G ker cp yielding the desired Cp: G / H -+ A by Noether’s structure Q.E.D. theorem.
Corollary 1.7.4: Suppose f: M -+ M’ and g : N
-+ N ‘ are maps in A u d - R and R - A o d , respectively. Then there is a group homomorphism denoted f Q g : M Q N -+M’ Q N ‘ such that ( f Q g)(xQ y ) = f x Q gy.
Proof: Define cp: M x N -+ M ’ Q N ‘ by $(x,y ) = f x Q gy. Then cp is balanced; take f Q g to be 50. Q.E.D. Remark 1.7.5: Tensor products serve the following purposes: (i) keeping track of balanced maps; (ii) changing rings of scalars (for modules and algebras); (iii) providing a “multiplication” of algebras (over a common base ring); and (iv) providing universal constructions, such as the “tensor algebra”.
These uses of tensor product will occupy us for much of the book and could easily fill several volumes. For example, (iii) is the setting for the Brauer group and the ensuing theory of central simple algebras (Chapter 7) and Azumaya algebras (45.3). For the remainder of this section we shall introduce some of the main themes involving tensor products, largely postponing their very important categorical role until Chapter 4. Remark 1.7.6: If f:M -+ M ‘ and f ‘ :M’ .+ M “ and g : N N ‘ and g‘: N ’ -+ N “ are maps then f ‘fQ g’g = ( f ’ Q g’)( f Q 9). (Just check this on x Q y , which span M Q N . ) Consequently, there is a tensor functor from ( A d - R ) x ( R - A d ) to d&given by ( M ,N ) + M Q N and (f,g) -+ f Q g. (Note 1, Q 1, = l,@N.) -+
OR
Tensor Products of Bimodules and of Algebras Proposition 1.7.7: Suppose M E T - A d - R and N E R - A o d . Then M Q N E T - A d by the scalar multiplication a ( x Q y ) = a x @ y ; notation as in corollary 1.7.4, if f is also a map in T - A 0 d - R then f 0 g is a map in T - A d . Proof: First we redefine scalar multiplication in a manner which is obviously well-defined; namely, take the right multiplication map pa: M -+ M given by x + ax, and note ax Q y = (pa Q l N ) ( xQ y). Associativity is now
Constructionsof Rings
104
Corollary 1.7.8 lf M E T - 4 u d - R then there is a functor M Q - from R - A o d to T - M d given by N + M 8 N and g + 18 g . Analogously, i f N E R - M o d - T there is a functor -8 N from J o d - R to Mud-T given by M + M Q N a n d f -+ f 8 1. Of course, we can always return to the original case by taking T = Z. For greater generality we may assume M and N are both bimodules.
Proposition 1.7.9: lf M E R-Mud-S and N R-Aud-T(as in proposition 1.7.7).
E
S-Aod-T then M Q N
E
A particular instance is when a ring T is viewed as a T-R-bimodule (for instance if R c T). Then TBR- is an important functor from R - M u d to T-Aod, which we shall study closely, and is called changing the ring of scalars from R to T. This technique is also applicable to algebras. Proposition 1.7.10: Suppose R and S are C-algebras. Then R Q S is a Calgebra with multiplication (rl 8 sl)(r2Q s2) = r l r 28 s1s2. Proofi Fix r 2 ,s2 and define f:R + R and g: S + S by right multiplication, i.e., fr = rr2 and gs = ss2. Then f Q g defines right multiplication by r2 8 s2, so the desired multiplication is well-defined. Associativity of multiplication follows from remark 1.7.6. Moreover, R Q S is a C-module, so it only remains to verify distributivity. To see this we work from the left, fixing a in R 8 S and defining II,:R x S -+R @ S by &(r, s) = a(r 8 s). Then is balanced and yields the map &: R Q S + R 8 S ; this is left multiplication by a and is thus distributive. Right distributivity is analogous. Q.E.D. Remark 1.7.11: If f:R + R' and g : T + T' are C-algebra homomorphisms then f Q g is also a C-algebra homomorphism. (This follows at once from proposition 1.7.7.)
51.7 Tensor Products
105
Properties of the Tensor Operation Having obtained the tensor product for modules and algebras, we are ready to ascertain some of its most fundamental properties. Proposition 1.7.12: Suppose Ri are rings for i = 0, 1, 2, 3 and Mi E R i &ud-Ri for 1 I i I3. Then (MI Q M , ) 8 M ,
%
,-
M , 0 ( M , Q M , ) in R,-Aod-R,
under an isomorphism sending ( x l Q x,) 0 x3 to X I 0 (
Q
~ 2 ~ 3 ) .
Proof: Fixing x in M , , define the balanced map t,hx: M , x M , + M , Q ( M , Q M , ) by $ J x 1 , x 2 )= x 1 Q ( x , Q x), yielding a group homomorphism $x:
MI Q M ,
+
MI Q ( M , 0 M3).
Now there is a balanced map cp: (MI Q M 2 ) x M , -+ M , Q ( M , Q M , ) given by cp( x l i 0 x Z i ,x ) = x l i Q x , ~ ) hence ; we have Cp: ( M , Q M , ) Q M, + MI Q ( M , Q M , ) sending (x, Q x,) Q x , to x 1 Q ( x , Q x3).Clearly (p is an R , - R , bimodule map, whose inverse can be constructed symmetrically, so (p is an isomorphism. Q.E.D.
1
1
Corollary 1.7.13: IfRiareC-algebrasthen(R, Q R , ) Q R , z R 1 0 ( R 2 Q R 3 ) canonically as C-algebras. Proposition 1.7.14: If M , N E C-Aud for C commutative then there is a Cmodule isomorphism M Q N + N Q M given by x Q y + y Q x ; this is an algebra isomorphism if M , N are C-algebras. Pro08
Define the balanced map $: M x N Q.E.D.
$ is the desired isomorphism.
+N Q M
by $(x, y ) = y Q x ;
One also has distributivity of the tensor product over direct sums (What else?). This is a special case of results in Chapter 4,but a short proof is available along the same lines as before. Ni) + @ ( M Q Ni) Proposition 1.7.15: There is an isomorphism M Q (eie, sending x 0( y i ) to (x 0y i ) . Proof: Define the balanced map t,h: M x (@N i ) + @ ( M Q N i ) by t,h(x,(yi))= ( x 0yi). Then $ is the desired map. To construct $-', let pi:Ni + @ Ni
106
Constructions of Rings
(aiE,
be the canonical injection and let f i = 1 @ pi:M 6 Ni + M @ Ni). Piecing together the fi yields a map f:@(M 0 Ni)-,M @ Ni)as in examQ.E.D. ple 1.4.25, and f ( x @ yi) = x @ ( yi),proving f and $ are inverses.
(0
Corollary 1.7.16: If F is a free W-module with base { x i :i E I } and R is a ring containing W, then R BW F is a free R-module with base { 1 6x i : i E I } .
Proofi View F as 0Wxi and R in R-AuA- W in the natural way.
Q.E.D.
Tensors and Centralizing Extensions One of the best ways of finding useful examples of tensor products is by means of the following notion. Definition 1.7.17: We say a ring T is a centralizing extension of R if T = CT(R)R,i.e., if T is generated by R and its centralizer (in T ) .T is a central extension if T = Z ( T ) R . Clearly central extensions are centralizing; centralizing extensions are also called extensions in the literature and are called liberal extensions in RobsonSmall [31]. Example 1.7.18: (i) For any monoid S the monoid ring R [ S ] is a centralizing extension of R. Likewise R [ I ] ,R [ [ I ] ] and , R((I))are all central extensions of R. (ii) MJR) is a centralizing extension of R (identifying R with the scalar matrices, whose centralizer contains the matric units).
Tensor products are also centralizing extensions, in a very special way. If R, R' are C-algebras there is a homomorphism f: R -+ R @ R' given by f r = r @ 1, and we write R @ 1 for f R . (We shall see below that f need not be injective in general.) We shall carry this notation for the next few pages.
Proposition 1.7.19: R Q R' is a centralizing extension of R @ 1, for any C-algebras R and R'. Moreover, if T is a centralizing extension of R and R' = CT(R) then there is an algebra surjection h: R Qc R' + T satisfying h(r @ r') = rr'.
107
51.7 Tensor Products
Proofi Note ( 1 Q r')(r 0 1) = r Q r' = ( I Q 1)( 1 Q r'). Hence 1 Q R' centralizes R Q 1, and R Q R ' = ( I 0 R')(R 0 1). To prove the second assertion, we define the (onto) balanced map $: R x R' + T by $(r,r') = rr' and take h = 6:R 0 R ' + T. To check h is a ring homomorphism we note
h((r, Q r;)(r20 I ; ) ) = h(r1r20 r i r ; ) = r1r2r;r; = rlr',r2r> = h(r, Q r;)h(r2Q r;).
Q.E.D.
Corollary 1.7.20: Suppose T is a centralizing extension of a C-algebra R and R' = C,(R). If R ' contains a base B of T as R-module, then T x R Q R'. Proofi Let h:R 0 R ' + T be the surjection of proposition 1.7.19. If ri Q xi E ker h for x i E B then r i x i = 0, implying each ri = 0 by hypothesis; hence ker h = 0, proving h is an isomorphism. Q.E.D.
I:=
1
This somewhat technical result has several immediate applications.
Example 1.7.21: Assume R is a C-algebra, where C is an arbitrary commutative ring. Tensors below are taken over C . (i) The monoid ringR[S] has S as a base (as R-module), implying R[S] x R Q C[S]. (ii) MJR) has the eij as a base, implying MJR) x R 0 M,,(C). (iii) Let us partition M,,(R) into blocks of size n x n. Thus there are in2 blocks, and to the u-u block we define Euv = ~ ~ = l e ( , - l , ,$(,-, + il ) n + i for 1 Iu, u Im. There is an injection M,,(R) + M,,,(R) given by a + (". *
i.e., the block a is repeated m times along the diagonal and we write 0's elsewhere. Identifying M,,(R) with its image, we see easily that its centralizer contains E,,, and these E,, are a base for M,,,,(R) over M,,(R). Since the E,, are a set of m x m matric units we conclude that M,,,(R) x M,,(R)Q M,(C). In particular, M,,,(C) x M,(C) 0 M,,(C). (iv) The Weyl algebra d , , ( C )x d l ( C )Q ... 0 dl(C),cf., exercise 1. Example Z.7.2Z': Another useful example of tensor product is as follows: Suppose A 4 R. Then MIAM z (RIA) ORM for any R-module M. (Indeed, the map M 4(RIA) ORM given by x + 1 Q x has kernel containing AM, so we get a map MIAM + (R/A) ORM. Its inverse is constructed from the balanced map RIA x M .+ M/AM given by ( r + A,x) + rx + AM.) Connections of this kind between tensor products and changes of ring are very
Constructionsof Rings
108
important because they give us the opportunity of obtaining general results about rings from properties of the tensor functor (corollary 1.7.8).See proposition 2.1 1.9ff and Ej4.2 to see how this idea unfolds. The following easy module-theoretic result is a useful converse to corollary 1.7.20. Proposition 1.7.22: T = R QwR'.
Suppose R, R' are rings canonically containing W,and let
(i) If R' is free in W-Mud with base B' containing 1 then the canonical maps R -+ T and R' -+ T (given by r + r 0 1 and r' + 1 0 r') are monic. Thus we may view R,R' c T in which R n R' = W. (ii) If R, R' are free in W-Mud with respective bases B, B' then T is free in W-Mod with base { b 0 6': b E B and b' E B'). Proof: (i) Corollary 1.7.16 implies that T is free as R-module with base { 1 0 b': b' E B } containing 1 0 1. Obviously, if 0 = r 0 1 = r(l 0 1) then r = 0; if r' = 1 wib: E R' and 0 = 1 0 r' = wi 0 b; then each wi = 0 so r' = 0. Thus R C_ T and R' C_ T canonically. If r 0 1 = 1 0 r' = 1 0 1 wibi then matching components shows r = w I E W, proving R n R' = W. (ii) If r' = wjb; and r E R, then writing rwj = wijbi in R, we have r 0 r' = rwj 0 bi = wijbi0 b;, proving the b Q 6' span T. To prove they are independent, suppose 0 = wijbi 8 bJ = Xi( wijbi)Q bJ for suitable wij in W; then each wijbi = 0 so each wij = 0, as desired. Q.E.D.
1
c
c
c
1
c
1
xi
Tensor Products Over Fields The classical theory of tensor products is for C a field, in which case the subject becomes quite straightforward. Corollary 1.7.23: Suppose C is a field, and T = R 0 R'. The canonical maps R R 0 1 and R' -+ 1 0 R' are isomorphisms; thus we may view R c T and R' c T, and T is a centralizing extension of R. Moreover, if 8,B' are respective bases of R, R' over C then { b 0 b':b E B, b' E B ' ) is a base of T over C. -+
Proof: By proposition 1.7.22(since R' has a base including 1).
Q.E.D.
Corollary 1.7.24: Viewed in R 0 R', we have Z(R) 0 Z(R') E Z(R 8 R'), equality holding i f C is a jield.
31.7 Tensor Products
109
Proof;. The first assertion is obvious. To obtain the reverse inclusion, expand a base B, of Z ( R ) over C to a base B of R (over C) and expand a base Bb of Z(R’) to a base B’ of R‘ (over C). If x c i j b i 0 bJ E Z ( R 0 R’) then 0 = [ C c i j b i@ b;,r @ 1 1 = x[cijbi,r] 0 b3 for each r in R, implying (for each j )0 = cijbi,r] for each r in R, so each cijbi E 2.Thus cij = 0 whenever bi # B,; likewise cij = 0 whenever bj $ Bb, implying cijbi @ bJ E Z ( R )@ Z(R’). Q.E.D.
xi
[Xi
1
We would like to match the ideal structure of R 0 R’ with those of R and R‘. Of course one should not be too optimistic. Indeed if K is a finite field extension of F then the canonical surjection K OFK+ K of proposition 1.7.19 sending a, 0 a, H a,a, is not 1 : 1 , by a dimension count. Thus K OFK is not a field and thus has zero-divisors. Our next example should be compared to theorem 2.5.36 below. Example 1.7.25: Suppose K is a purely inseparable field extension of a field F ; then K OFK has nonzero nilpotent elements. (Indeed, take a E K such that u p E F, where p = char(F). Then (a 0 1 - 1 @ a)p= u p@ 1 - 1 @ a” = 0.) Nevertheless, there are positive results to be had when C = Z ( R ) .
Lemma 1.7.26: Suppose R is simple and a, b E R are linearly independent over Z ( R ) . Then there are wil,wi2 in R, 1 Ii I k ( f o r suitable k ) such that Cf= wilawiZ# 0 and wi,bwi, = 0.
If=
Proof;. Otherwise there is a well-defined map f:RbR + R given by
for all ril,ri, in R, and f is clearly an R - R bimodule map. But RbR = R. Writing z = f l we have zr = ( f l ) r = f ( 1 r ) = f ( r 1 ) = rz, implying z E Z ( R ) ; Q.E.D. then a = f ( 1 b ) = zb, contrary to hypothesis. Theorem 1.7.27: Suppose C = Z ( R )and R is a simple C-algebra. Then every nonzero ideal A of R QcR‘ contains an element of the form 1 Q r’ # 0; in particular if R‘ is also simple then R QcR’ is simple. Proof: Choose 0 # a = rj 0 r; E A with u minimal possible. If u 2 2 then there are elements wil, wiz in R for 1 Ii Ik such that letting sj = wilrjwi2we have su- # 0 and su = 0. Then
110
Constructionsof Rings
contrary to minimality of u. Thus u = 1, and a = r l 0 r ; . Then 1 0 r; E ( R 0 l ) a ( R0 1) G A, proving the first assertion. If R‘ too is simple then 1 0 1 E (1 0 R’)(1 6 r ; ) ( l 0 R ’ ) G A proving Q.E.D. R 0 R‘ is simple. Corollary 1.7.28: If T = R W where R is simple and W is a Z(R)-algebra centralizing R then T M R @Z(R, W.
Proof: Otherwise the canonical epic cp: R 6 W -,R W given by cp(r 0 w ) = rw is not monic. But then there is some 0 # 1 0 w E ker cp which is absurd since 0 = cp(l0W ) = W . Q.E.D. Corollary 1.7.29: Suppose T is a finite dimensional subalgebra over a field F, and T = R OFR‘ where R is a simple subalgebra. Then R’ = CT(R). Proof: Let R” = CT(R). Obviously R’ c R”. But then T = RR” so T M R QFR” by corollary 1.7.28,yielding[ R : F ] [ R ” : F ]= [ T : F ]= [ R : F ] [ R ’ : F ] . Hence [ R “ :F ] = [ R ’ : F ] and thus R‘ = R“. Q.E.D.
In describing subsets of M 0 N it is convenient to write A 0 B for { c i a iQ b i :ai E A , bi E B}, where A c M and B c N. One must be careful not to view this as the tensor product of A and B even though the notation is the same. For example, the tensor product 22 0z(2/2Z) # 0; however, viewed inside 2 Bz(2/22) we have 2 2 0 (2/22) = 0 since any 2m 0 ii = m 0 2ii = m@O=O. Proposition 1.7.30: lf f:M + N is an epic R-module map and M‘ E A d - R then ker(1,. 0 f) = M’ 0 kerf (viewed in M’ QRM ) . Proof: Write K = M‘0 kerf. Then K I ker(1 0 f ) so 1 0 f induces a map f: ( M ’ 0 M ) / K + M‘ 0 N satisfyingf(x’ 63 x + K ) = x’ 0 fx. We shall show K = k e r ( l 8 f ) by proving f is an isomorphism, i.e., by constructing ?-I. Define the balanced map t,b: M‘ x N -P (M’ 0 N ) / K by $(x’,fx) = x’ 0 x + K. Then $: M‘ 0 N + (M’ 0 N ) / K satisfies q ( x ’ 0 fx) = x’ 6 x + K as desired. Q.E.D.
Tensor Products and Bimodules We have seen already that when transferring properties between rings R E R’ one often relies only on the R - R bimodule structure of R’. However,
$1.8 Direct Limits and Inverse Limits
111
bimodules are very complicated; for example, try describing the free R - R bimodule in terms of a base! At times the tensor product is a useful tool in studying bimodules, in view of the following fact: Proposition 1.7.31: Any R QaRoP-moduleM can be viewed as R - R bimodule under the scalar multiplications rx = ( r Q 1)x and xr‘ = ( 1 Q r‘)x, leading to an isomorphism of the categories R Qz R o P - A u d and R - A d - R , for any ring R. Proofi are
The two verifications of interest in proving M is an R - R bimodule
(rx)r‘= ((r Q 1)x)r’ = ( 1 Q r’)(r Q l ) x = ( r 0 1 ) ( 1 Q r‘)x = r(xr’). x(r’,r;) = (1 Qr’,r;)x
= ((1 Q r;)(l Q r’,))x = (1 Q r;)(xri) = (xr’,)r;.
Any R Q RoP-module map f:M + N becomes an R - R bimodule map, so we have a functor F : R Q R O P - A o d -P R - A u d - R . To obtain the inverse functor one takes an R - R bimodule M and defines a scalar multiplication as follows: The usual balanced map argument yields maps I,!Jx: R Q RoP-P M (for fixed x in M ) given by IL,(rQ r‘) = rxr‘; now allowing x to vary, define ( r Q r’)x = I,!Jx(rQ r’). To check M is a module over R Q RoP we observe
+
(rQr’)(x,+ x2) = r(xl + xz)r’ = rxlr’ + rx2r‘ = (rQr’)xl (rQr’)x2. ((rlQr\)(r2 Qr;))x = ( r l r 2Qr;r’,)x = rlr2xr;r’, = rl(r2xr;)r‘,= ( r , 0 r‘,)((r20 r;)x).
The other verifications are clear, and any R - R bimodule map becomes an R Q R’P-module map under this action, so we have the inverse functor to F, as desired. Q.E.D. Corollary 1.7.32: Let F = (R Q Rap)("), with base e l , . . .,en. Then F can be rieirI = (ri0 ri)ei. viewed as free R - R bimodule under the action Likewise, free R - R bimodules of infinite rank can be constructed.
XI=,
1
51.8 Direct Limits and Inverse Limits In $1.10 we shall explore localization over a central monoid. The proof that localization exists is cumbersome, and it actually can be obtained more easily via “direct limits,” a general construction which is useful also in many other
Constructions of Rings
112
settings. We shall also consider the dual construction, inverse limits, as well as completions as a special case.
Direct Limits As motivation, recall how the coproduct of {A,: i E I } in a category % is the “smallest” object A containing each A i “independently” (e.g., when %? = R-Aod). We would like to perform a similar construction when the A i are “glued together” in some way. An extreme case is when I = N and A l G A , C A, c ...; then one would take A = A,. Of course, A, G A , , really means there is a canonical injection cp: A i-,A i + 1, and there is also the problem of finding the suitable set in which to form the union A. To handle these two difficulties in a manner which also embraces the coproduct, we assume the index set 1 is given an arbitrary preorder I (i.e., < is reflexive and transitive).
u
Definition 1.8.2: A system (A,; (pi) is a set of objects {A,: i E I } in a category V, together with (pi in Hom(A,,Aj) whenever i 5 j, subject to the following two rules: whenever i 5 j Ik. (1) (p:(p{ = cp:
(2)
(pj =
lA,
for all i.
Examples 1.8.2: (i) if I has the trivial preorder then the cpi only exist for i = j since any i # j are incomparable. (ii) Any chain is a system, where I is given the usual order of ordinals, and cp; is the inclusion map. Definition 1.8.3: Suppose I is a preordered set, as before. The direct limit of the system (A,;cp{) is an object denoted 1 4A, (or, more precisely, 14(A,;q { )if necessary) together with morphisms pi:A, + & A, satisfying pi = p j q i for all i I j; for which given any family of morphisms gi:A, + A satisfying g, = gj(p{ for all i I j we have a unique g: lim A, + A such that gp, = g ifor each i, i.e., g completes the diagram
-
for each i Ij. Direct limits are defined by a universal property, and so are unique if they exist. In fact, they fit into a natural categorical setting, cf., exercise 4.
$1.8 Direct Limits and Inverse Limits
113
Example 1.8.4: We interpret the three examples of example 1.8.2 (when they exist). (i) If I has the trivial preorder then hr~ Ai is the coproduct (ii) If I is a chain then 1 4A i can be interpreted as A i .
u
Ai.
Thus we see the direct limit unifies several examples, but to obtain full benefit we want to prove that in these cases the limit must exist.
Proposition 1.8.5:
Direct limits always exist in R - A d .
Proof: Let ( M i ;qi) be a system of R-modules. Letting p j : Mj + @ M i be the injection into the j-th component, let N = c i s j ( p j q i- p i ) M i I@ M i . Each p j induces a map p j :M j + (@M i ) / N , and the constructions show ,iijq{= pi for all i Ij. We shall show &(Mi: pi) is ( @ M i ) / N together with the pi. Indeed given gi: Mi -+ M satisfying gjcpi = gi we first define the unique map 9’:@Mi + M satisfying g’pi = g i for all i. Then 0 = gJq .1!- g i = g’p.cp! J I - g‘pi = g ’ ( p j q i - pi) so N I ker 9’. Hence 9’ induces a map g : @ M i / N + M satisfying gpi = g i , as desired; g is unique since the p i M span @ M i / N . Q.E.D. On the other hand, we can also prove existence by restricting the systems under consideration.
Definition 1.8.6: A preordered set I is directed if each pair of elements has an upper bound. (It follows at once that each finite subset of I has an upper bound.) A directed system is a system indexed by a directed set. Theorem 1.8.7: Suppose the category %? is dejned in a Jirst-order language. Each directed system ( A i ;cpi) in %? has a direct limit. Proof: Let A’ be the disjoint union of the sets A i . Each element a of A’ then belongs to some suitable A i , and we indicate this by writing a“’ inon A’ by puting a ( i ) b”’ iff stead of a. Define the binary relation cpfa“’ = cp!b(j’ for suitable k 2 i, j. (Intuitively a and b “agree” far enough along I . ) Then clearly cpya“’ = cpj”b(j) for all m 2 k , from which it follows at once that is an equivalence, whose set of equivalence classes A ’ / - we denote as 2. It is easy to see 2 E ObV since each defining axiom involves only a finite number of elements and thus a finite number of indices, so there is an upper bound for these indices at which the appropriate verifications can be made. (For example, if %? = 9ing: then [O“’] = [O”’] and
-
-
-
Constructions of Rings
114
[l'"] = [ l ' j ) ] for each i, j since there is k 2 i, j and q10") = O(k)= qfO'"; moreover, given arbitrary elements [a'"] and [b'j)] in A take k 2 i , j and define [a(')]f [b")] = [qra(') f qfb("] and ab = [q:a")q;b(J)]and check easily that 2 is a ring.) The same argument gives us morphisms p i : Ai + 2 defined by pi& = [a'"], and p j q j = pi since q$") a") for all i I j . We claim ( & p i ) is the direct limit. Indeed, given gi: Ai + A satisfying g j q i = gi for i Ij , we want a unique g : A -+ A with gi = gpi for each i. As usual, uniqueness is obvious since 2 = p i A i . Existence of g is obtained by defining g[a'')] = gia('); this is well-defined since if [a")] = [b")] then taking qika(')= qjkb(j)we have gid" = gkqika")= g k q j k b ( j )= gjb(j).One sees easily that g is a morphism. Q.E.D.
-
u
Example 2.8.8: We return to the systems of example 1.8.2, whose direct limits were described in 1.8.4. (i) If I has the trivial preorder then I is not directed, and, indeed, we have seen the coproduct (which is the corresponding direct limit) need not exist in the category of nontrivial rings. Example 2.8.9: (A module is the direct limit of its f.g. submodules). Suppose M E R - A u d and {Si:iE I } are the finite subsets of M, viewed as a directed poset under set containment. Writing Mi for the submodule spanned by S i , one sees at once that M = lim Mi since any maps gi: Mi -+ N can be "pasted" together to a map g : M -+ N. The following result shall be generalized later (c.f., theorem 4.2.10): Proposition 1.8.10: If (4; ji) is a system in R-Aud with direct limit N and K ~ S - . d u d - R ,then ( K B R N i ; 1 O q ; ) is a system in S - d u d and K @IR N = hJ(K BRNi). 1 8 cpi) is a system in S - A d . If pi:4-+ N are the caProof: ( K OR4; nonical morphisms then we have morphisms 1 6p i :K 6Ni + K 8 N satisfying 1 8 pi = 1 @ p j q i = ( 1 @ pj)(l 6 qi)for i Ij , so it remains to verify the universality condition. Given gi: K 0 Ni -+ M satisfying gi = gj( 1 6 qi) we need g: K 0 N + M satisfying g(l 6p i ) = gi for each i. Fixing a in K define h i a : 4+ M by hiax = g i ( a 8x ) for x in N,.Clearly h, = hjaq{ for i Ij , so by hypothesis there is ha:N + M satisfying hapi = h, for each i. Note for any r in R that hi,,,x = hia(rx),from which it follows ha,x = h,(rx). Thus we have a balance map h: K x N + M given by h(a,x) = h,x, yielding a map g : K 8 N -+ M given by g(a 6x ) = h(a,x). Now g(l @ pi)@ @ x ) = g(a 8 pix) = ha(pix)= hiax = gi(a 6x ) for all a in
$1.8 Direct Limits and Inverse Limits
115
K and x in N , proving g(l 0 pi)= g,; uniqueness is seen by fixing a and Q.E.D. noting the h, are uniquely given.
D Supplement: Projective Limits The dual construction to direct limits is called “projective” or “inverse” limits. Whereas the definition is obtained formally by reversing arrows, the flavor is different. Direct limits involve “pasting together” objects, whereas inverse limits often involve a topological completion. Let us start with a category W and a preordered set I . An inverse system is a set { A , :i E I } of objects in %? together with morphisms (pi: A j A , for j satisfying each i I -+
(p: =
cpicpj
(pj =
1,;
whenever i I j I k. for all i.
Definition 1.8.11: The inverse limit (denoted @ I F and also called the projective limit) of the inverse system (A,;cpj) is an object @ A , of %, together A , --t A , with q i v j = vi for all i I j , which satisfy the with morphisms v,: lim t following property: For every A in Ob% and every set of morphisms gi:A + A i satisfying (pigj = g i for all i I j , there is a unique g: A -+ lim A , satisfying vig = g i for t each i in I . If I has the trivial preorder we have redefined the direct product. The usual argument shows that if the inverse limit exists it is unique up to isomorphism. We want to find situations in which it is guaranteed to exist; to obtain a good general condition we assume the inverse limit exists and see where it leads us. Suppose W is a concrete category with direct products, and suppose (A,;cpj) is an inverse system having an inverse limit. From the characterization of product, letting nj: A i-, A j denote the projection, we have a A i+ A isuch that n i f = vi for each i. For each unique morphism i < j we then have nif = vi = cp:vj = (p$njf;thus each (a,) in f(@ A,) c A i satisfies a, = viaj for all i 5 j . In particular, we have the following necessary nondegeneracy condition:
n
n
{ ( a , )E
n
fl A , : ai = q j a j for i I j } z 0
We shall call this the nondegeneracy condition (for inverse limits), and now show it often is sufficient as well as necessary in the important case
Constructionsof Rings
116
that % is a category defined in a first-order language. Suppose ( A i ; q j ) is an inverse system satisfying the nondegeneracy condition, so that L = {(ai)E A,: a, = qfaj for i I j} # 0.Also suppose L E %‘ and , let v,: L + Ai be the restriction of ni to L. If A E Ob %? and 9,:A + A , satisfy cpigj = gi then define g:A + L by ga = (gia).By definition we have v,ga = gia for all a in A, proving L = lim A , . This defines inverse limits in R-A’od, 9&g, and d8, and more generally for “universal algebra,” c.f., Jacobson [80B, Chapter 21.
n
The Completion We turn now to the most important special case of inverse limit. We shall carry it out first for abelian groups and then consider rings and modules as special cases. Example 1.8.12: Suppose we are given a set of subgroups { B i :i E I } of an abelian group G. Preordering I by putting i 5 j iff Bj E B,, we get an inverse system (G,;cpj) where Gi = G / B i and cpi: G j -P G, is the canonical map (viewing Gi as Gj/(Bi/Bj)).The nondegeneracy condition is satisfied by (g + B,) for each g in G, so we can form 6 = l@ G i , called the completion of G with respect to the Bi. We have a canonical group homomorphism $: G + given by $g = (g + Bi); $ is an injection iff Bi = 0.
+
n
n
Explicitly 6 = {(g, Bi) E G,: gj - g iE Bi for all j 2 i } . Thus $: G + 6 is onto iff for every such sequence (Gi + B,) there is g in G with g - giE Bi for each i ; in this case we say G is complete. Another description of the completion comes from topology. We say (g,) in G‘ is a Cauchy net if for each i there is some i’ for which gj - gi.E Bifor all j 2 i’. (Then for all j, j’ 2 i’ we have gj - gY = (gj- gi.)- (gj. - gi.)E Bi). {Cauchy nets} form an abelian group Cauchy(G) under component-wise addition, and are the set of convergent nets under the topology obtained by viewing {B,:i E I } as a neighborhood system of 0. There is a group homomorphism Cauchy(G) -+ obtained by “weeding out” the terms of a Cauchy net so that i‘becomes i for each i. The kernel N is the set of Cauchy nets which converge to 0; i.e., for each i there is some i’ for which gj E Bi for all j 2 i’. Thus 6 x Cauchy(G)/N, which is the topological completion of G.
niel
Digression 1.8.13: The topology on G (defined above) is Hausdorff iff Bi = 0. (Proof: (a) If g E Bi then 0 lies in the closure of {g}. (e) If
n
41.8 Direct Limits and Inverse Limits
I17
+
g # h~ G then g - h 4 Bi for some i, so g Bi and h proving the space is Hausdorff.)
+ Bi are disjoint open sets,
Example 1.8.14: Suppose R is a ring with filtration over (Z, +).Taking Bi= R ( i )we have Bj' Bi for all i i j so we can form R as above. In fact d is a ring with multiplication by (ri Bi)(ri + Bi) = (rir: + Bi), in the case that each Bi a R. There are two cases of interest:
+
+
(i) R ( i ) = 0 for all i > 0; then any Cauchy net (ri Bi) is equivalent to Bi), so R z R canonically, and R is complete. (ii) R has a filtration over N (i.e., R(i) = R for all i 5 0); then has a filtration over N, given by R ( n ) = {(r, B,): each ri E B,,}. Note this implies ri + B' = o for i I n (since B' 2 B,,). Consequently, R n k(n)= B,, = ~ ( n ) . Also if (r; + Bi) E k ( n ) then (ri Bi) - (rn+ Bi) E k ( n 1); since r,, E B, we see R(n) = ~ ( n ) R(n 1).
(r,,
+
+
+
+
,+
+
,
+
Suppose M = M, > M , > M , > ... in R-Mod. We can form the comis in fact an kpletion M of M with respect to the Mi. If M i= BiM then module under scalar multiplication (ri + Bi)(xi Mi) = (rixi Mi). In particular, we have the following special case of example 1.8.14(ii).
+
+
Definition 1.8.15: Suppose A a R. The A-adic completion of R is the completion of R with respect to the A-adic filtration (over N) given by R(0) = R and R ( i ) = A' for i > 0. Likewise the A-adic completion M of an R-module M is its completion with respect to the submodule Mi = A'M. This definition was motivated by the p-adic integers; here R = Zand A = pZ. The A-adic completion i? of R has the ideal A^ = {(ai A') E k : a , E A ) which contains $ A (recalling t,b: R + k is the canonical ring homomorphism given by t,br = ( r + A')) and plays the following key role:
+
Theorem 1.8.16: Notation as above, R I A idempotent-lifting ideal of R.
%
RIA^ canonically and
A^
is an
Proof: Composing t,b with the canonical map R + d/A^yields a homomorphism R + R / i whose kernel is A, yielding an injection $: R I A + RIA^. But II/ is onto, for if (r, + A') E R then (ri A') - ( r l A') E A^, SO (ri A') A^ = $(r, A). Thus R I A % R / i . Next we show 1 - a ^ is invertible for any element a = (a, + A') in 2. Note if (ai + A') E A^ then a , E A so a, E a , +A' G A
+
+
+
+ +
Constructionsof Rings
118
for each i, implying a: E A' and (1 - a , ) ( x { ~ i a=~ 1) - a; E 1 + A'. Thus a: we see (bi + A') is the desired inverse of 1 - 6. putting bi = It remains to show every idempotent e =(ri + A') + A^ of @A^ can be lifted to d . We want to write e = (ei+ A') + A^ where each ei + A' is idempotent in RIA'. Since r: - rl E A we can take el = r l , and we work inductively on i. Suppose we have found e l , . . .,ei for i 2 1. A'/A'+ is an idempotent-lifting ideal of RIA''' since (A'/A'+1)2 = 0. Viewing R/A' z ( R / A ' + ' ) / ( A ' / A ' + ' ) we can lift ei + A' to an idempotent e i + l + A'+' of RIA''', thereby completing the induction step. Q.E.D.
Ctli
Proposition 1.8.17: Let M be the A-adic completion of M , and f: M + M be the canonical map given by f x = (x + A'M). I f M = R x j then M = k f x j . In particular, if M is f . g . then fi is an f . g . d-module.
I:.=,
Proofi Given y^ = yi + A'M in auiE A' and zui E M . Then zui =
fi we write y i +
- yi =
xu= k
aUizUiwhere
ruijxjfor suitable ruij in R, so
Putting gj =(bij+ A') where bOj= 0 and, inductively, b , 1, = b, + = auiruij, we see gj E d and yi = Q.E.D. bijxj, implying y^ = bjjZj.
If=
81.9 Graded Rings and Modules In the last 20 years considerable interest has been attracted to the theory of graded rings and modules, primarily because any ring with filtration over Z has an "associated graded ring whose structure bears heavily on the structure of the original ring. This construction is deferred until definition 3.5.30, since it is most relevant to Noetherian rings; here we lay out the basic framework of the theory of graded rings and modules, including the category and its "free" objects. Then we construct the "tensor ring," an important source of examples of graded rings, and apply it to the free product construction. The reader interested in graded rings should pursue this subject in theorem 2.5.30 (the Jacobson radical), proposition 3.5.31 (the associated graded ring), definition 5.1.36 thru theorem 5.1.41 (the &,-theory), theorem 6.2.9 (the Golod-Shafarevich counterexample), and 58.3, 8.4 (enveloping algebras). Also, cf., exercises 2.6.1 1ff. Definition 1.9.1: Suppose S is a monoid. A C-algebra R is S - p a a d e d , or graded over S, if R = @ { R , : s E S } for C-submodules R , for which R,R,. E
51.9 Graded Rings and Modules
119
R,,,. Graded ring means graded Z-algebra (i.e., the R, are abelian groups). M, and rsxs,E Suppose R is S-graded. An R-module M is graded if M = M,,, for all r, in R, and x,. in M,.. R-%-&od is the category of graded Rmodules, whose morphisms are the maps f : M + N satisfying fM,c N, for each s. (These are called graded maps.) R-%-FLmod is the subcategory consisting of graded f.g. submodules. Likewise { S-graded C-algebras) is a subcategory of C - d t f whose morphisms are the algebra homomorphisms f : A + B satisfying fA, E B, for each s. If M is an S-graded module we call each M, a homogeneous component and x, for x, in M,, we define the call its elements homogeneous; writing x = Ifinit= support supp(x) = {s E S:x, # 0}, a finite set which is nonempty iff x # 0.
eSEs
Example 1.9.2: (i) A = R [ S ] is graded by S, where A , = Rs. (ii) A = M , , ( R ) is Z-graded, where A,=xj=i+uReij;thus AU=O for ( u J 2 n . (iii) Suppose is a primitive n-th root of 1. A = Z[[] is graded by Z/nZ, where A, = ['Z. (N, +) and (Z, +) are the grading monoids of greatest interest, largely in view of the following tie to filtrations.
Remark 1.9.3: If S is an ordered monoid then any S-graded algebra A has the filtration A(s) = Is,SsA,,, which is valuated by ua = A{supp(a)) for a # 0. Similarly, one can define the degree function dega = V{supp(a)}. Remark 1.9.4: In view of remark 1.2.15 the following conditions are equivalent when the grading monoid S of A is ordered: (i) A is a domain; (ii) u: A+S, is a monoid homomorphism; (iii) the product of nonzero homogeneous elements must be nonzero; (iv) deg(ab) = (deg a)(deg b) for all nonzero a, b in A (i.e., if one side is defined then both sides are defined and equal). It is easy to characterize the kernels in graded categories. If M is an Sgraded module and N < M , we write N, for N n M,. Clearly, N, I N ; we say N is graded if N, = N.
1
1
Remark 1.9.5: (i) The kernel of a graded map is a graded submodule. Conversely, if M is an S-graded module and N is a graded submodule then M / N is graded (by putting ( M I N ) , = M,/N,) and the canonical map M + M / N is graded. (The easy proofs are left for the reader.)
120
Constructionsof Rings
(ii) The kernel of a graded homomorphism is a graded ideal; conversely, if R is an S-graded algebra and A 4R is graded then RIA is a graded algebra (as in (i)) and the canonical homomorphism R --* RIA is graded. Suppose g : M + N is a graded epic which splits (but not necessarily by a graded map). Then g does split by a graded map, i.e., there is graded f: N + M for which gf = 1,. (Indeed, we take ungraded f':N - r M for which g f ' = l,, and define f,:N,+M, to be the composition N,+N-+M+M, f' Remark 1.9.6:
where the outside arrows are the canonical maps. Then f = @fs: N + M is graded and gfx, = (gf'x), = x, for all homogeneous x,, implying gf = l,.) The category R-$+Aud turns out to be quite useful, especially for S = (N, +). If R is S-graded then R(")E R-Y+Fimod, viewing RP) as (R,)("). However, R(") is not necessarily free in R-%-9imud since its generators are in R?), whereas a graded module could be generated by homogeneous elements from other components. To rectify this situation we need a larger module. Given any S-graded module M we write M ( s ) for M with the new grade given by M(s),, = M,,,. Then &R(s) is a graded module which has the following "freeness" property. Remark 1.9.7: Suppose M = Rxi is S-graded. If x i = E x i s then each xis E M so M is generated by homogeneous elements. Moreover, if f,:R(')+
c;=,Rxis are epics then @fs:@R(')(s)+ @R(')(s) x (R('))(') is a free R-module.)
A4 is a graded epic. (Note
Finite grading sets are important largely because of the following link to Z and N. Remark 1.9.8: Suppose $: S
+ S' is a monoid surjection. Any S-graded algebra R can be S'-graded by defining R,, = R, for u in S'. This yields a functor from {S-graded C-algebras} to { S'-graded C-algebras}.
Applying this technique to example 1.9.2 (ii) yields a 2122grading of M,,(R) called the checkerboard grade: eijis in the 0 (resp. 1) component iff i + j is even (resp. odd). Example 1.9.9:
As an immediate consequence of proposition 1.7.15 we have the following tensor product connection:
Proposition 1.9.10 Suppose R is an S-graded ring. Then R, is a ring, and for any subring W of R, there is a functor R Ow- porn W-Aud to R-%-Aod.
51.9 Graded Rings and Modules
121
In case W = R,, this functor identijes R,-Aud with the full subcategory of R-Yer-Aud consisting of those graded modules M for which M = R M , . Note that we used the multiplicative notation for S ; in many applications S is written additively, with 0 as the neutral element, so we would write R, and M , instead of R, and M , .
-
Proof;. R, is closed under multiplication since 1 1 = 1. Given N in W-Aud we grade RQwN by (RQN),=R,QN, proving the first assertion. If W = R, then (R Q N), = R, 0 N sz N , so the functor M + M , (going the other direction) shows R,-Aud is categorically equivalent to the specified subQ.E.D. category of R-Ya-Aud.
Remark 1.9.11: Let us refine proposition 1.9.10. If R is S-graded then we can grade R, trivially (i.e., (R,),=O for all s # 1) and thereby have R,-Yer-Aud. These are merely the R,-modules, graded as a direct sum of submodules indexed over S . There is a functor F = R OR,-: R,-Yer-Aud + R-Yer-dud whereby we grade R OR,M by putting ( r 0 x), = ~ u v = s 0 r ux,. In the other direction, there is a functor G = R, OR-: R-Yt-Aud + R1-Yer-Aud whereby R, ORN is graded via (r Q x), = r 0 x,. G F is naturally isomorphic to the identity under the usual tensor product isomorphism. However, FG is not naturally isomorphic to the identify since the grade may be changed. We shall investigate this further in the proof of theorem 5.1.34.
Tensor Rings One useful type of graded ring arises from tensor products. Defnition 1.9.12: Suppose M is an R - R bimodule. Define the tensor power M @ " by M@O = R, M @ ' = M and, inductively, M @ ( " + l = ) M QR M @ " , viewed as R-bimodule in the natural way. Define the tensor ring T ( M ) = M @ " .When R is ambiguous we write T R ( M )for T ( M ) .
Clearly T ( M ) is an R - R bimodule; to show T ( M ) is a ring we need a multiplication. First we note M @ "is spanned by elements x,@(x,Q( ***Qx,)), which we write more simply as x, Q Q x,. By proposition 1.7.12 we have M 0 M + M wrn+") given by (x, 0 . * .0 x,,,) Q an isomorphism qmn: ( y , Q . . . Q y,) + x, Q * * * Q x,,, @ y , 8 . * - Q y , . Applying proposition 1.7.15 twice we have a map cp: T ( M )Q T ( M )+ T ( M ) @'
given by a,,, Q b, -,cp,,,,(a,,,Q 6,) for a,,, in M
and b, in M @",
Constructionsof Rings
122
Now we have a multiplication in T ( M )by defining the product of a and b to be q(a @ b), and it is easy to verify the ring axioms. Summarizing, we have Proposition 1.9.13: T ( M )is an N-graded ring, with T ( M ) ,= R, T ( M ) ,= M , and, in general, T ( M ) ,= Ma”, multiplication given by (XI @
*
@ xm)(yl@ * @ y n )
= XI@ * * * @ X,
0~
1*.
’00Yn.
If R is a C-algebra then T ( M ) is also a C-algebra under multiplication c(x1 @ . . . @ x n ) = ( C l X 1 ) @ * . . @ X n .
The customary special case is when C is a commutative ring and M E C dud is viewed symmetrically as a bimodule. Then Tc(M) is called the tensor algebra of M . Tensor rings and tensor algebras are important as universals. To see this we first note there is a functor from { N-graded Calgebras} to C - d u d given by F T = Tl and Ff = f l where fl is the restrict i o n o f f : T + T ’ t o Tl. Proposition 1.9.14: Suppose C is a commutative ring and M E C - A o d . Then T = T,(M) together with the identijkation of M with Tl c T is a universalfrom M to the functor given above. Proof: We must show for every graded algebra A, each map f: M + Al extends to a unique homomorphism f’:T + A whose restriction to M is f. By induction on u one sees f’must satisfy f’(x1 @ ‘ . * * @ x u=) f ’ ( x , @ * * . O x u - , ) f x , =fx,...fx,
for all xl, ..., x u i n M .
(1)
Since the x1 8 ..-@ xu span T,,this shows f’must be unique, and this formula also motivates our definition of f ’. Namely put fi = f; define fu inductively on u by forming the balanced map $,,: T,,- x Tl + A , given by $,(y,x) = f u - l y f x ,and letf, = L1 0 Tl + A , . By induction on u, each f, is a map satisfying (l), so we can define f’:T + A by putting f ’ C y , = cfuyu where y, E T,. Noting f’(y,y,) = f,+,(y,y,) = f,y,f,y, by (I), where y, E T. and y , E T,, we conclude f ’ is indeed a homomorphism. Q.E.D.
6,:
If M=C(”’ then the tensor algebra T c ( M ) x C { X l..., , X,,}. Indeed, taking a base xl,. ..,x,, for M we define f:M + C{Xl,. . .,X,,}by Example 1.9.15:
81.9 Graded Rings and Modules
123
f x i = Xi and use the proposition to obtain a homomorphism f’: Tc(M)+ C{Xl,. . .,X,,} which is an isomorphism since the x i l 0 * 0 xi. form a base of T, over C.
This example is the motivating example in the study of tensor algebras, enabling us to obtain other constructions. Example 2.9.26: Let I be the ideal of Tc(M)generated by all x 0 x for x in M. Then I is graded, so T‘(M)/Z is an N-graded algebra called the exterior algebra of M , written as A ( M ) . Note for every x in M that x 2 = 0 in A ( M ) , and thus xx’ = - x ’ x for all x, x‘ in M . (Indeed, 0 = ( x + x ’ ) ~= x z + xx’ + x‘x + (x’)’ so xx’ + x‘x = 0.) This property can be used to characterize the exterior algebra as a suitable universal (cf., exercise 4)and leads to important applications in the theory of determinants (cf., Jacobson [85B,$7.23). Example 2.9.27: Let I be the (graded) ideal of Tc(M) generated by all x 0 y - y 0 x for x, y in M . Tc(M)/I is called the symmetric algebra of M and is commutative; commutative polynomial rings are obtained as a special case when M is free in C - A d . Example 2.9.28: (Upper triangular matrices as a tensor ring). Let R be a direct product of n copies of W, and let M = W ( ” - l )as W-bimodule, made into an R-bimodule as follows: Take a base of M over W and label it { e l 2 , e Z,..., 3 take a base of R over W and label it { e l l,..., en,,}, and define (weii)(w’ej,j+l) = dijww‘ej,j+l and ( w ’ e j . j + l ) ( w e i i )6i.j+1w’Wej,j+l~ =
In other words, the action from each side is matric multiplication. Then Mhasbase{ei,i+l~ei+l,i+2}sinceforj#iwehave -le i - l , i @ O = O . ei 1. i 0 ej,j + I = ei - 1, ieii 0 ej. j + 1 = e i - l , i O e i i e j , j +-
Ma
-
In this way we identify the u component of T,(M) as the u diagonal in the ring of upper triangular matrices, and T,(M) is easily seen to be isomorphic to the ring of upper triangular matrices over W.
r)
Example 2.9.29:
(,”
Suppose A, B are rings and M E A - A u d - B . The ring
can be viewed as a tensor ring by putting R = A x B and de-
fining left and right actions of R on M by (a,b)x = ax and x(a,b) = xb. (Verifications are as in the previous example.)
124
Constructions of Rings
Example 1.9.20: Let T be the tensor ring built from the ring R and the free R-R bimodule (of corollary 1.7.32), writing Xi instead of ei. The elements of T are sums of monomials rlXi,r2XiZ...rfXi,rf+, where ri E R ; multiplication of monomials is by juxtaposition (and reduction by multiplying out adjacent elements of R). This important ring is called the free R-ring and is denoted R ( X ) ; note it is “more” noncommutative than the ring R { X }defined earlier, since R centralizes X in R { X } but not in R ( X ) . Remark 1.9.21: Cohn and Bergman defined a generalization which is very useful in various situations (cf., Rowen [80B]). Namely, if R E C-dlg define ( R ;C ) - a i ~ to g be the full subcategory of R-W&g consisting of R-rings which are also C-algebras naturally, e.g., if R c T then C 1 E Z ( R ) c Z ( T ) .Using C instead of Z in proposition 1.7.31 we get an isomorphism from R QcRoPMod to the full subcategory of R - A u d - R consisting of those bimodules M such that (cl)x = x(c1) for all c in C and x in M. The free bimodule in this category produces a tensor ring called R,(X) which is free in (R; C)-WRg. The form of the elements are the same as in example 1.9.20, except that we can move elements of C past the ri and Xi.
B Supplement: Constructing Free Products Suppose R , and R , are rings containing W canonically. Our twofold aim is to show the amalgamated sum of R, and R2 over W exists (when it does), and then to construct it explicitly enough to answer questions about it. The reason we consider only two rings at a time is for ease of notation; any finite number of rings could be handled by iteration, and infinite sets of rings could be treated using direct limits. To prove existence, we only need to find a common overring R‘ of R, and R2 with R, n R2 = W, by proposition 1.4.34. If, in fact, W is the center of the Ri then the obvious candidate is R , OwR,. Theorem 1.9.22: If C E Z ( R i )for i = 1,2 and R , is free as C-module with a base containing 1, then the free product of R, and R2 exists in C-dlg. Prooj; By proposition 1.7.22 there are the canonical injections R1+R, 0 1 and R , + 1 Q R, in R1 BCR,. Q.E.D.
Example 1.9.23: Suppose C c Z(R,) and R, = C { X } . Then R, Qc R , = R, 0 C{X} is not the free product, which is easily seen to be the C-algebra described in remark 1.9.21, as will become clear in the foregoing discussion.
81.9 Graded Rings and Modules
125
When W is not central we can still form Tl = R, Q w R 2 , which need not be an algebra, however. It is instructive to assume there is an overring R' as described above, and see how Tl relates to it. (Then we shall discard R' and find intrinsic conditions for the amalgamated sum to exist.) Define gl: T, -+R' by gl(rl 0 r 2 ) = r l r 2 (by means of a balanced map); likewise define inductively T + , = T Q w T l for ir 1 and g , + , : T + , + R by g i + l ( a i Q a , ) = (giai)(glal).The elements of T are the sums of terms of the form I (1' )
0 r y ) 8 r y ) 6 r 2( 2 ) ** r y ) Q r$)
where ry) E Rj for j = 1,2,
whose image in R ' is r y ) r y ) r \ 2 ) r y )...r ( i ) r ( i ) 1
2 '
To construct the amalgamated sum R of R, and R 2 we might consider trying the tensor ring of T, as W-bimodule. However, the ring multiplications of the R, do not "fit" with their images in the tensor ring; for example, elements of the form
... Q
,
@
1 Q r;''
and
.
*
Q
ry)
Q
,Q 1 Q rL2)Q
Q r;'? Q
. . . - . . . Q r U-lr" ( l ) (1) 6 1 6 1 Q r;') 0 . ..
*
*
- . . . Q rL1'
,Q rL2?,rL2)6 1 Q 1 Q . . .
are nonzero. To correct this problem we define K i to be the W - W submodule of T spanned by the elements of these two forms, and let ?;: = T / K , . Clearly K , E kerg,, inducing maps Si: -+ R'. We shall now appeal to the direct limit underlying the tensor ring construction, but applied to the ?;:. -+ 7;. obtained by tacking on For each i I j in N we have a map cp;: Q1 Q l . . . Q 1 at theend,e.g.,
ri2) r y ) )= r:" r?) ri2' Q ri2) 1 1 Q 1 1. - Each K , c ker yielding maps cp:: % + q. Since cpc jp; = cp:, we have a whose direct limit @ p i ) is to be our candidate for the amalsystem gamated sum. cp:(ry)
ry)
cpi,
(%;2)
Theorem 1.9.24: F is a ring under the multiplication given by the rule (piiZi)(pjh)= p i + j ( a i Qbj) for a, in T and bj in T j , and is the coproduct of R , and R2 in W-9i.ng..
Proofi By construction 7 is a W - W bimodule. To obtain the desired multiplication we take W- W bimodule maps TQq+F given by iii05 .+ p i + j ( a iQ bj). Fixing j and taking direct limits gives a map F Q 7 + T;
Constructions of Rings
126
now taking direct limits over j yields a map F 6 F + 7 given by
-
piEi 6p j b + pi+j(ai@ bj);this yields the desired multiplication. For j = 1, 2 we have maps i,hj:Rj T given by $lrl = pl(rl 6 1) and
$,r2 = pz(l 6r,); these are ring homomorphisms since, for example, $,(r1r’,)
= p1(r,r’, =
6 1) = p2(r14 6 1 6 16 1)
6 1 6r’, 6 1) = $lrl$lr’,.
It remains to prove the universal property for coproducts. Suppose
&: Rj + R’ were W-ring homomorphisms for j = 1,2. We could then create a W-bimodule map z: l+
R‘ given by
a:
as in the discussion preceding this theorem. This yields a map 7 + R’ satisfying & = g$j for j = 1,2, and g is a ring homomorphism, by inspection. Q.E.D. Having explicitly constructed the coproduct, we note that it is the amalgamated sum iff the following two properties hold:
(1) The canonical maps $j: Rj + are injections. (2) Viewing Rj c thereby we have R, n R, = W. Suppose R, is a free W-module having a base containing 1. By proposition 1.7.22 the Ri sit canonically in T, with R, n R, = W, so our only obstacle is in showing pl: +7 is monic. In general this can be a formidable obstacle, although it is overcome successfully by Cohn [SS], who passes to the modules Ri= Ri/W and uses homology to prove amalgamated sums always exist if W is von Neumann regular (as well as other results). We shall content ourselves here with several examples which are amenable to computation. Example 1.9.25: Suppose R,, R, each are free as W-modules having respective bases B,, B , each containing 1. We want to build a monoid resembling the word monoid. Namely, let B: = Bi - { l} and 93 = { l } u {words alternating in letters from B’, and B i } , i.e., a typical element s # 1 of 9 will be written in the form s = b j . . .b, where j = 1 or j = 2, and each b, E B’, for u odd and b, E B; for u even. The amalgamated sum R (of R , and R, over W) is to be the free W-module F having base 9,but to define multiplication we have to be a bit more subtle, using the right regular representation. Indeed, we shall embed R, and R, in End, F and take R to be the subring of End, F generated by their images. Thus we must define the suitable right multiplication of an
41.9 Graded Rings and Modules
127
element r of Ri (for i = 1 or i = 2) on a base element s = b j . . .b, of 9, and we then extend it by distributivity (taking l r = r). We proceed by induction on k - j, working in three cases for r: Case I . r E BI, where i = 1 or 2. If k $ i (mod 2) then the product of s and r is the string bj. * b,r. If k = i (mod 2) then the product is b j . ..b, - r' where r' is the product b,r taken in R,. (Note b , . ..b,- ,r' is defined by induction on k.) 9
Case 11. r E W. Then the product of s and r is b j . . .b,- ,(bkr).
I:=,
Case I l l . r = w,,bi,,for w, in W and b , in B, v B , . The product sr is now defined in terms of cases I and I1 as (sw,,)biu.
,
The reader should note the similarity between this construction and the free products of groups, especially in light of example 1.4.29. Techniques treating bases of free products are illustrated well in the following interesting theorem. Theorem 1.9.26 (Cohn). If R , ,R , are domains which are both algebras over a jield C then the free product R = R , R , is also a domain. Proof: (Martindale-Montgomery [83]) If Bi are bases of R i containing 1, then R has a base 9 = { l } v {words alternating in letters from B; and B ; } where BI = Bi- { 1). As before, we write a typical base element as s = a j . . . a , where j = 1 or j = 2, and each a,, E B; for u odd and a, E B; for u even. We would like to view 9as an ordered monoid in order to filtrate R as in 51.2, but this is impossible because 9 is not a monoid. Nevertheless we shall provide B with a fairly natural order, and see what we can do. Given s = a j . . . a , we say length (s)= k + 1 - j. Given also s' = a: * * . a: we say s < s' according to the following rules: First priority. length (s) < length (s'). Second priority. length (s) = length (s') and j > u (i.e., j = 2 and u = 1). Third priority. length (s) = length (s') and j = u and according to some specified ordering on the Bi we have a, < a: for the smallest number t for which a, # a;. We shall now study multiplication in R using this order on 9. For any r in R write length ( r )for the length of its highest order term. We view C E R via the identification c -+ cl. Suppose q,r E R . If q or r are in C then the product is obvious, and nonzero, so assume q and r are not in C , i.e., they each have length 2 1. We
Constructions of Rings
128
shall concentrate on the highest order terms of qr and their length. Our object is to show q is (right) regular, by which we mean qr # 0 for all r # 0 in R. Suppose S , I are the respective highest order terms for q,r and write s = o r a j - * . a , and t = f i b ; . - b , where O # a , P E C and the a,b are from B; u B;. Write n = length (q) + length (r) = (k + 1 - j ) + (u + 1 - u). Case I . a, and b, are from different B:. Then st = ufiaj.--a,b,... b, is the highest order term of qr so length (qr) = n and, in particular, qr # 0.
1
Case 11. q E R , . Write r = riti where ti are distinct strings starting with elements of B 2 ,and each ri E R , (although possibly ri E C). Then qr = C(qri)ti# 0 since each qri # 0. Case Ill. a, and b, are from the same B:. This is the interesting case. Say a,, b, E B; . Thus k is odd and u = 1. Also for convenience we assume j = 2. Then
length ( s ) = k - 1 and length ( t ) = u . Note that length ( s t ) s k + u - 2 because of the “collapsing” in the middle. Suppose momentarily that some (other) term of q of length k - 1 starts with an element of B ; , and let ;denote the highest order such term. Then ;ends with an element of B;; we see that i t has length k u - 1 and is the highest order term of qr, proving qr # 0. Thus assume all terms of q of length k - 1 start with an element of B ; . Now pick the string s’ = a; ... a ; - of length k - 2, of highest order such that s’ is the beginning of some term of q. Let q‘ be the sum of all terms of q starting with s‘, and write q’ = s’w. Length (w) = ( k - 1 ) - ( k - 2) = 1 so w E R , ; hence wr # 0 by case 11. Of course length (wr) 5 u. If length (wr) = u then taking the term h of wr having highest order, we see s’h is the highest order term of qr (and has length k + u - 2); thus qr # 0 unless length (wr) c u, so we assume this. Let r’ be the sum of all terms of r having length u. In order for wr to collapse, w must cancel the initial part of r - r‘; thus w is invertible in R , and r - r‘ = w-lr” with length (r”) < u. Continuing, we pick the string s“ of length k - 2 of next highest order (after s’)such that s“ is the beginning of some term of q. The sum of all terms starting with s“ is s”w’ for some w’ and provide the highest order term for qr (thereby proving qr # 0) unless u > length (w’r) = length (w’w-lr”); hence we must have w’w-l E C, so w’ E Cw. Continuing along the strings of length k - 2, we are done unless q = yw + z where yw contains all terms of length 2 k - 2, so that length (z) Ik - 3. Now one easily can organize the proof as follows: We claim that every q # 0 is regular, by induction on length (4). For q of length 0 this is obvious since q E C. In general, we have shown that if qr = 0 for r # 0 then
+
,
-=
51.10 Central Localization
q = qw-1
129
+ zw-’
has length Ik - 2 = length (q) - 1, so by induction is regular; however, q(wr) = qr = 0, implying wr = 0, which is impossible by Case 11. Thus every nonzero element is regular, proving R , R 2 is indeed a domain. Q.E.D. =y
$1.10 Central Localization (also, cf., 52.12.W.) One of the most fundamental problems in ring theory is to “invert” a subset S of R in the sense of finding a ring homomorphism 9:R + T such that s is invertible in T for all s in S. One would ideally want cp to be an injection, in which case a necessary condition is certainly that each s in S is regular in the sense that rs # 0 and sr # 0 for all r # 0 in R . Two familiar instances from commutative algebra, when R is an integral domain (so that every nonzero element is regular): (i) One can form the field of fractions F of R . (ii) Given a prime ideal P of R let S = R - P and let R , denote { s - l r : s E S , r E R } c F. R , is local, i.e., its unique maximal ideal is { s - l r : s E S , r E P}. Consequently, the process we are about to describe is called localization. Before proceeding, let us describe the situation more formally in terms of universals. Let 9 denote the category whose objects are pairs (R, S) where R is a ring and S c R ; morphisms f:(R,S ) + (R‘,S ‘ ) are ring homomorphisms f: R + R‘ for which f S E S’. Then 9 has the full category % consisting of,all ( R , S ) for which each element of S is invertible in R , and we can define the forgetful functor F:% --* 9 which “forgets” this condition on S. A universal from ( R , S ) to F is called a localization of R at S and is denoted S - ’ R if it exists. Definition 1.10.1:
Explicitly there is a given homomorphism v: R + S-’R such that vs is invertible for each s in S, and, moreover, for any ring homomorphism $: R + T such that s is invertible in T for all s in S we have a unique homomorphism completing the diagram
By abstract nonsense S-’R is unique up to isomorphism. There is a general construction of S-’R, but it is rather unwieldy and resists computation. (For
Constructiowi of Rings
130
example, it is difficult to determine even when v is 1:l.) However, when S G Z(R) we can mimic the construction from the commutative theory and bypass many of the difficulties. We shall see in corollary 1.10.18' that the construction actually can be achieved directly from the commutative theory, merely by using the tensor product. Consequently we shall perform the construction here for S c Z(R), called central localization, and defer noncommutative generalizations until Chapter 3. In the literature R, or R[S-'] are also written in place of S I R . We shall take advantage of this notational ambiguity by introducing different constructions by different notations and then showing they are the same. The first construction is by brute force.
-
-
Define an equivalence on S x R by (slrrl) (s2,r2)if s(slr2 - s2rl)= 0 for suitable s in S; letting s-lr denote the equivalence class of (s,r) define S ' R as S x R / - made into a ring under the operations Consrrucrion 2.20.2:
sT'r,
+ s;'r2
+
= (s1s2)-1(s2rl slr2)
-(s-'r) = s-'(-r) (sT1r1)bi1r2)= (sls2)-'(rlr2).
This construction is very intuitive, but the verifications that S ' R is a ring (done more generally in 43.1) can best be described as "tedious," especially is indeed an equivalence. (Soon we shall bypass these verificachecking tions.) Let us see S-'R has the desired universal property. Indeed define v: R + S-'R by vr = l-'r, obviously a homomorphism, and note ( v s ) - l = s-'l. Given $: R + T with $s invertible for each s in S, we have
-
$r$s = $(rs) = $(sr) = $s$r,
implying ($s)-'$r = ($r)($s)-l
for all r in R, s in S. If there exists $s satisfying $ = t,hsv then $s(s-'r)$s = $s(s-'r)$s(l-'s) = $r, implying $s(s-'r) = ($s)-'$r,
(1)
proving qSis unique. Conversely, we show $s exists by defining it via this equation; it is easy to show $s is a homomorphism with $ = &v, once we have shown $s is well-defined. But if s;'rl = then s(slr2 - s2r1)= 0 for some s in S and 0 = $(S(Slr2 - s z r d = IL(ssls2)(($Sz)-'J/r2- (ILs1)F1$r1)9
131
%l.lOCentral Localization
implying ($s2)-'$r2 = ($sl)-'$rl since $(sslsz) is invertible. Thus we have constructed S-'R explicitly. A quicker construction can be obtained using exercise 1, but it is instructive to consider a third construction using direct limits. Construction 1.10.3: For each s in S take R, = Hom,(Rs, R). Preordering S as usual, i.e., s I t iff s divides t, we define cp:: R, + R, (for s I t) by sending a map f:Rs + R to its restriction to Rt. Now (R,; cp:) is a directed system of abelian groups, whose direct limit we denote R,, together with the canonical maps p,: R, + Rs. Iff: Rs -,R we denote p, f as the element s - l r where r = fs; note s and r determine f since f(as) = ar for any a in R.
We want to verify in general that Rs serves as S-'R and to prove this directly so as to have a self-contained proof of the existence of K'R. Of course, we must define multiplication on R, but first we want some preliminary observations. (i) s-'r = (s's)-'(s'r)for all s' in S. (Indeed, writing s-lr = psf we have fs = r so f(s's) = s'(fs) = s'r and taking t = s's we have t-'s'r = prq:f= psf = s-'r.) (ii) s;'rl - si1r2= (s1s2)-'(s2rl- slr2), seen by passing to s1s2 using (i). (iii) ker p, = { f E Hom(Rs, R): s'(fs) = 0 for some s' in S}. (Proof ( 2 )Take t = s's and note 0 = (s's)-'(s'fs) = prcpff = p, f.( G) If p,f = 0, then by the proof of proposition 1.8.5 we can view everything in O R , and write f as a sum of terms cpifi - fi, where for notational convenience we wrote i instead of si,and sj 2 si. Let t be the product of s and all the si and sj appearing in these expressions. Then qifi(t)= f i ( t ) for all these i, j , so 0 = f(t). Writing t = s's we get 0 = s'fs as desired. (iv) sr'rl=si'r2 iff s(s,r2-s2rl)=0 for some s. (Indeed s;'rl -silt-,= - s1r2)so apply (iii).) (sls2)-1(s2r1 Now define multiplication by (s;'r1)(si'r2) = (s1s2)-'(rlr2). This is well-defined in view of (iv) and is distributive over addition by a straightforward verification; 1 1 is the multiplicative unit. At this stage we have verified all the conditions necessary to carry over the verification of construction 1.10.2, to define the homomorphism v : R + R, by vr = l-'r, and to show (1) holds, so R, is identified naturally with S ' R .
-'
This construction emphasizes the R,, which could be thought of as modules s-'R, and this vantage point will be used to good effect later. Remark 2.10.4: Notation as in (l), ker $, = S-'ker $. (Indeed, s-'r E ker $s iff ($s)-'$r = 0, iff +r = 0.
132
Constructions of Rings
Proposition 1.10.5: If S G S' there is a canonical homomorphism cp: S-'R + (S')-'R given by s-'r + s-lr. If, moreover, vss is invertible for all s in S' then cp is an isomorphism. Proof: Take $: R + (S')-'R to be the canonical homomorphism and cp = t,bs. Under the additional hypothesis we can go in the opposite direction, starting with the canonical homomorphism $: R 4 S-'R; then cp-' = &.. Q.E.D.
In order to utilize central localization, we need to see first how structure passes from R to S-'R, then to note how S-'R may be in better form, and finally to show how one does not lose information when localizing wisely. Throughout S is a central submonoid of Z(R).
Structure Passing From R to S ' R We start by passing structure from R to S ' R , with special attention paid to ideals and the center. Given A c R write S-'A for {s-'a:s E S and a E A}, and s-'A for {s-'a: a E A ) . Remark 1.10.6: If L < R then S-'L I; S I R , by direct computation. Remark 1.10.7: For any finite set of elements xl, ...,x, of S-'L there is then some s such that each xi E s-'L. (Indeed, if xi = sf'ai take s = s1 xi = s-ysl ***Si-'Si+l.*.s,ai). "as,:
Note in remark 1.10.7 that we could multiply each xi by s to produce elements with denominator 1; this common but important technique is called clearing denominators, and often is used to pass from S-'R back to R. Write Y(R)for the lattice of proper left ideals of R, viewed as R-modules. If L c R and s E L n S then 1 = s-'s E S-'L, so S-'L = R. Thus every left ideal intersecting S "blows up", and we focus on gS(R)= ( L < R: L n S =
a}.
Proposition 1.10.8: There is an onto lattice homomorphism L?(S-'R) given by L + S-'L.
(D: Zs(R) +
Proof: Suppose L1,L,
$1.10 Central Localization
133
onto since if L' < S-'R we take L = { r E R : l - ' r € L ' } ;then L < R and Q.E.D. L' = S-'L. In general (D is not 1 :1, but it does act 1 : 1 on certain left ideals. We say a left ideal L is S-prime if sr E L implies r E L, whenever s E S and r E R. The importance of this concept will not be seen until we consider the prime spectrum in $2.1 1, but let us record some results here. Lemma 1.10.9: If L < R is S-prime and s-lr E S-'L then r E L. Proof;. Write s-lr = s;'xl where s1 E S and x , E L. Then s'(sx, for some s' in S so s'slr = s'sx, E L implying r E L. Q.E.D. Proposition 1.10.10: Suppose L,, L then L , I L. Proof;. If r E L, then 1-'r
E S-'L,
-= R and L is S-prime. I f I S-'L so r E L.
- slr) = 0
S-'L, I S-'L
Q.E.D.
Note that {S-prime left ideals of R } is not necessarily a sublattice of L?JR), since it need not be closed under sums. However, it is a lattice in its own right, isomorphic to Y ( S - ' R ) , as we see in the next result.
-
Theorem 1.10.11: The lattice Y s ( R )has a closure operation gioen by L= { r E R : Sr n L # @a>, under which the "closed" left ideals are precisely the S-prime left ideals. Thus {S-prime left ideals of R } is a lattice (where L , v L 2 = L , + L,) which is isomorphic to Ys(,(R) under 0 (of 1.10.8). Proofi If slrl E L and s,r, E L then sl!z(r, + r,) E L, from which one sees (for readily I, is a left ideal. Moreover, I , = L and L , n L, = Gn then sir E Li for suitable si in S so slszr E L , n L , and if r E Gn r E L , n L,). Clearly L = L iff L is S-prime. By proposition 1.10.10 the restriction (D' of 0 to S-prime left ideals of R is 1:l. Moreover, (DL = 0 L since if sr E L then 1-'r E S ' L . Thus @' is onto. In summary, we see {S-prime left ideals of R } is a poset under E and is naturally a lattice since any L , , L 2 have a sup (namely L, + __._ L,) and an inf (namely L, n L 2 ) . 0' is a lattice homomorphism since W ( L , + L,) = (D(Ll + L 2 )= (DL, + @L2 = 0'G + @'G. Q.E.D. Corollary 1.10.12: (D restricts to an onto lattice homomorphism from {Ideals of R disjoint from S } to {Ideals of S I R } . 0'restricts to a lattice isomorphism from {S-prime ideals of R } to {Ideals of S-'R}.
Constructionsof Rings
134
Proposition 1.10.13:
S-'Z(R) E Z(S-'R), equality holding if S is regular.
Proof: Suppose s1 E S and z1 E Z ( R ) .For any s-'r in S-'R we have [S;'Z~,S-'~]
=(s,s)-'[z,,~] =0
SO
S;'Z
E Z(S-'R).
Conversely, if S is regular and s;'rl E Z(S-'R), then for all r in R we have 0 = [sT'rl, l-'r] = s;'[r,,r] so [rl,r] = 0 proving rl E Z(R). Q.E.D.
Examples of Central Localization Example 2.10.14: If every ideal (resp. every left ideal) of R contains an element of S then S-'R is simple (resp. a division ring). This fact is used most often when S is all regular elements of R, in which case S-'R is the ring of central quotients of R. This coincides with the commutative ring of quotients when R is commutative. Example 1.20.25: Suppose S = { s i : i E N} for some fixed s in Z ( R ) . Then we write R [ s - ' ] for S ' R , and A [ s - ' ] for S-'A where A c R. For L < R note L [ s - ' ] z R [ s - ' ] iff L contains no power of s. Our final observations concern S-prime left ideals. Remark 2.10.26: By Zorn's lemma any left ideal disjoint from S is contained in a left ideal L maximal with respect to L n S = 125. L is then S-prime since L= {rER:srEL for suitable s in R} is a left ideal containing L , disjoint from S, so L = L. Thus we see S-prime left ideals exist in abundance, and for L as defined here S-'L is a maximal left ideal of S-'R. The same remark holds if we replace "left ideal" throughout by "ideal." These three examples are the basic tools for central localization and shall be examined closer in 52.1 1.
Central Localization of Modules Much of the previous discussion holds more generally for modules and when viewed in this way actually yields a tensor product connection between central localization and commutative localization, as we shall see. Definition 1.20.17: Suppose S is a submonoid of Z ( R ) and M E R-AoG!. For each s in S take M, = Hom,(Rs, M) and under the preorder s It iff s
135
$1.10 Central Localization
divides t, we define cp:: M, -+ Mt (for s I t ) by sending a map f:Rs + M to its restriction f:Rt-+M. Define S-'M =lim(M,; cp:), together with the canoni+ cal maps pi: M,+S-'M; given J Rs+M we denote p,f as the element s-'x where x = fs. We now make a series of observations analogous to those of construction 1.10.3 and omit the proofs when they are identical. First note if s is regular then Rs % R so M, % M as an abelian group. In general the following also hold for si in S and xi in M: (i) s-'x = (s's)-'(s'x) for all s' in S.
(ii) si'xl
- s;'xz = ( S ~ S ~ ) - ~-(SIXz). S~X~
(iii) ker ps = { f E Hom(Rs, M ) :s'(fx) = 0 for some s' in S}. (iv) si'xl = s;'xz iff s(s1x2 - szxl) = 0 for some s in S.
(v) There is a canonical map vs: M -+ Ms given by vsx = 1-'x, and ker vs = {x: S n Ann,x # @} (immediate from (ii) and (iv)). Thus the theory of central localization of modules parallels that of rings, with the simplification that we need not worry about ring multiplication. Indeed the following result holds: Proposition 1.10.18: -+
'
S-'R
BRM
!z S ' M , by an isomorphism s - l r 8 x
s- (rx).
Proofi There is a balanced bilinear map S-'R x M - + S - ' M given by (s-lr, x) 4 s-'(rx), which thus induces a map q :S-'R 0 M -P S-'M given by s-'r@x-+s-'(rx). On the other hand, cp-' is defined by the map s-'x --t s-'@ x, which is well-defined, since if si'xl = s;'xz then some s(s1x2 - SZX') = 0, so si' 0 X I = (ss1s2)-'ss2 0 X' = (ss1s2)-l0 S S Z X ' = (ss1s2)-l0 S S l X Z = s;'
Hence cp is the desired isomorphism.
0 x2.
Q.E.D.
Corollary 1.10.18': If S is a submonoid of Z x Z ( R ) then S - ' Z @ , R S-'R as Z-algebras. Proof: The map of proposition 1.10.18 respects multiplication.
%
Q.E.D.
136
Constructions of Rings
Proposition 1.10.19: There is an onto lattice homomorphism 0:Y ( M )+ Y ( S - ' M ) given N -.+ S-'N for N < M. Proofi
Duplicate proof of proposition 1.10.8, writing N in place of L.
Instead of copying out all the previous results for M replacing R, we shall now formulate them in a categorical setting.
Theorem 1.10.20 There is a functor F : R - d o d -.+ S-'R-Aod given by F M = S-'M where for any map f: M + N we define Ff:S-'M + S-'N by F f (s-lx) = s - y x . This functor satisfies the following important properties: (i) ker(Ff) = S-'ker f for every map f. S-'N is exact. (ii) r f K A M 3 N is exact then S-'K -% S-'M (iii) F induces an onto lattice homomorphism Y ( M )-.+ Y ( S - ' M ) . (iv) Define N to be an S-prime submodule of M if sx E N implies x E N for each s in S. Then L ( M ) has a closure operation given by N = { x E M : s x E N for some s in S } ; {S-prime submodules of M } is a lattice isomorphic to Y ( S - ' M ) under F. Ff is the composition S-'M x S-'R 8 M S-'R Q N x S-'N. It follows at once F is a functor. Identify S-'M with S-'R Q M in what follows. Proofi
(i) Clearly S-'(ker f)= S-'R 8 kerf G ker(Ff ). Conversely if s-lx E ker(Ff) then s-yx = 0; hence there is s' in S with 0 = s'fx = f (s'x), so S I X E kerf implying s-'x E S-'(ker f ). (ii) ker(Fg) = S-'ker g = S-'( flu) = (Ff )(S-'K). (iii) Duplicate proof of proposition 1.10.8, where here Li < M . (iv) Duplicate proof of theorem 1.10.11. Q.E.D. One nice feature of the central localization functor is that even noncategorical properties are preserved.
Remark 1.10.21: If F is free in R - d d with base {xl,. ..,x,} then S-'F is free in S-'R-dod with base { l-'xl,. . . ,l-'xn}. (Either verify this directly or recall we have proved the more general result that tensor products preserve freeness.) Remark 1.10.22: If S E S' are submonoids of Z ( R ) and M E R-AUQ! then there is a canonical S-'R-module map S-'M + (S')-'M given by s-lx -.+
137
Exercises
sf'x; this is an isomorphism if 1 -IS' is invertible in S I R . (Clear, by applying proposition 1.10.5to tensor products.)
Proposition 1.10.23: If z, seZ(R),then ( R [ z - ' ] ) [ s - ' ] x R[(zs)-'] as rings and M [ z - ' ] [ s - ' ] z M [ ( z s ) - ' ] for any R-module M. Proof: Take S = {(zs)':i E N} and S' = {zisj:i,j E N}. Then S c S' and for Z ' S ~ ES' we have (zisj)-' = ( z ~ ) - ( ~ + j ) in z j sK~ ' R . Hence R [ z - ' ] [ s - ' ] x R [ ( z s ) - ' ] by proposition 1.10.5, and remark 1.10.22 gives the isomorphism M [ z - ' ] [ s - ' ] % M[(zs)-'].
Exercises $1.1 1. Suppose f: M , ( R ) -+ T' is a ring homomorphism. Then T' = M,(R') for some ring R', and f is given componentwise by a suitable homomorphism f R + R'. (Hint: Define the matric units eij = f e , . Now writing T' = M,(R') let f r be that r' such that f ( re,) = r'efi.) 2. If e , , e , are idempotents of R with e, E R e , and if e2 A = e l A for some idempotent-lifting ideal A then e l = e , e , . (Hint: e , ( l - e 2 )is idempotent.) 3. Write M,,,(A) for the set of rn x n matrices with entries in A, made componentwise into an abelian group if A is an abelian group. M,,JR) E M m ( R ) - A ~ d - M , , ( R ) where the scalar multiplication is taken to be multiplication of matrices; more generally, if N E R-Aod-T then M,,,(N) E M , ( R ) - A d - M , ( T ) via matrix multiplication. In particular, any matrix of M,+,(R) can be partitioned in the form
1
(: ):
1
+
+
where A E M,(R), B E M,,,(R), C E M,,,(R) and D E M J R ) and this
provides a special case of example 1.1.10.
4. If M E M,(R)-Aod and eiiM = 0 for some i then M = 0. Use this fact to prove corollary 1.1.18 directly. (Hint: Suppose M is simple in R-Aud and 0 # N I M("). Then 0 # eiiN I eiiM(")x M so eiiN x M ; hence N = M(").The converse is even
easier.)
Infinite Matrices 5. M , ( R ) is defined to be the set of infinite matrices which are row-finite, i.e., every
matrix has a countably infinite number of rows, but almost all entries of each row are 0. Show M , ( R ) is a ring whose opposite is isomorphic to the ring of columnfinite matrices. 6. Defining M , . , ( N ) to be the set of columns with entries in N , show there is a functor F: R-.Ai~nd+ M , ( R ) - A d given by N + M m , , ( N ) . 7 . Suppose W G R are rings and T = { w 1 + rijei,:w E W,rij E R } , the subring of M , ( R ) generated by W and the eij. Show Z(T) z Z(W).
-
Ifinits
Constructions of Rings
138
$1.2 1. (Incidence algebras) Suppose I is a finite poset, viewed as a small category %? as
in example 0.1.1, and F is a field; then F[V] is called an incidence algebra. Interpret the incidence algebras (in terms of matrices) arising from the following partial orders on { 1,. .. ,n}: (1) the usual total order; (2) i Ij iff i = 1 or i = j ; (3) i Ij iff i < j and i < i, for some fixed i,. Show an element is invertible iff each "diagonal" entry is invertible.
Ordered Algebraic Structures 2. Given g , , ...,g,, in G write S ( g , , . .., g n ) for the normal semigroup in G generated
by gl,. ..,g,,. For example S(g) is the set of products of conjugates of g. A normal submonoid P of G is extendible if for any finite g , , ...,g,, in G - { 1) one can find h,~{g,,g;'}for 1 ~ i ~ n s u c h t h S(h,, a t ...,h,,)[email protected] Pisextendiblethen P n P-' = { 1) (because for any g # 1 we have S(g) or S(g-') disjoint from P ) . A normal submonoid Po of G is extendible iff G has an order < with Po E P(G). (Extensive hint: (e) Given g i # l pick h i ~ ( g i , g ; ' }with h , < l , so S(hl,...,h,,) has only elements < 1. (a) Take a maximal extendible normal submonoid P 2 Po, by Zorn. It suffices to show P u P-' = G, or better yet, S(g) c P or S ( g - ' ) c P for any g # 1. Otherwise, P S ( g ) and P S ( g - ' ) are both normal submonoids =I P so thereareg,,, . . . , g , , and g,,, . . . , g ,,,such that theextendibilitycondition fails, but then {gl ..,gl,, g,,, . ..,g,,,,g} contradicts the extendibility condition for P.) 3. G is an ordered group iff { 1) is extendible. 4. G is an ordered group iff every finitely generated subgroup of G is ordered. In particular, every torsion-free abelian group is ordered. (Hint: Use exercise 3 This result, called Leoy's Theorem, can also be proved by ultraproducts cf., exercise 1.4.18.) 5. Take the group G = {x'y': i, j E Z} with multiplication given by the rule yx = x-'y (so y-'x = x-ly-' by taking inverses). Then (x) is a normal subgroup and G/(x) x (y), so the factors of the chain G 3 (x) 3 { 1) are torsion-free cyclic and thus ordered. However G is not ordered, since x E P o yxy-' = x - l E P.
,,.
$1.3 1. If a ring R is not a division ring then each simple module is not free. Conclude that
a ring is a division ring iff each module is free.
2. The free algebra C{X,,X,} in two indeterminates contains the free algebra C{X}
in a countable number of indeterminates. (Hint: Define an injection $:C{X} -+ C{Xl,X2} by $XI = XlX,.) The free group in two indeterminates contains the free group in a countable number of indeterminates. (Hint:X, -+ XiX,Xi.) 3. $ + R(") is epic iff gf is the identity for some map g: R(")+ R("). What is the situation for monics? 4. View M = R ( " ) as a right R-module with base {el,...,en},where ei=(O,...,0,1,0,...,0). Every n x n matrix A = (a,) over R corresponds to a unique map f:M + M given by fej = e,aij. Likewise, if the matrix B corresponds to g, show AB corresponds to fg. Conclude f is epic iff BA = 1 in M,,(R) for a suitable matrix B.
I:=,
139
Exercises
5. Using exercise 4 show R is weakly n-finite iff every epic j:R(")-+ R(") is an
isomorphism. 6. R is weakly n-finite iff R'"' x R(")6 M implies M = 0. (Hint: (*) by exercise 4. (e) If f:R(")-+ R(")is epic then apply exercise 3 to the exact sequence 0 + kerf -+ R ( " ) L R ( "-+) 0 to show R(")x R(")@ kerj. (If necessary refer to proposition 1.4.10.) 7. Define t: R + R / [ R , R ] by t l = 1 + [R, R ] . This is a trace map, called the Stallings trace map, and has the universal property that any trace map of R factors through it.
81.4 1. There is a 1:l function from {ordinals} to {rings}, proving {rings} is not a set.
(Hint: Define$ {ordinals} + {rings} by fa = Ea for suitable fi defined by transfinite induction such that if a, = a: then IZBII> IEa21.) 2. The following examples can be constructed easily using the direct product: (i) A ring which is not an integral domain but which has no nilpotent elements # O (ii) An infinite ring having prime characteristic p > 0. (iii) A ring in which for each k in N there exists r nilpotent with rk # 0.
n
3. If e = ( r i )E Ri and each ri = 0 or 1 then e is a central idempotent; e is minimal under the PO of exercise 0.0.24 iff all but one ri are 0. 4. There exists an infinite chain of nonisomorphic fields F , c F, c ...(Hint: Let 4 be a finite algebraic extension of 4- and count dimensions.) 5. (An example of nonisomorphic commutative rings R,, R, with injections R , 4R , and R, + R , ) Take fields F, c F, c ..*as in exercise 4 and let R , = OFzi-and R 2 = @FZi.The inclusion maps F 2 i - , + F2i give an injection R , + R , and, likewise, the inclusions F2i + F2i+ gives an injection R, + R,. But there is no isomorphism Jl: R, -+ R,. (Hint: let e be one of the minimal idempotents of exercise 3. Then Jle is minimal since II/ is an isomorphism, but this implies Jl: 4 + 4 for some j 2 i + 1. Applying the same argument to shows x 4 which is impossible.) 6. Suppose rp has the form (Qlxl)~~~(Q,xt)((Jll A ... A Jlu-,)+Jlu) where the Jli are atomic formulas. If { i E I: $ holds in A i } E 9then Jl holds in A = A i / S (Hint: As argued in proposition 1.4.13, one may assume cp is quantifier-free. Let J , = { i : Jl, A . . . A Jlu- each hold in A i } and 5, = { i : Jluholds in Ai}. Then J ; u 5, E 9; if J , E F then 5, 2 (J', u J2)n 5, E R)
,
,
,
I,-'
fl
,
Ultraproducts 7. The ultraproduct of division rings is a division ring.
(fl
7'. Suppose Ri z M,,( q )for each i in I, and F is an ultrafilter on I. Then Ri)/Fx M n ( n&/9). In particular, if each is a division ring then ( n R i ) / . F is n x n matrices over a division ring. 8. The ultraproduct of ordered groups is an ordered group. Conclude from proposition 1.4.21 that a group can be ordered iff each of its finitely generated subgroups is ordered.
Constructions of Rings
140
Reduced Products As Rings In exercises 9-12 suppose {R,:i E I} are rings and let
n,,,
R= R,. Write Z(r) = { i I:~r,SO} and for any A c R, define Z(A)= {Z(r):r E A} E B(I).Conversely, for any 9 G @ ( I ) , define 9(9) = {r E R: Z(r) E 9).
xJE9
9. For any set J c 1 there is a central idempotent e(J) with Z(e(J)) = J . (As in exercise 3). If 9is a filter of I then 9(9)= Re(J). 10. If 9 is a filter of 9 ( I ) then 9(9) Q R and Z ( Y ( 9 ) )= $ and R / Y ( 9 ) is isomorphic to the reduced product RJ9. (Hint: Z(r r’) 2 Z(r) nZ(r’) and Z(rr’) 2 2(r)uZ(r’)for r, r‘ in R, so 9(9) Q R with Z ( 9 ( 9 ) )= 9 by exercise 9.
fl
n
+
Define the obvious surjection $: R + R i / 9 and show ker 9 is the set of (ri) such that { i E I: ri = 0)E I, which is Y ( 9 ) . ) 11. 9()gives a lattice injection from {filters of B(I)}to {ideals of R}. This is a lattice isomorphism if each Ri is a field. However, if I = N and Ri x Mi@) for each i then {(ri):the rank of the r, is bounded} is an ideal of R not in the image of 9(). 12. The ultrafilters of a set I correspond to the maximal ideals of F’ where F is an arbitrary field.
Rings of Continuous Functions The following exercises were chosen to give a taste of Gillman and Jerison [60B], which is a study of the ringR of continuous real-
valued functions on a topological space X. (Gillman-Jerison denote this as C ( X ) . ) Typical elements of R are continuous f:X + R, and we write Z ( f ) for { x E X :f x = 0}, called the zero set off. A 2-set is a zero set of suitable f. 13. {Z-sets}is a sublattice of 9 J ( X ) . 14. Each 2-set is a countable intersection of open sets of
X. (Hint: Z ( f ) = X : I ~<~n-’~). I If X is compact then {Z-sets} is closed under countable intersections but not countable unions. (Hint: One may assume 0 If;.x I1 for each 1;: and each x in X, and note Z(1;:)= Z ( ~ j 7 2 ‘ ) J A 2-filter is a sublattice of {Z-sets} such that if 2, E 9and Z, c 2, then 2, E 3 If A 4 R define Z ( A ) = {Z(f): f~ A} and show it is a Z-filter. Also given a 2-filter 9 define 9(9) = {fE R:Z(f) E 9}. Show Y ( 9 )Q R, and R / Y ( 9 ) has no nilpotent elements # 0. If A is a maximal ideal of R then Z (A ) is an ultra-filter; if 9 is an ultra-Z-filter then 9(9)is a maximal ideal. In the same way, prime ideals of R correspond to prime filters (in the sense that I, u I, E 9implies II E 9or I, E 9). There is a 1:l correspondence from {ultra-2-filters} to the points of the StoneCech compactification of X. In this way, one can use geometry to study R, and, in fact, this example embodies many features of algebraic geometry. n n s N i X6
15.
16.
17.
18.
n
Abelian Categories 19. Conditions (iii) and (iii’)of definition 1.4.40 are equivalent. (Hint: Iff = hg where g is a cokernel and h is a kernel then kerf = ker g and coker f = coker h.) Assume throughout the remainder of this section’s exercises that the underlying category V is abelian.
Exercises
141
20. Any monic epic is an isomorphism. 21. (“Five lemma;” compare with proposition 2.1 1.15) In the following commutative diagram if f,g are epic and u,,u3 are isomorphisms then u2 is also an isomorphism:
(Hint: It suffices to show u, is monk epic; by duality it suffices to show u2 is monic. Suppose u,h = 0 for some h: C A , . Then 0 = gu,h = u 3 f h so fh = 0. Hence h = (kerf)h’forsomeh’:C+ A , so0 = u,h = u,(kerf)h’=(kerg)u,h‘soh’=O; hence h = 0.) 22. (Compare with exercise 1.8.1’) The pullback of morphisms f,:A , + A and f,: A , + A is a triple (P,p,, p,) where pi: P + Ai are morphisms such that f,pl = f2p2 and such that any commutative diagram -+
n
can be completed by a unique morphism P’+P. Show the pullback exists for any abelian category W; explicitly let p: P + A , A , be kernel of the morphism (f,7r,-f27r2):AIA , + A and let pi = n i p : P + A i . 23. In exercise 22 if f,,f2are monic then p1,p2 are m o n k Thus the pullback is the intersection of f l and f,. 24. Suppose A E Ob(W). Using definition 1.4.35, define a subobject of A to be an equivalence class of monics to A , and show ( 9 ( A ) ,I) is a poset. 25. ( 9 ( A ) ,I) of exercise 24 is a modular lattice. (Hint: Denoting subobjects of A by representatives fi: Ai -+ A show fi is the image of that morphism f: H A , -+ A given by 1;. = fpi for all i, where p i : Ai -+ Ai i t t h e canonical monic. To show V fi is indeed the sup, put f = imf.-Then f = f h for some epic h: Ai + A i so each fi = Jhpi implying each fi I f. On the other hand, if each fi 5 k for some monic k : A‘ + A then k ker(coker k ) so 0 = (coker k)fi = (coker k ) f p i implying (coker k)f = 0 and thusf I k. Write Ai for f ( Ai). Similarly, A fi is the kernel of the morphism f’:A -+ fiA given by f i = nif’ for all i, where f i = coker/;.. This shows ( Y ( A ) ,I)is a lattice. Write Ai for the domain of ker(Afi). To show ( 9 ( A ) ,4 ) is modular it suffices by exercise 0.0.2 to show for all monics fi: Ai A and h: B + A with fi I fi that if f, A h = f, A h and f, v h = f , v h then f, = f,. To see this one needs to calculate f, A f2 explicitly. Indeed under *
n
v
H
1
n
-+
Constructions of Rings
142
the notation of exercise 22, the pullback P is A, n A, and p = ker(f,n, - f2n2)yielding the exact sequence
Al n A , 2 A ,
n
A , &'A,
+ A,
where p' = finl - f2n2.
n
n
Note p' is epic. Taking u : A, -+ A, with f, = f i u yields a composition A, B A, 4 A, which together with the projection A, B -+ B yields a morphism u': A, B A, B. By hypothesis there are isomorphisms A, nB -+ A, nB and A, B + A, B so applying exercise 2 1
n
A, n B -
+
A 2 n B-A2
-+
fl
--)I
+
lu2+ B
to show u' is an isomorphism; hence u is an isomorphism.)
26. A subcategory 9 of V is dense if any object of V is isomorphic to a suitable object in 9. Show the natural transformations of % then are determined by the
natural transformations of 9. 27. A category I is skeletally small if it has a small dense subcategory. Show R-Simod is skeletally small, for the small dense subcategory is {R(")/M:n E N and M IR'")}. If I is skeletally small and V is abelian then %I (cf., example 0.1.13) is abelian, where q, q, is defined by (q, q2)i = q l i q,i for i in I. (Hint: componentwise verifications.)
+
+
+
91.5 0. If N is an R-module then End"") x MJEndN). (Hint: Modify the proof of theorem 1.5.13, writing N = Rx and sending (J,) E M,(EndN) to the map /I: N'")-+ N'")given by /I(x,, ...,xn)= (C:=, &,xi,... finxi).) 1. Define the idealizer 9(L)of a left ideal L of R to be { r E R: Lr E L } . Then Y(L)is the largest subring of R in which L is an ideal; also J ( L ) / Lx End(R/L), by sending an element r to its right multiplication map. 2. (The dual functor) Given f i n Hom,(M, N )define fi -+ M by taking f h to be the composition hf for any h: N -+ R. This gives a contravariant functor F:R-Aod -+ d 0 d - R given by FM = M and Ff = f, called the dual functor. Likewise, there is and the covariant functor GF: a contravariant dual functor G: Mod-R + R-Aou!, R-Aod -+ R - d o d is called the double dual. 3. (Ellenberg-MacLane)There is a natural transformation q from ihe identity functor of R-Aod to the double dual functor. (Hint: Defi_neqM: M -+ M by taking qMxto be the map (qMx)f = fx E R for f in M. Show ($(qyx))f = (qfi(gx))f for each f in M and x in M,proving &, = qag.) 4. If R is a division ring in exercise 3 then q restricts to a natural isomorphism in R-Simod. (Hint: Each f.g.R-module M is free; to show qM is 1: 1 show that if x # 0 there is f in M with fx # 0. A dimension count shows each qM is an isomorphism.) 5. Suppose K, M, N are finite dimeqsional vector spaces over a field F, and K M -8, N is exact. Then fi M 2 is exact. (Hint: Certainly kerf contains
,XI=,
4
4 4
Exercises
143
the dual of coker f so equality holds by a dimension count; likewise $3is dual of Mlkerg, implying $N and kerf have the same dimension.) In the terminology of $2.11 below, this says the dual functor is exact for F - ~ % z o ~ a; more general result is given in exercise 2.1 1.0. Rngs 6. Show the free object in Wng is {polynomials in Z{X}without constant terms}. Generalize this to C-algebras without 1. 7. Construct the product and coproduct in W n f . (Hint: Direct product and free product)
$1.6 1. In any domain if ab = 1 then ba = 1. (Hint: ba(ba - 1) = 0.) 2. If Ra = Rb in a domain R then b = ua for some unit u. 3. If T = R [A; a, 61 is a PLID then R is a PLID satisfying Jategaonkar’s condition. (Hint: specialize 1 4 0 to show R is a PLID. To verify Jategaonkar’s condition suppose 0 # r E R. Then Tr TJ. = Tb for some b in T; r E Tb implies b E R, and I E Tb implies ab is invertible. Specialize I + 0 to get b E Rr.) 4. If F is a field of characteristicp then Z ( d , ( F ) )x F [ A P , p P ] , so d l ( F )is not simple.
+
Derivations 5. If 6 is a derivation on R then 6(Z(R)) E Z ( R ) .(Hint: 0 = 6 [ z , r ] = [z,dr] + [6z,r].) 6. Using Leibniz’ rule show that if char(R) = p and 6 E Deriv(R) then 6 P E Deriv(R). 7. Suppose 6*a = 0. Then 6”(a”) = n!(da)”. 8. (Hirano-Yamakawa [84]) For any derivation 6 of R and for each positive integer k there are integers nki such that (ska)b= ~ : = , n k i 6 k - i ( a 6 i for b ) all a,b in R.
(Proof by induction). 9. (Hirano-Yamakawa [ 8 4 ] ) Let R = M,(F[A]) and 6 be defined by taking differen-
tiation at each component. Then 6 is nil on soc(R) but not on R. However, using exercise 8, one can easily prove the following result: Suppose the derivation 6 of R is nil on an ideal A. If d k S = 0 for some subset S of A for which Ann,S = 0, then 6 is nil on R. In particular, this holds if Ann, S = 0 for some finite subset S of A. Moreover, if dkA = 0 and Ann A = 0 then 63k-2R= 0. Suppose a is an automorphism of R. A a-ideal of R is an ideal A of R such that aA = A; we denote this by A Q (R, a). 10. (Goldie-Michler [ 7 4 ] ) The a-ideals are the kernels in the category of rings with automorphism a, where the morphisms preserve a. Explicitly, if A a (R, a) then a acts naturally on R I A ; conversely, if f: R + T is a ring homomorphism and R, T have automorphisms both denoted a and f ( a r ) = a ( f r ) for all r in R then ker f Q (R, a).
A ring is prime if the product of any two nonzero ideals is nonzero.
144
Constructions of Rings
11. (Pearson-Stephenson [77]) Suppose R has an automorphism a. A u-ideal P is called a-prime if whenever A 4 R and B 4 (R,a) with A B G P, one must have A E P or B E P. R is called a-prime iff 0 is a u-prime ideal. Show T = R[l;a] is a prime ring iff R is a-prime. (Hint: (-=) If A B = 0 and B 4 (R,a) then ( T A T ) ( T B T )E TABT = 0. (=.) If A',B' Q T with A'B' = 0 then take A = {leading coefficients of elements of A'} and likewise for B.) 12. (Cauchon [79]) Suppose T = R[l;a,6] where R is simple and a is an automorphism. If A 4 T then A contains a monic polynomial f of minimal degree, and then A = Tf.Furthermore, if we take a monk polynomial g of minimal degree > 0 such that T g Q T then A = Tzg" for suitable n and suitable z in Z ( T ) . (Hint: The first assertion follows easily from the Euclidean algorithm; note if f in A has minimal degree t then RfR contains a monic polynomial of degree t. To prove the second assertion, write f = hgn where h # Tg; then Th 4 T. It suffices to prove Th = Tz for some z in Z ( T ) .Write h = qg p , with deg(p ) < deg(g). Write n = deg h and m = deg(g). Note deg q = n - m. For all r in R one has gr - (a"r)g E T g implying gr = (a"r)g; likewise, hr = (a"r)h, and pr = (anr)p. Similarly, there are ri in R such that g l = (l + r , ) g and h l = (l r2)h; if (degp) < m - 1 then p l = (l r 2 ) p , so Tp 4 T, and by minimality of degg we get degp = 0, so p E R is invertible and p-'h is central. If degp = m - 1 then g = l ' p p' where deg(l') = 1 and degp' < degp. Taking a' = an-m one has l ' r = (a'r)l' for all r in R, so T x R[A';a'], and we are reduced to the case 6 = 0; in this case, TA 4 T so m = 1, and one can use the proof of proposition 1.6.25(ii).)Cauchon also describes the center.
+
+
+
+
$1.7
my=,
1. The Weyl algebra d n ( C )x d l ( C ) . (Hint: Take the natural homomorphism d l ( C ) + d n ( C )sending 1 and p of the i-th component to li and pi. This map sends a base to a base so is an isomorphism.) 2. Suppose A, B E C-df' and H is a commutative C-algebra. Then ( A aC H) @, ( B @CHI ( A @ c B ) &H. 3. Given M E R-&d write Mopfor the corresponding right RoP-module(i.e., same addition and opposite scalar multiplication. If M,N E R - d u d the bilinear forms B: M x N + R correspond to the balanced maps Mopx N + R (over R) and thus induce group homomorphisms Mop N + R. This explains the tie between tensor products and bilinear forms. 4. Suppose C is a commutative ring and A is an abelian group. If A E C - d ~ then d scalar multiplication induces a map p: C €3 A + A given by p(c 8 a) = ca. If, moreover, A E C-d!' then there is a map n:A €3 A + A given by .(al €3 a 2 )= a,a2,and E : C + A given by EC = cl. Show the following diagrams commute:
8 9 -
mR
-
Exercises
145
where $: C 6 A A 6 C is given by $(c 6a) = a 6 c. Conversely, show that any maps n , as ~ described above give rise to an algebra structure by defining ala2 = n(a, 6 a 2 ) and ca = X ( E C 6 a). Thus a C-algebra is given by the triple
( A ,n , 4 . 5. Writing nA:A
-
6 A A and cA: C + A for the maps of exercise 4, reprove that the tensor product A @ B of two algebras is an algebra, by taking =E~@Q, and nA to be the composite ( A 6 B ) 6 ( A 6B ) - ( A
-
6A ) 6( B @ B ) A 60 B,
where the first map is given by ( a , 6 b , ) 6 (a, 6b,) --t (a, 6a z )6 (b, 6 b 2 ) and the second map is n, 6 nB. Show this algebra structure agrees with that given in the text. 6. (Polynomials over a module) If M E R - A d define M [ L ] = { ~ x i L i : xE iM } , made into a module over the polynomial ring R [ 1 ] by putting riLi)( xjL’) = ~ u ( ~ ~ = , r i x u - iShow ) R U .this is a module by identifying M [ I ] with Z [ R ] B Z M as module over Z [ A ] mZR = R [ L ) in the natural way. 7 . If M E A G ~ - and R N E R - A G such ~ that R is a summand of N then the canonical map M M @ 1 E M @ N is monic. (Hint: Construct the left inverse map M 6 N M.) 8. Suppose fi: R i Ti are homomorphisms for i = 1,2. Then ker(f, 0 f,) = (kerf,) 6 R 2 + R , 6 kerf, viewed in R I 6 R , .
(c c
---
61.8 1. Define the pushout of morphisms f,:A .
-
-
A , and f 2 : A 0 A , to be the direct limit of the following system: i = {0,1,2} with PO defined by 0 < 1 and 0 < 2; the Ai are as given with pb = 1;: for i = 1,2 and cpi = lAi for all i. Thus the pushout is an object P together with morphisms p i : A i P for i = 1,2 satisfying plf, = p2f 2 . (Take p, = p,f, .) Show by example that the pushout need not exist in 9 h g . In R-Adshow P = ( A , $ A , $ A 2 ) / ( R( -a,f,a, 0) R( -a,O, f,a)) x ( A , @ A 2 ) / zR( -fla,f2a), the sums taken over all a in A , . Associate the pushout to the following diagram and universal:
-
1
+
I\ -
1’. (The pullback) Given morphisms 1;::Ai -P A , for i
= 1,2 define the pullback of j , and f2 to be the inverse limit of the system dual to that of exercise 1. Thus it is an object P together with morphisms p i : P Ai for i = 1,2 such that flpl = f 2 p 2 ,
Constructions of Rings
146
i.e., according to the diagram of exercise 1 with the arrows reversed. Show
P = { ( a o , a , , a 2 ) ~ n A i : a=of i a 1 = f 2 a 2 }
x { ( a , , a , ) ~ A lx A2:flaI = f 2 a 2 }
in R-Aod, a i m , , and d&. 2. If f:A + B is a map then cokf is a pushout of the system A + s B, and kerf is a
1
0
0
pullback of the inverse system A + j 3B.- In particular, cok is a direct limit and ker is an inverse limit. 3. (Reduced products as direct limits) Any filter f of subsets of a set I is partially ordered via set containment. Letting ng:Hi,, A + Ai denote the natural projection for T c S in E we get a system A i ; n s ) whose direct limit is A i / f together with the natural maps ps: Ai --* A i / S 4. Given a small category I define the inductive limit of a functor f: I -+W to be a universal from F (viewed as an object of U') to the diagonal functor 6: W + V', cf., example 0.1.13 and exercise 0.1.3. The direct limit is a special case via example 0.1.1, viewing any poset I as a small category. Thus the direct limit is a universal.
(n,,,n,,, nisS n
n
01.9 1. The Morita ring A =
(i r),
is graded by
and all other A , = 0. 2. Suppose A is an algebra over an algebraically closed field F, and let a E End, A. We define the characteristic subspace A , = { a E A : ( u- a)'a = 0 for suitable t } for a in F and recall by linear algebra that A = @ A , . If u is a ring endomorphism as well then A,A, E A,, (hint: (a - afl)(ab)= (a - a)aab aa(u - B)b for a in A, and b in A&, so A is graded by the multiplicative structure of F. If, moreover, a is an automorphism algebraic over F (viewing End, A as an F-algebra) then there are only a finite number of eigenvalues, since each eigenvalue is a root of the minimal polynomial, so there are only a finite number of nonzero components. If, instead, a is a derivation then A is graded by the additive structure of F (hint: show A,AF E A , + , by means of the equation (a - a - fl)(ab)= ((a - a)a)b a(a - fl)b). 3. Suppose A is graded. There is a lattice injection from {left ideals of A , } to {graded left ideals of A } given by L + A L (since ( A L ) , = L). This foreshadows a connection between the structures of Al and of A which will be of focal interest at times. Often A, has a special interpretation. For example, in exercise 2 if a is an automorphism which satisfies a separable polynomial then A , = A".
+
+
Exercises
147
Tensor Algebras 4. For every C-algebra A and every map f:M
+ A such that ( f x ) ’ = 0 for all x in M there is a unique algebra homomorphism f: A(M) + A extending f. Use this property to write A(M)as a suitable universal. 5. Suppose M is a free C-module with base indexed by I . Then A(M) x C { X } / A where A is the ideal generated by { X f , X i X j+ X j X i : i , jE I } . (Hint: Verify the universal property.) Furthermore, letting x i denote the canonical image of X i , one has a base B = { I } u { X i ; . . x i U : O< u < 00 and i , < ... < i,} of A(M) over C. The degree of the monomial x i l . . . x i uis defined to be u and is welldefined. Letting B, = { b E B: deg(b) is even} show A ( M )is Z/2Z-graded, where the 0-component is CB, = Z(A(M)).Thus A(M) is a free module over its center with base { I } u { x i :i E I } . 6. The symmetric algebra is a universal from a given module M to the forgetful functor (from {commutative C-algebras} to C - d ~ d . ) 6’. (Tensor rings as universals) Define the category W i ~ g - . @ i m ~whose d objects are pairs cp(R,M ) with M in R-dud-R, and whose morphisms are pairs (cp,f) where cp: R -+ R‘ is a ring homomorphism and f: M + M ’ is a p m a p on each side (i.e., q f ( r l x r 2 )= (cpr,)(fx)(cpr,).There is a functor F : {N-graded rings} + W i ~ g - B i m satisfying ~d FT = (To,TI).Taking u:(R, M ) + T R ( M )by sending R to the 0-component and M to the 1-component, show ( T R ( M ) , uis) the universal from (R, M ) to F. 7. Define the algebra of dual numbers (? over C to be free with base l , x and satisfying x 2 = 0. (This is the exterior algebra of a C-module_isomorphic to C.) If R E C-,&Y define a correspondence Deriv(R) + Aut(R €3 C) by sending 6 to the automorphism s^ of R @ ( ? given by s^(r,@l + r 2 @ x ) = r , @ 1 1 _ + ( r , + 6 r l ) 0 x ; inner derivations of R are sent to inner automorphisms of R €3C. 8. The free product R of any algebra over a field F with a polynomial ring F [ i ] in one in indeterminate is a prime ring. (Hint: Show r 1 h 2 # 0 for all nonzero r r2 in R by ordering a base.) This gives a useful procedure of creating examples of prime rings, as illustrated in exercise 3.2.9.
,,
Quadratic Forms and Clifford Algebras 9. A quadratic form on a vector space V is a map Q : V + F with Q ( a x ) = a 2 Q x for all x in V and such that the map B : V x V+F given by B ( x , y ) = Q ( x + y ) - Q x - Q y
is a bilinear form. Given a quadratic form Q on V, define the Clifford algebra C( V, Q ) = T ( V ) / I where T (V ) is the tensor algebra of V and I is the ideal generated by all x €3 x - Q(x).Then one has a canonical map $: V + C( V,Q ) ; writing X for $x one has X2 = Q x and X j j jE = B ( x ,y ) for x , y in V. In fact, C(V,Q ) is
+
universal with respect to this property: If A E F - d @ and f: V -+ A is a map such that ( f x ) ’ = Q x then there is a unique algebra homomorphism C( V , Q ) + A such that ?$ = f. Generalize this to arbitrary modules over commutative rings. 10. If { x i : i E I } i s a basefor V o v e r F t h e n E = { l } u { x i l x i 2 . . ~ x i r : t E N a n d i , < i, < ... < i , } span C( V,Q ) over F. (Easy induction on the degree of the monomial.) In particular, if [ V : F ] = n then [ C ( V , Q ) :F ] 2 2”. In fact, E is a base of C ( V , Q ) when B is nondegenerate, as seen in the next exercises.
Constructiolrr of Rings
148
11. Given a field F of characteristic # 2 and 0 #a, ~ E define F the quaternion algebra to be a four-dimensional algebra over F with elements x,y such that x2 =a, y2 = j,and x y = - y x ; then { I , x , y , x y } is a base. Note such an algebra must be
unique up to isomorphism in F-dt''. Q=(a, j)can be constructed as follows: Let K = F[1]/(,I2 - a ) , a commutative ring, and let a be the canonical image of 1 in K, so K = FLU].Then Q is the F-subalgebra of M 2 ( K )generated by the matrices 2a 0 and y = Note (o o) E K Q , implying K Q = M , ( K ) ; x = 0 -a a dimension count then shows M 2 ( K ) 7 z K @ Q , from which it follows Q is simple with center F. 12. (Explicit construction of the Clifford algebra.) Notation as above, suppose B is nondegenerate and char(F)#2. We construct an algebra A containing V in which x 2 = Qx for each x in V; moreover, if [ V : F ] = n then [ A : F ] = 2", implying C (V, Q ) 7z A and providing an explicit description of the Clifford algebras. Let { x i : 1 s i In } be an orthogonal base of V (c.f., Jacobson [74B,p. 3381). Since B is nondegenerate we have Q x i # O for each i. Let ai = Q x i . For each t < n we shall define inductively A ( x , , ...,x,), which will be the Clifford algebra on F x , ; it will follow A = A ( x , , . . .,x,).
(" )
(i .)A
c:=,
Case I . A ( x , ) = F [ 1 ] / ( L 2 - a,), identifying x 1 with the image of 1. Clearly, A ( x l ) = F F x , and x : = a, so [ A ( x , ) : F ] = 2 = 2' and we are done in this case. Note if a, is not square in F then l 2-aI is irreducible, so A ( x , ) is a field; otherwise, A ( x , ) z F x F by the Chinese Remainder Theorem.)
+
Case 11. A ( x l , x 2 ) is the quaternion algebra (a,,a2)2. (Indeed, taking yi with y:=aiandyly2= -y2y,,wecanidentifyxiwithyi,sinceforanyo=y1x, +y2x2 in V one has Q v = y:a, y:a2 = (yly, y2y2)'.)
+
+
Inductive Step. Suppose A ( x , , .. .,x,- 2 ) has been defined. Note for i < j It - 2 that xixj = - x j x i since (xi xj)2 = Q(xi xi) = ai aj = x: x f . Let 6 = ( x , . . . x , - ~= ) ~ f a l . . . a , and S =(a,-,6,a,-,6),,aquaternion algebra. Take y,- , , y , in S with y,- ly, = -y,y,- and y: = ai6. We define A ( x , , . .., x , ) = A ( x , , . . . ,x,- 2 ) BFS. Indeed, identify xi with (xl * * * x , -2 ) - 1 0 yi for i = t - 1 and i = t . Then x: = ai and xixj = -xixi for all i < j 5 t, as desired.
-,
+
+
+
+
,
$1.10 1. Suppose S is a submonoid of Z ( R ) ,and let 1= {As:s E S} be a commutative set of indeterminates. Then R , 7z R[1]/(ASs - 1: s E S), seen by verifying the universal
property.
2
Basic Structure Theory
This chapter contains the general results on rings and their modules which have come to be known as the “structure theory.” One of the main themes is Jacobson’s structure theory, via primitive rings and the Jacobson radical. This approach has been spectacularly successful in the 40 years since its inception. The approach is threefold: First one studies “primitive” rings, which are the building blocks, then one obtains the “semiprimitive rings,” and finally one studies the Jacobson radical J , the smallest ideal of a ring R such that R / J is semiprimitive. Since the inception of this theory, prime rings have come to the fore, especially with Goldie’s theorem, which characterizes left orders in simple Artinian rings. Although Goldie’s theorem and its consequences are not studied until Chapter 3, we shall also recast the structure theory in terms of prime rings; the radical associated with this theory is the “lower nilradical.” We shall also examine other nilradicals. Another side to the structure theory is the study of rings in terms of their modules. This can be done through the Jordan-Holder-Schreier theorem and the Krull-Schmidt theorem. New classes of rings arising in such a discussion are semiprimary, perfect, and seimiperfect rings, which are useful generalizations of Artinian rings. On the other hand, perhaps the best approach to
149
150
Basic Structure Theory
module theory is via projective modules and injective modules, thereby laying the foundation for homological algebra (Chapter 5). Sections 2.8-2.12 deal with this very important aspect of the structure theory. At the end of the chapter we consider involutions on rings. This extra piece of structure turns out to be very useful in studying those rings that possess it.
52.1 Primitive Rings Our object in this section is to become familiar with the class of “primitive” rings which is general enough to embrace a very large assortment of examples but is amenable to study by means of Jacobson’s “density theorem.” Our approach will be to develop the theory of primitive rings first and then describe some of the examples in detail. In the course of investigation we shall introduce some important tools of structure theory, including prime rings, minimal left ideals, and the socle. The definition of primitive ring itself is rather straightforward. Definition 2.1.1: A ring is primitive if it has a faithful simple module. Remark 2.1.2:
(i) Any simple ring R is primitive. Indeed every nonzero module M is faithful since Ann M 4R and is thus 0; hence R / L is faithful simple in R-.Mud for any maximal left ideal L. (ii) If D is a division ring and M is a right vector space over D then End MD is primitive (since M is faithful simple viewed as a module over End MD). Our principal objective is to relate primitive rings to End MD. First we locate D. Proposition 2.1.3: (“Schur’s lemma”) i f M E R - A o d is simple then D = End, M is a division ring.
By remarks 0.2.10,0.2.11 every nonzero element of D is an isomorphism and is thus invertible. Q.E.D. Proofi
If R has a faithful simple module M then by means of the regular representation (cf., example 1.5.11) we can view R c End M D where D = End, M. In fact, R takes up a lot of room, as we shall see now.
52.1 Primitive Rings
151
Jacobson's Density Theorem Definition 2.1.4: Suppose R is an arbitrary subring of End MD where M is a vector space over a division ring D, and view M E R - A u d by the given action of R on M. We say R is dense if for every n in N and every D-independent set { x , , . . . , x , } in M we have R X = M(") where x = ( x l , ..., x , ) E M("). (In other words, given y , , . . .,y, in A4 one can find r in R such that rxi = yi for 1 I i I n.) Remark 2.1.5: Every dense subring R of End MD is primitive. (Indeed, M is obviously faithful in R-~uQ! since f M = 0 implies f = 0; M is simple by the case n = 1 of definition 2.1.4.)
The term "density" stems from the following topological considerations: Given x E M and f E End MD define B(x;f )= { g E End M,: gx = f x } . The B(x;f )are a sub-base for a topology called the finite topology of End MD; R is dense in this topology iff R is a dense subring. The converse of remark 2.1.5 is the key to the subject. Theorem 2.1.6: (Jacobson's density theorem) Suppose R has a faithful simple module M and D = End, M. Then R is dense in End MD. Proof: We shall prove that R ( x , , . . , ,x,) = M(") for every D-independent set { x , , . . .,x , } in M. For n = 1 this is true since M is simple, so we proceed by induction on n. Claim: There is r in R such that rx, # 0 and rxi = 0 for all i < n. Otherwise r ( x l , ...,x,- 1) = O always implies rx, = 0 so we have a well-defined map f: M("- ')+ M given by f ( r ( x l , .. .,x, - ,)) = rx, (since R ( x , , . ..,x , - 1) = M("- by induction hypothesis). Then by proposition 1.5.20 there are d , , . . .,dn- in D such that xidi = f ( x , , . . . ,x,- ,) = x,, contrary to the assumed independence of x l ,. . .,x,. Having established the claim, we see by symmetry that for each j I n there exists rj#O with rjxj#O and rjxi=O for all i # j . Given arbitrary y,,. . . , y , in r k j . Then rxi = rjrjxi = M we find r; in R with r)(rj.xj)=y j and put r = Q.E.D. ririxi = yi for each i, as desired.
,
1;:;
,
An elegant proof of a generalization of the density theorem is given in exercise 2.4.1. One can also formulate these results in terms of matrices.
152
Basic Structure Theory
Proposition 2.1.7: If R is a dense subring of End MD then one of the following situations holds: (i) [ M : D ] = n for some n < co,in which case R x M,(D); (ii) For every n in N there is a subring of R having M,(D) as a homomorphic image. Proof: If [ M : D ] = n then R x End MD x M,(D). Otherwise, given n pick x,D and let R, = D-independent elements x l , . . .,x , of M , put V = { r E R: rV E V } . Then V E R , - A d so the regular representation gives us a homomorphism R, -+ End VDx M,(D) which is a surjection by the density theorem. Q.E.D. The structure of End MD is much less amenable when M is infinite dimensional over D;in this case End M D even lacks IBN (cf., example 1.3.33). One immediate consequence of Jacobson’s density theory is the following extremely important structure theorem.
Theorem 2.1.8: (Wedderburn-Artin) If R is primitive and satisjes DCC on left ideals then R x M,(D) for a suitable division ring D. Write R as dense subring of End M,, and let { x i :i E I } be a base of M over D. Let L, = Ann{xj:j Ii } . Then L, > L, > ... by density, contrary to hypothesis unless 111 is finite. But then we are done by proposition 2.1.7(i). Q.E.D. Proof:
The usual formulation of the Wedderburn-Artin theorem is “any simple ring satisfying DCC on left ideals has the form M,(D).” Since we are assuming 1 E R this statement can be improved (corollary 2.1.25’) and, furthermore, there are several short proof (exercises 8,9). Nevertheless this treatment shows how the density theorem gives us a firm grasp of primitive rings. There is a useful internal characterization of primitive rings. Define the core of a left ideal L (written core(L)) to be the sum of all those (two-sided) ideals of R contained in L. Thus the core is the unique largest ideal of R contained in L. Proposition 2.1.9: ( i ) Core(L) = Ann,(R/L). ( i i ) if L c R is maximal then R/Core(L) is primitive ring. ( i i i ) R is a primitive ring iff R has a maximal left ideal L whose core is 0. Proof: Let A = Core(R).
$2.1 Primitive Rings
153
(1) Ann,(R/L) is an ideal of R, and for any r in AnnR(R/L) we have r = r l E r R c L , implying Ann,(R/L) E A. Conversely, AR = A c L so A c AnnR(R/L). (ii) R/L is a simple module over R and is thus faithful simple over RIA. (iii) (F) follows from (ii); conversely, if M is a faithful simple R-module then M x R/L for some maximal left ideal L, implying 0 = Ann, M = Q.E.D. AnnR(R/L) = core(L) by (i).
Corollary 2.1.10: Every commutative primitive ring has no nonzero left ideals and is thus a field. There is a related criterion for primitivity which is sometimes easier to verify. We say a left ideal L is comaximal with all ideals if L + A = R for all 0 # A a R. Clearly, a maximal left ideal L has core 0 iff L is comaximal with all ideals, leading us to Proposition 2.1.11: all ideals.
R is a primitive ring iff R has a left ideal L comaximal with
Proofi (+) Take L maximal with core 0. (F) Take a maximal left ideal L‘r>L. Then L’ is comaximal with all ideals, Q.E.D. so core (L’) = 0.
Prime Rings and Minimal Left Ideals The density theorem relies heavily on the choice of faithful simple module, and one may ask whether all faithful simple R-modules need be isomorphic. In general the answer is “no” but an affirmative answer is available in one very important situation. We shall say a (nonzero) left ideal is minimal if it is minimal as a nonzero left ideal. Z is an example of a ring without minimal (left)ideals since if n E I 4h then 2nh c I . Primitive rings having a minimal left ideal are particularly well-behaved, and to elucidate the situation we introduce a more general class of rings. Definition 2.1.12: R is a prime ring if AB # 0 for all 0 # A, B Q R.
In generalizing definitions from elementary commutative ring theory, one often does best in replacing elements by ideals. We shall see that prime rings form the cornerstone of ring theory, being the “correct” noncommutative generalization of integral domain.
154
Basic Structure Tbeory
Proposition 2.1.13 The following conditions are equivalent: ( i ) R is prime; (ii) Ann, L = 0 for every nonzero left ideal L of R ; (iii)rl Rr, # 0 for all nonzero r1,r2 E R. Proof: (i)*(ii) Ann, L and LR are ideals of R with (Ann, L)(LR)=O, and 0 # L E LR,SO AnnRL= 0. (ii) (iii) if r2 # 0 then rl E Ann, Rr, implying rl = 0 by (ii). (iii) (i) if 0 # A, B Q R then taking nonzero a E A, b E B yields 0 # (aR)b E AB. Q.E.D. Remark 2.1.14: Every primitive ring is prime. (Indeed, if M E R-&d is faithful and simple and 0 # A,B Q R then 0 # BM I M so BM = M; implying 0 # AM = A(BM),so AB # 0.) The converse of remark 2.1.14is false even for commutative rings, by corollary 2.1.10.The “missing link” is minimal left ideals.
Proposition 2.1.15: Suppose R is prime and has a minimal left ideal L. Then L is faithful simple in R-Aod, implying R is primitive; moreover, every faithful simple R-module M is isomorphic to L, implying End, M x End, L. Proof: Ann, L = 0 by proposition 2.1.13, so L is faithful simple, and R is primitive. Suppose M E R - A u d is also faithful simple. Then LM # 0 so aOxO#O for some a, in L, x, in M. By remarks 0.2.10,ll the map L+M given by a + ax, is an isomorphism. Thus L z M and End, L x End, M. Q.E.D.
Finite-Ranked Transformations and The Socle To study minimal left ideals more closely, we view a primitive ring R as a dense subring of End M,, where M is faithful simple in R - A d and D = End, M. For any r in R define ran&) = [rM:D], viewing rM as a D-subspace of M. We are interested in the elements of finite rank, because they permit great flexibility in the study of R inside End MD. (We shall see below that “finite rank” is independent of the choice of M.) Remark 2.1.16: Suppose rl, r , in R have respective finite ranks t l , t , . Then rank(rl + 1,) I t l + t 2 and rank(rlr,) I min(t,,t,) by remark 0.2.3. The rank 1 elements play a special role.
52.1 Primitive Rings
155
Lemma 2.1.17: If rank(r) = t 2 1 then there are rank 1 elements r l , . . .,r, in Rr such that r = r,.
,
c:=,
Proof: Write rM = xiD, and for each i pick a, in R such that aixj = dijxi for 1 I j I t. Given x in M there are d , in D with rx = xjdj = a i x j d j = E : , , airx, so r=C:,, air. Taking ri=air we note riM=xiD so each ri has rank 1. Q.E.D.
c:,j=l
Lemma 2.1.18:
,
Suppose rank@) = t. Rr is a minimal left ideal of R iff t = 1.
Proof: (a) Take 0 # r , E Rr of rank 1. 0 # Rr, I Rr, so by hypothesis Rr, = Rr and r E Rr,; r has rank 1 by remark 2.1.16. (+) We prove Rr is minimal by showing rERa for every O f a E R r . Indeed, suppose a = r’r # 0 and pick x in M with 0 # a x = r‘rx. Let y = rx #O. Then rM = yD. Since M is simple there is rrrin R with r”(ax) = y. Take x’ arbitrary in M and write rx’ = yd’ for suitable d’ in D ; then rx’ = yd’
= (r”ax)d’ = r”r’(rX)d’ = r”r’yd‘ = rr’r’rxr = r”ax’
proving r = rrraE Ra.
Q.E.D.
To make use of these lemmas we must show that the existence of a minimal left ideal L implies the existence of finite-ranked elements. But proposition 2.1.15 shows M x L in R - A d , so we take M = L, and D = End, L. The crucial step is finding an idempotent in L. Lemma 2.1.19: Suppose L is a minimal lefi ideal of R and a E L with La # 0. Then La = L and Ann,a = 0, and L has an idempotent e with ea = a = ae. Proof: La # 0 and Ann,a are left ideals of R contained in L. Since L is minimal we get La = L and Ann, a = 0. Thus a E La so a = ea for some eE L. Then ea = e2a so (eZ- e) E Ann,a = 0, proving e is idempotent. Hence Q.E.D. Ann,e = 0 (as above) so a - ae E Ann,e = 0. Corollary 2.1.20: Suppose L is a minimal left ideal. If L z # 0 then L has a nonzero idempotent; in particular, this is the case if R is prime. Having produced an idempotent we are ready to utilize it in the structure theory. Proposition 2.1.21: Suppose R is any ring with idempotent e, and put L= Re.
156
Basic Structure Theory
Then there is an isomorphism from End, L to eRe preserving the right module action of L. If L is a minimal left ideal then eRe is a division ring, and, viewing L as module over the primitive ring R = R/Ann, L , we see all elements of L have rank 1.
Proof: Recall End, L = Hom,(L, L)OP.For any f in End, L we have f e = f ( e 2 )= efe E e L = eRe, so we can define $: End, L + eRe by $f = f e . Then $(fl + f 2 ) = (fl + f2)e = f i e + f i e = $fl + $f2 and $ ( f l f 2 ) = ( f z f 1 ) e = f 2 ( ( f 1 e ) e= ) ( f i e ) f 2 e= $fl$f2, so $ is a homomorphism, with ker$ = {f E End, L : f e = 0} = 0. Moreover, given ere in eRe we could define f i in End, L as right multiplication by re; then $.f, = f i e = ere, proving I(/ is onto and thus is an isomorphism. If L is a minimal left ideal then L is a faithful simple R-module and so eRe x End, L x EndE L is a division ring; eL= eRe so rank(e) = 1. Hence rank(re) = 1 for any re # 0. Q.E.D. We have prepared the ground for the definition of an important ideal, defined for an arbitrary ring R.
Definition 2.2.22: The socle of a ring R, denoted soc(R), is the sum of the minimal left ideals of R if R has minimal left ideals; otherwise soc(R) = 0. Remark 2.2.23: If L is a minimal left ideal of R then so is Lr for any r in R such that Lr # 0. (Indeed if 0 # ar E Lr for a in L then L = Ra so Lr = Rar.) Consequently soc(R) Q R.
Lemma 2.1.24: of R ) .
n
If R is prime and soc(R)#O then soc(R)= {nonzero ideals
Proofi Suppose 0 # A a R. For any minimal left ideal L of R we have 0 # A L I A n L I L; hence A n L = L and L c A , proving soc(R) E A. But soc(R)Q R by remark 2.1.23. Q.E.D.
Theorem 2.1.25: If R is a dense subring of End MD then soc(R)= {elements of R having finite rank}.
Proof: {elements of R having finite rank} is clearly an ideal A which by lemmas 2.1.17 and 2.1.18 is contained in soc(R). To prove s o c ( R ) c A we may assume soc(R)#O. Then A#O by corollary 2.1.20 and proposition 2.1.21, so soc(R)E A by lemma 2.1.24. Q.E.D.
52.1 Primitive Rings
157
Corollary 2.1.25’: Any simple ring R with minimal left ideal L has the form M J D ) for a suitable division ring D. Proof: R is dense in End LD; the socle, being nonzero, must be the whole ring. In particular rank( 1)= n for some n, implying [ L : D ]= n, so R z M,,(D). Q.E.D.
Remark 2.1.26: If R is dense in End MD and soc(R) # 0 then soc(R) is also dense in End MD. (Indeed take any rank 1 idempotent e and take x E M with ex # 0. Now given independent x,,. . ., x , in M and arbitrary y , , ...,y, in A4 we take ril in R such that rilxi = x and rilxj = 0 for all j # i, and take ri2 in R such that ri2ex = y i ; then letting r = ri2eril E soc(R) we clearly have rxi = y i for 1 I i I t.) Actually, a much more general result (exercise 2) is available if we are willing to move to the category of rings without 1, noting the proof of the density theorem is still valid. We conclude this line of exploration by showing the socle of a prime ring is left-right symmetric.
Proposition 2.1.27: Suppose R is prime. Rr is a minimal left ideal of R iff rR i s a minimal right ideal. Proof: (a) Suppose 0 # r’ E rR. We need to prove r E r‘R. Take an idempotent e of Rr; then r E Re and r = r l e for some rI in R. Write r’ = ra = rlea. Then r,eaRr,ea # 0 so there is r2 in R with 0 # r,ear2rle E r’R. Since eRe is a division ring we can multiply ear2rle by some element to get e, implying r l e E r‘R;which is what we were trying to prove. (=) By left-right symmetry. Q.E.D.
Corollary 2.1.28: A prime ring R has minimal lejit ideals iff it has minimal right ideals, in which case soc(R)= x(minima1 right ideals of R). Let us pause to list the classes of rings described above, from general to specific: Prime -B Primitive
/ Prime with minimal left ideal l M n ( D )
Simple /
Basic Structure Theory
158
Examples of Primitive Rings The class of primitive rings is fascinating since they vary greatly despite the unified framework imposed by the density theorem. We shall examine some examples in detail, starting with primitive rings with socle. The socle is very useful for constructing examples because of the following easy observation. Remark 2.2.29: If R is a subring of End MD containing soc(End MD)then R is dense in End MD. In particular, if R , is any subring of End MD then R , + soc(End MD) is a dense subring of End MD.(It is a ring since soc(End MD)is an ideal.)
This remark is very useful in constructing examples of primitive rings resembling given examples. For example, if C is an arbitrary integral domain, then taking an infinite dimensional right vector space M over the field of fractions F of C , we see C soc(End MF)is a primitive ring whose center is C. (Here we identify each element c of C with c 1, where 1 denotes the identity The following important example is also obtained transformation of End MF.) from this remark, cf., exercise 6.2.9’ below.
+
-
Example 2.2.30: Suppose F is a field and T is an infinite dimensional F-algebra. Viewing T E End TFby the regular representation, let R = T + soc(End TF). Then R E F-&’ and is a dense subalgebra of End TF.
Having seen how to construct interesting primitive rings with socle # 0 we turn to primitive rings having zero socle. In fact, we already have many examples and need merely to recognize them by means of the following result.
Proposition 2.1.31:
lf R is a domain having a minimal ldt ideal then R is a
division ring. Proofi There is a short structural proof using proposition 2.1.15 but we may as well use the following easy argument: Suppose L = R x is a minimal left ideal and 0 # a E R. Then 0 # Rax E R x so Rax = Rx and x E Rax, implying x = bax for some b in R. Then 1 = ba so we have found a left inverse for every nonzero element. Q.E.D.
Corollary 2.1.32: lf R is a simple domain which is not a division ring then R is primitive with socle 0. Proofi Simple implies primitive, so we apply the contrapositive of the proposition. Q.E.D.
52.1 Primitive Rings
159
Example 2.1.33: The Weyl algebra over a field of characteristic 0 is a simple domain, so is primitive with socle 0. Example 2.1.34: For any field F the free algebra F{X1,X2} is not simple but, nevertheless, is primitive with socle 0. To see this, we take a right vector space M with countable base {ul, u 2 , . . .} over F and define the transformations rj in End MF by rlu,=O, r l u i + l = u i and r2ui=uiz+1. We see easily that F{X,, X 2 >is isomorphic to the subalgebra R of End MF generated by rl and r 2 , by the map XiH rj (because the “monomials” in rl and r2 are linearly independent). But M is obviously faithful in R-&ud and M is simple (because for any x in M we get some r;tx = uoa for suitable a # 0 implying u, E Rx, and clearly each ui E Ru, implying M = Ru,). Hence R is primitive. F{X1,X2} is a domain and thus has socle 0. Example 2.1.35: Suppose K is a field with an endomorphism a not of finite order. Then R = K [A;a] is primitive; indeed R(A - 1) is a maximal left ideal with core 0 since by proposition 1.6.25 all two sided ideals have the form RAi. On the other hand, R is a domain and thus has socle 0.
More examples are given in the exercises, as well as in the supplements here.
E Supplement: A Right Primitive Ring Which is Not Primitive Many basic concepts of ring theory are left-right symmetric, but not primitivity. While an undergraduate, Bergman [64] produced a right primitive ring which is not (left) primitive. His example relies on the asymmetry inherent in the skew polynomial construction. Later Jategaonkar found a general construction which has other applications, and we shall present Jategaonkar’s ring. (Also cf. Cohn [85B].) Example 2.1.36: (Jategaonkar’s counterexample) A Jategaonkar sequence of rings is a collection { R,: p I a> of rings for a given ordinal a satisfying the following conditions: (1) R , is a division ring D,and D c R, for each p. (2) For every successor ordinal y = 8’ there is an injection a:, R,
+
D
such that R , is the skew polynomial ring R,[I,; a,]. R, for every limit ordinal y. (3) R , =
To define a Jategaonkar sequence it suffices by transfinite induction to define
Basic Structure Theory
160
the o,, but first we shall study the properties of Jategaonkar sequences, assuming that they exist. In the above notation we call R , a Jategaonkar ring if a is a limit ordinal. All proofs are straightforward by transfinite induction unless otherwise stated.
R, c R , for every i3 < y I a. Every nonzero element of R, can be written uniquely in standard form f= diIil.* * litfor suitable t, suitable di in D,and suitable ordinals il I i, I * * . I i, < a. In particular, we can define u ( f ) = {largest fl: I , appears in a monomial off}. If f E R, and fl > u(f) then I , = (o,f)-'I,f E R y f . Each R , is a PLID. (Proof by induction: For y a successor ordinal this follows from proposition 1.6.24. For y a limit ordinal and L< R , we take j < y with L n R, # 0 and, inductively, take L n R, = R,f for suitable f i n R,; for every B' > fl we have I,. E R y f by (iii), so, in fact, L = R , f . ) In particular, R, is a PLID. R,I, Q R , for each y (since I y I , = (D,I,)I, for p < y and I , I , E IyR,IZ, c R,I, for fl 2 y by (iii)). (vi) For each y < a there is a homomorphism R,+ R , obtained by specializing for I , + 0 for each fl > y. (sincexB, ,R,I, 4 Rmby (v)) (vii) Every nonzero left ideal L of R, contains a nonzero two-sided ideal of the form RI,. (Indeed, write L = R , f and take /? > u(f). Then I , E L by (iii) and RA, 4 R by (v).) (viii) R, is not primitive since every maximal left ideal has a nonzero core. '(1 + I,& E D for f;. in R , then each (ix) If fll < fl, < < fl, and fi = 0. (Otherwise, take such an equation with y minimal where y = max{u(fi): 1 I i I t } . If y > fl, then specializing y + 0 gives I 1( + I& E D with fi = giI, + 1;.But each u(f:) < y, contrary to hypo+ Isi)gi = 0, and by thesis unless each f: = 0; now, fi = g i I y , so induction on the degree we conclude each gi = 0, so fi = 0. This proves y Ifl,. If y
c:=
c(1
+
Thus Cl3:(1 + A )gi E D, so by induction on t, we see each g i = 0; si so, p v g , = 0, implying g , = 0, contrary to definition of d,.
52.1 Primitive Rings
161
(x) R is right primitive. (Indeed, let A = c p < , ( l + 1,)R,. 1 $ A by (ix); A is comaximal with all ideals for if 0 # I 4 R then some 1, E I by (vii), implying 1 = (1 + 2,) - I , E A + I . Hence R is primitive by proposition 2.1.1 1.) In particular, R , is right primitive but not (left) primitive. R, has other interesting properties which shall be derived later. We turn now to the existence of Jategaonkar rings. This may seem to be a formidable task, but in fact can be handled quite easily by means of the “generic approach,” one of the themes of this book. The underlying idea, well illustrated in this example, is to use indeterminates to satisfy a given restriction in the most general possible manner. In the case at hand, we shall show that any given division ring Do is contained in a suitable Jategaonkar ring R,, for any ordinal R,. Let X = { X , : 1 I p < a } be a set of noncommuting indeterminates over D o . We shall build R , as a subring of a larger ring, with the X p taking the place of the A,. Since one large ring we know how to build from Do and X is the Laurent series ring D,((X)) of theorem 1.3.40, we shall take each R, to be a suitable subring. For y a limit ordinal we clearly want R, = {R,: fl < y}, so we shall henceforth assume y is a successor ordinal, say y = p’. Now we want R , = R,[X,; p,] for a suitable homomorphism p y :R, + D where D = R,; hence for all /? < y we must have X,X,X;’ = p y x BE D. The “generic” approach mentioned earlier leads us to use this condition to define D as follows: Let H be that subgroup of the free group % ( X ) generated by all X,X,X;’ for all fl < v. Then H inherits the ordering of % ( X ) and so Do((X)) has a division subring D = D,((H)) in view of theorem 1.2.24’. Let R, be the subring of Do((X)) generated by D and all X , for fl I y. Then there is an injection p,: R , + D given by pyf = X , f X ; ’ , and it remains to show that the X, act like indeterminates over R, or, more formally, that there is an isomorphism $ , : R , [ I ; p , ] + R , given by $ y ~ ~ = o Q i = c I = o l ; . X : yfor = 0, i.e., if each t . Clearly $, is a surjection, so it suffices to prove ker J/, ~ f = , 1 ; . X=~0 then each 1;. = 0. Assume, on the contrary, that ~ : , , 1 ; . X := 0, with each 1;. in R,, and f, # 0, and choose t minimal such. Then 0 = X , ( c f i X i ) X ; l = c ( p , f i ) X i , so we may assume each fi E D. Multiplying through by f;’ we now may assume f , = 1. But now X : XfZAfiX: = 0 = X : c : , ; ( p , f , ) X i (again conjugating by X , ) so‘ c:i,!,(1;. - p,f;,)Xt = 0; by minimality of t we see 1;: = p,f;: for each i.
u
+
+
Claim: If f E D and pyf = f then f E D o . (If we can prove this claim then
162
Basic Structure Theory
each J E D o , contrary to X , being an indeterminate over D o , so we conclude that ker $, = 0.)
Proof of Claim: Write f as a Laurent series x d h h where the dh E Do and h E H. Now every element of H is a string of XvXPX;’ or (XVXBX;’)-’ = XvXj’X, for fl < v ; so any h # 1 starts with some X,, and ends with some Xi:, and by inspection cannot commute with X,. If supp(f) # { l } then we can take h # { l } minimal in supp(f) (which is well-ordered). Then X,h < hX, or hX, < X,h. In the former case, we have X,hX;’ < h and X,hX;’ E supp(X, f X ; ’ ) = supp( f); in the latter case, Xi’hX, c h and Xi’hX, E supp(f). At any rate, we have contradicted the minimality of h, so indeed supp(f) = { l}, proving f E Do as claimed. Having established the claim, we conclude as noted above that ker $, = 0, so that R , = R,[X,;p,] as desired. Q.E.D.
82.2 The Chinese Remainder Theorem and Subdirect Products This short section provides a general method for simplifying the study of rings by breaking a ring into more manageable rings. Our motivation comes from a venerable result of number theory, often called the “Chinese Remainder Theorem:” Given m,, . . .,m,, n,,. ..,n, in N where m,, ... ,m, are pairwise relatively prime, one can find some n E N such that n = n, (modulo mi) for 1 I1 I t. We shall find a very easy proof of this fact by restating it in terms of the notions we previously encountered. Namely, given a collection ( A i :i E I } of ideals of R, we define the canonical homomorphism R RIA, by r + (r + Ai). The Chinese Remainder Theorem says that if n,, . . . ,n, are pairwise relatively prime then the canonical homomorphism Z + Z/niZ is onto. In fact, this result can be stated much more generally. We say ideals A,, .. . ,A, of R are comaximal if Ai + Aj = R whenever i # j.
+Hie,
fl:= ,
Proposition 2.2.1: (“Chinese Remainder Theorem”) Suppose A,, . . .,A, are RIA, comaximal ideals of R. Then the canonical homomorphism cp: R + is onto.
Hi=,
Proofi It suffices to show that (0,. . .,0, r + A,, 0,. . .,0) E cpR for each i, which is clearly the case if (0,. . .,0,1,0,. ..,0) E qR. By symmetry we need only show ( l , O , . .. ,0) E cpR, i.e., there exists r in R such that 1 - r E A , and r E A, n n A,. For each j > 1 write 1 = alj + aj for suitable aIj in A , and
s2.2 The Chinese Remainder Theorem and Subdirect Products
163
aj in Aj. Then
where a is a sum of terms from A, (since each term has some a I j as a multiplicand). Thus, letting r = a , ... a, we see 1 - r = a E A, and r E A, n . . . n A , , as desired. Q.E.D.
Subdirect Product Since proposition 2.2.1 gives a sufficient condition for cp to be onto, we now ask when cp is 1 : l . Proposition 2.2.2: If { A,: i E I}are ideals of R then the kernel of the canonical map 4p: R -+ RIA, is A,. In particular, if A,, . . . , A , are comaximal RIA,. then R / n ; = ,Ai x
n,,,n;=,nis,
Proof;. cpr = 0 iff r + A, = 0 (iff r E A,) for each i, proving the first assertion. The rest follows from Proposition 2.2.1. Q.E.D. Corollary 2.2.3: If A,, . . .,A, are distinct maximal ideals of R haoing intersection 0 then R s~ RIA,.
n:=,
Definition 2.2.3': An ideal P of R is prime if RIP is a prime ring. The following conditions are easily seen to be equivalent to this definition, cf. proposition 2.1.13: (i) If A , B a Rand AB E P then A c P o r B c P (ii) If A 2 P and B 3 P are ideals then AB $Z P (iii) If aRb c P then a E P or b E P.
A semiprime (resp. semiprimitioe) ideal is an intersection of prime (resp. primitive) ideals. Prime ideals are one of the keys to the theory of rings. Let us record a useful general result relating maximal ideals to prime ideals. Remark 2.2.4: Suppose A , , . . . ,A, are distinct maximal ideals of R and A, ... A, E P for some prime ideal P. Then P = Ai for some i. (Indeed, A, ... A,- G P or A, G P; by induction on t we conclude some A, c P, and thus A, = P since A, is maximal.)
,
This remark sheds further light on corollary 2.2.3. If A,, ... , A , are maximal ideals of R with Ai = 0, then any prime ideal P contains 0 = A, A,
n:=,
Basic Structure Theory
164
and thus P = Ai for some i. Thus A l , . . . , A , are the only prime ideals of R. For future reference we digress a bit, with a module-theoretic version of corollary 2.2.3.
Proposition 2.2.5: If M has maximal submodules N,, where t is minimal, then M x Hi=,M / N i .
. ..,N,with nr=N, = 0
n:=,
+
Proofi Put Mi = M / N , . Define cp: M -, Mi by cpx = (x N , ,..., + N,). Then ker cp = Ni = 0 so it suffices to prove cp is epic. By symmetry it suffices to show for each element x in M there exists x’ in N , n n Nt with x N , = x‘ + N,. By hypothesis N2n ... n N, has some nonzero element y. Since M , is simple we have x + N , = r ( y + N,) for some Q.E.D. t i n R, so we take x’ = ry.
x
+
Definition 2.2.6: Given a collection { A i :i E I } of ideals of R, we say R is a subdirect product of { R I A , :i E I } if the canonical homomorphism cp: R -, RIAi is an injection.
Hie,
Remark 2.2.7: By proposition 2.2.2 we see R is a subdirect product of the RIAi iff Ai = 0. Thus we have an internal condition (in terms of ideals) for when R can be studied in terms of direct products of homomorphic images.
n
Subdirect products are much more general than direct products, as we see by the following examples. Z is a subdirect product of the finite fields Z / p Z for p prime, since pZ = 0. For any product of distinct primes m = p 1 * * * p t ,Z / m Z z Z/piZ. The polynomial ring F[A] is a subdirect product of the fields F [ A ] / ( p ) where p runs over the irreducible polynomials. For any product of distinct irreducible polynomials f = p l * * * pwe , have F [ A ] / ( f ) x F[A]/(pi).
n
n;=,
n:=,
Semiprime Rings Often “semi” means “subdirect product.” Definition 2.2.8: R is semiprime if R is a subdirect product of prime rings. Remark 2.2.9: By remark 2.2.7, R is semiprime iff
n(prime ideals of R} = 0.
Semiprime rings have a very useful property which gives them a central role in the structure theory.
42.3 Modules with Composition Series and Artinian Rings
165
Remark 2.2.10: If L is a nonzero (or right) ideal in a semiprime ring R then L z # 0. (Indeed L $Z P for some prime P a R , so the image t # 0 in the prime ringR = R / P , implying L2 # 0 by proposition 2.1.13; hence L z # 0.)
In 82.6 we shall see that this property actually characterizes semiprime rings. For the time being we utilize it as follows: Proposition 2.2.11: Any minimal left ideal L of a semiprime ring contains a primitive idempotent. Proof: By corollary 2.1.20 L has a nonzero idempotent, which is primitive Q.E.D. by proposition 1.1.21.
52.3 Modules with Composition Series and Artinian Rings This section features the Jordan-Holder-Schreier theory of composition series. As an application, we determine the basic structure of left Artinian rings and also introduce central simple algebras. We shall rely on 50.2.17tT.
The Jordan- Holder and Schreier Theorems Let us say a chain M > M , > * . * > M, has length t. When verifying M is Artinian we shall often find it convenient to prove the stronger assertion that every chain in L ( M ) has length bounded by some t. This can usually be done directly, but we prove now that it is enough to examine one particular chain. Definition 2.3.1: A composition series of length t for M E R-Aud is a chain is of submodules M = M , > M I > ... > M, = 0 such that each Mi-,/Mi simple in R - A d ; each Mi- , / M i is called a factor of the composition series. Two composition series M = M , > M , > > M, = 0 and M = No > N, > ... > Nu = 0 are equivalent if u = t and there is a permutation 71 such that Nzi-,/Nzix M i - , / M i for 1 I i I t. (In other words, the two composition series have the same sets of factors, possibly permuted.) A rejnement of a chain of submodules is a new chain obtained by inserting additional submodules. Remark 2.3.2: A module M has a composition series iff M is both Noetherian and Artinian. ((3) follows at once from theorem 2.3.3 below. (e) M is Noetherian so has a maximal (proper) submodule M , ; M , has a maximal
Basic Structure Theory
166
submodule M,, etc; the chain M > M, > M , > ... terminates since M is Artinian, thereby yielding a composition series.) Theorem 2.3.3: Suppose M E R - A d has a composition series % = (M = M , > M , > ..* > M,= 0). Then any chain of submodules of M has a refinement equivalent to %. (In particular, every chain has length < t.)
-
-
to denote equivalent chains, and let 9 = (M > N , > Proofi Write N , > .. .) be an arbitrary chain. We aim to prove 9 has a refinement %' %. We introduce the following general notation to permit manipulation of chains: picking Nu and letting 9'= (M > N , > > Nu)and 9"= (Nu> Nu+ > . * we write 9 = 9' + 9"and 9"= 9 - 9'.Also define %, = % ( M > M,) = ( M , > M , > > M, = 0), a composition series of length t - 1. The proof is best visualized by means of the following picture:
,
a)
The proof is by induction on t , the length of the composition series. If N , I MI then by induction we can refine 9'- (M > N , ) ( M , 2 N , ) = (M, 2 N, > N, > to a composition series 5%; W,, so 9 has the refinement (M > M,)+ %: ( M > MI) + = %, and we are done. Thus we may assume N , $ M , . Then N , M, = M since (N, M , ) / M , is a nonzero submodule of the simple module M / M , . By induction on t , we can refine the chain M1 > N, n M, 2 0 to a composition series %', %, and we can surely write U', = U; U;, where W; is a composition series for N , n M,and %; is a chain from M1 to N1 n MI whose factors are all simple. But M , / ( N , n MI) x ( M , + N , ) / N , = M / N , , so we can translate %> to a chain gofrom M to N , having the same (simple) factors. Denoting the length of %;' as rn, we see U; has length (t - 1) - m. Also N , / ( N , nM,)x ( N , M , ) / M , = M / M , is simple. Hence (N, > N1n M,) %\ is a composition series for N , having length t - m,which, by induction, is equivalent to some refinement 9, of 9 - (M > N , ) . Q0 9, is a composition series which is a refinement of 9, so we need merely show (9, 9,) %. To see this we examine the sets of factors, letting . . a )
-
-
+
+
+
+
+
+
-
+
+
-
$2.3 Modules with Composition Series and Artinian Rings
167
9( ) denote the set of factors of a chain.
+
5 ( g 0 9,) = 9(9,) u 9(9,) = T(%?‘J u 5 ( ( N l > N, n M,)
+
= 9(%>) { N , / N , n M,}
+ %;)
u 9(%; - %>)
= 9(%?:) u { N , / N , n M,}
Q.E.D. = S(%?,) u {MIMI} = F(%?). This theorem combines the “Jordan-Holder theorem” (stating the equivalence of any two composition series) with the “Schreier refinement theorem” (stating that any chain can be refined to a composition series). This very fundamental theorem enables us to define the length of M, written { ( M ) , to be the length of its composition series. (If M has no composition series we write [(M) = 00.)
Corollary 2.3.4:
Suppose [(M)
=n
< co.
(i) Every chain of submodules has length 5 n. (ii) P(M) = t ( N ) G ( M / N )for every N < M. (In particular, d ( N ) < [(M).)
+
Proof:
(i) is immediate; (ii) is clear when we refine the chain M > N. Q.E.D.
A related result to be used later connects composition series to primitive ideals, cf., remark 2.5.0 below. Remark 2.3.5:
If an f.g. module M has a composition series of length m then there are primitive ideals P,, .. . ,P,,, such that P, . * . P, M = 0. (Indeed, if M = Mo > M , > ... > M,,, = 0 is a composition series, take Pi = Ann,(Mi- , / M i ) ; thenP,M,-, E M,foreachisoP,,,..*P,MG M,,,=O.)
Artinian Rings Definition 2.3.6: A ring R is left Artinian (resp. right Artinian) if R is Artinian as left (resp. right) R-module. R is Artinian if R is left and right Artinian. It is easy to see that any homomorphic image of a left Artinian ring is left Artinian, because any chain of left ideals can be lifted up from a homomorphic image. We are ready to determine much of the structure of left Artinian rings.
Basic Structure Theory
168
Example 2.3.7: Every finite dimensional algebra R over a field F is Artinian. (Indeed, if [R:F] = t and R > L, > L, > then viewing the Li as subspaces of R we have t=[R:F]>[L,:F]>[L,:F]> -**implying[Lj:F]=O for some j I t, so Lj = 0.) Remark 2.3.8: Every simple left Artinian ring has a minimal left ideal and thus by Wedderburn-Artin is of the form M,,(D) for suitable n and suitable division ring D. Conversely, R = M,,(D) is simple Artinian since we have the composition series of R-modules R > Ln-l > L n F 2>
> Lo = 0
where L, =
11 Rejj U
j=
(so that L,/L,-, x Reuuis a simple R-module); R is simple by proposition 1.1.5.)
Thus simple Artinian is just a different name for a ring of the form Mn(D). This characterization, resulting from work of Wedderburn, Artin, Hopkins, and Levitzki, is so fundamental that rings of the form M,,(D)are thereby called simple Artinian rings. Their module structure is very straightforward. Remark 2.3.8': Suppose e is a primitive idempotent of a simple Artinian ring R. Then Re is a simple R-module, and any simple R-module is isomorphic to Re, by proposition 2.1.15.
Theorem 2.3.9:
Suppose R is a left Artinian ring.
(i) Every prime ideal of R is maximal; in particular, i f R is prime then R is simple Artinian. (ii) There are only a finite number of distinct prime ideals PI,. . .,P,, and R/pi a direct product of simple Artinian rings. Rl fli= pi x
Proof: (i) Suppose P 4R is prime. Then RIP is prime Artinian and thus primitive by proposition 2.1.15. RIP is simple Artinian by theorem 2.1.8, so, in particular, P is a maximal ideal. (ii) Suppose Pl, P,, . . . are distinct prime (and thus maximal) ideals. Then the chain Pl
3
Pl n Pz 3 Pl n P2n P3 3
terminates at some Pl n n P,, implying for each prime ideal P that Pl n * - n P, E P. Hence P = pi for some i It by remark 2.2.4; the rest is proposition 2.2.2. Q.E.D.
42.3 Modules with Composition Series and Artinian Rings
169
Armed with this result we shall now characterize a wider class of Artinian rings.
Theorem 2.3.10:
The following conditions are equivalent for a ring R:
(i) R is a Jinite direct product of simple Artinian rings. (ii) R = Soc(R). (iii) R is semiprime and leji Artinian. Proofi (i) * (ii) M,,(D)is the sum of its minimal left ideals, and this property passes to finite direct products. L,. Then 1 = ay,for suitable Lyiand uyiE (ii) * (iii) Write R = LYi;writing Li place of Lyiyields 1 E Liso R = Li. Putting Li = Lj gives a composition series R > 15,- > > .-.> L’, > 0 for R in R-Aod, proving R is left Artinian. To show R is semiprime, we note that 0 = Ann{ 1) 3 Ann Li.Since each Li is simple in R-Aod, we see each Ann L, is a primitive ideal; hence R is a subdirect product of the primitive (and thus prime) rings R/Ann L,. (iii) (i) By theorem 2.3.9, letting PI,.. . ,P, be the prime (and thus maximal) ,(R/4), and each R/C is simple Artinian. ideals of R, we have R w Q.E.D.
I:= ,
Eyer
n:=
n:=
A ring R satisfying the conditions of theorem 2.3.10 is called semisimple Artinian, or semisimple. Note that condition (i) is left-right symmetric, implying that the right-handed versions of (ii) and (iii) are also necessary and sufficient for a ring to be semisimple Artinian. Corollary 2.3.11: Suppose R is a semiprime ring in which every nonzero left ideal contains a minimal lefi ideal. If soc(R) is a sum of a finite number of minimal lejl ideals then R is semisimple Artinian. Proofi If soc(R) = Lifor minimal left ideals Li,then we have a composition series soc(R) = M,-l > ... > M , = 0 where each Mu= L, so L(soc(R))It . We shall use this fact to show soc(R) = Re for some idempotent e. Indeed, put e, = 0 and use the following inductive procedure: Given e, idempotent take a minimal left ideal L < R(l - e,) and write L = Ra, for a suitable idempotent a, of R (by proposition 2.2.11). Writing a, = r,(l - e,) we see aueu= 0 but (1 - e,)a, # 0; hence a: = (1 - e,)a, is an idempotent of L orthogonal to e,, so e,, = a: e, is idempotent in soc(R).
IT=
+
Basic Structure Theory
170
The chain 0 < Re, < Re, < in soc(R) must have length It, so Re, = soc(R). If soc(R) # R then by hypothesis R ( l - e,) contains a minimal left Q.E.D. ideal not in the socle, which is absurd. Hence soc(R)= R. Corollary 2.3.12: Suppose a semiprime ring R has orthogonal primitive ideme, = 1. Then R is semisimple Artinian and each potents e l , . . .,e, with Re, is a minimal leji ideal.
I:=,
xi=,
Proofi Put A = soc(R) and L , = A n Re,. Then A = L , since any a = a C e i = ae, E L i . But L i , being in the socle, contains a minimal left ideal L ; = Re: where ei is idempotent (cf., proposition 2.2.1l), and proposition 1.1.21 shows Re, = L ; is minimal. Hence R = soc(R) is semisimple Artinian. Q.E.D.
1
Semisimple Artinian rings are so important in the structure theory that we shall summarize their basic properties in terms of idempotents.
Theorem 2.3.13: Write a semisimple Artinian ring R as Ri = M,,(Di) called the simple components of R.
ni=,R, for suitable
(i) Let z, = (0,. . .,0,l,O,...,0)where 1 appears in the i position. Then each zi is a central idempotent of R with z, = 1; A , = Rzi are the unique minimal ideals of R. Each A, is itself a ring with multiplicative unit z , , and Ri x A , as
,
rings. (ii) Any simple R-module M is isomorphic to Re for some primitive idempotent e of R. (iii) Every primitive idempotent e of R lies in some A,. Two primitive idempotents e, e' lie in the same A, iff Re x Re' as modules, iff eRe' # 0. (iv) There are precisely t isomorphic classes of simple R-modules, one for each simple component. Proof: (i) by proposition 1.1.14. (ii) M = A,M so some A,M # 0 implying A,M = M. Let 2 = Cj*,Ai. Then AA, = 0 so AM = AA,M = 0 and thus we view M as module over R I A x Ri. M is a simple &-module, by remark 0.0.9, so by remark 2.3.8' is isomorphic (in R,-Mud) to R,e for some primitive idempotent e of R,. Viewing e in A, we see M % Re in R-Mud. (iii) Write e = (el,.,.,e,) where e, E A,. The e, are orthogonal idempotents so e = e, for some i, and all other ej = 0. Clearly e, e' are in the same
42.3 Modules with Composition Series and Artinian Rings
171
component iff eRe' # 0 (since A iis simple as a ring). If e, e' E A i then Re x Re' as shown in (ii); conversely, i f f : Re --t Re' is an isomorphism and e E A i , then 0 # f e = f (zie)= zi f e E ziRe' implying zie' # 0, so e' E A'. (iv) Immediate from (ii) and (iii). Q.E.D. Let us disgress for a moment to show that the left-right symmetry of semisimple Artinian rings does not hold for left Artinian rings in general.
(r ,,L)
Example 2.3.14:
Suppose F is a field and K is a subfield, and let R =
. By example 1.1.9, the only proper left ideals of R are 0, Fe,,
,
,
+ Ke,, ,
Fe, and { a'e, + a'/3e, : a' E F } for each /3 in F, so R has length 2 in R - A u d and is left Artinian. On the other hand, for any K-subspace J of F, we see
(: i)
is a right ideal. Thus R is not right Artinian if [F:K] = 00.
Rather than enter here into the consequences of these basic results on Artinian rings, we close the discussion with a typical argument concerning an Artinian-like condition. Proposition 2.3.15: Suppose R has no infinite chain Rr 3 Rr2 3 Rr3 3 r in R. If a E R with Ann, a = 0 then a is invertible in R.
* *
for
Pro08 By hypothesis Ra' = Ra'" for some i, so ai E Ra'". Write ai = ba'+1. Then (1 - ba)ai = 0, implying 1 - ba = 0 (seen inductively on i ) ; hence ba = 1. But now (ab - 1)a = a(ba) - a = 0 so ab - 1 E Anna = 0 and ab = 1. Q.E.D.
Split Semisimple Artinian Algebras Definition 2.3.16: Suppose R is a finite dimensional F-algebra. R is split if Rx MJF) for suitable t, u in N . A field extension K of F is a splitting jield for R if R OFK is split as K-algebra.
n:=,
One of the prime uses of tensor products is in splitting algebras, largely because of the following few results. Note that if R is simple and split then R 2 M,,(F) for some n. Proposition 2.3.17: Any finite dimensional semisimple algebra R over an algebraically closed field F is split.
Basic Structure Theory
172
n:=,
Proofi Write R = R, where each R, is simple Artinian. Then R, = Mnu(D,) where 0,is a division algebra finite dimensional over F. For any d in D,, we see F[d,] is a finite extension of F and is an integral domain (in fact a field); since d is algebraic over F we conclude d E F. This proves 0, = F for each u, so R x Hi=,MJF). Q.E.D.
Corollary 2.3.18: The algebraic closure K of F is a splitting field for a finite dimensional F-algebra R iffR BFK is semiprime. Proofi (=.) is a fortieri. (t) [R BFK: K] = [ R :F] so R BFK is Artinian; if semiprime then R BFK is semisimple and thus split. Q.E.D. The condition in corollary 2.3.18 does not always hold (cf., example 1.7.25), but an important positive result is available.
n:=,
Corollary 2.3.19: If R = R, where each R, is a simple finitedimensional F-algebra with center x F, then the algebraic closure K of F is a splitting field for R.
fl
Proofi By proposition 1.7.15 we have R BFK x R, QF K, each component of which is simple by theorem 1.7.27, so R Q K is split by corollary 2.3.18. Q.E.D. Remark 2.3.20: The general procedure for splitting R (if possible) is to write R = R, and take a field compositum F‘of the Z ( R , ) over F. If R OF x F’is still semiprime then we can split it by corollary 2.3.19.
n
Given a splitting field we can find a splitting field which is a finite extension of F, by the following.
Proposition 2.3.21: If K is a splitting field for R over F then K contains a splitting field which is finitely generated (as a ring) over F.
fl:=
Proofi Write R QFK = Mnu(K).Letting {el’: 1 I i, j Inu} be a set of matric units for R, we write e y = r l l Q a: for rll in R and a!; in K. Let K O be the subfield of K generated over F by all the a!:. Then K O is a finitely generated extension of F, and R BFKOcontains enough matric units Q.E.D. to be split (by a dimension check).
xk
$2.3 Modules with Composition Series and Artinian Rings
173
Central Simple Algebras and Splitting Definition 2.3.22: R is a central simple F-algebra if R is simple, F = Z(R), and [R: F] < 00. (In the literature, the “finite dimensionality” criterion is not always included in the definition.)
Every central simple algebra is clearly Artinian, but the theory of central simple algebras is considerably richer than that of simple Artinian rings. We shall develop some of the basic splitting results here, but leave the remainder of the theory for Chapter 7. Remark 2.3.23:
(i) If R is a prime algebra which is finite dimensional over its center then R is simple; indeed R is Artinian so apply theorem 2.3.9. (ii) Every subalgebra of a central simple division algebra is a division algebra. (Clear by (i) since it is a domain.)
Proposition 2.3.24: If R is a central simple F-algebra then the algebraic closure F of F is a splitting j e l d for R. Proof;. By theorem 1.7.27 R OFF’ is simple and thus split, by proposition 2.3.17. Q.E.D.
(See proposition 6.1.24 below for a related result.)
Corollary 2.3.25: If R is a central simple algebra then [R:F] = n 2 for suitable n, in particular, for n such that R OFF x M,,(F). Remark 2.3.26: Writing a central simple algebra R in the form M,(D) for D a division ring, we have the following information:
(i) D itself is a central simple F-algebra, with [D:F] = ( n / t ) 2 where n2 = [R:F]. (ii) R x M,,(F) BFDby example 1.7.21. (iii) ROP is also a central simple algebra, and R o P ~ M , , ( D o PM,,(F)OFDoP. )x Continuing this notation, we know by propositions 2.3.24 and 2.3.21 that R has a splitting field finite over F, but we shall improve this result in $7.0. We conclude this short discussion with a theorem so important that (according to Zelinsky) the master of central simple algebras, A. A. Albert, called it the most important theorem in the subject.
174
Basic Structure Theory
Theorem 2.3.27: If R is a central simple F-algebra and [ R : F ] = n then R &IF RoP x M,(F). Proof;. M J F ) z End,(R) contains both R and RoP via the right and left regular representations of R, respectively, cf., remark 1.510, thereby yielding a ring homomorphism cp: R BFRoP + M,(F) given by r 0 r' + rr'. But R RoP is simple by theorem 1.7.27 so cp is an injection; counting dimensions shows cp is an isomorphism. Q.E.D.
Zariski Topology (for Finite Dimensional Algebras) Definition 2.3.28: Suppose F is an infinite field, and let V = F("). Given a subset S of the polynomial ring FCA,,. . .,A,] define V ( S ) = {(al,.. .,a,) E V : f(al,. . .,a,) = 0 for all f in S}. Then the {US):S C F[A,, ...,A,]} constitute the closed sets of a topology on V called the Zariski topology. The Zariski topology of a finite dimensional algebra over an infinite field is its Zariski topology as a vector space. Write V(f)for V({f}).
n{
The open sets have the form V - V ( S )= V V(f):f E S } = V f E S}, so the sets V - V(f) form a base of the open sets.
u{ - V(f)):
Remark 2.3.29: V(f) # V for every 0 # f E FCA,, . . . , A , ] , by the fundamental theorem of algebra, cf., Jacobson [85B, theorem 2.193. It follows that any two nonempty open sets intersect nontrivially, seen by taking complements of V(fl) u V(fJ c V(flf2) # V. In particular, every open set is dense. This simple fact has far-reaching consequences. The idea in using the Zariski topology is to show various natural conditions are Zariski open and thus Zariski dense; hence any finite number of these conditions define a Zariski dense set. In this manner one can add on certain conditions at no expense. In what follows, R is a finite dimensional F-algebra, and wefixabaseb,, ..., b,. Definition 2.3.30: Let p,, . . .,p, be commuting indeterminates over R, and define R' = R [ p , , .. .,p,] and F' = F[p,, . ..,p , ] . The element x = bipi in R' is called the generic element of R (with respect to the base b , , . ..,b,). Viewing b,, .. .,b, as a base of R' over F' we can embed R' in M,(F') by mean of the regular representation; the characteristic polynomial of the matrix corresponding to x is called the generic characteristic polynomial px(A).
82.3 Modules with Composition Series and Artinian Rings
175
Remark 2.3.31: Because F’ is a unique factorization domain and p x is monic, the monk irreducible factors of p , in F’[A] are actually irreducible in F(pl, . . . , p , ) [A], so in particular the minimal polynomial m, of x over F ( p l , . . ., p , ) has coefficients in F’. This is called the generic reduced characteristic polynomial.
c
Definition 2.3.32: Suppose r = aibi E R, and m, = cf=oh(pl,. . . ,p,)ili where fi E F’ (so fd = 1). The reduced characteristic polynomial m, of r is Cf=,l;.(al,. . .,a,)Af. The reduced norm of r is ( - l)dfo(al,.. .,a,) and the reduced trace of r is -fl(al,. . .,a,). Remark 2.3.33’: These definitions are independent of the choice of base. (Indeed a change of base corresponds to conjugation of matrices.) Remark 2.3.34: (i) Suppose K is a field extension of F. The reduced norm (resp. trace) of r in R is the same as the reduced norm (resp. trace) of r Q 1 in R QFK, where we use the base bl Q 1,. . . ,b, 0 1. (ii) If R = M J F ) the generic reduced characteristic polynomial is easily seen to be the characteristic polynomial of x. Thus, in this case the reduced trace is the trace, and the reduced norm is the determinant, and these are independent of the choice of base.
Proposition 2.3.35: In the above notation every r in R has degree I d over F, and { r E R: the minimal polynomial of r has degree d } is a nonempty Zariski-dense open subset of R. Proofi As above let x be the generic element with respect to the base b , , ...,b,. Since x has degree d we have 1, x,. . . ,x d - l linearly independent so writing x k = hjkbkfor hjkin F’, we see the t x d matrix (hj,)has a nonzero d x d minor q in F’. Letting q1 = q, q z , . . . ,q,, denote the d x d minors in (hi,) we see that a suitable specialization of the pi H ai in F will give q(al,. . . ,a,) # 0 and thus the matrix (hjk(a1,..., a,)) has a nonzero d x d minor; letting r= a,b E R, we conclude that 1, r,. ..,r d P 1are linearly independent, so r has degree d. An arbitrary element r = aibi will have degree d iff 1, r, . . .,r d - l are independent, iff one of the minors ql(al,.. .,a,), . . .,qu(al,. . .,atj) is nonzero, i.e., iff (al,. ..,a,) belongs to the union of the Zariski open sets V - V(ql), Q.E.D. ..., V - V(q,,)where V - R.
1
Basic Structure Theory
176
Proposition 2.3.36: An element r of R is invertible iff its reduced norm is nonzero. In particular {invertible elements of R } is Zariski open. Proofi Let p,(A) and m,(A) be the generic characteristic and generic reduced characteristic polynomials. Then m, divides p x , so specializing x H r we see rn,(A) divides p,(A). Let qr(A)be the minimal polynomial of r. Then q, I m,. But p , is the characteristic polynomial of the matrix corresponding to r under the regular representation, so q, and pr have the same irreducible factors; consequently, m, and p , have the same irreducible factors. Now r is invertible iff A{m,(A), iff Atp,(A), iff the reduced norm of r is Q.E.D. nonzero.
52.4 Completely Reducible Modules and the Socle In 52.1 we introduced the socle of a ring in order to study primitive rings. The careful reader will have noticed that a much more general definition was given in exercise 0.0.12, and we shall now examine (from scratch) how this definition applies to modules, leading to several important characterizations of semisimple Artinian rings. Definition 2.4.1: The socle of an R-module M, written soc(M), is the sum of the simple submodules of M (so soc(M) = 0 if M has no simple submodules). M is completely reducible (also called semisimple) if soc(M) = M.
In examining soc(M) we are led to the complement of a submodule N in M, which we recall is N' < M such that M = N 0 N' (where 0 denotes the internal direct sum throughout this section). Of course, the complement need not be unique, as evidenced by the example M = R'') and N = {(a,0):a E W}. We say M is complemented if every nonzero submodule has a complement. Modules are not necessarily complemented, so we introduce a related concept. Definition 2.4.2: A submodule L of M is large (also called essential) if L n N # 0 for all 0 # N < M. An essential complement of N I M is some N' I M such that N n N ' = 0 and N N' is large.
+
Thus every complement is an essential complement. Essential complements are very important in module theory because they exist, as we shall see now.
82.4 Completely Reducible Modules and the Socle
177
Lemma 2.4.3: Suppose A , B, C s M. (i) I f ( A + B ) n C # Oand A n C = 0 then B n ( A + C ) # 0. (ii) If A I C I A + B then C = A + ( B n C).
Pro08 Each result follows instantly from the observation if 0 # c = a then b = c - a E A + C. Q.E.D.
+b
Proposition 2.4.4: Every submodule of M has an essential complement. In fact, if N , Q IM with N n Q = 0 then N has an essential complement containing Q.
Proof: We prove the second assertion, since the first then follows for Q = 0. By Zorn’s lemma there is N‘ I M containing Q, maximal with respect to N n N ’ = O . We claim N + N’ is large. We must show for O # P c M that P n ( N + N’) # 0. This is obvious unless P $ N’ in which case N ’ + P > N ’ and so ( N ’ + P ) n N # O . Hence P n ( N ’ + N ) # O by lemma 2.4.3(i). Q.E.D. Proposition 2.4.5: If A 5 N I M and B is a complement (resp. essential complement) of A in M then B n N is a complement (resp.essential complement) of A in N.
Proof: The assertion about complements is a special case of lemma 2.4.3(ii) taking N = C and M = A B. To prove the assertion for essential complements suppose 0 # P I N ; then P I M so 0 # ( A + B)n P. Taking 0 # p = a + b we have b = p - a E N so P E A + (Bn N ) . Q.E.D.
+
When verifying a submodule N of M is large it is enough to show N n Rx # 0 for every 0 # x E M , since every nonzero module contains a nonzero cyclic submodule. This trivial observation will be used frequently, especially when we study large submodules in earnest in fi3.3, but let us make several easy observations. Proposition 2.4.5’: (i) Suppose N IN ’ I M . N is large in M iff N is large in N‘ and N’ is large in M . (ii) If M = M , + M 2 and Ni are large submodules of M ithen N 1 + N 2 is large in M.
Basic Structure Theory
178
Proofi (i) Immediate from the definition. (ii) First consider the case N, n N2 = 0. If x = x, + x2 where x i E Mi we need r in R such that 0 # rx E N , + N,. This is trivial unless x1 # 0, in which case 0 # rlxl E N , for some r , in R. We are done unless r i x 2 # 0, in which case 0 # r2rlx2 E N2for some r , , and then we take r = r2r1. In general let M; be an essential complement of M, n M, in M,. Then M, M; is large in M, + M, by our special case; likewise N, + (N, n M;) is large in M, M; and so is large in M, + M, by (i). A fortiori N, + N , is large in M, + M , = M. Q.E.D.
+
+
Armed with these basic tools we shall now find the link between completely reducible modules and semisimple Artinian rings. Although the next two results have purely lattice-theoretic proofs (given in exercises 0.0.11 and 0.0.12),we shall present full module-theoretic proofs. Proposition 2.4.6: If M is complemented then M is completely reducible. Let M' be a complement of soc(M) in M. We shall show M' = 0 (so that soc(M) = M). Indeed, if there is 0 # x E M' we can take N I M' maximal with respect to x # N (by Zorn's lemma), and N has a complement N' in M' by proposition 2.4.5. We claim N' is simple, contrary to M' n soc M = 0. To prove the claim, suppose to the contrary that 0 < A c N'. Then A has a complement A' in N', and by choice of N we have x = y, + a = y, + a' for suitable yi in N, a in A, and a' in A'. Then y, - y, = a' - a E N n N' = 0, so a' = a E A n A' = 0 and thus x = y , E N, a contradiction. Thus the claim is proven, and we must conclude M' = 0 as desired. Q.E.D. Proofi
Theorem 2.4.7: Soc(M) =
{ large submodules of M}.
Proof: If 0 # S I M is simple and L I M is large then 0 # S n L E S implying S n L = S and so S E L. Hence soc(M) E L. Letting P = (-){large submodules of M }we thus have soc(M) E P. To prove the opposite inclusion we shall show P is complemented (and then we are done by proposition 2.4.6) Indeed if N I P then N has an essential complement N'; thus N N' is large, implying N I P I N N '. By lemma 2.4.3(ii) we see P = N @ (N' n P), so N has a complement in P, as desired. Q.E.D.
+
Theorem 2.4.8:
+
Thefollowing assertions are equivalent for M in R-.,4tud:
42.5 The Jacobson Radical
179
(i) M is completely reducible. (ii) M has no large proper submodules. (iii) M is complemented. (i) +(ii). M = soc(M) = (-){large submodules of M}, so M is its only large submodule. (ii) (iii) Every submodule has an essential complement, which is thus a complement. (iii) + (i) By proposition 2.4.6. Q.E.D. fro&
Since R is semisimple Artinian iff R is completely reducible in R - d o d , we have a new characterization of semisimple Artinian rings, with which we conclude this discussion.
Theorem 2.4.9
The following assertions are equivalent for a ring R :
(i) R is semisimple Artinian. (ii) R is completely reducible in R - A u d . (iii) Every R-module is completely reducible. (iv) Every R-module is complemented. (v) The only large left ideal of R is R itseg We already have (i) o (ii) and (iii) o (iv), and (iii) + (ii) is a fortiori. It remains to prove (ii) =. (iii). Write R = L, where Liare minimal left ideals, and suppose M E R - A d . For any x in M we have Rx = L i x . If Lix # 0 then a -+ a x gives an epic from Lito Lix, implying Lix is a simple module; hence x E soc(M) for each x in M, proving M is completely reducible. (ii) o (v) By theorem 2.4.8. Q.E.D. froofi
1
82.5 The Jacobson Radical We return to the general structure theory of rings. Having the Jacobson density theory at out disposal, it is natural to focus on primitive rings. This leads us to call an ideal P primitive if RIP is a primitive ring. Using subdirect products we can then study semiprimitive rings, i.e., rings R which are subdirect products of primitive rings, i.e., (){primitive ideals} = 0. We shall need an easy criterion for an ideal to be primitive.
P 4R is a primitive ideal iff P is the annihilator of a simple R-module M. (Proof (*) R / P has a faithful simple module M, which is then
Remark 2.5.0:
Basic Structure Theory
180
a simple R-module with annihilator P, by remark 0.0.9; (-=) if P then M is a faithful simple RIP-module.)
= Ann,
M
The subject of this section is the obstruction to a ring being semiprimitive. The Jacobson radical Jac(R) = n{primitive ideals of R f . Clearly R is semiprimitive iff Jac(R) = 0, so we shall try to “remove” the Jacobson radical. Definition 2.5.2:
Proposition 2.5.1 ’: (i) If A a R and A 5 Jac(R) then Jac(R/A) = Jac(R)/A; in particular R/Jac(R) is semiprimitive. (ii) ff Jac(R/A) = 0 then A 2 Jac(R).
Proof: Write- for the image in I? = R / A . (i) If P is a primitive ideal of R then A E Jac(R) E P so primitive, implying P is a primitive ideal of R. Thus
Jac(l?) = =
RIP FZ R / P is
n{ P : P is a primitive ideal of R}
{ primitive ideals of R} = Jac(R)
(ii) If Jac(I?) = 0 then 0 = n { P :P is a primitive ideal containing A } = primitive ideals containing A} 2 Jac(R) implying Jac(R) 5 A. Q.E.D.
n{
Proposition 2.5.2: Jac(R) =
n{maximal leji ideals of R}.
Proofi ( G )By proposition 2.1.9 every maximal left ideal contains a primitive ideal and thus contains Jac(R). ( 2 )If P 4 R is primitive then for same simple M in R - A O J we have P = Ann, M = {Ann x : x E M } 2 {maximal left ideals of R ] since each Ann x is a maximal left ideal. Q.E.D.
n
n
Quasi-Invertibility In order to study Jac(R) as a set, we need a description in terms of elements. To this end let us say a E R is left quasi-invertible if 1 - a is left invertible in R, i.e., if 1 E R(l - a); a is quasi-invertible if 1 - a is invertible (from both sides). A subset of R is quasi-invertible if each element is quasi-invertible. (Compare with definition 1.1.23(i).)
181
$2.5 The Jacobson Radical
Lemma 2.5.3: Any left ideal L of left quasi-invertible elements is quasiinvertible. In fact if a E L and r ( l - a ) = 1 then 1 - r E L . Proofi 1 - r = -ra E L , so r = 1 - (1 - r) has a left inverse b. Hence the right and left inverses of r are equal, i.e., 1 - a = b is invertible. Q.E.D.
Proposition 2.5.4: Jac(R) is a quasi-invertible ideal of R which contains every quasi-invertible left ideal.
For any a E Jac(R) = n(maxima1 left ideals of R ) we cannot have 1 - a in a maximal left ideal, so R( 1 - a ) = R, proving a is left quasi-invertible. Hence Jac(R) is quasi-invertible by Lemma 2.5.3. Now suppose B is a quasi-invertible left ideal. If there were some maximal left ideal L @ B we would have B L = R, so b a = 1 for some b in B, a in L, and then a = 1 - b would be invertible (since b is quasi-invertible), contrary to L # R. Hence B is contained in every maximal left ideal, so B E Jac(R). Q.E.D. Proof:
+
+
In view of this result, Jac(R) is the same as what we would get from the right-handed analogue of definition 2.5.1. Indeed, calling this “right-handed” Jacobson radical J , we see J is quasi-invertible (by the right-handed version of proposition 2.5.4).Thus J CI Jac(R), and symmetrically Jac(R) E J .
Remark 2.5.4‘: Recall a left ideal L of R is nil if every element of L is nilpotent. Remark 1.1.27 applied to proposition 2.5.4 show Jac(R) contains every nil left (or right) ideal. The characterization given in 2.5.4 is also useful because invertibility (and thus quasi-invertibility) passes to homomorphic images and sometimes back again, as we shall see now.
Lemma 2.5.5: If J is a quasi-invertible ideal of R and r is an element of R whose canonical image in RIJ is invertible then r is invertible in R . Proof: Take r f in R such that 1 - r’r E J and 1 - rr’ E J . Then these elements are quasi-invertible, so r’r and rr‘ are invertible in R. It follows at once Q.E.D. that r is left and right invertible, so r is invertible.
Our final basic result concerning the Jacobson radical involves passing to homomorphic images.
Basic Structure Theory
182
Proposition 2.5.6: (i) If cp: R + T is a ring surjection then cp(Jac(R))G Jac(T). (ii) If A 4R then (Jac(R) + A ) E Jac(R/A), equality holding if A G Jac(R).
Proofi Write J = Jac(R).
(i) If a E J then cp(1 - u)-’(l - cpa) = 1, implying cpa is left quasi-invertible; thus cpJ c Jac(T). (ii) The first assertion follows from (i); the second assertion is proposition 2.5.1’. Q.E.D.
Examples To give the reader the flavor of the Jacobson radical, we present some results concerning large classes of examples. Suppose 0 v {invertibleelements of R} is a division ring D.
Proposition 2.5.7: Then Jac(R) = 0.
Proofi Let J = Jac(R). Then J n D Q D implying J n D = 0. But if a E J then 1 - a is invertible so 1 - a E D and a E D n J = 0. Q.E.D. Corollary 2.5.8: Suppose A is a ring with a filtration by N such that A(0) is a division ring. Then Jac(R) = 0.
In particular, every skew polynomial ring over a division ring is semiprimitive. Let us now consider the opposite extreme.
Definition 2.5.9:
A ring R is local if { noninvertible elements of R} Q R.
(Some authors call these rings “quasi-local,” reserving the use of “local” for when the ring is Noetherian.) Proposition 2.5.10:
The following statements are equivalent:
(i) R is local. (ii) {noninvertibleelements of R} is a maximal left ideal of R. (iii) R has a unique maximal left ideal. (iv) Jac(R) is a maximal left ideal (and thus the unique maximal left ideal). (v) R/Jac(R) is a division ring.
$2.5 The Jacobson Radical
183
froofi Let J = {noninvertible elements of R}. If r 4 J then Rr = R, so r cannot be contained in any proper left ideal of R.
-
(i) (ii) (iii) is immediate from the above observation. (iii) =. (i) Let J' be the unique maximal left ideal of R. Obviously J' c J. But if r E J then Rr is a proper left ideal and thus contained in a maximal left ideal, which is J', proving J G J'. (iii) o (iv) by proposition 2.5.2. (iv) o (v) A ring is a division ring iff it has no nonzero left ideals. Q.E.D.
Example 2.5.21: If D is a division ring then the ring of formal power series D [ [ A ] ] is local (since the noninvertible elements are the power series having constant term 0, clearly an ideal). Remark 2.5.22: The easiest condition to verify that R is local is the following: If a + b = 1 then a or b is invertible. (For suppose R is not local. Then {noninvertible elements) is not closed under addition, so there are noninvertible elements x and y with u = x + y invertible. Hence xu-' + yu-' = 1, violating the condition.)
Idernpotents and the Jacobson Radical The Jacobson radical is particularly apt for dealing with idempotent-lifting since we now see that condition (i) of definition 1.1.23 is that every idempotent-lifting ideal is contained in the Jacobson radical. This connection will be examined closely in $2.7; here we collect a few basic facts. Remark 2.5.23: Jac(R) contains no nontrivial idempotent e # 0 by remark 1.1.24. It follows that a local ringR has no nontrivial idempotents. Proposition 2.5.14:
If e E R is idernpotent then Jac(eRe) = eJac(R)e.
froof: Write J = Jac(R). ( 2 ) If x E eJe and 1 =y( 1 -x) then e =ey(l -x)e= eye - eyxe = eye(e - x) since xe = x = ex, proving eye is the left quasiinverse of x in eRe, so eJe is left quasi-invertible in eRe. (E) Proposition 1.1.15 implies Jac(eRe)eM = 0 for all simple M in RQ.E.D. Aod, so Jac(eRe) = Jac(eRe)e E J. Corollary 2.5.15:
Jac(M,(R)) = M,(Jac(R)).
Basic Structure Theory
184
Proof: This follows from corollary 1.1.18, but we now have a more elementary proof. Jac(M,,(R)) = M,,(J) for some J 4 R; identifying R with Q.E.D. eM,(R)e for e = el yields J = eJac(M,(R))e = Jac(R). This result leads us to the question of Jac(M,(R)), cf., exercise 1.1.5. The solution is given in exercises 2.8.29ff.
Weak Nullstellensatz and the Jacobson Radical One of the traditional aims of ring theory is to extract the essence of some well-known theorem and then find a straightforward generalization to noncommutative rings. One favorite such theorem has been Hilbert’s renowned Nullstellensatz, which is the statement, “Suppose F is an algebraically closed field, and consider polynomials f,f l , .. .,f, in the commutative polynomial ring R = F [ l l , . ..,An]. If f vanishes at all the common zeroes of f i , . ..,f,,then f” E Rfi for some m.”
In other words, for A =
RJ the conclusion of the Nullstellensatz is that
f + A is nilpotent in RIA. As in Kaplansky [70B, theorem 331, the hypotheses show f is in every maximal ideal of R containing A, so f + A E Jac(R/A).
Thus the key structural fact needed to complete the proof is that Jac(R/A) is nil. In other words, we want to show the Jacobson radical of every homomorphic image of R is nil. In general, one might say any ringR having this property satisfies the “weak Nullstellensatz.” Our next results give broad instances of when the Jacobson radical is nil, thereby providing the “weak Nullstellensatz” for left Artinian rings and for arbitrary algebras over suitably large fields. We shall return to the Nullstellensatz at definition 2.12.26ff. In case R is left Artinian the radical predates Jacobson, and we have the following result. Theorem 2.5.16:
Jac(R) is nilpotent for any left Artinian ring R.
Proofi Let J = Jac(R). Then J 2 J 2 2 J 3 2 ... so J‘ = J‘” for some t. Let N = J’;then N = N 2 . We claim N = 0. Otherwise N contains a nonzero left ideal L minimal with respect to L = N L . Then 0 # N u E L for some a in L , and N u = N 2 a = N ( N a ) implies L = N u (by assumption on L). Hence a = ra for some r in N. But then ( 1 - r)a = 0, contrary to r quasi-invertible. Thus 0 = N = J’ as claimed. Q.E.D.
Note that Jac(T) n R need not be quasi-invertible when R is a subring of
$2.5 The Jacobson Radical
185
T ; for example let T be a localization of Z,and R = Z. Nevertheless, there is a useful generalization of theorem 2.5.16:
Proposition 2.5.17: Suppose R is a subring of T. (i) If every element of R which is invertible in T is already invertible in R, then R n Jac(T) E Jac(R). (ii) If R is leji Artinian then R n Jac(T) G Jac(R) is nilpotent. Proofi (i) If r E R n Jac(T) then (1 - r)-l E T so (1 - I)-' E R, proving R n Jac(T )is quasi-invertible in R. (ii) If r E R is invertible in T then Ann, r = 0, implying r is invertible in R (by proposition 2.3.15). Now (i) implies R n Jac(T) c Jac(R) which is nilpotent by the theorem. Q.E.D.
Corollary 2.5.18: Suppose R is an algebra over a field F. Then every r in Jac(R) is nilpotent or transcendental. Proofi If r is not transcendental then F [ r ] is Artinian and r E F [ r ] nJac(R), a nil ideal by proposition 2.5.17(ii). Q.E.D.
Corollary 2.5.19: If R is an algebraic algebra over a jield then Jac(R) is nil.
Our further study of the radical of an algebra R over a field F requires the notion of the resolvent set of r in R, defined as { a E F:(r - a ) is invertible} (identifying F with a subfield of R). Write a(r) for the complement (in F ) of the resolvent set. Lemma 2.5.20: If r E R is algebraic (over a field F ) with minimal polynomial p then a(r) = { a E F:p(a) = O}. Proofi F[r] ss F [ A ] / ( p ) for some polynomial p = p ( l ) . We note a cyclical set of implications which implies all assertions are equivalent for arbitrary q(1) in F [ 1 ] : q(r) is invertible in R =. q(r) is not a zero divisor in F [ r ] =.p(1), q(1) are relatively prime => 1 = g(A)p(A) + h ( l ) q ( l )for suitable g ( l ) , h ( l ) in F [ l ] * 1 = h(r)q(r)+ q(r) is invertible in F [ r ] . Now taking q(A) = 1- a (which is irreducible) we see q(r) E a(r) iff 1 - a and p are not relatively prime, iff (1- a) I p , iff p(a) = 0. Q.E.D.
Basic Structure Theory
186
Proposition 2.5.21: Suppose [F[r]:F ] 2 t. Then for any distinct a’,. ..,a, in the resolvent set of r we haue {(r - al)-’, .. .,(r - a,)-’} is F-independent.
Proofi
Suppose
If= P,(r - a,)- ’ = 0 for Piin F. Defining qi = n ( 2 - aj) j t i
and multiplying through by f l i = l ( r- a j ) yields &(r) = 0. On the other hand, deg(xfliqi)I t - 1, so, by hypothesis, xfliqi= 0. Thus for each u we get o = Cpiqi(a,,)= fiuq,(au)= B,,flj+,,(a,, - aJ, implying each B,, = 0 Q.E.D. for 1 I u I t.
Theorem 2.5.22: Suppose F is a field, R cardinal numbers). Then Jac(R) is nil.
E F-dt’,
and IF1 - 1 > [R:F] (as
Proofi If r E Jac(R) then ( 1 - ar)-’ exists for all a in F, implying r - a = -a(l - a-lr) is invertible for all 0 # a E F. If r were not algebraic then every finite subset of S = {(r - a)-1:a E F} would be F-independent by proposition 2.5.21, implying S is F-independent, contrary to hypothesis. Hence r is Q.E.D. algebraic and thus nilpotent by Corollary 2.5.18. Remark 2.5.22: It is very easy to construct a commutative algebra R of countable dimension over an arbitrary field F such that Jac(R) is not nilpotent; let C = F[Al,A2,.. .] and consider C/A where A = CA:.
xnsN
The Structure Theoretical Approach to Rings Let us outline a sequence of steps which one often follows in proving a theorem about a class of rings. The philosophy is to prove the theorem for a ring R in increasing generality, as in the following cases:
1. R is a division ring. 2. R is simple Artinian (matrices over a division ring). 3. R is primitive (use the density theorem to reduce to 2). 4. R is semiprimitive (reduce to 3 using subdirect products). 5. R has no nil ideals # 0. 6. R is semiprime. 7. General case. We shall encounter several instances of this method. Perhaps the most straightforward is the class of “commutativity theorems,” which enable one to conclude that rings are commutative under rather weak hypotheses.
$2.5 The Jacobson Radical
187
Although the list of people working in this area in the 1950s and 1960s reads like a "Who's Who in Algebra," interest has waned considerably since 1970, and, aside from a few technical questions, this area is largely of historical interest. Nevertheless, it is instructive in the use of structure theory and is included in a series of exercises. One of the most successful applications of the structure theory has been in the theory of polynomial identity rings, to be described in Chapter 6. When performing the reductions listed above, one can proceed immediately from 4 to 5 (or 6) when the Jacobson radical is nil (or nilpotent); several instances of this were just seen. Even when the Jacobson radical is not nil, there is a method of passing from 4 to 5, due to the following important theorem of Amitsur:
Theorem 2.5.23 (Amitsur): If R has no nonzero nil ideals then R[1] is semi primitive. Often we can transfer the conclusion of an assertion from R[A] to R, and in this way pass from 4 to 5. We now give a short direct proof of Amitsur's theorem; a second proof is given below in the context of graded rings.
ProoJ- Otherwise, let J = {nonzero elements of Jac(R[1]) having smallest degree}, and Jo = {leading coefficients of the element of J}. Clearly Jo u {0} is an ideal of R, which we claim is nil. Indeed suppose p E J. Then llp E Jac(R[A]), so there exists q in R[ll] such that (1 - 1p)q = 1. Then q = llpq + 1, which is the case m = 1 of the formula
which we verify now by induction on m. Indeed, assume (1) holds for m - 1. Then
= llmpmq
+
m-1
#?pi, i=O
as desired. Write p = C : = o r i l i . If x , r k x 2 = 0 for suitable x i in R then d e g ( x , p x , ) < k ; so, by definition of J , we have x , p x , = 0. We shall use this observation repeatedly. For example, write q = c : = o r i l l i for suitable ri in R and take m > t ; matching leading coefficients in (1) yields O = r r r : = r r - ' r k r i , so r,"-'pr;=O.
Basic Structure Theory
188
Hence r?-’rir; = 0 for all i, so r?-’prir; = 0, implying rF-’p2r; = 0. Continuing this argument shows pmr;= 0, SO 0 = Impmr:Atand (1) becomes m- 1
C (2 + i1 2pi. i=O =O
f-1
q = Impm
As above, we now obtain pmr;- = 0; continuing in this way, finally yields 0 = rrrb = r? (since q = llpq + 1 implies r6 = 1). Thus we proved the leading coefficient of each element of Jo is nil, as desired. But now Jo u (0) s Q.E.D. Nil(R) = 0, proving J is empty, i.e., Jac(R[I]) = 0.
“Nakayama ’s Lemma” One of the basic tools in studying a non-semiprimitive ringR is the result Jac(R)M # M for every f.g. R-module M # 0. This is known as “Nakayama’s lemma,” although it is generally agreed that a better attribution would be Azumaya-Krull-Jacobson. Actually any of the following assertions shall be called “Nakayama’s lemma” in the sequel. Proposition 2.5.24: “Nakayama’s lemma.” Suppose 0 # M J = Jac(R).
E R-Fiwod
and
(i) M # J M . (ii) If N IM and M = N + J M then N = M. (iii) lf M J J M is spanned by x1 + J M , . ..,xk + J M then x l , . . .,xk span M. Proofi
c:=l
(i) Write M = Rxi with t minimal possible. If M = J M then x, = x a i x i for ai in J, so (1 - a,)x, = aixi; but 1 - a, is invertible so x, E Rxi, contradiction. (ii) M J N = J ( M / N )so M / N = 0 by (i), implying N = M. Q.E.D. (iii) Let N = 1:=1 Rxi. Then M = N + J M so N = M by (ii).
1:::
c:;:
There are several improvements of this result. First we record one due to Schelter, also, cf., exercise 12.
Proposition 2.5.25: r f M E R-Fimud and N < M then there is some primitive P Q R with N + P M # M. Proofi By proposition 0.2.15 there is some maximal submodule M‘ containing N. Then M J M ’ is simple so P = Ann, M J M ‘ is a primitive ideal Q.E.D. with PM c M‘; hence N + PM E M‘ # M.
$2.5 The Jacobson Radical
189
The Radical of a Module Definition 2.5.26: If M E R - A o d define Rad(M) = n{maximal submodules of M}, where we say Rad(M) = M if M has no maximal (proper) submodules.
Viewing R in R-.Mod we have Rad(R) = Jac(R) by proposition 2.5.2. Thus the radical of a module generalizes the Jacobson radical and is of considerable use in the technical study of f.g. modules, partly because of the following results. (However, our uses of Rad(M) will be confined to the exercises, cf., exercises 2.8.8ff.) Remark 2.5.27: Jac(R)M E Rad(M). (Indeed, if N is a maximal submodule then Jac(R) c Ann(M/N) so Jac(R)M E N, implying Jac(R)M c {maximal submodules}).
n
This improves Nakayama’s lemma because proposition 0.2.15 shows Rad(M) < M for every f.g. module M.
F Supplement: Finer Results Concerning the Jacobson Radical In this supplement we collect a wide range of lovely theorems about Jac(R), including Wedderburn’s principal theorem and several theorems of Amitsur. We start by comparing Jac(R) with Jac(T) when R is a subring of T. Our object is to compare Jacobson radicals of tensor extensions, but many results can be framed in the following general context. Definition 2.5.28: Suppose T E R - A d - R . An element x of T is R-normalizing if xR = Rx. (This parallels the group-theoretic notion of the normalizer of a subgroup.) T is R-normalizing if T is spanned (as R-module) by a set of normalizing elements; if this set is finite and R c T are rings we say T is a Jinite normalizing extension of R. (See exercises 13ff and 2.12.1Off.)
The obvious example of a normalizing extension is a centralizing extension; also the skew polynomial ring R[A;cr] is R-normalizing iff cr is onto. The next result is basic in studying normalizing extensions. Proposition 2.5.29: Suppose T is a Jinite normalizing extension of R spanned by R-normalizing elements a , . . a,,. If M E T-Mod is simple then M is a direct product of I n simple modules in R-Aod. ¶.
Basic Structure Theory
190
,
Raix so M is an f.g. Proof: For any x # 0 in M we have M = Tx = R-module and thus has a maximal R-submodule by proposition 0.