Misplaced Pages

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (May 2017) (Learn how and when to remove this message)

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. The axiom, 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 of this axiom are explored in inner model theory.

Implications

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, the negation of Suslin's hypothesis, and the existence of an analytical (in fact, ${\displaystyle \Delta _{2}^{1}}$) 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 L. While L does contain the initial ordinals of those large cardinals (when they exist in a supermodel of L), and they are still initial ordinals in L, 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. This is in part because it seems unnecessarily "restrictive", as it allows only certain subsets of a given set (for example, ${\displaystyle 0^{\sharp }\subseteq \omega }$ can't exist), 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

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:

• John Addison's ${\displaystyle \Sigma _{2}^{1}}$ formula ${\displaystyle {\textrm {Constr}}(X)}$ such that ${\displaystyle {\mathcal {P}}(\omega )\vDash {\textrm {Constr}}(X)}$ iff ${\displaystyle X\in {\mathcal {P}}(\omega )\cap L}$, i.e. ${\displaystyle X}$ is a constructible real.

• There is a ${\displaystyle \Pi _{3}^{1}}$ formula known as the "analytical form of the axiom of constructibility" that has some associations to the set-theoretic axiom V=L. For example, some cases where ${\displaystyle M\vDash {\textrm {V=L}}}$ iff ${\displaystyle M\cap {\mathcal {P}}(\omega )\vDash {\textrm {Analytical}}\;{\textrm {form}}\;{\textrm {of}}\;{\textrm {V=L}}}$ have been given.

Significance

The major significance of the axiom of constructibility is in Kurt Gödel's 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 ${\displaystyle V=L}$ is relatively consistent (i.e. if ${\displaystyle ZFC+(V=L)}$ can prove a contradiction, then so can ${\displaystyle ZF}$), and that in ${\displaystyle ZF}$

${\displaystyle V=L\implies AC\land GCH,}$

thereby establishing that AC and GCH are also relatively consistent.

Gödel's proof was complemented in later years by Paul Cohen's result that both AC and GCH are independent, i.e. that the negations of these axioms (${\displaystyle \lnot AC}$ and ${\displaystyle \lnot GCH}$) are also relatively consistent to ZF set theory.

Statements true in L

This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (November 2017) (Learn how and when to remove this message)

Here is a list of propositions that hold in the constructible universe (denoted by L):

• The generalized continuum hypothesis and as a consequence
  • The axiom of choice
• Diamondsuit
  • Clubsuit
• Global square
• The existence of morasses
• The negation of the Suslin hypothesis
• 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 ${\displaystyle \Delta _{2}^{1}}$ set of reals (in the analytical hierarchy) that is not measurable.
• The truth of Whitehead's conjecture that every abelian group A with Ext(A, Z) = 0 is a free abelian group.
• The existence of a definable well-order of all sets (the formula for which can be given explicitly). In particular, L satisfies V=HOD.
• The existence of a primitive recursive class surjection ${\displaystyle F:{\textrm {Ord}}\to {\textrm {V}}}$, i.e. a class function from Ord whose range contains all sets.

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

1. 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.
2. "Before Silver, many mathematicians believed that ${\displaystyle V\neq L}$, but after Silver they knew why." - from P. Maddy (1988), "Believing the Axioms. I" (PDF), The Journal of Symbolic Logic, 53, p. 506
3. W. Marek, Observations Concerning Elementary Extensions of ω-models. II (1973, p.227). Accessed 2021 November 3.
4. W. Marek, ω-models of second-order arithmetic and admissible sets (1975, p.105). Accessed 2021 November 3.
5. ^ W. Marek, Stable sets, a characterization of β₂-models of full second-order arithmetic and some related facts (pp.176--177). Accessed 2021 November 3.
6. 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

• How many real numbers are there?, Keith Devlin, Mathematical Association of America, June 2001

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

• Axioms of set theory
• Constructible universe