Abstract Algebra/Ring Homomorphisms
Just as with groups, we can study homomorphisms to understand the similarities between different rings.
Contents |
[edit] Homomorphisms
[edit] Definition
Let R and S be two rings. Then a function
is called a ring homomorphism if for every
, the following properties hold:
- f(r1r2) = f(r1)f(r2),
- f(r1 + r2) = f(r1) + f(r2).
In other words, f is a ring homomorphism if it preserves additive and multiplicative structure.
Furthermore, if R and S are rings with unity and f(1R) = 1S, then f is called a unital ring homomorphism.
[edit] Examples
- Let
be the function mapping
. Then one can easily check that f is a homomorphism, but not a unital ring homomorphism. - If we define
, then we can see that g is a unital homomorphism. - The zero homomorphism is the homomorphism which maps ever element to the zero element of its codomain.
Theorem: Let R and S be integral domains, and let
be a nonzero homomorphism. Then f is unital.
Proof:
. But then by cancellation, f(1R) = 1S.
In fact, we could have weakened our requirement for R a small amount (How?).
Theorem: Let R,S be rings and
a homomorphism. Let R' be a subring of R and S' a subring of S. Then φ(R') is a subring of S and φ − 1(S') is a subring of R. That is, the kernel and image of a homomorphism are subrings.
Proof: Proof omitted.
Theorem: Let R,S be rings and
be a homomorphism. Then φ is injective if and only if ker φ = 0.
Proof: Consider φ as a group homomorphism of the additive group of R.
Theorem: Let F,E be fields, and
be a nonzero homomorphism. Then φ is injective, and φ(x) − 1 = φ(x − 1).
Proof: We know φ(1) = 1 since fields are integral domains. Let
be nonzero. Then φ(x − 1)φ(x) = φ(x − 1x) = φ(1) = 1. So
. So
(recall you were asked to prove units are nonzero as an exercise). So ker φ = 0.
[edit] Isomorphisms
[edit] Definition
Let R,S be rings. An isomorphism between R and S is an invertible homomorphism. If an isomorphism exists, R and S are said to be isomorphic, denoted
. Just as with groups, an isomorphism tells us that two objects are algebraically the same.
[edit] Examples
- The function g defined above is an isomorphism between
and the set of integer scalar matrices of size 2,
. - Similarly, the function
mapping
where z = a + bi is an isomorphism. This is called the matrix representation of a complex number. - The Fourier transform
defined by
is an isomorphism mapping integrable functions with pointwise multiplication to integrable functions with convolution multiplication.
Excercise: An isomorphism from a ring to itself is called an automorphism. Prove that the following functions are automorphisms:

- Define the set
, and let 
be the function mapping
. Then one can easily check that
, then we can see that
and the set of integer scalar matrices of size 2,
.
mapping
where
defined by
is an isomorphism mapping integrable functions with pointwise multiplication to integrable functions with convolution multiplication.
, and let 