Math 2.0

statement theorem

Commutativity of addition

Statement

For all natural numbers aa and bb, a+b=b+aa + b = b + a. Here ++ is the addition of natural numbers.

Remarks

The proof from the recursive definition of addition uses the principle of mathematical induction two times. An operation ∗\ast on a set is commutative when x∗y=y∗xx \ast y = y \ast x for all xx and yy. Multiplication of natural numbers is also commutative. Subtraction of integers is not commutative: 3−1≠1−33 - 1 \neq 1 - 3.

Explanations

L1 human

The order of two numbers in a sum does not change the result: 2+52 + 5 and 5+25 + 2 are both 77. Think of two piles of stones: you count the same total when you count the second pile first.

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 7 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. Definition by recursion concept
  2. Mathematical induction concept
  3. Natural numbers object
  4. Peano axioms concept
  5. Successor function definition
  6. Addition of natural numbers definition
  7. Commutativity of addition statement

Sources

  1. Web https://en.wikipedia.org/wiki/Commutative_property, Definition
  2. Web https://en.wikipedia.org/wiki/Addition, Commutativity