Spread (intuitionism)

In intuitionistic mathematics, a spread is a particular kind of species of infinite sequences defined via finite decidable properties. Here a species is a collection, a notion similar to a classical set in that a species is determined by its members.

History

The notion of spread was first proposed by L. E. J. Brouwer (1918B), and was used to define the continuum. As his ideas were developed, the use of spreads became common in intuitionistic mathematics, especially when dealing with choice sequences and intuitionistic analysis (see Dummett 77, Troelstra 77). In the latter, real numbers are represented by the dressed spreads of natural numbers or integers.

The more restricted so called fans are of particular interest in the intuitionistic foundations of mathematics. There, their main use is in the discussion of the fan theorem (which is about bars, not discussed here), itself a result used in the derivation of the uniform continuity theorem.

Definitions

Overview

In modern terminology, a spread is an inhabited closed set of sequences. Spreads are defined via a spread function, which performs a (decidable) "check" on finite sequences. If all the finite initial parts of an infinite sequence satisfy a spread function's "check", then we say that the infinite sequence is admissible to the spread. The notion of a spread and its spread function are interchangeable in the literature. Graph theoretically, one may think of a spread in terms of a rooted, directed tree with numerical vertex labels. A fan, also known as finitary spread, is a special type of spread. In graph terms, it is finitely branching. Finally, a dressed spread is a spread together some function acting on finite sequences.

Preliminary notation and terminology

This article uses "${\displaystyle \langle }$" and "${\displaystyle \rangle }$" to denote the beginning resp. the end of a sequence. The sequence with no elements, the so called empty sequence, is denoted by ${\displaystyle \langle \rangle }$.

Given an infinite sequence ${\displaystyle \langle x_{1},x_{2},\ldots \rangle }$, we say that the finite sequence ${\displaystyle \langle y_{1},y_{2},\ldots ,y_{i}\rangle }$ is an initial segment of ${\displaystyle \langle x_{1},x_{2},\ldots \rangle }$ if and only if ${\displaystyle x_{1}=y_{1}}$ and ${\displaystyle x_{2}=y_{2}}$ and ... and ${\displaystyle x_{i}=y_{i}}$.

Spread function

A spread function${\displaystyle s}$ is a function on finite sequences that satisfies the following properties:

• Given any finite sequence ${\displaystyle \langle x_{1},x_{2},\ldots ,x_{i}\rangle }$ either ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=0}$ or ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=1}$. In other words, the property being tested must be decidable via ${\displaystyle s}$.
• ${\displaystyle s(\langle \rangle )=0}$.
• Given any finite sequence ${\displaystyle \langle x_{1},x_{2},\ldots ,x_{i}\rangle }$ such that ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=0}$, there exist some ${\displaystyle k}$ such that ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i},k\rangle )=0}$.

Given a finite sequence, if ${\displaystyle s}$ returns 0, the sequence is admissible to the spread given through ${\displaystyle s}$, and otherwise it is inadmissible. The empty sequence is admissible and so part of every spread. Every finite sequence in the spread can be extended to another finite sequence in the spread by adding an extra element to the end of the sequence. In that way, the spread function acts as a characteristic function accepting many long finite sequences.

We also say that an infinite sequence ${\displaystyle \langle x_{1},x_{2},\ldots \rangle }$ is admissible to a spread defined by spread function ${\displaystyle s}$ if and only if every initial segment of ${\displaystyle \langle x_{1},x_{2},\ldots \rangle }$ is admissible to ${\displaystyle s}$. For example, for a predicate characterizing a law-like, unending sequence of numbers, one may validate that it is admissible with respect to some spread function.

Fan

Informally, a spread function ${\displaystyle s}$ defines a fan if, given a finite sequence admissible to the spread, there are only finitely many possible values that we can add to the end of this sequence such that our new extended finite sequence is admissible to the spread. Alternatively, we can say that there is an upper bound on the value for each element of any sequence admissible to the spread. Formally:

• A spread function ${\displaystyle s}$ defines a fan if and only if given any sequence admissible to the spread ${\displaystyle \langle x_{1},x_{2},\ldots ,x_{i}\rangle }$, then there exists some ${\displaystyle k}$ such that, given any ${\displaystyle j>k}$ then ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i},j\rangle )=1}$

So given a sequence admissible to the fan, we have only finitely many possible extensions that are also admissible to the fan, and we know the maximal element we may append to our admissible sequence such that the extension remains admissible.

Examples

Spreads

Simple examples of spreads include

• The set of sequences of even numbers
• The set of sequences of the integers 1–6
• The set of sequences of valid terminal commands.^{[ clarification needed ]}

Fans

• The set of sequences of legal chess moves
• The set of infinite binary sequences
• The set of sequences of letters

What follows are two spreads commonly used in the literature.

The universal spread (the continuum)

Given any finite sequence ${\displaystyle \langle x_{1},x_{2},\ldots ,x_{i}\rangle }$, we have ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=0}$. In other words, this is the spread containing all possible sequences. This spread is often used to represent the collection of all choice sequences.

The binary spread

Given any finite sequence ${\displaystyle \langle x_{1},x_{2},\ldots ,x_{i}\rangle }$, if all of our elements (${\displaystyle x_{1},x_{2},\ldots ,x_{i}}$) are 0 or 1 then ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=0}$, otherwise ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=1}$. In other words, this is the spread containing all binary sequences.

Dressed spreads

An example of a dressed spread is the spread of integers such that ${\displaystyle s(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=0}$ if and only if

${\displaystyle \forall y.(0<y\leq i)\to {\big (}(x_{i}=0)\lor (x_{i}=2\cdot x_{y-1}\pm 1){\big )}}$,

together with the function ${\displaystyle f(\langle x_{1},x_{2},\ldots ,x_{i}\rangle )=x_{i}\cdot 2^{2-i}}$. This represents the real numbers.

See also

• Bar induction
• Choice sequence
• Constructive analysis

References

• L. E. J. Brouwer Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten. Erster Teil, Allgemeine Mengenlehre, KNAW Verhandelingen, 5: 1–43 (1918A)
• Michael Dummett Elements of Intuitionism, Oxford University Press (1977)
• A. S. Troelstra Choice Sequences: A Chapter of Intuitionistic Mathematics, Clarendon Press (1977)