Bar Induction

Bar induction is a reasoning principle used in intuitionistic mathematics, introduced by L. E. J. Brouwer. Bar induction's main use is the intuitionistic derivation of the fan theorem, a key result used in the derivation of the uniform continuity theorem.

It is also useful in giving constructive alternatives to other classical results.

The goal of the principle is to prove properties for all infinite sequences of natural numbers (called choice sequences in intuitionistic terminology), by inductively reducing them to properties of finite lists. Bar induction can also be used to prove properties about all choice sequences in a spread (a special kind of set).

Definition

Given a choice sequence $x_0,x_1,x_2,x_3,\ldots$, any finite sequence of elements $x_0,x_1,x_2,x_3,\ldots,x_i$ of this sequence is called an ''initial segment'' of this choice sequence.

There are three forms of bar induction currently in the literature, each one places certain restrictions on a pair of predicates and the key differences are highlighted using bold font.

Decidable bar induction (BI_''D'')

Given two predicates $R$ and $A$ on finite sequences of natural numbers such that all of the following conditions hold:
* every choice sequence contains at least one initial segment satisfying $R$ at some point (this is expressed by saying that $R$ is a ''bar'');
* $R$ is decidable (i.e. our bar is ''decidable'');
* every finite sequence satisfying $R$ also satisfies $A$ (so $A$ holds for every choice sequence beginning with the aforementioned finite sequence);
* if all extensions of a finite sequence by one element satisfy $A$, then that finite sequence also satisfies $A$ (this is sometimes referred to as $A$ being ''upward hereditary'');

then we can conclude that $A$ holds for the empty sequence (i.e. A holds for all choice sequences starting with the empty sequence).

This principle of bar induction is favoured in the works of, A. S. Troelstra, S. C. Kleene and Albert Dragalin.

Thin bar induction (BI_''T'')

Given two predicates $R$ and $A$ on finite sequences of natural numbers such that all of the following conditions hold:
* every choice sequence contains a unique initial segment satisfying $R$ at some point (i.e. our bar is ''thin'');
* every finite sequence satisfying $R$ also satisfies $A$;
* if all extensions of a finite sequence by one element satisfy $A$, then that finite sequence also satisfies $A$;

then we can conclude that $A$ holds for the empty sequence.

This principle of bar induction is favoured in the works of Joan Moschovakis and is (intuitionistically) provably equivalent to decidable bar induction.

Monotonic bar induction (BI_''M'')

Given two predicates $R$ and $A$ on finite sequences of natural numbers such that all of the following conditions hold:
* every choice sequence contains at least one initial segment satisfying $R$ at some point;
* once a finite sequence satisfies $R$, then every possible extension of that finite sequence also satisfies $R$ (i.e. our bar is ''monotonic'');
* every finite sequence satisfying $R$ also satisfies $A$;
* if all extensions of a finite sequence by one element satisfy $A$, then that finite sequence also satisfies $A$;

then we can conclude that $A$ holds for the empty sequence.

This principle of bar induction is used in the works of A. S. Troelstra, S. C. Kleene, Dragalin and Joan Moschovakis.

Relationships between these schemata and other information

The following results about these schemata can be intuitionistically proved:

:
\begin
BI_M & \vdash BI_D \\ ptBI_D & \vdash BI_T \\ ptBI_T & \vdash BI_D
\end

(The symbol "$\,\vdash\,$" is a "turnstile".)

Unrestricted bar induction

An additional schema of bar induction was originally given as a theorem by Brouwer (1975) containing no "extra" restriction on $R$ under the name ''The Bar Theorem''. However, the proof for this theorem was erroneous, and unrestricted bar induction is not considered to be intuitionistically valid (see Dummett 1977 pp 94–104 for a summary of why this is so). The schema of unrestricted bar induction is given below for completeness.

Given two predicates $R$ and $A$ on finite sequences of natural numbers such that all of the following conditions hold:
* every choice sequence contains at least one initial segment satisfying $R$ at some point;
* every finite sequence satisfying $R$ also satisfies $A$;
* if all extensions of a finite sequence by one element satisfy $A$, then that finite sequence also satisfies $A$;

then we can conclude that $A$ holds for the empty sequence.

Relations to other fields

In classical reverse mathematics, "bar induction" ($BI_$) denotes the related principle stating that if a relation $R$'' is a well-order, then we have the schema of transfinite induction over $R$ for arbitrary formulas.

References

* L. E. J. Brouwer ''Brouwer, L. E. J. Collected Works'', Vol. I, Amsterdam: North-Holland (1975).
*
* Michael Dummett, ''Elements of intuitionism'', Clarendon Press (1977)
* S. C. Kleene, R. E. Vesley, ''The foundations of intuitionistic mathematics: especially in relation to recursive functions'', North-Holland (1965)
* Michael Rathjen, ''The role of parameters in bar rule and bar induction'', Journal of Symbolic Logic 56 (1991), no. 2, pp. 715–730.
* A. S. Troelstra, ''Choice sequences'', Clarendon Press (1977)
* A. S. Troelstra and Dirk van Dalen, ''Constructivism in Mathematics, Studies in Logic and the Foundations of Mathematics'', Elsevier (1988)

Constructivism (mathematics)
Mathematical induction

{{logic-stub