Math 2.0

proof

Proof that a homomorphism is injective iff its kernel is trivial

Proof

  1. Let φ:G→H\varphi : G \to H be a group homomorphism with kernel KK.
  2. Suppose that φ\varphi is injective, and let k∈Kk \in K. φ(e)=e\varphi(e) = e, so φ(k)=φ(e)\varphi(k) = \varphi(e). Thus k=ek = e, and K={e}K = \{e\}.
  3. Now suppose that K={e}K = \{e\}, and let a,b∈Ga, b \in G with φ(a)=φ(b)\varphi(a) = \varphi(b).
  4. Then φ(a−1b)=φ(a)−1φ(b)=e\varphi(a^{-1}b) = \varphi(a)^{-1}\varphi(b) = e, so a−1b∈Ka^{-1}b \in K.
  5. Thus a−1b=ea^{-1}b = e, so a=ba = b, and φ\varphi 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.

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. Group homomorphism definition
  5. Inverse element definition
  6. Kernel of a homomorphism definition
  7. Proof of the cancellation laws proof
  8. Proof of the uniqueness of inverses proof
  9. Cancellation laws statement
  10. Uniqueness of inverses statement
  11. Homomorphisms preserve identity and inverses statement
  12. 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.

Sources

  1. Web https://en.wikipedia.org/wiki/Group_homomorphism, Image and kernel