Math 2.0

proof

Proof of the cancellation laws

Proof

  1. Let aa, bb and cc be elements of a group GG with identity ee, and suppose that ab=acab = ac.
  2. Multiply both sides on the left by the inverse a−1a^{-1}. This gives a−1(ab)=a−1(ac)a^{-1}(ab) = a^{-1}(ac).
  3. By associativity, (a−1a)b=(a−1a)c(a^{-1}a)b = (a^{-1}a)c, so eb=eceb = ec and b=cb = c.
  4. Now suppose that ba=caba = ca. Multiply both sides on the right by a−1a^{-1}.
  5. By associativity, b(aa−1)=c(aa−1)b(aa^{-1}) = c(aa^{-1}), so be=cebe = ce and b=cb = c.

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.

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 cancellation laws 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), Division