List of statements independent of ZFC

The mathematical statements discussed below are provably independent of ZFC (the canonical axiomatic set theory of contemporary mathematics, consisting of the Zermelo–Fraenkel axioms plus the axiom of choice), assuming that ZFC is consistent. A statement is independent of ZFC (sometimes phrased "undecidable in ZFC") if it can neither be proven nor disproven from the axioms of ZFC.

## Axiomatic set theory[edit]

Further information: Axiomatic set theory

In 1931, Kurt Gödel proved the first ZFC independence result, namely that the consistency of ZFC itself was independent of ZFC (Gödel's second incompleteness theorem).

The following statements are independent of ZFC, among others:

* the consistency of ZFC;
* the continuum hypothesis or CH (Gödel produced a model of ZFC in which CH is true, showing that CH cannot be disproven in ZFC; Paul Cohen later invented the method of forcing to exhibit a model of ZFC in which CH fails, showing that CH cannot be proven in ZFC. The following four independence results are also due to Gödel/Cohen.);
* the generalized continuum hypothesis (GCH);
* a related independent statement is that if a set x has fewer elements than y, then x also has fewer subsets than y. In particular, this statement fails when the cardinalities of the power sets of x and y coincide;
* the axiom of constructibility (V = L);
* the diamond principle (◊);
* Martin's axiom (MA);
* MA + ¬CH (independence shown by Solovay and Tennenbaum).[1]
* Every Aronszajn tree is special (EATS);

Diagram showing the implication chains

We have the following chains of implications:

V = L → ◊ → CH,
V = L → GCH → CH,
CH → MA,

and (see section on order theory):

◊ → ¬SH,
MA + ¬CH → EATS → SH.

Several statements related to the existence of large cardinals cannot be proven in ZFC (assuming ZFC is consistent). These are independent of ZFC provided that they are consistent with ZFC, which most working set theorists believe to be the case. These statements are strong enough to imply the consistency of ZFC. This has the consequence (via Gödel's second incompleteness theorem) that their consistency with ZFC cannot be proven in ZFC (assuming ZFC is consistent). The following statements belong to this class:

* Existence of inaccessible cardinals
* Existence of Mahlo cardinals
* Existence of measurable cardinals (first conjectured by Ulam)
* Existence of supercompact cardinals

The following statements can be proven to be independent of ZFC assuming the consistency of a suitable large cardinal:

* Proper forcing axiom
* Open coloring axiom
* Martin's maximum
* Existence of 0#
* Singular cardinals hypothesis
* Projective determinacy (and even the full axiom of determinacy if the axiom of choice is not assumed)

## Set theory of the real line[edit]

Further information: Set theory of the real line

There are many cardinal invariants of the real line, connected with measure theory and statements related to the Baire category theorem, whose exact values are independent of ZFC. While nontrivial relations can be proved between them, most cardinal invariants can be any regular cardinal between ℵ1 and 2ℵ0. This is a major area of study in the set theory of the real line (see Cichon diagram). MA has a tendency to set most interesting cardinal invariants equal to 2ℵ0.

A subset X of the real line is a strong measure zero set if to every sequence (εn) of positive reals there exists a sequence of intervals (In) which covers X and such that In has length at most εn. Borel's conjecture, that every strong measure zero set is countable, is independent of ZFC.

A subset X of the real line is  ℵ 1 {\displaystyle \aleph _{1}} -dense if every open interval contains  ℵ 1 {\displaystyle \aleph _{1}} -many elements of X. Whether all  ℵ 1 {\displaystyle \aleph _{1}} -dense sets are order-isomorphic is independent of ZFC.[2]

## Order theory[edit]

Further information: Order theory

Suslin's problem asks whether a specific short list of properties characterizes the ordered set of real numbers R. This is undecidable in ZFC.[3] A Suslin line is an ordered set which satisfies this specific list of properties but is not order-isomorphic to R. The diamond principle ◊ proves the existence of a Suslin line, while MA + ¬CH implies EATS (every Aronszajn tree is special),[4] which in turn implies (but is not equivalent to)[5] the nonexistence of Suslin lines. Ronald Jensen proved that CH does not imply the existence of a Suslin line.[6]

Existence of Kurepa trees is independent of ZFC, assuming consistency of an inaccessible cardinal.[7]

Existence of a partition of the ordinal number ω 2 {\displaystyle \omega _{2}} into two colors with no monochromatic uncountable sequentially closed subset is independent of ZFC, ZFC + CH, and ZFC + ¬CH, assuming consistency of a Mahlo cardinal.[8][9][10] This theorem of Shelah answers a question of H. Friedman.

## Abstract algebra[edit]

Further information: Abstract algebra

In 1973, Saharon Shelah showed that the Whitehead problem ("is every abelian group A with Ext1(A, Z) = 0 a free abelian group?") is independent of ZFC.[11] An abelian group with Ext1(A, Z) = 0 is called a Whitehead group; MA \+ ¬CH proves the existence of a non-free Whitehead group, while V = L proves that all Whitehead groups are free. In one of the earliest applications of proper forcing, Shelah constructed a model of ZFC + CH in which there is a non-free Whitehead group.[12][13]

Consider the ring A = R[x,y,z] of polynomials in three variables over the real numbers and its field of fractions M = R(x,y,z). The projective dimension of M as A-module is either 2 or 3, but it is independent of ZFC whether it is equal to 2; it is equal to 2 if and only if CH holds.[14]

A direct product of countably many fields has global dimension 2 if and only if the continuum hypothesis holds.[15]

## Number theory[edit]

Further information: Number theory

One can write down a concrete polynomial p ∈ Z[x1, ..., x9] such that the statement "there are integers m1, ..., m9 with p(m1, ..., m9) = 0" can neither be proven nor disproven in ZFC (assuming ZFC is consistent). This follows from Yuri Matiyasevich's resolution of Hilbert's tenth problem; the polynomial is constructed so that it has an integer root if and only if ZFC is inconsistent.[16]

## Measure theory[edit]

Further information: Measure theory

A stronger version of Fubini's theorem for positive functions, where the function is no longer assumed to be measurable but merely that the two iterated integrals are well defined and exist, is independent of ZFC. On the one hand, CH implies that there exists a function on the unit square whose iterated integrals are not equal — the function is simply the indicator function of an ordering of [0, 1] equivalent to a well ordering of the cardinal ω1. A similar example can be constructed using MA. On the other hand, the consistency of the strong Fubini theorem was first shown by Friedman.[17] It can also be deduced from a variant of Freiling's axiom of symmetry.[18]

## Topology[edit]

Further information: Topology

The Normal Moore Space conjecture, namely that every normal Moore space is metrizable, can be disproven assuming CH or MA + ¬CH, and can be proven assuming a certain axiom which implies the existence of large cardinals. Thus, granted large cardinals, the Normal Moore Space conjecture is independent of ZFC.[citation needed]

Various assertions about  P ( ω ) / {\displaystyle P(\omega )/} finite, P-points, Q-points, ...[further explanation needed]

The existence of an S-space is independent of ZFC. In particular, it is implied by the existence of a Suslin line.[19]

## Functional analysis[edit]

Further information: Functional analysis

Garth Dales and Robert M. Solovay proved in 1976 that Kaplansky's conjecture, namely that every algebra homomorphism from the Banach algebra C(X) (where X is some compact Hausdorff space) into any other Banach algebra must be continuous, is independent of ZFC. CH implies that for any infinite X there exists a discontinuous homomorphism into any Banach algebra.[20]

Consider the algebra B(H) of bounded linear operators on the infinite-dimensional separable Hilbert space H. The compact operators form a two-sided ideal in B(H). The question of whether this ideal is the sum of two properly smaller ideals is independent of ZFC, as was proved by Andreas Blass and Saharon Shelah in 1987.[21]

Charles Akemann and Nik Weaver showed in 2003 that the statement "there exists a counterexample to Naimark's problem which is generated by ℵ1, elements" is independent of ZFC.

Miroslav Bačák and Petr Hájek proved in 2008 that the statement "every Asplund space of density character ω1 has a renorming with the Mazur intersection property" is independent of ZFC. The result is shown using Martin's maximum axiom, while Mar Jiménez and José Pedro Moreno (1997) had presented a counterexample assuming CH.

As shown by Ilijas Farah[22] and N. Christopher Phillips and Nik Weaver,[23] the existence of outer automorphisms of the Calkin algebra depends on set theoretic assumptions beyond ZFC.

Wetzel's problem, which asks if every set of analytic functions which takes at most countably many distinct values at every point is necessarily countable, is true if and only if the continuum hypothesis is false.[24]

## Model theory[edit]

Further information: Model theory

Chang's conjecture is independent of ZFC assuming the consistency of an Erdős cardinal.

## Computability theory[edit]

Further information: Computability theory

Marcia Groszek and Theodore Slaman gave examples of statements independent of ZFC concerning the structure of the Turing degrees. In particular, whether there exists a maximally independent set of degrees of size less than continuum.[25]

## References[edit]

1. ^ Kunen, Kenneth (1980). Set Theory: An Introduction to Independence Proofs. Elsevier. ISBN 0-444-86839-9.
2. ^ Baumgartner, J., All  ℵ 1 {\displaystyle \aleph _{1}} -dense sets of reals can be isomorphic, Fund. Math. 79, pp.101 – 106, 1973
3. ^ Solovay, R. M.; Tennenbaum, S. (1971). "Iterated Cohen extensions and Souslin's problem". Annals of Mathematics. Second Series. 94 (2): 201–245. doi:10.2307/1970860. JSTOR 1970860.
4. ^ Baumgartner, J., J. Malitz, and W. Reiehart, Embedding trees in the rationals, Proc. Natl. Acad. Sci. U.S.A., 67, pp. 1746 – 1753, 1970
5. ^ Shelah, S. (1981). "Free limits of forcing and more on Aronszajn trees". Israel Journal of Mathematics. 38 (4): 315–334. doi:10.1007/BF02762777.
6. ^ Devlin, K., and H. Johnsbraten, The Souslin Problem, Lecture Notes on Mathematics 405, Springer, 1974
7. ^ Silver, J., The independence of Kurepa's conjecture and two-cardinal conjectures in model theory, in Axiomatic Set Theory, Proc. Symp, in Pure Mathematics (13) pp. 383 – 390, 1967
8. ^ Shelah, S., Proper and Improper Forcing, Springer 1992
9. ^ Schlindwein, Chaz, Shelah's work on non-semiproper iterations I, Archive for Mathematical Logic (47) 2008 pp. 579 – 606
10. ^ Schlindwein, Chaz, Shelah's work on non-semiproper iterations II, Journal of Symbolic Logic (66) 2001, pp. 1865 – 1883
11. ^ Shelah, S. (1974). "Infinite Abelian groups, Whitehead problem and some constructions". Israel Journal of Mathematics. 18 (3): 243–256. doi:10.1007/BF02757281. MR 0357114.
12. ^ Shelah, S. (1972). "Whitehead groups may be not free, even assuming CH, I". Israel Journal of Mathematics. 28 (3): 193–204. doi:10.1007/BF02759809.
13. ^ Shelah, S. (1980). "Whitehead groups may not be free even assuming CH, II". Israel Journal of Mathematics. 35 (4): 257–285. doi:10.1007/BF02760652.
14. ^ Barbara L. Osofsky (1968). "Homological dimension and the continuum hypothesis" (PDF). Transactions of the American Mathematical Society. 132: 217–230. doi:10.1090/s0002-9947-1968-0224606-4.
15. ^ Barbara L. Osofsky (1973). Homological Dimensions of Modules. American Mathematical Soc. p. 60\. ISBN 9780821816622.
16. ^ See e.g.:
* James P. Jones (1980). "Undecidable diophantine equations". Bull. Amer. Math. Soc. 3 (2): 859–862. doi:10.1090/s0273-0979-1980-14832-6.
* Carl, M.; Moroz, B. (2014). "On a Diophantine Representation of the Predicate of Provability". Journal of Mathematical Sciences. 199 (199): 36–52. doi:10.1007/s10958-014-1830-2. hdl:21.11116/0000-0004-1E89-1. S2CID 34618563.
For a summary of the argument, see Hilbert's tenth problem § Applications.
17. ^ Friedman, Harvey (1980). "A Consistent Fubini-Tonelli Theorem for Nonmeasurable Functions". Illinois J. Math. 24 (3): 390–395. doi:10.1215/ijm/1256047607. MR 0573474.
18. ^ Freiling, Chris (1986). "Axioms of symmetry: throwing darts at the real number line". Journal of Symbolic Logic. 51 (1): 190–200. doi:10.2307/2273955. JSTOR 2273955. MR 0830085. S2CID 38174418.
19. ^ Todorcevic, Stevo (1989). Partition problems in topology. Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-5091-6.
20. ^ H. G. Dales, W. H. Woodin (1987). An introduction to independence for analysts.`{{cite book}}`: CS1 maint: uses authors parameter (link)
21. ^ Judith Roitman (1992). "The Uses of Set Theory". Mathematical Intelligencer. 14 (1).
22. ^ Farah, Ilijas (2011). "All automorphisms of the Calkin algebra are inner". Annals of Mathematics. Second Series. 173 (2): 619–661. arXiv:0705.3085. doi:10.4007/annals.2011.173.2.1.
23. ^ Phillips, N. C.; Weaver, N. (2007). "The Calkin algebra has outer automorphisms". Duke Mathematical Journal. 139 (1): 185–202. arXiv:math/0606594. doi:10.1215/S0012-7094-07-13915-2. S2CID 13873756.
24. ^ Erdős, P. (1964), "An interpolation problem associated with the continuum hypothesis", The Michigan Mathematical Journal, 11: 9–10, doi:10.1307/mmj/1028999028, MR 0168482.
25. ^ Groszek, Marcia J.; Slaman, T. (1983). "Independence results on the global structure of the Turing degrees". Transactions of the American Mathematical Society. 277 (2): 579. doi:10.2307/1999225. JSTOR 1999225.

## External links[edit]

* What are some reasonable-sounding statements that are independent of ZFC?, mathoverflow.net

* 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)
& 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
* 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 & 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 & 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
* 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]: View this template
*[t]: Discuss this template
*[e]: Edit this template