Constructivism (philosophy of mathematics)

This article is about constructivism in the philosophy of mathematics, not about what is called constructivism in the philosophy of education. For that and other meanings of the word, see constructivism.

In the philosophy of mathematics, constructivism asserts that it is necessary to find (or "construct") a mathematical object to prove that it exists. When one assumes that an object does not exist and derives a contradiction from that assumption, one still has not found the object and therefore not proved its existence, according to constructivists. See constructive proof.

Constructivism is often confused with intuitionism, but in fact, intuitionism is only one kind of constructivism. Intuitionism maintains that the foundations of mathematics lie in the individual mathematician's intuition, thereby making mathematics into an intrinsically subjective activity. Constructivism does not, and is entirely consonant with an objective view of mathematics.

Constructivist mathematics

Constructivist mathematics uses constructivist logic, which is essentially a removal of the law of the excluded middle from classical logic. By removing this law, the remaining logical system has an existence property which classical logic does not: whenever $\exists _{x\in X}P(x)$ is proven constructively, then in fact $P(a)$ is proven constructively for (at least) one particular $a\in X$ . Thus the proof of the existence of a mathematical object is tied to the possibility of its construction.

This is not to say that the law of the excluded middle is denied entirely. In fact, special cases of the law will be provable as theorems (for instance, in Heyting arithmetic, $\forall x,y\in \mathbb {N} :x=y\vee x\neq y$ is a theorem). It is just that the law is not assumed as an axiom.

Example from real analysis

In classical real analysis, one way to define a real number is as a Cauchy sequence of rational numbers.

In constructive mathematics, one way to construct a real number is as a function $f$ that takes a positive integer $n$ and outputs a rational $f(n)$ , together with a function $g$ that takes a positive integer $n$ and outputs a positive integer $g(n)$ such that

\forall n:\forall i,j\geq g(n):|f(i)-f(j)|\leq {1 \over n}

so that as $n$ increases, the values of $f(n)$ get closer and closer together. We can use $f$ and $g$ together to compute as close a rational approximation as we like to the real number they represent.

Under this definition, a simple representation of the real number e is:

f(n)=\sum _{i=0}^{n}{1 \over n!},g(n)=n

This definition corresponds to the classical definition using Cauchy sequences, except with a constructive twist: for a classical Cauchy sequence, it is required that, for any given distance, there exists (in a classical sense) a member in the sequence after which all members are closer together than that distance. In the constructive version, it is required that, for any given distance, it is possible to actually specify the point in the sequence where this happens (this required specification is often called the modulus of convergence). In fact, the standard constructive interpretation of the mathematical statement

\forall n:\exists m:\forall i,j\geq m:|f(i)-f(j)|\leq {1 \over n}

is precisely the existence of the function computing the modulus of convergence. Thus the difference between the two definitions of real numbers can be thought of as the difference in the interpretation of the statement "for all... there exists..."

This then opens the question as to what sort of function from a countable set to a countable set, such as f and g above, can actually be constructed. Different versions of constructivism diverge on this point. Constructions can be defined as broadly as free choice sequences, which is the intuitionistic view, or as narrowly as algorithms (or more technically, the recursive functions), or even left unspecified. If, for instance, the algorithmic view is taken, then the reals as constructed here are essentially what classically would be called the computable numbers.

Cardinality

To take the algorithmic interpretation above would seem at odds with classical notions of cardinality. By enumerating algorithms, we can show classically that the computable numbers are countable. And yet Cantor's diagonal argument shows that real numbers have higher cardinality. Furthermore the diagonal argument seems perfectly constructive. To identify the real numbers with the computable numbers would then be a contradiction.

And in fact, Cantor's diagonal argument is constructive, in the sense that given a bijection between the real numbers and natural numbers, one constructs a real number which doesn't fit, and thereby proves a contradiction. We can indeed enumerate algorithms to construct a function T from the natural numbers onto the reals. But, to each algorithm, there may or may not correspond a real number, as the algorithm may fail to satisfy the constraints, or even be non-terminating (T is a partial function), so this fails to produce the required bijection.

Still, one might expect that since T is a partial function from the natural numbers onto the real numbers, that therefore the real numbers are no more than countable. And, since every natural number can be trivially represented as a real number, therefore the real numbers are no less than countable. They are, therefore exactly countable. However this reasoning is not constructive, as it still does not construct the required bijection. In fact the cardinality of sets fails to be totally ordered (see Cantor–Bernstein–Schroeder theorem).

Attitude of mathematicians

Traditionally, mathematicians have been suspicious, if not downright antagonistic, towards mathematical constructivism, largely because of the limitations that it poses for constructive analysis. These views were forcefully expressed by David Hilbert in 1928, when he wrote in Die Grundlagen der Mathematik, "Taking the principle of excluded middle from the mathematician would be the same, say, as proscribing the telescope to the astronomer or to the boxer the use of his fists" [1]. (The law of excluded middle is not valid in constructivist logic.) Errett Bishop, in his 1967 work Foundations of Constructive Analysis, worked to dispel these fears by developing a great deal of traditional analysis in a constructive framework. Nevertheless, not every mathematician accepts that Bishop did so successfully, since his book is necessarily more complicated than a classical analysis text would be. In any case, most mathematicians see no need to restrict themselves to constructivist methods, even if this can be done.

[1] Translation from the Stanford Encyclopedia of Philosophy, http://plato.stanford.edu/entries/mathematics-constructive/.

Mathematicians who have contributed to constructivism

Errett Bishop
Paul Lorenzen
Leopold Kronecker (old constructivism)
L.E.J. Brouwer (intuitionism)

Branches

External links