free choice sequences

In intuitionistic mathematics, a choice sequence is a constructive formulation of a sequence. Since the Intuitionistic school of mathematics, as formulated by L. E. J. Brouwer, rejects the idea of a completed infinity, in order to use a sequence (which is, in classical mathematics, an infinite object), we must have a formulation of a finite, constructible object that can serve the same purpose as a sequence. Thus, Brouwer formulated the choice sequence, which is given as a construction, rather than an abstract, infinite object.

Lawlike and lawless sequences

A distinction is made between ''lawless'' and ''lawlike'' sequences. A ''lawlike'' sequence is one that can be described completely—it is a completed construction, that can be fully described. For example, the natural numbers $\mathbb N$ can be thought of as a lawlike sequence: the sequence can be fully constructively described by the unique element 0 and a successor function. Given this formulation, we know that the $i$th element in the sequence of natural numbers will be the number $i-1$. Similarly, a function $f : \mathbb N \mapsto \mathbb N$ mapping from the natural numbers into the natural numbers effectively determines the value for any argument it takes, and thus describes a lawlike sequence.

A ''lawless'' (also, ''free'') sequence, on the other hand, is one that is not predetermined. It is to be thought of as a procedure for generating values for the arguments 0, 1, 2, .... That is, a lawless sequence $\alpha$ is a procedure for generating $\alpha_0$, $\alpha_1$, ... (the elements of the sequence $\alpha$) such that:
*At any given moment of construction of the sequence $\alpha$, only an initial segment of the sequence is known, and no restrictions are placed on the future values of $\alpha$; and
*One may specify, in advance, an initial segment $\langle \alpha_0, \alpha_1, \ldots, \alpha_k \rangle$ of $\alpha$.
Note that the first point above is slightly misleading, as we may specify, for example, that the values in a sequence be drawn exclusively from the set of natural numbers—we can specify, a priori, the range of the sequence.

The canonical example of a lawless sequence is the series of rolls of a die. We specify which die to use and, optionally, specify in advance the values of the first $k$ rolls (for $k\in \mathbb N$). Further, we restrict the values of the sequence to be in the set $\$. This specification comprises the procedure for generating the lawless sequence in question. At no point, then, is any particular future value of the sequence known.

Axiomatization

There are two axioms in particular that we expect to hold of choice sequences as described above. Let $\alpha\in n$ denote the relation "the sequence $\alpha$ begins with the initial sequence $n$" for choice sequence $\alpha$ and finite segment $n$ (more specifically, $n$ will probably be an integer encoding a finite initial sequence).

We expect the following, called the ''axiom of open data'', to hold of all lawless sequences:
A(\alpha) \rightarrow \exists n alpha\in_n_\,\land\,_\forall\beta\in_n[A(\beta)
where_$A$_is_a_ alpha\in_n_\,\land\,_\forall\beta\in_n[A(\beta)
where_$A$_is_a_one-place_predicate">(\beta).html"_;"title="alpha\in_n_\,\land\,_\forall\beta\in_n[A(\beta)">alpha\in_n_\,\land\,_\forall\beta\in_n[A(\beta)
where_$A$_is_a_one-place_predicate.__The_intuitive_justification_for_this_axiom_is_as_follows:_in_intuitionistic_mathematics,_verification_that_$A$_holds_of_the_sequence_$\alpha$_is_given_as_a_algorithm.html" ;"title="one-place_predicate.html" ;"title="(\beta).html" ;"title="alpha\in n \,\land\, \forall\beta\in n[A(\beta)">alpha\in n \,\land\, \forall\beta\in n[A(\beta)
where $A$ is a one-place predicate">(\beta).html" ;"title="alpha\in n \,\land\, \forall\beta\in n[A(\beta)">alpha\in n \,\land\, \forall\beta\in n[A(\beta)
where $A$ is a one-place predicate. The intuitive justification for this axiom is as follows: in intuitionistic mathematics, verification that $A$ holds of the sequence $\alpha$ is given as a algorithm">procedure; at any point of execution of this procedure, we will have examined only a finite initial segment of the sequence. Intuitively, then, this axiom states that since, at any point of verifying that $A$ holds of $\alpha$, we will only have verified that $A$ holds for a finite initial sequence of $\alpha$; thus, it must be the case that $A$ also holds for any lawless sequence $\beta$ sharing this initial sequence. This is so because, at any point in the procedure of verifying $A(\alpha)$, for any such $\beta$ sharing the initial prefix of $\alpha$ encoded by $n$ that we have already examined, if we run the identical procedure on $\beta$, we will get the same result. The axiom can be generalized for any predicate taking an arbitrary number of arguments.

Another axiom is required for lawless sequences. The ''axiom of density'', given by:
$\forall n \, \exists \alpha [\alpha\in n]$
states that, for any finite prefix (encoded by) $n$, there is some sequence $\alpha$ beginning with that prefix. We require this axiom so as not to have any "holes" in the set of choice sequences. This axiom is the reason we require that arbitrarily long finite initial sequences of lawless choice sequences can be specified in advance; without this requirement, the axiom of density is not necessarily guaranteed.

See also

*

Notes

References

*

*

*

*

*

*

*

*

*

*

{{Refend

Constructivism (mathematics)