Math 2.0

statement theorem

Induction on the integers

Statement

Let P(z)P(z) be a property of integers zz. Suppose that P(0)P(0) holds. Suppose that for each natural number nn, P(n)P(n) implies P(n+1)P(n + 1). Suppose that for each natural number nn, P(−n)P(-n) implies P(−n−1)P(-n - 1). Then P(z)P(z) holds for every integer zz.

Remarks

The proof applies ordinary induction two times: one time to P(n)P(n) and one time to P(−n)P(-n), for natural numbers nn. Each integer is nn or −n-n for some natural number nn, thus the two inductions cover all of Z\mathbb{Z}.

Explanations

L1 human

You start at 00 and you walk in both directions on the number line. One induction goes up through 1,2,3,…1, 2, 3, \dots, and the other goes down through −1,−2,−3,…-1, -2, -3, \dots.

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.

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. Integers object
  2. Mathematical induction concept
  3. Induction on the integers statement

Sources

  1. Web https://en.wikipedia.org/wiki/Mathematical_induction, Variants