Proof of the cancellation laws
Proof
- Let , and be elements of a group with identity , and suppose that .
- Multiply both sides on the left by the inverse . This gives .
- By associativity, , so and .
- Now suppose that . Multiply both sides on the right by .
- By associativity, , so and .
Idea
Multiply both sides of the equation by the inverse of the common factor, on the same side as that factor.
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 5 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Binary operation definition
- Group concept
- Identity element definition
- Inverse element definition
- Proof of the cancellation laws proof
What depends on this
12 nodes use this node, directly or through other nodes.
- Inner automorphism group is isomorphic to G modulo its centre 05HYGWFG63
- Homomorphisms preserve identity and inverses 08FKQD7NJ3
- The kernel is a normal subgroup 0C9ZKYSPYR
- 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
- Cancellation laws 0VSNX4P2Q0
- Proof that the kernel is a normal subgroup AY60KQR8RT
- Proof that a homomorphism is injective iff its kernel is trivial D05NAAC3XK
- Proof of the first isomorphism theorem H4QSPK0XTZ
Sources
What links here
No node links to this node yet.