Induction, Bounding And Least Number Principles

In first-order arithmetic, the induction principles, bounding principles, and least number principles are three related families of first-order principles, which may or may not hold in nonstandard models of arithmetic. These principles are often used in reverse mathematics to calibrate the axiomatic strength of theorems.

Definitions

Informally, for a first-order formula of arithmetic $\varphi(x)$ with one free variable, the induction principle for $\varphi$ expresses the validity of mathematical induction over $\varphi$, while the least number principle for $\varphi$ asserts that if $\varphi$ has a witness, it has a least one. For a formula $\psi(x,y)$ in two free variables, the bounding principle for $\psi$ states that, for a fixed ''bound'' $k$, if for every $n < k$ there is $m_n$ such that $\psi(n,m_n)$, then we can find a bound on the $m_n$'s.

Formally, the induction principle for $\varphi$ is the sentence:

: \mathsf\varphi: \quad \big \varphi(0) \land \forall x \big( \varphi(x) \to \varphi(x+1) \big) \big\to \forall x\ \varphi (x)

There is a similar strong induction principle for $\varphi$:

: \mathsf'\varphi: \quad \forall x \big \big( \forall y\to \forall x\ \varphi (x)

The least number principle for $\varphi$ is the sentence:

: $\mathsf\varphi: \quad \exists x\ \varphi (x) \to \exists x' \big( \varphi (x') \land \forall y < x'\ \, \lnot \varphi(y) \big)$

Finally, the bounding principle for $\psi$ is the sentence:

: \mathsf\psi: \quad \forall u \big \big( \forall x < u\ \, \exists y\ \, \psi(x,y) \big) \to \exists v\ \, \forall x < u\ \, \exists y < v\ \, \psi(x,y) \big/math>

More commonly, we consider these principles not just for a single formula, but for a class of formulae in the arithmetical hierarchy. For example, $\mathsf\Sigma_2$ is the axiom schema consisting of $\mathsf\varphi$ for every $\Sigma_2$ formula $\varphi(x)$ in one free variable.

Nonstandard models

It may seem that the principles $\mathsf\varphi$, $\mathsf'\varphi$, $\mathsf\varphi$, $\mathsf\psi$ are trivial, and indeed, they hold for all formulae $\varphi$, $\psi$ in the standard model of arithmetic $\mathbb$. However, they become more relevant in nonstandard models. Recall that a nonstandard model of arithmetic has the form $\mathbb + \mathbb \cdot K$ for some linear order $K$. In other words, it consists of an initial copy of $\mathbb$, whose elements are called ''finite'' or ''standard'', followed by many copies of $\mathbb$ arranged in the shape of $K$, whose elements are called ''infinite'' or ''nonstandard''.

Now, considering the principles $\mathsf\varphi$, $\mathsf'\varphi$, $\mathsf\varphi$, $\mathsf\psi$ in a nonstandard model $\mathcal$, we can see how they might fail. For example, the hypothesis of the induction principle $\mathsf\varphi$ only ensures that $\varphi(x)$ holds for all elements in the ''standard'' part of $\mathcal$ - it may not hold for the nonstandard elements, who can't be reached by iterating the successor operation from zero. Similarly, the bounding principle $\mathsf\psi$ might fail if the bound $u$ is nonstandard, as then the (infinite) collection of $y$ could be cofinal in $\mathcal$.

Relations between the principles

The following relations hold between the principles (over the weak base theory $\mathsf^- +\mathsf\Sigma_0$):

* $\mathsf'\varphi \equiv \mathsf\lnot\varphi$ for every formula $\varphi$;
* $\mathsf\Sigma_n \equiv \mathsf\Pi_n \equiv \mathsf'\Sigma_n \equiv \mathsf'\Pi_n \equiv \mathsf\Sigma_n \equiv \mathsf\Pi_n$;
* $\mathsf\Sigma_ \implies \mathsf\Sigma_ \implies \mathsf\Sigma_n$, and both implications are strict;
* $\mathsf\Sigma_ \equiv \mathsf\Pi_n \equiv \mathsf\Delta_$;
* $\mathsf\Delta_n \implies \mathsf\Delta_n$, but it is not known if this reverses.

Over $\mathsf^- +\mathsf\Sigma_0 + \mathsf$, Slaman proved that $\mathsf\Sigma_n \equiv \mathsf\Delta_n \equiv \mathsf\Delta_n$.

Reverse mathematics

The induction, bounding and least number principles are commonly used in reverse mathematics and second-order arithmetic. For example, $\mathsf\Sigma_1$ is part of the definition of the subsystem $\mathsf_0$ of second-order arithmetic. Hence, $\mathsf'\Sigma_1$, $\mathsf\Sigma_1$ and $\mathsf\Sigma_1$ are all theorems of $\mathsf_0$. The subsystem $\mathsf_0$ proves all the principles $\mathsf\varphi$, $\mathsf'\varphi$, $\mathsf\varphi$, $\mathsf\psi$ for arithmetical $\varphi$, $\psi$. The infinite pigeonhole principle is known to be equivalent to $\mathsf\Pi_1$ and $\mathsf\Sigma_2$ over $\mathsf_0$.

References

{{Mathematical logic

Formal theories of arithmetic
Mathematical axioms
Predicate logic