- •List of Symbols
- •Classical Algebra
- •Modern Algebra
- •Binary Operations
- •Algebraic Structures
- •Extending Number Systems
- •Algebra of Sets
- •Number of Elements in a Set
- •Boolean Algebras
- •Propositional Logic
- •Switching Circuits
- •Divisors
- •Posets and Lattices
- •Normal Forms and Simplification of Circuits
- •Transistor Gates
- •Representation Theorem
- •Exercises
- •Groups and Symmetries
- •Subgroups
- •Cyclic Groups and Dihedral Groups
- •Morphisms
- •Permutation Groups
- •Even and Odd Permutations
- •Equivalence Relations
- •Normal Subgroups and Quotient Groups
- •Morphism Theorem
- •Direct Products
- •Groups of Low Order
- •Action of a Group on a Set
- •Exercises
- •Translations and the Euclidean Group
- •Matrix Groups
- •Finite Groups in Two Dimensions
- •Proper Rotations of Regular Solids
- •Finite Rotation Groups in Three Dimensions
- •Necklace Problems
- •Coloring Polyhedra
- •Counting Switching Circuits
- •Exercises
- •Monoids and Semigroups
- •Finite-State Machines
- •Quotient Monoids and the Monoid of a Machine
- •Exercises
- •Rings
- •Integral Domains and Fields
- •Subrings and Morphisms of Rings
- •New Rings From Old
- •Field of Fractions
- •Convolution Fractions
- •Exercises
- •Euclidean Rings
- •Euclidean Algorithm
- •Unique Factorization
- •Factoring Real and Complex Polynomials
- •Factoring Rational and Integral Polynomials
- •Factoring Polynomials over Finite Fields
- •Linear Congruences and the Chinese Remainder Theorem
- •Exercises
- •Ideals and Quotient Rings
- •Computations in Quotient Rings
- •Morphism Theorem
- •Quotient Polynomial Rings that are Fields
- •Exercises
- •Field Extensions
- •Algebraic Numbers
- •Galois Fields
- •Primitive Elements
- •Exercises
- •Latin Squares
- •Orthogonal Latin Squares
- •Finite Geometries
- •Magic Squares
- •Exercises
- •Constructible Numbers
- •Duplicating a Cube
- •Trisecting an Angle
- •Squaring the Circle
- •Constructing Regular Polygons
- •Nonconstructible Number of Degree 4
- •Exercises
- •The Coding Problem
- •Simple Codes
- •Polynomial Representation
- •Matrix Representation
- •Error Correcting and Decoding
- •BCH Codes
- •Exercises
- •Induction
- •Divisors
- •Prime Factorization
- •Proofs in Mathematics
- •Modern Algebra in General
- •History of Modern Algebra
- •Connections to Computer Science and Combinatorics
- •Groups and Symmetry
- •Rings and Fields
- •Convolution Fractions
- •Latin Squares
- •Geometrical Constructions
- •Coding Theory
- •Chapter 2
- •Chapter 3
- •Chapter 4
- •Chapter 5
- •Chapter 6
- •Chapter 7
- •Chapter 8
- •Chapter 9
- •Chapter 10
- •Chapter 11
- •Chapter 12
- •Chapter 13
- •Chapter 14
- •Index
8
RINGS AND FIELDS
The familiar number systems of the real or complex numbers contain two basic binary operations, addition and multiplication. Group theory is not sufficient to capture all of the algebraic structure of these number systems, because a group deals with only one binary operation. It is possible to consider the integers as a group (Z, +) and the nonzero integers as a monoid (Z , ·), but this still neglects the relation between addition and multiplication, namely, the fact that multiplication is distributive over addition. We therefore consider algebraic structures with two binary operations modeled after these number systems. A ring is a structure that has the minimal properties we would expect of addition and multiplication. A field is a more specialized ring in which division by nonzero elements is always possible.
In this chapter we look at the basic properties of rings and fields and consider many examples. In later chapters we construct new number systems with properties similar to the familiar systems.
RINGS
A ring (R, +, ·) is a set R, together with two binary operations + and · on R satisfying the following axioms. For any elements a, b, c R,
(i)(a + b) + c = a + (b + c).
(ii)a + b = b + a.
(iii)there exists 0 R, called the zero, such that a + 0 = a.
(iv)there exists (−a) R such that a + (−a) = 0.
(v)(a · b) · c = a · (b · c).
(vi)there exists 1 R such that 1 · a = a · 1 = a.
(associativity of addition) (commutativity of addition) (existence of an additive identity)
(existence of an additive inverse)
(associativity of multiplication) (existence of multiplicative identity)
Modern Algebra with Applications, Second Edition, by William J. Gilbert and W. Keith Nicholson ISBN 0-471-41451-4 Copyright 2004 John Wiley & Sons, Inc.
156 |
8 RINGS AND FIELDS |
(vii) a · (b + c) = a · b + a · c and |
(distributivity) |
(b + c) · a = b · a + c · a. |
|
Axioms (i)–(iv) are equivalent to saying that (R, +) is an abelian group, and axioms (v) and (vi) are equivalent to saying that (R, ·) is a monoid.
The ring (R, +, ·) is called a commutative ring if, in addition,
(viii) a · b = b · a for all a, b R. (commutativity of multiplication)
The integers under addition and multiplication satisfy all of the axioms above, so that (Z, +, ·) is a commutative ring. Also, (Q, +, ·), (R, +, ·), and (C, +, ·) are all commutative rings. If there is no confusion about the operations, we write only R for the ring (R, +, ·). Therefore, the rings above would be referred to as Z, Q, R, or C. Moreover, if we refer to a ring R without explicitly defining its operations, it can be assumed that they are addition and multiplication.
Many authors do not require a ring to have a multiplicative identity, and most of the results we prove can be verified to hold for these objects as well. Exercise 8.49 shows that such an object can always be embedded in a ring that does have a multiplicative identity.
The set of |
all n × n square matrices with real coefficients forms a ring |
(Mn(R), +, ·), |
which is not commutative if n > 1, because matrix multiplication |
is not commutative.
The elements “even” and “odd” form a commutative ring ({even, odd}, +, ·) where the operations are given by Table 8.1. “Even” is the zero of this ring, and “odd” is the multiplicative identity. This is really a special case of the following example when n = 2.
Example 8.1. Show that (Zn, +, ·) is a commutative ring, where addition and multiplication on congruence classes, modulo n, are defined by the equations [x] + [y] = [x + y] and [x] · [y] = [xy].
Solution. It follows from Example 4.19, that (Zn, +) is an abelian group. Since multiplication on congruence classes is defined in terms of represen-
tatives, it must be verified that it is well defined. Suppose that [x] = [x ] and
[y] = [y ], so that x ≡ x and y ≡ y mod n. This implies that x = x + kn and y = y + ln for some k, l Z. Now x · y = (x + kn) · (y + ln) = x · y +
(ky + lx + kln)n, so x · y ≡ x · y mod n and hence [x · y] = [x · y ]. This shows that multiplication is well defined.
TABLE 8.1. Ring of Odd and Even Integers
+ |
Even |
Odd |
Even |
even |
odd |
Odd |
odd |
even |
|
|
|
· |
Even |
Odd |
Even |
even |
even |
Odd |
even |
odd |
|
|
|
RINGS |
157 |
The remaining axioms now follow from the definitions of addition and multiplication and from the properties of the integers. The zero is [0], and the unit is [1]. The left distributive law is true, for example, because
[x] · ([y] + [z]) = [x] · [y + z] = [x · (y + z)] |
|
|
= [x · y + x · z] |
by distributivity in Z |
|
= [x · y] + [x · z] = [x] · [y] + [x] · [z]. |
||
Example 8.2. Construct the addition and |
multiplication tables for the |
ring |
(Z5, +, ·). |
|
|
Solution. We denote the congruence class [x] just by x. The tables are given
in Table 8.2. |
|
|
|
|
||
|
|
√ |
|
√ |
|
|
Example 8.3. Show that (Q( |
2), +, ·) is a commutative ring where Q( 2) = |
|||||
√ |
|
|
|
|
|
|
{a + b 2 R|a, b Q}. |
|
|
|
|
||
√
Solution. The set Q( 2) is a subset of R, and the addition and multiplication
is the same as that of real numbers. First, we check that + and · are binary |
||||||||||||||||||||||
|
√ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
operations on Q( 2). If a, b, c, d Q, we have |
|
|
|
|
|
|
|
|
|
|
|
|||||||||||
|
√ |
|
|
|
|
√ |
|
|
√ |
|
|
|
√ |
|
|
|
|
|
|
|||
(a + b 2) + (c |
+ d 2) = (a + c) + |
(b + d) 2 |
Q( 2) |
|||||||||||||||||||
since (a + c) and (b + d) Q. Also, |
|
|
|
|
|
|
|
|
|
|
|
|||||||||||
√ |
|
|
√ |
|
|
|
√ |
|
|
√ |
|
|
|
|
||||||||
(a + b 2) · (c + d |
|
2) = (ac + 2bd) + |
(ad + bc) |
2 |
Q( 2) |
|||||||||||||||||
since (ac + 2bd) and (ad + bc) Q. |
|
|
|
|
|
|
|
|
√ |
|
|
|||||||||||
We now check that axioms (i)–(viii) of a commutative ring are valid in Q( 2).
(i) |
Addition of real numbers |
is associative. |
|||||
(ii) |
Addition of real numbers |
is commutative. |
|||||
|
|
= 0 + 0 |
√ |
|
√ |
|
|
(iii) |
The zero is 0 |
2 |
Q(√2). |
||||
(iv) |
The additive |
inverse |
of |
a + b |
2 |
is (−a) |
|
(−a) and (−b) Q.
√√
+(−b) 2 Q( 2), since
TABLE 8.2. Ring (Z5, +, ·)
+ |
0 |
1 |
2 |
3 |
4 |
0 |
0 |
1 |
2 |
3 |
4 |
1 |
1 |
2 |
3 |
4 |
0 |
2 |
2 |
3 |
4 |
0 |
1 |
3 |
3 |
4 |
0 |
1 |
2 |
4 |
4 |
0 |
1 |
2 |
3 |
|
|
|
|
|
|
· |
0 |
1 |
2 |
3 |
4 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
2 |
3 |
4 |
2 |
0 |
2 |
4 |
1 |
3 |
3 |
0 |
3 |
1 |
4 |
2 |
4 |
0 |
4 |
3 |
2 |
1 |
|
|
|
|
|
|
158 |
|
|
|
8 RINGS AND FIELDS |
||
(v) |
Multiplication of real numbers is associative. |
√ |
|
|
||
(vi) |
√ |
|
Q( |
|
|
|
The multiplicative identity is 1 = 1 + 0 2 |
2). |
|||||
(vii)The distributiv√ e axioms hold for real numbers and hence hold for elements of Q( 2).
(viii) Multiplication of real numbers is commutative. |
|
We have already investigated one algebraic system with two binary operations: a boolean algebra. The boolean algebra of subsets of a set is not a ring under the operations of union and intersection, because neither of these operations has inverses. However, the symmetric difference does have an inverse, and we can make a boolean algebra into a ring using this operation and the operation of intersection.
Example 8.4. (P (X), , ∩) is a commutative ring for any set X.
Solution. The axioms (i)–(viii) of a commutative ring follow from Propositions 2.1 and 2.3. The zero is Ø, and the identity is X.
In the ring above, A ∩ A = A for every element A in the ring. Such rings are called boolean rings, since they are all derivable from boolean algebras (see Exercise 8.13).
Example 8.5. Construct the tables for the ring (P (X), , ∩), where X = {a, b, c}.
Solution. Let A = {a}, B = {b}, and C = {c}, so that A = {b, c}, B = {a, c}, and C = {a, b}. Therefore, P (X) = {Ø, A, B, C, A, B, C, X}. The tables for the symmetric difference and intersection are given in Table 8.3.
The following properties are useful in manipulating elements of any ring.
Proposition 8.6. If (R, +, ·) is a ring, then for all a, b R:
(i)a · 0 = 0 · a = 0.
(ii)a · (−b) = (−a) · b = −(a · b).
(iii)(−a) · (−b) = a · b.
(iv)(−1) · a = −a.
(v)(−1) · (−1) = 1.
Proof. (i) By distributivity, a · 0 = a · (0 + 0) = a · 0 + a · 0. Adding −(a · 0) to each side, we obtain 0 = a · 0. Similarly, 0 · a = 0.
(ii)Compute a · (−b) + a · b = a · (−b + b) = a · 0 = 0, using (i). Therefore, a · (−b) = −(a · b). Similarly, (−a) · b = −(a · b).
(iii)We have (−a) · (−b) = −(a · (−b)) = −(−(a · b)) = a · b by (ii) and Proposition 3.7.
