| Previous page (Integral domains and Fields) | Contents | Next page (Division and Euclidean algorithms) |
These are the concepts which play the same role as subgroups and normal subgroups in group theory.
Definition
A subring S of a ring R is a subset of R which is a ring under the same operations as R.
Equivalently: The criterion for a subring
A non-empty subset S of R is a subring if a, b
S
a - b, ab
S.
So S is closed under subtraction and multiplication.
Exercise: Prove that these two definitions are equivalent.
Remark
Using the above criterion makes it easy to check that something is a ring by showing that it is a subring of something else since one does not need to check associativity or distributivity.
Examples
form a subring of
.
of
.
.
6.
| a, b
} forms a subring of
.
5 | a, b
} is a subring of the ring
.
5 | x, y
} is also a subring of
.
forms a subring of the ring of all 2
2 real matrices.Definition
A subring I of R is a left ideal if a
I, r
R
ra
I.
So I is closed under subtraction and also under multiplication on the left by elements of the "big ring".
A right ideal is defined similarly.
A two-sided ideal (or just an ideal) is both a left and right ideal.
That is, a, b
I, r
R
a - b, ar, ra
I.
Remark
These subsets are related to the ideal numbers that Eduard Kummer (1810 to 1893) defined to "restore the uniqueness of factorisation" in the rings used for proving cases of Fermat's last theorem.
Examples
Proof
Note that if the identity 1 is in an ideal then the ideal is the whole ring. But if a field element a
0 is in an ideal, so is a-1a and so 1 is in too.
forms a left ideal of the ring of all 2
2 real matrices while those of the form
form a right ideal of this ring.
Proof
Such a polynomial is of the form xq(x) for some polynomial q(x) and it is easy to verify the ideal condition for these.
[x] whose coefficients are all even is an ideal. So is the set of those with even constant coefficient.Definitions
Let R be a commutative ring with identity. Let S be a subset of R. The ideal generated by S is the subset < S > = {r1s1 + r2s2 + ... + rksk
R | r1 , r2 , ...
R, s1 , s2 , ...
S, k
}.
In particular, if S has a single element s this is called the principal ideal generated by s.
That is, < s > = {rs | r
R}.
Remarks
Examples
of
is the principal ideal < 2 >.
[x] with 0 constant term) is the principal ideal < x > .
[x] whose coefficients are all even is the principal ideal < 2 >.
[x, y] with zero constant coefficient is the ideal < x, y > and is not principal.
We will see later that in the rings
and
[x] every ideal is principal.
| Previous page (Integral domains and Fields) | Contents | Next page (Division and Euclidean algorithms) |