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.
In 1931, Kurt Gödel proved his incompleteness theorems, establishing that many mathematical theories, including ZFC, cannot prove their own consistency. Assuming ω-consistency of such a theory, the consistency statement can also not be disproven, meaning it is independent. A few years later, other arithmetic statements were defined that are independent of any such theory, see for example Rosser's trick.
The following set theoretic statements are independent of ZFC, among others:
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.);
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;
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:
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 -dense if every open interval contains -many elements of X. Whether all -dense sets are order-isomorphic is independent of ZFC.[2]
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 a partition of the ordinal number 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.
In 1973, Saharon Shelah showed that the Whitehead problem ("is every abelian groupA 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 fractionsM = 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]
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]
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]
The Normal Moore Space conjecture, namely that every normalMoore space is metrizable, can be disproven assuming the continuum hypothesis or assuming both Martin's axiom and the negation of the continuum hypothesis, 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.[19]
The existence of an S-space is independent of ZFC. In particular, it is implied by the existence of a Suslin line.[20]
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.
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.[25]
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.[26]
^Baumgartner, J., All -dense sets of reals can be isomorphic, Fund. Math. 79, pp.101 – 106, 1973
^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. JSTOR1970860.
^Baumgartner, J., J. Malitz, and W. Reiehart, Embedding trees in the rationals, Proc. Natl. Acad. Sci. U.S.A., 67, pp. 1746 – 1753, 1970
^Devlin, K., and H. Johnsbraten, The Souslin Problem, Lecture Notes on Mathematics 405, Springer, 1974
^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
^Shelah, S., Proper and Improper Forcing, Springer 1992
^Schlindwein, Chaz, Shelah's work on non-semiproper iterations I, Archive for Mathematical Logic (47) 2008 pp. 579 – 606
^Schlindwein, Chaz, Shelah's work on non-semiproper iterations II, Journal of Symbolic Logic (66) 2001, pp. 1865 – 1883
^Nyikos, Peter J. (2001). "A history of the normal Moore space problem". Handbook of the History of General Topology. History of Topology. Vol. 3. Dordrecht: Kluwer Academic Publishers. pp. 1179–1212. doi:10.1007/978-94-017-0470-0_7. ISBN0-7923-6970-X. MR1900271.
^Todorcevic, Stevo (1989). Partition problems in topology. Providence, R.I.: American Mathematical Society. ISBN978-0-8218-5091-6.
^H. G. Dales; W. H. Woodin (1987). An introduction to independence for analysts.
^Judith Roitman (1992). "The Uses of Set Theory". Mathematical Intelligencer. 14 (1).