courseshub.world · Lives in Mathematics and Physics

L. E. J. Brouwer

Luitzen Egbertus Jan Brouwer

A course in two strands: the Dutch mathematician who founded modern topology in five years, then spent half a century rebuilding mathematics on the mind’s construction of it, and the theorems of both periods.

Born 27 February 1881, Overschie Died 2 December 1966, Blaricum Fixed point theorem 1909–1912 Level advanced undergraduate → graduate
The binary fan. Every infinite path of choices crosses the highlighted bar; the fan theorem says such a bar can be cut off at a uniform finite depth.
Lesson 00

How to use this course

L. E. J. Brouwer has two reputations that rarely meet. Topologists know him for the fixed point theorem, the degree of a map and the invariance of dimension, results proved between 1909 and 1913 that turned topology into a rigorous discipline. Logicians and philosophers know him as the founder of intuitionism, the view that mathematics is a mental construction and that the law of excluded middle is not valid for infinite domains. The two strands are connected. The topology made his name and gave him the standing to attack classical mathematics; the attack led him to doubt some of his own topological proofs.

Prerequisites for Part II
  • Point-set topology: compactness, connectedness, continuous maps.
  • For Lessons 04–06, a first course in algebraic topology (fundamental group, simplicial or singular homology) helps but is not required for the statements.
  • For Lessons 08–10, propositional and first-order logic and a little real analysis.

Each technical lesson opens with a paragraph for the general reader, then gives precise statements, proof sketches and exercises with folded solutions. Lessons 04–07 cover the topology; Lessons 08–10 cover intuitionism, moving from logic to the real numbers to Brouwer’s own theory of the continuum.

Reference

Timeline

1881Born 27 February in Overschie, now part of Rotterdam.
1897Passes the entrance examinations of the University of Amsterdam at the Haarlem gymnasium.
1904Master’s degree; first paper, on continuous motions in four-dimensional space. Marries Lize de Holl; they settle in Blaricum.
1905Leven, Kunst en Mystiek (Life, Art and Mysticism).
1907Doctorate under Diederik Korteweg: Over de grondslagen der wiskunde.
1908“De onbetrouwbaarheid der logische principes”: first public attack on the excluded middle. Speaks at the ICM in Rome.
1909Privaatdocent at Amsterdam. Meets Poincaré, Hadamard and Borel in Paris.
1911–12Invariance of dimension, the degree of a mapping, the fixed point theorem in all dimensions, invariance of domain, the Jordan curve theorem in \(n\) dimensions.
1912Elected to the Royal Netherlands Academy. Extraordinary professor at Amsterdam; inaugural lecture “Intuitionisme en formalisme”.
1913Ordinary professor. Paper on the natural notion of dimension.
1914Joins the editorial board of Mathematische Annalen.
1918–19Set theory independent of the excluded middle: choice sequences and spreads. Declines offers from Göttingen and Berlin.
1920Bad Nauheim lecture; the foundational quarrel with Hilbert begins.
1925Arend Heyting takes his doctorate under Brouwer.
1927“Über Definitionsbereiche von Funktionen”: the bar theorem, the fan theorem, uniform continuity.
1928Lectures in Vienna on 10 and 14 March; Gödel and Wittgenstein attend. Removed from the Annalen board.
1932Knight of the Order of the Netherlands Lion.
1934First volume of Compositio Mathematica, which he founded.
1948Foreign Member of the Royal Society. First papers on the creating subject.
1951Retires from his chair.
1966Dies 2 December in Blaricum, struck by a vehicle near his house, aged 85.
Part I · Formation
Lesson 01

Overschie to Amsterdam, 1881–1904

Luitzen Egbertus Jan Brouwer was born on 27 February 1881 in Overschie, a village now absorbed into Rotterdam. He was precocious: he finished secondary school in Hoorn at about fourteen. After the family moved to Haarlem he prepared for the university entrance examinations, which he passed at the Haarlem gymnasium in 1897.

At the University of Amsterdam he studied under Diederik Korteweg, the applied mathematician remembered for the Korteweg–de Vries equation. Korteweg recognised his talent quickly and encouraged him to publish his first research, on continuous motions in four-dimensional space, which appeared in the proceedings of the Royal Academy in 1904. The other teacher who mattered was Gerrit Mannoury, a philosopher-mathematician whose lectures introduced Brouwer to the foundations of mathematics and to questions about language and meaning.

Brouwer was also a young man of strong and unusual views on life. In 1905 he published Leven, Kunst en Mystiek, a short book of lectures that is mystical, pessimistic and fiercely critical of society, industry and the use of language to dominate others. It is hard reading, but it contains the seed of his later philosophy: the conviction that real knowledge lives in an individual mind, and that language and logic are only imperfect tools for communicating it.

In 1904 he married Lize de Holl, a divorcée with a daughter, who later qualified as a pharmacist. The couple settled in Blaricum, a village east of Amsterdam in the Gooi, where Brouwer would live for the rest of his life.

Lesson 02

The thesis and the unreliable logic, 1904–1909

Brouwer’s doctoral thesis, Over de grondslagen der wiskunde (On the foundations of mathematics), was defended in 1907. It builds mathematics from the intuition of time, includes a study of continuous groups related to Hilbert’s fifth problem, and criticises the logicism of Russell and the formalism of Hilbert, with some sympathy for Poincaré. Korteweg disliked the philosophical chapters and persuaded Brouwer to cut some of them.

The core idea is that mathematics is a free activity of the mind, independent of language. It begins with what Brouwer later called the primordial intuition: the experience of a moment of time falling apart into two, one remembered and one present. From this “two-ity” the mind builds the natural numbers, finite sequences and, more problematically, the continuum. Logic, on this view, is a description of regularities in the language used to report constructions, and it may fail when applied beyond the domain where it was observed.

The next year Brouwer drew the radical conclusion. In “De onbetrouwbaarheid der logische principes” (The unreliability of the logical principles, 1908) he argued that the law of excluded middle, \(A\vee\neg A\), is justified only for finite domains. For a statement about infinitely many natural numbers, asserting \(A\vee\neg A\) amounts to claiming that every such question can be settled, and nobody has a method for that. The paper attracted little attention at the time.

Meanwhile he travelled. He spoke at the International Congress of Mathematicians in Rome in 1908. In 1909 he met Poincaré, Jacques Hadamard and Émile Borel. Topology was in the air in Paris, and Brouwer decided to make his name with mathematics no one could dismiss.

Lesson 03

Five years of topology, 1909–1913

In 1909 Brouwer became a privaatdocent at Amsterdam and gave his inaugural lecture on the nature of geometry. Over the next four years he published a series of papers, many in Mathematische Annalen, that transformed what was then called analysis situs.

  • He introduced simplicial approximation: a continuous map between polyhedra can be replaced, up to small error, by a piecewise linear one, which can then be studied combinatorially.
  • With it he defined the degree of a continuous map between oriented manifolds of the same dimension (Lesson 04).
  • He proved the fixed point theorem for balls of every dimension (Lesson 05), having first treated the plane and three-space.
  • He proved that \(\mathbb R^m\) and \(\mathbb R^n\) are not homeomorphic for \(m\ne n\), and the stronger invariance of domain (Lesson 06).
  • He extended the Jordan curve theorem to \(n\) dimensions, and in 1913 proposed a topological definition of dimension (Lesson 07).

These were exactly the results that set theory and analysis needed. Georg Cantor had shown that a line and a plane have the same number of points, and Peano had found a continuous curve filling a square, so it was no longer obvious that dimension meant anything topological. Brouwer showed that it did.

Recognition followed fast. He was elected to the Royal Netherlands Academy of Arts and Sciences in 1912, at 31. The same year he was appointed extraordinary professor at Amsterdam, helped by a supporting letter from Hilbert, and gave his inaugural lecture “Intuitionisme en formalisme”, which set out his foundational programme in public. In 1913, after Korteweg resigned his chair, Brouwer became ordinary professor. With his reputation secure, he turned back to the foundations.

Part II · The mathematics
Lesson 04

The degree of a mapping

For the general reader. Wrap a rubber band around your finger twice: the band covers the finger twice in the same direction. Brouwer found a whole number that measures how many times a map wraps one sphere around another, counted with sign. The number does not change when the map is deformed, and it is the key to almost everything else he proved in topology.

Goals
  • Define the degree of a map between spheres, combinatorially and homologically.
  • Compute the degree of rotations, reflections and the antipodal map.
  • Prove the hairy ball theorem.

Two definitions

Let \(f:S^n\to S^n\) be continuous, \(n\ge1\). Brouwer’s definition: approximate \(f\) by a simplicial map \(g\) on fine triangulations. Pick a point \(y\) in the interior of an \(n\)-simplex of the target. Each \(n\)-simplex of the source mapped onto that simplex contributes \(+1\) if \(g\) preserves orientation on it and \(-1\) if it reverses it. The sum is independent of \(y\) and of the approximation. The modern definition uses homology: \(H_n(S^n;\mathbb Z)\cong\mathbb Z\), and \(f_*\) acts on it as multiplication by an integer \(\deg f\).

Theorem (Brouwer, 1911–12)

The degree has the following properties.

  1. If \(f\simeq g\) (homotopic), then \(\deg f=\deg g\).
  2. \(\deg(f\circ g)=\deg f\cdot\deg g\) and \(\deg(\mathrm{id})=1\).
  3. If \(f\) is not surjective, then \(\deg f=0\).
  4. A reflection \(r(x_0,\dots,x_n)=(-x_0,x_1,\dots,x_n)\) has degree \(-1\); hence the antipodal map \(a(x)=-x\) on \(S^n\) has degree \((-1)^{n+1}\).

Property 3 holds because a non-surjective map factors through \(S^n\setminus\{p\}\cong\mathbb R^n\), which is contractible. Property 4 follows from 2 because \(a\) is a composition of \(n+1\) reflections. Heinz Hopf proved the converse of property 1 in 1926: maps \(S^n\to S^n\) with equal degree are homotopic.

The hairy ball theorem

Hairy ball theorem (Brouwer 1912 for \(S^2\))

The sphere \(S^n\) admits a continuous nowhere-vanishing tangent vector field if and only if \(n\) is odd.

Proof. If \(v(x)\perp x\) and \(v(x)\ne0\), normalize to \(|v(x)|=1\). Then \(H(x,t)=\cos(\pi t)\,x+\sin(\pi t)\,v(x)\) lies on \(S^n\) and is a homotopy from \(\mathrm{id}\) to \(a\). So \(1=(-1)^{n+1}\) and \(n\) is odd. Conversely, for \(n=2k-1\) the field \(v(x_1,\dots,x_{2k})=(-x_2,x_1,-x_4,x_3,\dots)\) works.

Exercise 4.1Show that \(z\mapsto z^k\) on the unit circle \(S^1\subset\mathbb C\) has degree \(k\) for every integer \(k\), using the combinatorial definition (count preimages of a point with orientation).

Show solution
Take \(y=1\). For \(k\ne0\) its preimages are the \(|k|\) roots of unity \(e^{2\pi ij/k}\). Near each one, the map \(e^{i\theta}\mapsto e^{ik\theta}\) multiplies angle velocity by \(k\), so it preserves orientation if \(k>0\) and reverses it if \(k<0\). The signed count is \(|k|\cdot\operatorname{sgn}k=k\). For \(k=0\) the map is constant, so not surjective, and the degree is 0.

Exercise 4.2Let \(f:S^n\to S^n\) have no fixed point. Show \(f\simeq a\), and conclude \(\deg f=(-1)^{n+1}\). Deduce that every map \(S^{2m}\to S^{2m}\) of degree \(1\) has a fixed point.

Show solution
Since \(f(x)\ne x\), the segment from \(f(x)\) to \(-x\) never passes through 0. So \(H(x,t)=\dfrac{(1-t)f(x)-tx}{|(1-t)f(x)-tx|}\) is a homotopy from \(f\) to \(a\), and \(\deg f=\deg a=(-1)^{n+1}\). On an even-dimensional sphere this is \(-1\), so a map of degree 1 cannot be fixed-point free.
Lesson 05

The fixed point theorem

For the general reader. Stir a cup of coffee gently, without splashing, and let it settle. Some point of the liquid is exactly where it started. Crumple a map of a city and drop it on the floor of that city: some point on the map lies exactly over the place it represents. These are pictures of Brouwer’s fixed point theorem, one of the most widely used results in mathematics, from economics to differential equations.

Goals
  • State the fixed point theorem and reduce it to the no-retraction theorem.
  • Prove no-retraction with the degree, and the plane case with Sperner’s lemma.
  • Understand why Brouwer later rejected his own proof.
Theorem (Brouwer fixed point theorem)

Every continuous map \(f:D^n\to D^n\) of the closed unit ball in \(\mathbb R^n\) has a fixed point. The same holds for any space homeomorphic to \(D^n\), such as a compact convex subset of \(\mathbb R^n\) with non-empty interior.

The case \(n=3\) was proved by Piers Bohl in 1904, in a paper that went unnoticed, and the theorem is equivalent to results of Poincaré from the 1880s. Brouwer treated low dimensions in 1909 and the general case in 1911–12, in the paper “Über Abbildung von Mannigfaltigkeiten” where he introduced the degree. Hadamard gave an independent proof for all \(n\) in 1910, using the Kronecker index.

Reduction to no-retraction

Lemma (no retraction)

There is no continuous \(r:D^n\to S^{n-1}\) with \(r(x)=x\) for all \(x\in S^{n-1}\).

Proof. If \(r\) existed, then \(r\circ i=\mathrm{id}_{S^{n-1}}\), where \(i\) is the inclusion. Apply \(H_{n-1}\): the identity of \(\mathbb Z\) factors through \(H_{n-1}(D^n)=0\) (for \(n\ge2\)), which is absurd. For \(n=1\), \(D^1=[-1,1]\) is connected while \(S^0=\{\pm1\}\) is not.

Fixed point theorem from no-retraction. Suppose \(f(x)\ne x\) for all \(x\). Let \(r(x)\) be the point where the ray from \(f(x)\) through \(x\) leaves the ball. Explicitly \(r(x)=x+t(x)\,(x-f(x))\), with \(t(x)\ge0\) the non-negative root of \(|x+t(x-f(x))|^2=1\), which depends continuously on \(x\). Points of the boundary are sent to themselves, so \(r\) is a retraction, a contradiction.

A combinatorial proof

Sperner’s lemma (1928), dimension 2

Triangulate a triangle with vertices labelled 1, 2, 3. Label each vertex of the triangulation so that a vertex on the side between corners \(i\) and \(j\) gets label \(i\) or \(j\). Then the number of small triangles with all three labels is odd; in particular, at least one exists.

Given \(f\) on the triangle \(\Delta=\{x\in\mathbb R^3_{\ge0}:x_1+x_2+x_3=1\}\), label each vertex \(v\) by some \(i\) with \(f(v)_i<v_i\) (or with \(v_i>0\) if \(f(v)=v\)). This is a Sperner labelling. Refining the triangulation gives fully labelled triangles shrinking to a point \(x^*\), where by continuity \(f(x^*)_i\le x^*_i\) for all \(i\). Since the coordinates of both sum to 1, \(f(x^*)=x^*\).

Brouwer’s doubts

Both proofs show that a fixed point exists without showing how to find it to a prescribed accuracy, and from the intuitionistic standpoint of Lessons 08–10 the classical statement is not provable. Brouwer later disowned the theorem in its original form. Intuitionistically one can prove an approximate version: for every \(\varepsilon>0\) there is \(x\) with \(|f(x)-x|<\varepsilon\). The Sperner argument is effectively such a proof, and it underlies modern algorithms for computing economic equilibria.

Exercise 5.1Prove the case \(n=1\) directly from the intermediate value theorem.

Show solution
Let \(f:[-1,1]\to[-1,1]\) and \(g(x)=f(x)-x\). Then \(g(-1)=f(-1)+1\ge0\) and \(g(1)=f(1)-1\le0\). By the intermediate value theorem \(g(c)=0\) for some \(c\), so \(f(c)=c\).

Exercise 5.2Show that the fixed point property fails for the open ball, for the annulus, and for the unit ball of the Hilbert space \(\ell^2\). (Hint for the last: consider \(x\mapsto\big(\sqrt{1-\|x\|^2},x_1,x_2,\dots\big)\).)

Show solution
Open ball \((-1,1)\): \(x\mapsto(x+1)/2\) has fixed point only at 1, which is excluded. Annulus: a rotation by a small angle. In \(\ell^2\): \(f\) maps the closed unit ball to the unit sphere, since \(\|f(x)\|^2=1-\|x\|^2+\|x\|^2=1\). A fixed point would have \(\|x\|=1\), so \(x_1=\sqrt{1-1}=0\), then \(x_2=x_1=0\), and inductively \(x=0\), contradicting \(\|x\|=1\). Compactness is what fails in infinite dimensions.

Exercise 5.3Prove Sperner’s lemma in dimension 1: a segment from vertex 1 to vertex 2 is subdivided and its points labelled 1 or 2, with the left end 1 and the right end 2. Show the number of small segments labelled \(\{1,2\}\) is odd.

Show solution
Walk from left to right. The label starts at 1 and ends at 2, so it changes an odd number of times. Each change is exactly a small segment with labels \(\{1,2\}\). The two-dimensional proof counts, in each small triangle, the edges labelled \(\{1,2\}\), and reduces to this case on the boundary.
Lesson 06

Invariance of dimension and domain

For the general reader. Cantor proved that a line and a square contain the same number of points, and Peano drew a curve that passes through every point of a square. So can a line and a plane be the same space, just stretched? Brouwer proved that they cannot: no continuous, one-to-one, reversible deformation turns a space of one dimension into a space of another.

Goals
  • State invariance of domain and deduce invariance of dimension.
  • Sketch the proof via the Jordan–Brouwer separation theorem.
  • See why the result fails in infinite dimensions.
Theorem (Invariance of domain, Brouwer 1912)

Let \(U\subseteq\mathbb R^n\) be open and \(f:U\to\mathbb R^n\) continuous and injective. Then \(f(U)\) is open, and \(f\) is a homeomorphism of \(U\) onto \(f(U)\).

Corollary (Invariance of dimension, Brouwer 1911)

If non-empty open sets \(U\subseteq\mathbb R^m\) and \(V\subseteq\mathbb R^n\) are homeomorphic, then \(m=n\).

Brouwer proved invariance of dimension first, in “Beweis der Invarianz der Dimensionenzahl” (Math. Ann. 70, 1911), and invariance of domain in “Beweis der Invarianz des \(n\)-dimensionalen Gebiets” (Math. Ann. 71, 1912).

The separation theorem

Theorem (Jordan–Brouwer separation, 1912)

Let \(\Sigma\subset\mathbb R^n\) be homeomorphic to \(S^{n-1}\). Then \(\mathbb R^n\setminus\Sigma\) has exactly two connected components, one bounded and one unbounded, and \(\Sigma\) is the boundary of each. If \(B\subset\mathbb R^n\) is homeomorphic to \(D^k\), then \(\mathbb R^n\setminus B\) is connected.

In modern form both statements follow from Alexander duality, \(\tilde H_0(\mathbb R^n\setminus\Sigma)\cong\tilde H^{\,n-1}(\Sigma)\), which gives \(\mathbb Z\) for a sphere and 0 for a ball.

Invariance of domain from separation. Let \(x\in U\) and \(D\subset U\) a closed ball around \(x\) with boundary sphere \(S\). Then \(f(S)\) is a topological sphere, so \(\mathbb R^n\setminus f(S)\) has two components. The set \(f(\operatorname{int}D)\) is connected and disjoint from \(f(S)\), and \(\mathbb R^n\setminus f(D)\) is connected and unbounded by the ball case. Since \(\mathbb R^n\setminus f(S)=f(\operatorname{int}D)\cup(\mathbb R^n\setminus f(D))\) is a disjoint union of two connected sets, these must be the two components. So \(f(\operatorname{int}D)\) is the bounded component, which is open. Continuity of the inverse follows because \(f\) maps open sets to open sets.

Exercise 6.1Deduce invariance of dimension from invariance of domain.

Show solution
Suppose \(m<n\) and \(h:U\to V\) is a homeomorphism with \(U\subseteq\mathbb R^m\), \(V\subseteq\mathbb R^n\) open. Compose \(h^{-1}\) with the inclusion \(\mathbb R^m\hookrightarrow\mathbb R^n\), \(x\mapsto(x,0)\). This is a continuous injection \(V\to\mathbb R^n\), so by invariance of domain its image is open in \(\mathbb R^n\). But the image lies in the hyperplane \(\mathbb R^m\times\{0\}\), which has empty interior. Contradiction.

Exercise 6.2Show that invariance of domain fails in \(\ell^2\): the right shift \(S(x_1,x_2,\dots)=(0,x_1,x_2,\dots)\) is a continuous injection of \(\ell^2\) into itself whose image is not open.

Show solution
\(S\) is a linear isometry, hence continuous and injective. Its image is the closed subspace \(\{x:x_1=0\}\). Any ball around 0 contains \((\varepsilon,0,0,\dots)\), which is not in the image, so the image has empty interior.
Lesson 07

What is dimension?

For the general reader. A point has dimension 0, a curve 1, a surface 2. To make this precise for arbitrary spaces, Brouwer used a simple idea: a space has dimension \(n\) if pieces of it can be cut apart by walls of dimension \(n-1\). Points are cut by nothing, curves by points, surfaces by curves. The idea, refined by Pavel Urysohn and Karl Menger in the 1920s, became dimension theory.

Goals
  • Define inductive and covering dimension.
  • State the theorem that the \(n\)-cube has dimension \(n\).
  • Compute the dimension of some classical sets.

Brouwer’s definition (1913)

In “Über den natürlichen Dimensionsbegriff” (J. reine angew. Math. 142, 1913), Brouwer noticed that Poincaré’s earlier description of dimension by cuts was flawed, and proposed a corrected one based on separating closed sets. The version now standard, due to Urysohn and Menger independently, is the small inductive dimension.

Definition (small inductive dimension)

\(\operatorname{ind}\varnothing=-1\). For a regular space \(X\), \(\operatorname{ind}X\le n\) if every point has arbitrarily small open neighbourhoods \(U\) with \(\operatorname{ind}\partial U\le n-1\).

Definition (Lebesgue covering dimension)

\(\dim X\le n\) if every finite open cover of \(X\) has a finite open refinement in which every point lies in at most \(n+1\) sets.

Theorem (dimension of the cube; Lebesgue’s covering theorem)

\(\operatorname{ind}[0,1]^n=\dim[0,1]^n=n\). In particular, if the cube \([0,1]^n\) is covered by finitely many closed sets of sufficiently small diameter, some point lies in at least \(n+1\) of them.

Henri Lebesgue stated the covering property in 1911; Brouwer criticised the argument, and his own 1913 paper proved that the cube has dimension \(n\) in his sense. The lower bound \(\ge n\) is the hard part, and it is equivalent to the fixed point theorem: both follow from Sperner’s lemma. For separable metric spaces, \(\operatorname{ind}\), the large inductive dimension and \(\dim\) all coincide, a theorem of the 1920s and 1930s due to Urysohn, Menger, Hurewicz and others.

Brouwer took a direct interest in this work. Urysohn and Pavel Alexandrov visited him in Blaricum in 1924, shortly before Urysohn drowned while swimming in Brittany, and Menger and Witold Hurewicz both worked in Amsterdam in the following years.

Exercise 7.1Show that \(\operatorname{ind}\mathbb Q=0\) and that the Cantor set \(C\) has \(\operatorname{ind}C=0\).

Show solution
In \(\mathbb Q\), the sets \((x-r,x+r)\cap\mathbb Q\) with \(x\pm r\) irrational have empty boundary in \(\mathbb Q\), and they are arbitrarily small. In the Cantor set, the sets of points whose first \(k\) ternary digits are fixed are clopen, hence have empty boundary, and have diameter \(3^{-k}\). Empty boundary means \(\operatorname{ind}\le -1+1=0\); both spaces are non-empty, so the dimension is exactly 0.

Exercise 7.2Exhibit, for every \(\varepsilon>0\), a cover of the square \([0,1]^2\) by closed sets of diameter less than \(\varepsilon\) in which no point lies in more than 3 sets. (This shows the bound in the covering theorem is sharp for \(n=2\).)

Show solution
Use a brick-wall pattern: rows of rectangles of width \(\delta\) and height \(\delta/2\), with alternate rows shifted by \(\delta/2\). Each corner point is shared by at most three bricks, since vertical edges in adjacent rows do not line up. Take \(\delta\) small enough that the diagonal \(\delta\sqrt5/2\) is below \(\varepsilon\). A square grid would not do: its vertices lie in four squares.
Lesson 08

Intuitionistic logic

For the general reader. For Brouwer, to say that a statement is true is to say that you have a proof of it. Then “\(A\) or not \(A\)” means you either have a proof of \(A\) or a proof that \(A\) is impossible, and for many open problems you have neither. Brouwer refused to formalize this view, but his student Arend Heyting wrote down the logic that results, and it has turned out to be the logic of computation.

Goals
  • State the proof interpretation of the connectives.
  • Use Kripke models to show that a formula is not intuitionistically provable.
  • Understand Glivenko’s theorem and the double-negation translation.

The proof interpretation

Heyting (1930–34) and, independently in the form of a calculus of problems, Andrey Kolmogorov (1932) gave the meaning of the connectives by saying what counts as a proof. This is now called the Brouwer–Heyting–Kolmogorov (BHK) interpretation.

  • A proof of \(A\wedge B\) is a pair of proofs, one of \(A\) and one of \(B\).
  • A proof of \(A\vee B\) is a proof of \(A\) or a proof of \(B\), together with an indication of which.
  • A proof of \(A\to B\) is a construction transforming any proof of \(A\) into a proof of \(B\).
  • \(\bot\) has no proof, and \(\neg A\) abbreviates \(A\to\bot\).
  • A proof of \(\forall x\,A(x)\) is a construction giving, for each \(d\), a proof of \(A(d)\); a proof of \(\exists x\,A(x)\) is a pair \((d,p)\) with \(p\) a proof of \(A(d)\).

Heyting’s 1930 formal system, intuitionistic logic, is classical logic without the excluded middle \(A\vee\neg A\), or equivalently without double-negation elimination \(\neg\neg A\to A\).

Kripke semantics

A Kripke model is a partially ordered set of “stages of knowledge” \(w\), with atoms becoming true at some stage and staying true at all later stages. Forcing is defined by \(w\Vdash A\wedge B\) iff both hold; \(w\Vdash A\vee B\) iff one holds at \(w\); \(w\Vdash A\to B\) iff for all \(v\ge w\), \(v\Vdash A\) implies \(v\Vdash B\); and \(\bot\) is never forced.

Theorem (Kripke, 1965: soundness and completeness)

A propositional formula is provable in intuitionistic logic if and only if it is forced at every node of every Kripke model.

Theorem (Glivenko, 1929)

A propositional formula \(A\) is a classical tautology if and only if \(\neg\neg A\) is intuitionistically provable. In particular \(\neg A\) is classically provable iff it is intuitionistically provable.

For first-order logic and arithmetic, Gödel and Gentzen (1933) gave a translation that inserts double negations so that every classically provable formula becomes intuitionistically provable. Classical arithmetic is therefore consistent if intuitionistic arithmetic is.

Exercise 8.1Construct a two-node Kripke model in which \(p\vee\neg p\) and \(\neg\neg p\to p\) both fail at the root.

Show solution
Nodes \(w_0<w_1\), with \(p\) true at \(w_1\) only. At \(w_0\): \(p\) is not forced, and \(\neg p\) is not forced since \(w_1\ge w_0\) forces \(p\). So \(p\vee\neg p\) fails. \(\neg p\) fails at both nodes (at \(w_1\) because \(p\) holds), so \(\neg\neg p\) holds at \(w_0\), while \(p\) does not. So \(\neg\neg p\to p\) fails at \(w_0\).

Exercise 8.2Give intuitionistic proofs (BHK constructions) of \(\neg\neg(p\vee\neg p)\) and of \(\neg\neg\neg p\to\neg p\).

Show solution
For the first, let \(h\) be a proof of \(\neg(p\vee\neg p)\). Then \(\lambda x.\,h(\mathrm{inl}\,x)\) is a proof of \(\neg p\), so \(h(\mathrm{inr}(\lambda x.\,h(\mathrm{inl}\,x)))\) is a proof of \(\bot\). Thus \(\lambda h.\,h(\mathrm{inr}(\lambda x.\,h(\mathrm{inl}\,x)))\) proves \(\neg\neg(p\vee\neg p)\). For the second, given \(k:\neg\neg\neg p\) and \(x:p\), the term \(\lambda f.\,f\,x\) proves \(\neg\neg p\), so \(k(\lambda f.\,f\,x)\) proves \(\bot\). The proof is \(\lambda k.\,\lambda x.\,k(\lambda f.\,f\,x)\). Brouwer himself observed in the 1920s that triple negation reduces to single negation.
Lesson 09

Intuitionistic reals and weak counterexamples

For the general reader. Brouwer had a simple way to show that a classical theorem is unjustified. He built a specific number whose properties depend on an unsolved problem, such as whether a certain pattern of digits ever appears in \(\pi\). If the theorem gave a definite answer for this number, it would solve the problem. Such “weak counterexamples” do not refute the theorem; they show that no one is entitled to assert it.

Goals
  • Define real numbers as constructive Cauchy sequences and the apartness relation.
  • Build weak counterexamples to trichotomy and to the existence of decimal expansions.
  • Formulate the omniscience principles they rely on.

Reals and apartness

A real number is given by a sequence of rationals \((q_n)\) with a known rate of convergence, say \(|q_m-q_n|\le 2^{-m}+2^{-n}\). Two reals are equal if \(|q_n-r_n|\le 2^{1-n}\) for all \(n\). Brouwer introduced a positive notion of distinctness: \(x\) is apart from \(y\), written \(x\,\#\,y\), if we can find \(n\) with \(|q_n-r_n|>2^{1-n}\). Then \(x\,\#\,y\) implies \(x\ne y\), but the converse requires Markov’s principle, which Brouwer did not accept.

Weak counterexamples

Fix an open problem of the form \(\forall n\,P(n)\) with \(P\) decidable, for instance “no run of 100 consecutive 7s begins at position \(n\) of the decimal expansion of \(\pi\)”. Define

\[ a_n=\begin{cases}2^{-k}&\text{if }k\le n\text{ is least with }\neg P(k),\\ 0&\text{if }P(k)\text{ for all }k\le n.\end{cases} \]

The sequence is computable and converges at a known rate to a real \(a\ge0\), and \(a=0\) iff \(\forall n\,P(n)\).

Proposition (Brouwer, 1920s)

Intuitionistically, none of the following can be asserted for all reals \(x,y\):

  1. \(x=0\ \vee\ x\ne0\);
  2. \(x<y\ \vee\ x=y\ \vee\ x>y\) (trichotomy);
  3. \(x\le0\ \vee\ x\ge0\);
  4. every real has a decimal expansion.

Each would yield a method to decide open problems of the form \(\forall n\,P(n)\).

Later constructive mathematicians named the principles involved. The limited principle of omniscience (LPO) says that for every binary sequence, either all terms are 0 or some term is 1; it is equivalent to 1 and 2. The lesser principle (LLPO) is equivalent to 3. Statement 4 is the subject of Brouwer’s 1921 paper asking whether every real number has a decimal expansion. Note that \(\neg\neg(x\le 0\vee x\ge0)\) is provable: the counterexamples show unprovability, not falsity.

Exercise 9.1Using the real \(a\) above, show that \(a=0\vee a\ne0\) would decide \(\forall n\,P(n)\).

Show solution
If \(a=0\), then \(\forall n\,P(n)\): otherwise for the least \(k\) with \(\neg P(k)\) we have \(a=2^{-k}>0\). If \(a\ne0\), then \(\neg\forall n\,P(n)\), since \(\forall n\,P(n)\) would give \(a=0\). Either way the problem is settled.

Exercise 9.2Let \(b=\tfrac12+c\), where \(c=(-1)^k2^{-k}\) if \(k\) is the least \(n\) with \(\neg P(n)\), and \(c=0\) if there is none (built as a limit like \(a\)). Show that choosing the first decimal digit of \(b\) would tell us whether \(c\le0\) or \(c\ge0\), hence decide something we cannot decide.

Show solution
If \(c>0\) then \(b>\tfrac12\) and its first digit must be 5. If \(c<0\) then \(b<\tfrac12\) and the first digit must be 4. If \(c=0\) both 0.5000… and 0.4999… are expansions. So a first digit of 5 implies \(c\ge0\), and a digit of 4 implies \(c\le0\). Choosing a digit thus yields \(c\le0\vee c\ge0\), which tells us whether the first counterexample to \(P\), if any, occurs at an even or at an odd position. Brouwer’s 1921 example was of this kind.
Lesson 10

Choice sequences, fans and bars

For the general reader. How can a mind that builds everything step by step grasp the continuum? Brouwer’s answer was the choice sequence: an infinite sequence of numbers that is never complete, chosen one term at a time, possibly freely. A function defined on such sequences must give its answer after seeing only finitely many terms. From this observation Brouwer derived theorems that are false in classical mathematics, such as that every function on the unit interval is continuous.

Goals
  • Define spreads and fans and state the continuity principle.
  • State the fan theorem and the uniform continuity theorem.
  • See how the continuity principle refutes a form of the excluded middle.

Spreads and the continuity principle

Choice sequences first appear in a 1914 review; Brouwer’s systematic theory began with “Begründung der Mengenlehre unabhängig vom logischen Satz vom ausgeschlossenen Dritten” (1918–19). A spread is, roughly, a tree of finite sequences of natural numbers in which every node has at least one successor; its elements are the infinite paths, or choice sequences. A fan is a spread in which every node has finitely many successors, such as the binary fan \(2^{\mathbb N}\) of the hero picture. For a sequence \(\alpha\) write \(\bar\alpha n=\langle\alpha(0),\dots,\alpha(n-1)\rangle\).

Continuity principle (weak form)

If for every choice sequence \(\alpha\) there is a natural number \(m\) with \(A(\alpha,m)\), then for every \(\alpha\) there are \(m\) and \(n\) such that \(A(\beta,m)\) for every \(\beta\) with \(\bar\beta n=\bar\alpha n\).

The reason is that \(m\) must be produced at some finite stage of the construction of \(\alpha\), knowing only an initial segment.

Bars and the fan theorem

A set \(B\) of finite sequences is a bar on a spread if every element \(\alpha\) has some initial segment \(\bar\alpha n\in B\).

Fan theorem (Brouwer, 1924–27)

If \(B\) is a bar on a fan, then some finite subset of \(B\) is already a bar. Equivalently, there is \(N\) such that every element of the fan has an initial segment of length at most \(N\) in \(B\).

Brouwer derived it from the more general bar theorem, a principle of induction over well-founded trees: if \(B\) is a decidable bar on the universal spread \(\mathbb N^{\mathbb N}\), and a property \(Q\) holds on \(B\) and passes from all one-step extensions of a node to the node itself, then \(Q\) holds at the root. His justification analysed the possible form of a proof that \(B\) is a bar, and it remains one of the most debated arguments in the subject.

Uniform continuity theorem (Brouwer, 1927)

In intuitionistic analysis, every function \(f:[0,1]\to\mathbb R\) defined on the whole interval is uniformly continuous.

The proof represents \([0,1]\) as the image of a fan, applies the continuity principle to get pointwise continuity, then the fan theorem to make the modulus uniform. Classically the fan theorem is König’s lemma in contrapositive form, and the uniform continuity theorem is false for, say, the step function at \(\tfrac12\). Intuitionistically the step function is simply not a total function, because one cannot decide for every \(x\) whether \(x<\tfrac12\) or \(x\ge\tfrac12\) (Lesson 09).

The creating subject

From 1948 Brouwer used a further device: sequences that depend on the mathematician’s own future progress in research, such as “\(\alpha(n)=1\) if by stage \(n\) I have proved \(A\)”. Georg Kreisel formalized the idea in 1967, and Saul Kripke’s version, Kripke’s schema, combined with continuity principles yields strong counterexamples: statements of classical mathematics that are intuitionistically refutable, not merely unprovable.

Exercise 10.1Use the continuity principle to refute \(\forall\alpha\,(\alpha=\underline0\ \vee\ \alpha\ne\underline0)\), where \(\underline0\) is the constant sequence 0 and \(\alpha\) ranges over \(\mathbb N^{\mathbb N}\).

Show solution
From the disjunction, for every \(\alpha\) there is \(m\in\{0,1\}\) with \(m=0\) if \(\alpha=\underline0\) and \(m=1\) if \(\alpha\ne\underline0\). Apply the continuity principle at \(\alpha=\underline0\): we get \(m=0\) and \(n\) such that every \(\beta\) with \(\bar\beta n=\bar{\underline0}n\) gets the answer 0, so \(\beta=\underline0\). But \(\beta=(0,\dots,0,1,0,\dots)\) with the 1 at position \(n\) agrees with \(\underline0\) for \(n\) terms and is not \(\underline0\). Contradiction. So the universally quantified excluded middle is refuted, while each single instance remains unrefuted.

Exercise 10.2Prove the fan theorem for the binary fan classically, from compactness or König’s lemma. Then explain why the proof is not acceptable intuitionistically, using Kleene’s 1953 example of an infinite computable binary tree with no computable infinite path.

Show solution
Suppose no finite part of \(B\) is a bar. Then the tree \(T\) of nodes with no initial segment in \(B\) is infinite (for each \(N\), some node of length \(N\) avoids \(B\)). A finitely branching infinite tree has an infinite path (König): always step to a successor with infinitely many descendants. That path avoids \(B\), contradicting that \(B\) is a bar. The step “choose a successor with infinitely many descendants” is not effective. Kleene’s tree shows that in recursive mathematics the fan theorem fails: the complement of his tree, restricted to computable paths, is a computable bar with no finite sub-bar. Brouwer’s fan theorem holds for choice sequences, which are more than computable sequences.
Part III · Life and legacy
Lesson 11

The foundational quarrel, 1918–1929

After 1913 Brouwer published little topology. In 1918–19 he began the systematic reconstruction of set theory and analysis on intuitionistic lines, with choice sequences at the centre. He declined offers of chairs in Göttingen and Berlin in 1919 and stayed in Amsterdam, where he built up the mathematics library and drew foreign visitors.

The quarrel became public in 1920 with his lecture at Bad Nauheim. Hermann Weyl, Hilbert’s most brilliant former student, announced his support in “Über die neue Grundlagenkrise der Mathematik” (1921), with the line “Brouwer, that is the revolution!” Hilbert took the challenge as a threat to the mathematics of his generation. His response was a programme to prove the consistency of classical mathematics by finitary means, which he pursued with Paul Bernays and Wilhelm Ackermann through the 1920s. In a 1927 lecture he compared forbidding the excluded middle to taking the telescope from the astronomer. The dispute became known as the Grundlagenstreit.

Brouwer had his own circle. From 1922 to 1926 he took part in the Signific Circle with Mannoury and others, discussing language and meaning. His doctoral students included Bernardus Haalmeijer (1917), Maurits Belinfante (1923), Arend Heyting and Barend de Loor (1925), and later Frans Loonstra (1941) and Johanna Geldof (1951). Heyting’s formalization of intuitionistic logic, which won a prize of the Dutch Mathematical Society and appeared in 1930, made intuitionism accessible to logicians, although Brouwer himself thought formalization beside the point.

In March 1928 Brouwer lectured in Vienna. In the audience were the young Kurt Gödel and Ludwig Wittgenstein, who reportedly returned to philosophy after hearing him. The same year the conflict with Hilbert turned personal. In October 1928, Hilbert, seriously ill and fearing for the future of the Mathematische Annalen, wrote to Brouwer removing him from the editorial board. The procedure ignored the board’s rules. Einstein and Constantin Carathéodory protested; Einstein called the affair a frog-and-mouse war. The publisher resolved it by dissolving the board and re-forming it without Brouwer. He was deeply hurt and withdrew from much of international mathematics.

DiscussionGödel’s incompleteness theorems (1931) showed that Hilbert’s programme could not succeed in its original form. Did they vindicate Brouwer? Consider what each side claimed, and the Gödel–Gentzen translation of Lesson 08.

Lesson 12

Later years and legacy, 1929–1966

Brouwer founded a new journal, Compositio Mathematica, whose first volume appeared in 1934; it remains a leading journal. He received an honorary doctorate from Oslo in 1929 and was made a Knight of the Order of the Netherlands Lion in 1932. From 1935 to 1941 he sat on the municipal council of Blaricum.

During the German occupation the university was under pressure. Brouwer helped the resistance and supported Jewish students, but in 1943 he advised students to sign the loyalty declaration demanded by the occupiers so that they could complete their studies. After liberation he was briefly suspended from his post. He resumed his research programme in 1948 with the creating subject, and in the same year was elected a Foreign Member of the Royal Society. He lectured at Cambridge between 1946 and 1951, retired from his chair in 1951, and lectured in South Africa in 1952 and in the United States and Canada in 1953. Cambridge gave him an honorary doctorate in 1954.

His wife Lize died in 1959. Brouwer remained active and quarrelsome into old age. On 2 December 1966, aged 85, he was struck by a vehicle while crossing the street in front of his house in Blaricum and died.

Legacy

  • Topology: the degree, simplicial approximation, the fixed point theorem and invariance of domain are the first chapter of every course in algebraic topology. The fixed point theorem was extended by Lefschetz, Schauder and Kakutani and underlies existence theorems in differential equations and the equilibrium theorems of Nash, Arrow and Debreu.
  • Logic: intuitionistic logic, through the BHK interpretation, Kleene’s realizability and the Curry–Howard correspondence, became the logic of computation. Per Martin-Löf’s type theory and proof assistants such as Coq (now Rocq), Agda and Lean are built on it.
  • Constructive mathematics: Errett Bishop’s Foundations of Constructive Analysis (1967) showed that much of analysis can be done constructively without choice sequences; topos theory gave intuitionistic logic a geometric meaning.
  • Editions: his Collected Works appeared in two volumes, edited by Heyting (1975) and Hans Freudenthal (1976). Dirk van Dalen’s biography is the standard account of his life.

Final projectChoose either the fixed point theorem or invariance of domain. Write a two-page account for a strong undergraduate that states the theorem, gives a complete proof of one special case, and explains whether and how the statement can be made constructive.

Reference

Connections

People linked to L. E. J. Brouwer across this collection. A name without a link has no page here yet. See L. E. J. Brouwer in the network of all 337 lives →

Teachers and advisors

  • Diederik Korteweg 1907

Students

  • Arend Heyting 1925
  • Barend de Loor 1925
  • Bernardus Haalmeijer 1917
  • Frans Loonstra 1941
  • Johanna Geldof 1951
  • Maurits Belinfante 1923

Influenced by

Influenced

Colleagues and collaborators

Rivals

Friends

Also mentioned in this life

Fields

On CoursesHub

Reference

Sources and further reading

Biography

  1. J. J. O’Connor and E. F. Robertson, Luitzen Egbertus Jan Brouwer, MacTutor History of Mathematics.
  2. L. E. J. Brouwer, Wikipedia.
  3. M. van Atten, Luitzen Egbertus Jan Brouwer, Stanford Encyclopedia of Philosophy.
  4. L. E. J. Brouwer, Mathematics Genealogy Project.
  5. D. van Dalen, L. E. J. Brouwer: Topologist, Intuitionist, Philosopher, Springer, 2013.
  6. W. P. van Stigt, Brouwer’s Intuitionism, North-Holland, 1990.

Mathematics

  1. L. E. J. Brouwer, Beweis der Invarianz der Dimensionenzahl, Math. Ann. 70 (1911).
  2. L. E. J. Brouwer, Über Abbildung von Mannigfaltigkeiten, Math. Ann. 71 (1911–12).
  3. L. E. J. Brouwer, Beweis der Invarianz des \(n\)-dimensionalen Gebiets, Math. Ann. 71 (1912).
  4. L. E. J. Brouwer, Über den natürlichen Dimensionsbegriff, J. reine angew. Math. 142 (1913).
  5. L. E. J. Brouwer, Über Definitionsbereiche von Funktionen, Math. Ann. 97 (1927).
  6. L. E. J. Brouwer, Collected Works, vol. I (ed. A. Heyting), vol. II (ed. H. Freudenthal), North-Holland, 1975–76.
  7. A. Heyting, Intuitionism: An Introduction, North-Holland, 1956.
  8. A. S. Troelstra and D. van Dalen, Constructivism in Mathematics, 2 vols., North-Holland, 1988.
  9. Individual choice sequences: history, development and use, arXiv:2501.16067.
  10. A. Hatcher, Algebraic Topology, Cambridge, 2002 (degree, fixed points, invariance of domain).
  11. Brouwer fixed-point theorem, Wikipedia (history and proofs).