Math 5462 Slide 9
Math 5462 Slide 9
7 Homomorphisms
Shaoyun Yi
MATH 546/701I
Summer 2021
Proof: Proofs of i)-iii) are the same as in the case of a group isomorphism.
i) φ(e1 ) · φ(e1 ) = φ(e1 ∗ e1 ) = φ(e1 ) φ(e1 ) = e2 .
i)
ii) φ(a) · φ(a−1 ) = φ(a ∗ a−1 ) = φ(e1 ) = e2 φ(a−1 ) = (φ(a))−1 .
iii) Just as in the case of an isomorphism, use an induction argument.
iii) i)
iv) (φ(a))n = φ(an ) = φ(e1 ) = e2 . Thus o(φ(a))|n. [Why?]
Two comments:
i) and ii) are not necessarily true if φ is not onto.
If o(a) = n in G1 , then o(φ(a)) in G2 is a divisor of n. (See slide # 4)
Shaoyun Yi Homomorphisms Summer 2021 9 / 16
Homorphisms Between Cyclic Groups
In slide # 6, we define a homomorphism φ : Zn → Zk by φ([x]n ) = [mx]k .
Recall φ well-defined ⇔ k|mn. Every homomorphism φ : Zn → Zk is of this form.
Find all homomorphisms from Z to Z, from Z to Zn , and from Zn to Z.
Let m be a fixed integer. Define a function φ : Z → Z by φ(x) = mx.
Then φ is a homomorphism. Every homomorphism must be of this form.
Proof: φ is a homomorphism since φ(x + y ) = · · · = φ(x) + φ(y ).
φ is completely determined by its value on 1. [Why?] Say φ(1) = m ∈ Z.
For x ∈ Z+ , φ(x) = φ(1 + · · · + 1) = φ(1) + · · · + φ(1) = xφ(1) = mx.
For x ∈ Z− , so x = −|x| : φ(x) = φ(−|x|) = −φ(|x|) = −m|x| = mx.
Let [m]n ∈ Zn . Define a function φ : Z → Zn by φ(x) = [mx]n .
Then φ is a homomorphism. Every homomorphism must be of this form.
Proof: The proof is the same as for homomorphisms Z → Z.
The only homomorphism Zn → Z is defined by φ([x]n ) = 0 for [x]n ∈ Zn .
Proof: o([x]n ) = d o(φ([x]n ))|d. But in Z, only 0 has a finite order.
Shaoyun Yi Homomorphisms Summer 2021 10 / 16
Normal Subgroup
Let φ : G1 → G2 be a homomorphism.
Let g be any element in G1 . Then gkg −1 ∈ ker(φ) for all k ∈ ker(φ).
π : G1 → G1 /φ