Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-13T09:26:08.850Z Has data issue: false hasContentIssue false

An intuitionistic proof of Tychonoff's theorem

Published online by Cambridge University Press:  12 March 2014

Thierry Coquand*
Affiliation:
Institutionen för Informationsbehandling, Chalmers Tekniska Högskola och Göteborgs Universitet, 412 96 Göteborg, Sweden
*
Institut National de Recherche en Informatique et en Automatique, 78153 Le Chesney, France, E-mail: [email protected]

Extract

Tychonoff's theorem states that a product of compact spaces is compact. In [3], P. Johnstone presents a proof of Tychonoff's theorem in a “localic” framework. The surprise is that the point-free formulation of Tychonoff's theorem is provable without the axiom of choice, whereas in the usual formulation it is equivalent to the axiom of choice (see Kelley [5]).

The proof given in [3], however, is classical and seems to use the replacement axiom of Zermelo-Fraenkel. The aim of this paper is to present what we believe to be a more direct proof, which is intuitionistic and can be proved using as primitive only the notion of inductive definition, as it is for instance presented in Martin-Löf [6]. One main point of the paper is to show that the theory of locales can be developed rather naturally in the framework of inductive definitions. We think that our arguments can be presented in the constructive set theory of Aczel [2].

The paper is organized as follows. In §1 we show the argument in the case of a product of two spaces. This proof has a direct generalisation to the case of a product over a set with a decidable equality.

§1. Product of two spaces. We first recall a possible definition of a point-free space (see Johnstone [3] or Vickers [10]). It is a poset (X, ≤), together with a meet operation ab, written multiplicatively, and, for each aX, a set Cov(a) of subsets of {xXxa}. We ask that if MCov(a) and ba, then {bssM} ∈ Cov(b). This property of Cov will be called the axiom of covering. The elements of Cov(u) are called basic covers of uX.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Aczel, P., An introduction to inductive definition, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, 1977, pp. 739782.CrossRefGoogle Scholar
[2]Aczel, P., The type theoretic interpretation of constructive set theory: inductive definitions, Logic, methodology and philosophy of science. VII (Marcus, B.et al., editors), North-Holland, Amsterdam, 1986, pp. 1749.Google Scholar
[3]Johnstone, P. J., Stone spaces, Cambridge University Press, Cambridge, 1982.Google Scholar
[4]Johnstone, P. J. and Vickers, S., Preframe presentations present, preprint, 1990.CrossRefGoogle Scholar
[5]Kelley, J. L., The Tychonoff product theorem implies the axiom of choice, Fundamenta Mathematicae, vol. 37 (1950), pp. 7576.CrossRefGoogle Scholar
[6]Martin-Löf, P., Hauptsatz for the intuitionistic theory of iterated inductive definitions, Proceedings of the second Scandinavian logic symposium (Fenstad, J. E., editor), North-Holland, Amsterdam, 1971, pp. 179216.CrossRefGoogle Scholar
[7]Sambin, G., Intuitionistic formal space—a first communication, Mathematical logic and its applications (Skordev, G., editor), Plenum Press, New York, 1987, pp. 187204.CrossRefGoogle Scholar
[8]Troelstra, A. S., Choice sequences: a chapter of intuitionistic mathematics, Clarendon Press, Oxford, 1977.Google Scholar
[9]Vermeulen, J. J. C., Tychonoff's theorem in a topos, preprint, 1990.Google Scholar
[10]Vickers, S., Topology via logic, Cambridge Tracts in Theoretical Computer Science, vol. 5, Cambridge University Press, Cambridge, 1989.Google Scholar