Math 2.0

statement theorem

Associativity of addition

Statement

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

Remarks

The proof from the recursive definition of addition uses induction on cc. Because of this law, we can write a+b+ca + b + c without parentheses. Multiplication of natural numbers is also associative.

Explanations

L1 human

When you add three numbers, you can add the first two first or the last two first. For example, (2+3)+4=5+4=9(2 + 3) + 4 = 5 + 4 = 9 and 2+(3+4)=2+7=92 + (3 + 4) = 2 + 7 = 9.

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. Associativity of addition statement

Sources

  1. Web https://en.wikipedia.org/wiki/Associative_property, Definition
  2. Web https://en.wikipedia.org/wiki/Addition, Associativity