Jump to content

Abstract Algebra/Rings, ideals, ring homomorphisms

From Wikibooks, open books for an open world

Basic definitions

[edit | edit source]

Definition 10.1:

A ring is a set R together with two binary operations +:R×R→R and ⋅:R×R→R and two special elements, the unit 1 and the zero 0, such that:

  1. R is an abelian group with respect to + with neutral element 0.
  2. R is a monoid (that is, a group without inversion) with respect to ⋅ with neutral element 1.
  3. The distributive laws hold: a⋅(b+c)=a⋅b+a⋅c, (b+c)⋅a=b⋅a+c⋅a.

Examples 10.2:

  • The whole numbers ℤ with respect to usual addition and multiplication are a ring.
  • Every field is a ring.
  • If R is a ring, then all polynomials over R form a ring. This example will be explained later in the section on polynomial rings.

Definition 10.3:

Let R be a ring. A left ideal of R is a subset I⊆R such that the following two things hold:

  1. (I,+) is a subgroup of (R,+).
  2. ∀r∈R:rI⊆I, where rI={ri|i∈I} (closedness by left multiplication).

Replacing closedness by left multiplication by closedness by right multiplication, we can define right ideals, and then both-sided ideals. If I⊆R is a both-sided ideal of R, we write I≤R.

We'll now show an important property of the set of all ideals of a given ring, namely that it's inductive. This means:

Definition 10.4:

Let (S,≤) be a partially ordered set (that is, the usual conditions transitivity, reflexivity and anti-symmetry are satisfied). S is called inductive if and only if every ascending chain of elements of S (that is, a sequence (sn)n∈ℕ in S such that s1≤s2≤s3≤⋯≤sk≤⋯) has an upper bound (that is, an element b∈S such that ∀n∈ℕ:b≥sn).

With this definition, we observe:

Theorem 10.5:

If a commutative ring R is given, the set of all ideals I of R, partially ordered by inclusion (i.e. S={I⊂R|I≤R}⊂2R, where we use the convention of Donald Knuth and denote the power set of a set T by 2T) is inductive.

Proof:

If

I1⊆I2⊆I3⊆⋯⊆Ik⊆⋯

is an ascending chain of ideals, we set

J:=⋃n∈ℕIn

and claim that J≤R. Indeed, if a,b∈J, find m,n∈ℕ such that a∈In and b∈Im. Then set N:=max⁡{m,n}, so that a,b,a+b∈IN⊆J since IN≤R. Similarly, if a∈J and r∈R, pick n∈ℕ such that a∈In, whence ra∈In⊆J since In≤R.◻

Residue class rings

[edit | edit source]

Definition and theorem 10.4:

Let R be a ring, and I≤R. Then we define a relation ∼I on R as follows:

a∼Ib:⇔a−b∈I.

This relation is an equivalence relation, and an equivalence class [a] shall be denoted by a+I for a∈R. If we define an addition

(a+I)+(b+I):=(a+b)+I

and a multiplication

(a+I)⋅(b+I):=a⋅b+I,

then these two are well-defined (i. e. independent of the choice of the representatives a and b) and turn R/I into a ring, called the residue class ring with respect to the ideal I.

Proof:

First, we check that ∼I is an equivalence relation.

  1. Reflexiveness: a−a=0∈I since I is an additive subgroup.
  2. Symmetry: a−b∈I⇔−(a−b)∈I since inverses are in the subgroup.
  3. Transitivity: Let a−b∈I and b−c∈I. Then a−c=a−b+(b−c)∈I, since a subgroup is closed under the group operation.

Then we check that addition and multiplication are well-defined. Let a+I=a′+I and b+I=b′+I. Then

a+b−(a′+b′)=a+b−(a+i+b+j)=−i−j∈I for certain i,j∈I.

Furthermore,

a⋅b−a′⋅b′=a⋅b−a⋅b−a⋅j−i⋅b−i⋅b

for these same i,j∈I; this is in I by closedness by left and right multiplication.

The ring axioms directly carry over from the old ring R.◻

Ring homomorphisms

[edit | edit source]

Definition 10.5:

Let R,S be rings. A ring homomorphism between the two is a map

φ:R→S

such that:

  1. For all a,b∈R φ(a+b)=φ(a)+φ(b) and φ(a⋅b)=φ(a)⋅φ(b).
  2. φ(1R)=1S (1R is the unit of R and 1S of S).