Math 2.0

statement proposition

Homomorphisms preserve identity and inverses

Statement

Let GG and HH be groups with identity elements eGe_G and eHe_H, and let φ ⁣:G→H\varphi \colon G \to H be a group homomorphism. Then φ(eG)=eH\varphi(e_G) = e_H, and φ(a−1)=φ(a)−1\varphi(a^{-1}) = \varphi(a)^{-1} for each a∈Ga \in G.

Remarks

The first equation follows from φ(eG)φ(eG)=φ(eG)=φ(eG)eH\varphi(e_G) \varphi(e_G) = \varphi(e_G) = \varphi(e_G) e_H and cancellation. The second follows from φ(a)φ(a−1)=φ(eG)=eH\varphi(a) \varphi(a^{-1}) = \varphi(e_G) = e_H and the uniqueness of inverses. A consequence is that φ(an)=φ(a)n\varphi(a^n) = \varphi(a)^n for each integer nn.

Explanations

L1 human

A map that respects products automatically respects the identity and the inverses. You do not need to ask for these two properties in the definition of a homomorphism. For example, the exponential map sends 00 to 11 and −x-x to 1/ex1/e^x.

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 8 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. Uniqueness of inverses statement
  8. Homomorphisms preserve identity and inverses statement

What depends on this

7 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Group_homomorphism, Properties