Equivalence of Well-Ordering Principle and Induction/Proof/WOP implies PFI
- Principle of Finite Induction: Given a subset $S \subseteq \N$ of the natural numbers which has these properties:
- $0 \in S$
- $n \in S \implies n + 1 \in S$
- then $S = \N$.
To save space, we will refer to:
We assume the truth of WOP.
Let $S \subseteq \N$ which satisfy:
- $(D): \quad 0 \in S$
- $(E): \quad n \in S \implies n+1 \in S$.
We want to show that $S = \N$, that is, the PFI is true.
Aiming for a contradiction, suppose that:
- $S \ne \N$
Consider $S' = \N \setminus S$, where $\setminus$ denotes set difference.
From Set Difference is Subset, $S' \subseteq \N$.
A lower bound of $\N$ is $0$.
By hypothesis, $0 \in S$.
From the definition of set difference, $0 \notin S'$.
So this minimal element of $S'$ has the form $k + 1$ where $k \in \N$.
We can consider the Natural Numbers as Elements of Minimal Infinite Successor Set.
Thus $k \in S$ but $k + 1 \notin S$.
From $(E)$, this contradicts the definition of $S$.
Thus if $S' \ne \O$, it has no minimal element.
So $S = N$.
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): $\S 2.1$: Chapter $2$: Integers and natural numbers: The integers