Ring (mathematics)

Algebra ->  Algebra  -> College  -> Abstract -> Ring (mathematics)     (Log On)


Ring (mathematics)

Jump to: navigation, search
An image illustrating geometric addition on a cubic curve in projective space. Ring theory has many important applications in algebraic geometry.

In mathematics, more specifically in modern algebra, a ring is a set equipped with two binary operations – often referred to as addition and multiplication. Despite their name, these two operations are not the same as the natural operations of addition and multiplication defined on the integers; rather, they are a generalization of these familiar operations. In particular, the operations of addition and multiplication defined on a ring, satisfy certain conditions, known as axioms, that make the ring structurally similar to the integers. However, these conditions do not restrict the ring too much, in that a broad variety of mathematical objects are taken into account. These two ideas, when put together, give rise to the ring axioms which are discussed later in the article (see below).

Ring theory is the branch of mathematics which studies rings. Rings, being structurally similar to the integers in many ways, have algebraic properties similar to the integers. For example, a ring theoretic analogue of the fundamental theorem of arithmetic exists, as well as a generalization of the Euclidean algorithm and Bézout's identity. However, this is not to say that these results hold in the context of all rings. As the ring axioms are very general, often it is found that structurally, rings are no more similar to the integers further than the ring axioms. That is, apart from the ring axioms that are shared by both the ring, and the set of integers, there are not many other properties that both structures satisfy. It is therefore necessary to impose additional conditions on the structure of rings, that allow results such as the fundamental theorem of arithmetic to hold true. In general, many properties of the integers, relevant to only the operations of addition and multiplication, can be generalized to the context of rings (notice that subtraction and division are inverses of the operations of addition and multiplication respectively, and therefore can also be defined in the context of rings (under certain conditions)). However, ring theory studies rings in their full generality, and often the ring axioms are all that is necessary to develop a rich theory.

Although ring theory deals with only a single mathematical structure (rings), and therefore deals with only one structural aspect of the integers, it has far-reaching applications in mathematics. For example, algebraic geometry, the combination of ring theory with the language and problems of geometry, may be used to give a proof of Fermat's last theorem - a famous but now solved problem in mathematics. In a similar manner, many number theoretic facts may be proved using techniques of ring theory; sometimes there being no proof (mathematics) of a number theoretic fact without the use of ring theory. This is not to say, however, that ring theory only has applications in number theory. For example, ring theory has many important applications in general topology, and in particular, algebraic topology, where rings can serve as certain invariants of topological spaces - or, in more formal language, there exist certain functors between the category of topological spaces and the category of rings. One example being the cohomology ring, associated to any topological space. As another example of the applications of ring theory to mathematics, to any group is associated its Burnside ring which uses a ring to describe the various ways a group may act on a finite set. These examples provide only a taste of the applications of ring theory in mathematics - there are many other such applications to be discussed later in this article (see below).

Although ring theory is very much central and basic to much of mathematics, it is still a major area of research. A huge area of current reasearch in ring theory, lies within algebraic geometry and algebraic number theory. Ring theory alone, is also a major area of research - the main aspect of research being the distinction between commutative rings, and non-commmutative rings. Commutative rings are fairly well understood compared to non-commutative rings, due to the fact that a much smaller class of rings are to be considered. On the other hand, many results in non-commutative ring theory may be easily transferred to commutative ring theory, while retaining the same set of hypothesis. Despite these facts, there are many important open problems in both commutative and non-commutative ring theory.

Contents

[ Definition and illustration

[ First example: the integers

The most familiar example of a ring is the set of all integers, Z, consisting of the numbers

..., −4, −3, −2, −1, 0, 1, 2, 3, 4, ... [1]

together with the usual operations of addition and multiplication. These operations satisfy the following properties:

  • The integers form an abelian group under addition; that is:
    • Closure axiom for addition: Given two integers a and b, their sum, a + b is also an integer.
    • Existence of additive identity: For any integer a, a + 0 = 0 + a = a. Zero is called the identity element of the integers because adding 0 to any integer (in any order) returns the same integer.
    • Commutativity of addition: For any two integers a and b, a + b = b + a. So the order in which you add two integers is irrelevant.
    • Associativity of addition: For any integers, a, b and c, (a + b) + c = a + (b + c). So, adding b to a, and then adding c to this result, is the same as adding c to b, and then adding this result to a.
    • Existence of additive inverse: For any integer a, there exists an integer denoted by −a such that a + (−a) = (−a) + a = 0. The element, −a, is called the additive inverse of a because adding a to −a (in any order) returns the identity.
  • The integers form a multiplicative monoid (a monoid under multiplication); that is:
    • Closure axiom for multiplication: Given two integers a and b, their product, a · b is also an integer.
    • Associativity of multiplication: Given any integers, a, b and c, (a · b) · c = a · (b · c). So multiplying b with a, and then multiplying c to this result, is the same as multiplying c with b, and then multiplying a to this result.
    • Existence of multiplicative identity: For any integer a, a · 1 = 1 · a = a. So multiplying any integer with 1 (in any order) gives back that integer. One is therefore called the multiplicative identity.
  • Multiplication is distributive over addition : These two structures on the integers (addition and multiplication) are compatible in the sense that
    • a · (b + c) = (a · b) + (a · c), and
    • (a + b) · c = (a · c) + (b · c)
for any three integers a, b and c.

[ Formal definition

A ring is a set R equipped with two binary operations + : R × RR and · : R × RR (where × denotes the Cartesian product), called addition and multiplication. To qualify as a ring, the set and two operations, (R, +, · ), must satisfy the following requirements known as the ring axioms. [2]

1. Closure under addition. For all a, b in R, the result of the operation a + b is also in R.c[›]
2. Associativity of addition. For all a, b and c in R, the equation (a + b) + c = a + (b + c) holds.
3. Existence of additive identity. There exists an element 0 in R, such that for all elements a in R, the equation 0 + a = a + 0 = a holds.
4. Existence of additive inverse. For each a in R, there exists an element b in R such that a + b = b + a = 0
5. Commutativity of addition. For all a, b in R, the equation a + b = b + a holds.
  • (R, +, · ) is required to be a monoid under multiplication:
1. Closure under multiplication. For all a, b in R, the result of the operation a · b is also in R.c[›]
2. Associativity of multiplication. For all a, b, and c in R, the equation (a · b) · c = a · (b · c) holds.
3. Existence of multiplicative identity. There exists an element 1 in R, such that for all elements a in R, the equation 1 · a = a · 1 = a holds.
  • The distributive laws:
1. For all a, b and c in R, the equation a · (b + c) = (a · b) + (a · c) holds.
2. For all a, b and c in R, the equation (a + b) · c = (a · c) + (b · c) holds.

[ Notes on the definition

As with some axiomatic theories, there are often disputes as to what axioms a ring should satisfy. Sometimes the disagreement between two definitions is minor. For instance, some authors insist that 1 ≠ 0 in a ring (in words, this means that the multiplicative identity of the ring must be different from its additive identity). In particular they don't consider the trivial ring to be a ring (see below).

A more significant disagreement is that some authors omit the existence of a multiplicative identity in a ring[3][4] [5] . For instance, this would allow the even integers to form a ring with the natural operations of addition and multiplication (all ring axioms are satisfied except for the existence of a multiplicative identity). Rings that satisfy the ring axioms as given above but do not contain a multiplicative identity are sometimes called pseudo-rings. The term rng (jocular; ring without the multiplicative identity) is also used for such rings. Rings which do have multiplicative identities (and also satisfy the above axioms) are sometimes referred to unital rings, unitary rings, rings with unity, rings with identity or rings with 1.[6] Note that one can always embed a non-unitary ring inside a unitary ring (see this for one particular construction of this embedding).

There are still other more significant differences between two particular definitions of a ring. For instance, some authors omit associativity of multiplication in the set of ring axioms; rings that are nonassociative are called nonassociative rings. In this article, all rings are assumed to satisfy the axioms as given above unless stated otherwise.

[ Second example: the ring Z4

Consider the set Z4 consisting of the numbers 0, 1, 2, 3 where addition and multiplication are defined as follows (note that for any integer, x, x mod 4 is defined to be the remainder when x is divided by 4):

  • For any x, y in Z4, x + y is defined to be their sum in Z (the set of all integers) mod 4. So we can represent the additive structure of Z4 by the left-most table as shown.
  • For any x, y in Z4, xy is defined to be their product in Z (the set of all integers) mod 4. So we can represent the multiplicative structure of Z4 by the right-most table as shown.
· 0 1 2 3
0 0 0 0 0
1 0 1 2 3
2 0 2 0 2
3 0 3 2 1
+ 0 1 2 3
0 0 1 2 3
1 1 2 3 0
2 2 3 0 1
3 3 0 1 2

It is simple (but tedious) to verify that Z4 is a ring under these operations. First of all, one can use the left-most table to show that Z4 is closed under addition (any result is either 0, 1, 2 or 3). Associativity of addition in Z4 follows from associativity of addition in the set of all integers. The additive identity is 0 as can be verified by looking at the left-most table. Given an integer x, there is always an inverse of x; this inverse is given by 4 - x as one can verify from the additive table. Therefore, Z4 is an abelian group under addition.

Similarly, Z4 is closed under multiplication as the right-most table shows (any result above is either 0, 1, 2 or 3). Associativity of multiplication in Z4 follows from associativity of multiplication in the set of all integers. The multiplicative identity is 1 as can be verified by looking at the right-most table. Therefore, Z4 is a monoid under multiplication.

Distributivity of the two operations over each other follow from distributivity of addition over multiplication (and vice-versa) in Z (the set of all integers).

Therefore, this set does indeed form a ring under the given operations of addition and multiplication.

Properties of this ring

  • In general, given any two integers, x and y, if xy = 0, then either x is 0 or y is 0. It is interesting to note that this does not hold for the ring (Z4, +, ⋅):
2 ⋅ 2 = 0
although neither factor is 0. In general, a non-zero element a of a ring, (R, +, ⋅) is said to be a zero divisor in (R, +, ⋅), if there exists a non-zero element b of R such that ab = 0. So in this ring, the only zero divisor is 2 (note that 0 ⋅ a = 0 for any a in a ring (R, +, ⋅) so 0 is not considered to be a zero divisor).
  • A commutative ring which has no zero divisors is called an integral domain (see below). So Z, the ring of all integers (see above), is an integral domain (and therefore a ring), although Z4 (the above example) does not form an integral domain (but is still a ring). So in general, every integral domain is a ring but not every ring is an integral domain.

[ Third example: the trivial ring

If we define on the singleton set {0}:

0 + 0 = 0

0 × 0 = 0

then one can verify that ({0}, +, ×) forms a ring known as the trivial ring. Since there can be only one result for any product or sum (0), this ring is both closed and associative for addition and multiplication, and furthermore satisfies the distributive law. The additive and multiplicative identities are both equal to 0. Similarly, the additive inverse of 0 is 0. The trivial ring is also a (rather trivial) example of a zero ring (see below).

[ History

A portrait of Richard Dedekind: the founder of ring theory.

The study of rings originated from the theory of polynomial rings and the theory of algebraic integers. Furthermore, the appearance of hypercomplex numbers in the mid-nineteenth century undercut the pre-eminence of fields in mathematical analysis.

Richard Dedekind (image to the right) introduced the concept of a ring. [7]

The term ring (Zahlring) was coined by David Hilbert in the article Die Theorie der algebraischen Zahlkörper, Jahresbericht der Deutschen Mathematiker Vereinigung, Vol. 4, 1897. [7]. The motivation for this term is unclear.

The first axiomatic definition of a ring was given by Adolf Fraenkel in an essay in Journal für die reine und angewandte Mathematik (A. L. Crelle), vol. 145, 1914. [7]

In 1921, Emmy Noether gave the first axiomatic foundation of the theory of commutative rings in her monumental paper Ideal Theory in Rings.[7]

[ Simple consequences of the ring axioms

Basic facts about rings that can be deduced from the ring axioms are commonly subsumed under elementary ring theory. For example, one can deduce uniqueness of the additive identity in a ring, and uniqueness of the additive inverse of a particular element in a ring using group theory alone. Similarly, the inverse of a unit in a ring is necessarily unique (provable using group theory). However, some properties that effectively combine the additive and multiplicative structures in a ring cannot be proved by group theoretical means alone. For example, one cannot prove that for every element a in a ring (R, +, ⋅), a ⋅ 0 = 0 ⋅ a = 0, using only one of the structures. One also must take advantage of distributivity of multiplication over addition (see below). This constitutes one explanation as to why ring theory is important in its own right. This also explains why distributivity is such an important axiom in ring theory.

[ Basic properties of rings

From the axioms, one can deduce that if (R, +, ⋅) is a ring, for all a, b in R we have:

Theorem 1: 0 ⋅ a = a ⋅ 0 = 0

Corollary 1: A ring, (R, +, ⋅) is trivial (that is, consists of precisely one element) if and only if 0 = 1.

Theorem 2: (−1)a = −a

Theorem 3: (−a) ⋅ b = a ⋅ (−b) = −(ab)

[ Group properties of rings

  • An integer in a ring is an element n of the ring that can be written either as:
n = 1 + ... + 1 or,
n = −1 − ... − 1
Note that for any element a of a ring (R, +, ⋅), a ⋅ n = n ⋅ a for any integer n. In words, this means that the order in which you multiply an integer with another element in a ring is irrelevant.
  • If a ring is a cyclic group under addition, then it is commutative (see above). More generally, the center of a ring contains the set of all integers of the ring. In particular, no ring can have trivial center unless 1 + 1 = 1, or, equivalently, 1 = 0 and the ring is trivial.

[ Binomial theorem for rings

(x+y)^n=\sum_{k=0}^n{n \choose k}x^ky^{n-k},
holds whenever x and y commute (see this for a proof). The theorem holds for arbitrary x and y in a commutative ring.

[ Basic concepts

[ Zero ring

Let (R, +, · ) be a ring. Then (R, +, · ) is said to be a zero ring if the product of any two elements in R is 0 (the additive identity).

Note

  • If we assume that rings have multiplicative identities, then a ring is zero if and only if it is trivial. Therefore, the concept of a zero ring is only interesting when one deals with rings that are only semigroups under multiplication (that is, do not necessarily have a multiplicative identity).

Example

  • Any abelian group can be turned into a zero ring by letting a · b = 0 for every a, b in the group (and letting + be the group operation of that abelian group).

[ Units

An element a of a ring (R, +, · ) need not necessarily have a multiplicative inverse (for example, in the ring of all integers, 2 has no multiplicative inverse). An element a in a ring is called a unit if it is invertible with respect to multiplication. Formally,

Formal definition

Let (R, +, · ) be a ring. An element a of (R, +, · ) is said to be a unit in (R, +, · ) if there is an element b in the ring such that a · b = b · a = 1.

Notes

  • The set of all units in (R, +, · ) forms a group under ring multiplication; this group is denoted by U(R) or R*.

Examples

  • Every non-zero element in the ring of all real numbers ((R, +, · )) is a unit in this ring. In fact, one can define a field (see below) to be a commutative ring such that every non-zero element is a unit. Therefore, (R, +, · ) forms a field.

[ Opposite ring

  • Let (R, +, · ) be a ring. The opposite ring, (Rop, +, * ) is defined by a * b = b · a. Addition on the opposite ring is defined to be the same as addition on the original ring.

Note

Examples

  • If the opposite ring of a ring (R, +, · ) is commutative, then so is the original ring.
  • Consider the opposite ring of the opposite ring; that is Ropop. Note that, Ropop = R so that the operation on rings, taking any ring to its 'opposite' is involutory.
  • Note that, in particular, the above example shows that one can define a natural functor from the category of rings to itself.
  • If two rings R1 and R2 are isomorphic, then their corresponding opposite rings are also isomorphic.

[ Ring homomorphisms

A homomorphism of rings is a function f: R1R2 between two rings R1 and R2 preserving the ring operations, in the sense that for all a, b in R1 the following identities are required to hold:

  • f(a + b) = f(a) + f(b)
  • f(a · b) = f(a) · f(b)
  • f (1R1) = 1R2

As in any category a map f possessing an inverse g: R2R1, i.e. a map in the opposite direction such that the two compositions fg and gf equal the identity map of R2 and R1, respectively, is called an isomorphism. Equivalently, f is bijective.

For any ring R with unit element, there is a natural map ZR, it maps any positive n to the n-fold sum of the unit element of R, and −n to the additive inverse of n · 1R. The characteristic of R can be expressed in terms of this map.

[ Subrings

Informally, a subring is a ring, (S, +, · ), contained in a bigger one, (R, +, · ).[8] More formally, let (R, +, · ) be a ring. A subset S of R is said to be a subring of R if:

  • For every a, b in S, a + b is in S
  • For every a, b in S, a · b is in S
  • For every a in S, −a (the additive inverse of a in R) is in S
  • The multiplicative identity of R is in S, i.e 1 is in S

If S is a subring of R, then S is a ring in its own right with + and · restricted to the cartesian product S X S.

Examples

  • Suppose f : R_1 \to R_2\, is a ring morphism. Then the image, f (R1) is a subring of R2.
  • If A is a subring of R and B is a subring of R such that B is a subset of A, then B is a subring of A.

[ Ideals

The purpose of an ideal in a ring is to somehow allow one to define the quotient ring of a ring (analogous to the quotient group of a group; see below). An ideal in a ring can therefore be thought of as a generalization of a normal subgroup in a group. More formally, let (R, +, · ) be a ring. A subset I of R is said to be a right ideal in R if:

  • (I, +) is a subgroup of the underlying additive group in (R, +, · ) (i.e (I, +) is a subgroup of (R, +)).
  • For every x in I and r in R, x · r is in I.

A left ideal is similarly defined with the second condition being replaced. More specifically, a subset I of R is a left ideal in R if:

  • (I, +) is a subgroup of the underlying additive group in (R, +, · ) (i.e (I, +) is a subgroup of (R, +)).
  • For every x in I and r in R, r · x is in I.

Notes

  • If k is in R, then k · R is a right ideal in R, and R · k is a left ideal in R. These ideals (for any k in R) are called the principal right and left ideals generated by k.
  • If every ideal in a ring (R, +, · ) is a principal ideal in (R, +, · ), (R, +, · ) is said to be a principal ideal ring.
  • An ideal in a ring, (R, +, · ), is said to be a two-sided ideal if it is both a left ideal and right ideal in (R, +, · ). It is preferred to call a two-sided ideal, simply an ideal.
  • If I = {0} (where 0 is the additive identity of the ring (R, +, · )), then I is an ideal known as the trivial ideal. Similarly, R is also an ideal in (R, +, · ) called the unit ideal.

Examples

  • Any additive subgroup of the integers is an ideal in the integers with its natural ring structure.
  • There are no non-trivial ideals in R (the ring of all real numbers) (i.e, the only ideals in R are {0} and R itself). More generally, a field cannot contain any non-trivial ideals.
  • From the previous example, every field must be a principal ideal ring.
  • A subset, I, of a commutative ring (R, +, · ) is a left ideal if and only if it is a right ideal. So for simplicity's sake, we refer to any ideal in a commutative ring as just an ideal.

[ Quotient ring

Informally, the quotient ring of a ring, is a generalization of the notion of a quotient group of a group. More formally, given a ring (R, +, · ) and a two-sided ideal I of (R, +, · ), the quotient ring (or factor ring) R/I is the set of cosets of I (with respect to thee underlying adSource: this wikipedia article, under GFDL.