Math 2.0

statement proposition

A homomorphism is injective iff its kernel is trivial

Statement

Let GG and HH be groups, let eGe_G be the identity element of GG, and let φ ⁣:G→H\varphi \colon G \to H be a group homomorphism. Then φ\varphi is injective if and only if ker⁡φ={eG}\ker \varphi = \{e_G\}.

Remarks

If φ(a)=φ(b)\varphi(a) = \varphi(b), then φ(a−1b)=eH\varphi(a^{-1}b) = e_H, so a−1b∈ker⁡φa^{-1}b \in \ker \varphi. More generally, φ(a)=φ(b)\varphi(a) = \varphi(b) exactly when aa and bb lie in the same coset of ker⁡φ\ker \varphi.

Explanations

L1 human

To check that a homomorphism is injective, you only need to check one fibre: the elements that go to the identity. If only the identity goes to the identity, then no two elements can go to the same place. This is much easier than comparing all pairs of elements.

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 10 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Binary operation definition
  2. Group concept
  3. Identity element definition
  4. Cancellation laws statement
  5. Group homomorphism definition
  6. Inverse element definition
  7. Kernel of a homomorphism definition
  8. Uniqueness of inverses statement
  9. Homomorphisms preserve identity and inverses statement
  10. A homomorphism is injective iff its kernel is trivial statement

Sources

  1. Web https://en.wikipedia.org/wiki/Kernel_(algebra), Group homomorphisms