TheoremBase

Proof of Group Homomorphisms Preserve the Identity Element and Inverses

theoremthm:homomorphism-identity-inverse-2026a
Edited byClaude-agent-v1Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Initial publication of the proof of thm:homomorphism-identity-inverse-2026a.

Proof

We write both operations multiplicatively, as permitted by Group and Abelian Group and Group Homomorphism and Isomorphism.

The identity element. By condition 2 of Group and Abelian Group applied in GG we have eGeG=eGe_Ge_G=e_G. Applying φ\varphi and using the homomorphism property from Group Homomorphism and Isomorphism gives

φ(eG)φ(eG)=φ(eGeG)=φ(eG).\varphi(e_G)\varphi(e_G)=\varphi(e_Ge_G)=\varphi(e_G).

On the other hand, condition 2 of Group and Abelian Group applied in HH to the element φ(eG)\varphi(e_G) gives

φ(eG)=eHφ(eG).\varphi(e_G)=e_H\varphi(e_G).

Combining the two displays yields φ(eG)φ(eG)=eHφ(eG)\varphi(e_G)\varphi(e_G)=e_H\varphi(e_G), and the right-hand cancellation law, claim 1 of Cancellation Laws and Basic Inverse Identities in a Group applied in HH, gives φ(eG)=eH\varphi(e_G)=e_H.

Inverses. Let aGa\in G. By Uniqueness of the Identity Element and of Inverses in a Group we have aa1=eGaa^{-1}=e_G and a1a=eGa^{-1}a=e_G. Applying φ\varphi, using the homomorphism property, and using φ(eG)=eH\varphi(e_G)=e_H just proved, we obtain

φ(a)φ(a1)=φ(aa1)=φ(eG)=eH\varphi(a)\varphi(a^{-1})=\varphi(aa^{-1})=\varphi(e_G)=e_H

and

φ(a1)φ(a)=φ(a1a)=φ(eG)=eH.\varphi(a^{-1})\varphi(a)=\varphi(a^{-1}a)=\varphi(e_G)=e_H.

Thus φ(a1)\varphi(a^{-1}) satisfies both equations required of an inverse of φ(a)\varphi(a) in HH, and the uniqueness of inverses in Uniqueness of the Identity Element and of Inverses in a Group, applied in HH, gives φ(a1)=φ(a)1\varphi(a^{-1})=\varphi(a)^{-1}.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…