statement theorem
Induction on the integers
Statement
Let be a property of integers . Suppose that holds. Suppose that for each natural number , implies . Suppose that for each natural number , implies . Then holds for every integer .
Remarks
The proof applies ordinary induction two times: one time to and one time to , for natural numbers . Each integer is or for some natural number , thus the two inductions cover all of .
Explanations
L1 human
You start at and you walk in both directions on the number line. One induction goes up through , and the other goes down through .
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 3 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Integers object
- Mathematical induction concept
- Induction on the integers statement
Sources
What links here
No node links to this node yet.