// Workers AI · dad joke modeIs the axiom of constructibility a builder? It constructs its own proof.
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (May 2017) |
The axiom of constructibility is a possible axiom for set theory in mathematics that asserts that every set is constructible. The axiom is usually written as V = L, where represents the von Neumann universe of all well-founded sets, and represents the constructible sets. In Zermelo–Fraenkel set theory (ZF), the property of being constructible is expressible as a single formula , and every set is in , so the axiom can be written in the language of ZF in the form .
The axiom of constructibility, first investigated by Kurt Gödel, is inconsistent with the proposition that zero sharp exists and stronger large cardinal axioms (see list of large cardinal properties). Generalizations (i.e. weaker versions) of this axiom are explored in inner model theory.[1]
Implications
[edit]The axiom of constructibility implies the axiom of choice (AC), given Zermelo–Fraenkel set theory without the axiom of choice (ZF). It also settles many natural mathematical questions that are independent of Zermelo–Fraenkel set theory with the axiom of choice (ZFC); for example, the axiom of constructibility implies the generalized continuum hypothesis,[2] the negation of Suslin's hypothesis, and the existence of an analytical (in fact, ) non-measurable set of real numbers, all of which are independent of ZFC.
The axiom of constructibility implies the non-existence of those large cardinals with consistency strength greater or equal to 0#, which includes some "relatively small" large cardinals. For example, no cardinal can be -Erdős in . While does contain the initial ordinals of those large cardinals (when they exist in a supermodel of ), and they are still initial ordinals in , it excludes the auxiliary structures (e.g. measures) that endow those cardinals with their large cardinal properties.
Although the axiom of constructibility does resolve many set-theoretic questions, it is not typically accepted as an axiom for set theory in the same way as the ZFC axioms. Among set theorists of a realist bent, who believe that the axiom of constructibility is either true or false, most believe that it is false.[3] This is in part because it seems unnecessarily "restrictive", as it allows only certain subsets of a given set (for example, can't exist),[citation needed] with no clear reason to believe that these are all of them. In part it is because the axiom is contradicted by sufficiently strong large cardinal axioms. This point of view is especially associated with the Cabal, or the "California school" as Saharon Shelah would have it.
In arithmetic
[edit]Especially from the 1950s to the 1970s, there have been some investigations into formulating an analogue of the axiom of constructibility for subsystems of second-order arithmetic. A few results stand out in the study of such analogues:
Significance
[edit]The major significance of the axiom of constructibility is in Kurt Gödel's 1938 proof of the relative consistency of the axiom of choice and the generalized continuum hypothesis to Von Neumann–Bernays–Gödel set theory. (The proof carries over to Zermelo–Fraenkel set theory, which has become more prevalent in recent years.)
Namely Gödel proved that is relatively consistent (i.e., if can prove a contradiction, then so can ), and that in
thereby establishing that AC and GCH are also relatively consistent.[2]
Gödel's proof was complemented in 1962 by Paul Cohen's result that both AC and GCH are independent, i.e., that the negations of these axioms ( and ) are also relatively consistent to ZF set theory.
Statements true in L
[edit]Here is a list of propositions that hold in the constructible universe (denoted by ):
- The existence of a definable well-order of all sets (the formula for which can be given explicitly), and as consequences
- The existence of a definable global choice function, and thus the axiom of choice
- Every set is an ordinal definable set (V=HOD)
- The generalized continuum hypothesis[2]
- Jensen's diamond principles ◊, ◊*, and ◊+ (and hence also Ostaszewski's club principle ♣)
- The negation of the Suslin hypothesis[7]
- Global square
- The existence of morasses
- The non-existence of 0# and as a consequence
- The non existence of all large cardinals that imply the existence of a measurable cardinal
- The existence of a set of reals (in the analytical hierarchy) that is not measurable.
- The truth of Whitehead's conjecture that every abelian group with is a free abelian group, where is the Ext functor.
- The existence of a primitive recursive class surjection , i.e., a class function from whose range contains all sets. [8]
Accepting the axiom of constructibility (which asserts that every set is constructible) these propositions also hold in the von Neumann universe, resolving many propositions in set theory and some interesting questions in analysis.
References
[edit]- ↑ Hamkins, Joel David (February 27, 2015). "Embeddings of the universe into the constructible universe, current state of knowledge, CUNY Set Theory Seminar, March 2015". jdh.hamkins.org. Archived from the original on April 23, 2024. Retrieved September 22, 2024.
- 1 2 3 Gödel, Kurt (1940). The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory. Annals of Mathematics Studies (No. 3). Princeton, N.J.: Princeton University Press – via Internet Archive.
- ↑ "Before Silver, many mathematicians believed that , but after Silver they knew why." - from P. Maddy (1988), "Believing the Axioms. I" (PDF), The Journal of Symbolic Logic, 53, p. 506
- ↑ W. Marek, Observations Concerning Elementary Extensions of ω-models. II (1973, p.227). Accessed 2021 November 3.
- ↑ W. Marek, ω-models of second-order arithmetic and admissible sets (1975, p.105). Accessed 2021 November 3.
- 1 2 W. Marek, Stable sets, a characterization of β₂-models of full second-order arithmetic and some related facts (pp.176--177). Accessed 2021 November 3.
- ↑ Rinot, Assaf (2011). "Jensen's diamond principle and its relatives". In Babinkostova, Liljana; Caicedo, Andrés E.; Geschke, Stefan; Scheepers, Marion (eds.). Set Theory and Its Applications (PDF). Contemporary Mathematics. Vol. 533. Providence, RI: American Mathematical Society. pp. 125–156. arXiv:0911.2151. doi:10.1090/conm/533. ISBN 978-0-8218-4812-8.
- ↑ W. Richter, P. Aczel, Inductive Definitions and Reflecting Properties of Admissible Ordinals (1974, p.23). Accessed 30 August 2022.
- Devlin, Keith (1984). Constructibility. Springer-Verlag. ISBN 3-540-13258-9.
External links
[edit]- How many real numbers are there?, Keith Devlin, Mathematical Association of America, June 2001