Jump to content

Abstract Algebra/Ring Homomorphisms

From Wikibooks, open books for an open world

Just as with groups, we can study homomorphisms to understand the similarities between different rings.

Homomorphisms

[edit | edit source]

Definition

[edit | edit source]

Let R and S be two rings. Then a function f:R→S is called a ring homomorphism or simply homomorphism if for every r1,r2∈R, 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.

Examples

[edit | edit source]
  1. Let f:ℤ→M2(ℤ) be the function mapping a↦(a000). Then one can easily check that f is a homomorphism, but not a unital ring homomorphism.
  2. If we define g:a↦(a00a), then we can see that g is a unital homomorphism.
  3. 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 f:R→S be a nonzero homomorphism. Then f is unital.

Proof: 1Sf(1R)=f(1R)=f(1R2)=f(1R)f(1R). 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 φ:R→S 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 φ:R→S 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 φ:F→E be a nonzero homomorphism. Then φ is injective, and φ(x)−1=φ(x−1).

Proof: We know φ(1)=1 since fields are integral domains. Let x∈F be nonzero. Then φ(x−1)φ(x)=φ(x−1x)=φ(1)=1. So φ(x)−1=φ(x−1). So φ(x)≠0 (recall you were asked to prove units are nonzero as an exercise). So ker⁡φ=0.

Isomorphisms

[edit | edit source]

Definition

[edit | edit source]

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 R≅S. Just as with groups, an isomorphism tells us that two objects are algebraically the same.

Examples

[edit | edit source]
  1. The function g defined above is an isomorphism between ℤ and the set of integer scalar matrices of size 2, S={λI2|λ∈ℤ}.
  2. Similarly, the function φ:ℂ→M2(ℝ) mapping z↦(a−bba) where z=a+bi is an isomorphism. This is called the matrix representation of a complex number.
  3. The Fourier transform ℱ:L1→L1 defined by ℱ(f)=∫ℝf(t)e−iωtdt is an isomorphism mapping integrable functions with pointwise multiplication to integrable functions with convolution multiplication.

Exercise: An isomorphism from a ring to itself is called an automorphism. Prove that the following functions are automorphisms:

  1. f:ℂ→ℂ,f(a+bi)=a−bi
  2. Define the set ℚ(2)={a+b2|a,b∈ℚ}, and let g:ℚ(2)→ℚ(2),g(a+b2)=a−b2