Addition of natural numbers
Definition
Let be the set of natural numbers and let be the successor function. Addition is the function , , with these two properties for all and in :
Remarks
For each , these equations are a definition by recursion on . Thus exactly one such function exists. With , the second equation gives . For example, .
Explanations
L1 human
To add to , you start at and count up steps. The definition says this in two rules: adding changes nothing, and adding one more step gives the next number.
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
- Definition by recursion concept
- Natural numbers object
- Peano axioms concept
- Successor function definition
- Addition of natural numbers definition
What depends on this
8 nodes use this node, directly or through other nodes.
- Well-ordering principle 01BX15HSRR
- Associativity of addition 0C32J27WQC
- Commutativity of addition 0DFZNHJ0S2
- Induction from an arbitrary base case 0GF6AJEBZ0
- Multiplication of natural numbers 0JRC32D6K2
- Distributive law 0KBEMAJAYA
- Strong induction 0KMVFSHFGZ
- Order on the natural numbers 0Y9H52BT03
Sources
- Web https://en.wikipedia.org/wiki/Addition, Natural numbers
- Web https://en.wikipedia.org/wiki/Peano_axioms, Addition
What links here
Used by
- Associativity of addition 0C32J27WQC
- Commutativity of addition 0DFZNHJ0S2
- Multiplication of natural numbers 0JRC32D6K2
- Distributive law 0KBEMAJAYA
- Order on the natural numbers 0Y9H52BT03