Math 2.0

proof

Proof of the uniqueness of inverses

Proof

  1. Let aa be an element of a group GG with identity ee. Let bb and cc both be inverses of aa, so ba=eba = e and ac=eac = e.
  2. Then b=be=b(ac)b = be = b(ac).
  3. By associativity, b(ac)=(ba)cb(ac) = (ba)c.
  4. Since ba=eba = e, (ba)c=ec=c(ba)c = ec = c.
  5. Thus b=cb = c, and aa has only one inverse.

Idea

Multiply one inverse by the element and then by the other inverse. Associativity lets the product collapse in two ways.

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.

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. Inverse element definition
  5. Proof of the uniqueness of inverses proof

What depends on this

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

Sources

  1. Web https://en.wikipedia.org/wiki/Group_(mathematics), Uniqueness of inverses