THE AXIOM OF CHOICE

We propose that failures of the axiom of choice, that is, surjective functions admitting no sections, can be reasonably classified by means of invariants borrowed from algebraic topology. We show that cohomology, when defined so that its usual exactness properties hold even in the absence of the axiom of choice, is adequate for detecting failures of this axiom in the following sense. If a set X, viewed as a discrete space, has trivial first cohomology for all coefficient groups, then every J-indexed family of nonempty sets has a choice function. We also obtain related results when the coefficient groups are required to be abelian or well-orderable. In particular, we show that, if all discrete spaces have trivial first cohomology for all abelian coefficient groups, then the axiom of choice holds. Introduction. The axiom of choice, in one of its many equivalent forms, asserts that, for any surjective function p, from a set Y onto a set X, there exists a section, i.e., a map s: X -» Y with/) ° s = idx. A formally similar concept, the existence (or, more often, nonexistence) of continuous sections for continuous surjections, is one of the central concerns of algebraic topology, and topologists have created an impressive arsenal of sophisticated tools for analyzing it. It therefore seems reasonable to try to use these tools to describe the ways in which the axiom of choice can fail. The sets and functions that are relevant to the axiom of choice can be viewed as topological spaces and continuous functions, and thus brought formally within the domain of algebraic topology, by simply giving all of the sets the discrete topology. An obvious difficulty with this project is that the homotopy, homology, and cohomology groups of discrete spaces all vanish, under the usual definitions, in all positive dimensions, whether or not the axiom of choice holds. One can circumvent this difficulty by using more exotic invariants, such as A-theory, but we shall adopt a more radical approach. We shall argue, in §1, that the usual definitions of cohomology are appropriate only in the presence of the axiom of choice; in its absence they fail to satisfy some simple exactness conditions. We therefore propose to adopt a definition of cohomology due to Giraud [3] which has the expected exactness properties even if the axiom of choice is false. With this definition, or indeed with any definition having a certain (rather tiny) amount of exactness, we can at least make a start on the project of using cohomology to describe failures of the axiom of Received by the editors October 7, 1981 and, in revised form, September 15, 1982. 1980 Mathematics Subject Classification. Primary 03E25, 55N99.

[1]  G. Hamel Eine Basis aller Zahlen und die unstetigen Lösungen der Funktionalgleichung:f(x+y)=f(x)+f(y) , 1905 .

[2]  B. Russell On Some Difficulties in the Theory of Transfinite Numbers and Order Types , 1907 .

[3]  F. Hausdorff,et al.  Bemerkung über den Inhalt von Punktmengen , 1914 .

[4]  B. Russell,et al.  Introduction to Mathematical Philosophy , 1920, The Mathematical Gazette.

[5]  Alfred Tajtebaum-Tarski Sur quelques théorèmes qui équivalent à l'axiome du choix , 1924 .

[6]  S. Banach,et al.  Sur la décomposition des ensembles de points en parties respectivement congruentes , 1924 .

[7]  D. Hilbert Über das Unendliche , 1926 .

[8]  M. Zorn A remark on method in transfinite algebra , 1935 .

[9]  M. Stone The theory of representations for Boolean algebras , 1936 .

[10]  K. Gödel Consistency-Proof for the Generalized Continuum-Hypothesis. , 1939, Proceedings of the National Academy of Sciences of the United States of America.

[11]  M. Stone,et al.  A General Theory of Spectra. I: I. , 1940, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Axiom of choice for finite sets. , 1945 .

[13]  Paul Bernays,et al.  A system of axiomatic set theory—Part I , 1937, Journal of Symbolic Logic.

[14]  J. Cooper,et al.  Elements de Mathematique. XV, Premiere Partie, Les Structures Fondamentales de L'Analyse , 1948, The Mathematical Gazette.

[15]  J. L. Kelley,et al.  The Tychonoff product theorem implies the axiom of choice , 1950 .

[16]  Gregorio Klimovsky El teorema de Zorn y la existencia de filtros e ideales maximales en los reticulados distributivos , 1958 .

[17]  R. L. Blair,et al.  The axiom of choice for finite sets , 1960 .

[18]  P. J. Cohen,et al.  THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS, II. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[19]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[20]  R. Solovay A model of set-theory in which every set of reals is Lebesgue measurable* , 1970 .

[21]  Jean Giraud,et al.  Cohomologie non abélienne , 1971 .

[22]  A. Leisenring Mathematical logic and Hilbert's ε-symbol , 1971 .

[23]  J. Bell,et al.  The Maximal Ideal Theorem for Lattices of Sets , 1972 .

[24]  J. Truss Finite axioms of choice , 1973 .

[25]  Paul E. Howard,et al.  Limitations on the Fraenkel-Mostowski method of independence proofs , 1973, Journal of Symbolic Logic.

[26]  R. Diaconescu Axiom of choice and complementation , 1975 .

[27]  J. Paris,et al.  The Type Theoretic Interpretation of Constructive Set Theory , 1978 .

[28]  P. T. Johnstone,et al.  Tychonoff's theorem without the axiom of choice , 1981 .

[29]  Gregory H. Moore Zermelo’s Axiom of Choice , 1982 .

[30]  P. Johnstone,et al.  The point of pointless topology , 1983 .

[31]  John L. Bell On the Strength of the Sikorski Extension Theorem for Boolean Algebras , 1983, J. Symb. Log..

[32]  Peter Aczel,et al.  The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions , 1986 .

[33]  A A Kirillov,et al.  On normed rings , 1987 .

[34]  John L. Bell,et al.  Toposes and local set theories - an introduction , 1988 .

[35]  F. Borceux,et al.  Boolean-algebras in a Localic Topos , 1990 .

[36]  V. M. Tikhomirov On Rings of Continuous Functions on Topological Spaces , 1991 .

[37]  W. Just,et al.  Versions of the Axiom of Choice , 1995 .

[38]  John L. Bell,et al.  Boolean Algebras and Distributive Lattices Treated Constructively , 1999, Math. Log. Q..

[39]  Peter Aczel,et al.  Collection Principles in Dependent Type Theory , 2000, TYPES.

[40]  Andrew M. Pitts,et al.  Categorical logic , 2001, LICS 2001.

[41]  Silvio Valentini,et al.  Extensionality Versus Constructivity , 2002, Math. Log. Q..

[42]  Maria Emilia Maietti,et al.  Modular correspondence between dependent type theories and categories including pretopoi and topoi , 2005, Mathematical Structures in Computer Science.