Proof that a homomorphism is injective iff its kernel is trivial
Proof
- Let be a group homomorphism with kernel .
- Suppose that is injective, and let . , so . Thus , and .
- Now suppose that , and let with .
- Then , so .
- Thus , so , and is injective.
Idea
Two elements have the same image exactly when their quotient is in the kernel.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 12 nodes in this order. The foundations come first, and the list ends with this node. The list takes the proofs Proof of the uniqueness of inverses, Proof of the cancellation laws.
- no evidence level
- Binary operation definition
- Group concept
- Identity element definition
- Group homomorphism definition
- Inverse element definition
- Kernel of a homomorphism definition
- Proof of the cancellation laws proof
- Proof of the uniqueness of inverses proof
- Cancellation laws statement
- Uniqueness of inverses statement
- Homomorphisms preserve identity and inverses statement
- Proof that a homomorphism is injective iff its kernel is trivial proof
What depends on this
7 nodes use this node, directly or through other nodes.
- Inner automorphism group is isomorphic to G modulo its centre 05HYGWFG63
- First isomorphism theorem 0CXXJNG5B6
- A homomorphism is injective iff its kernel is trivial 0N2P0XRTDF
- Second isomorphism theorem 0PPP2J2DJV
- Order of the alternating group 0SZ1KMNWVE
- Third isomorphism theorem 0TJ1V9DDPC
- Proof of the first isomorphism theorem H4QSPK0XTZ
Sources
- Web https://en.wikipedia.org/wiki/Group_homomorphism, Image and kernel
What links here
No node links to this node yet.