Essays北极甜虾 · No. 14

SET THEORY · V数到无穷之后
第五讲 · 大基数(完结)

无穷之上

大基数,和“什么是真的”
上一讲说,通常的公理回答不了连续统假设。那就加公理?最自然的新公理,是断言“更大的无穷存在”。这样的无穷大到连自己存在都证明不了,却能回答一大批关于实数的老问题,唯独回答不了连续统假设。最后一讲爬一架梯子,看看梯子顶上是什么。八条定理,都带证明或证明要点。
Ⅰ可数性
Ⅱ比大小
Ⅲ序数
Ⅳ连续统
Ⅴ大基数
上一讲

Gödel 的可构造宇宙 让连续统假设成立,Cohen 的力迫法让它不成立:它和 ZFC 独立。ZFC 关于 唯一能说的,是它不能由可数步逼近。

先交作业

只看它能不能由可数步逼近。 是 的极限,不行; 是 的极限,也不行。 是后继基数,可以; 要逼近它得走 步,可数步不够,也可以。

1
THE LADDER

一架梯子

ZFC不可达inaccessibleMahlo弱紧weakly compact可测measurableWoodin超紧supercompact巨大hugeI0、I1、I3Reinhardt与选择公理矛盾能证明的越来越多一致性强度
图 5·1大基数之梯,按“一致性强度”从下往上排(只列了一部分,中间还有很多级)。每往上一级,公理系统就更强:上一级的存在能推出下一级的“不矛盾”。最上面一级和选择公理矛盾。

先回到最底下。ZFC 的公理能造出多大的集合?从空集出发,反复取幂集,再把前面的都并起来,得到一层一层的“累积层级”:

最后一条用于极限序数 。

分别有 1、2、4、16、65536 个元素。 是所有“有限的”集合; 已经包含了全体实数。所有集合都在某一层里。

:所有有限的集合
:包括全体实数
:全体集合
不可达时,
本身就是一个
满足 ZFC 的宇宙
图 5·2累积层级。一个大基数 ,就是一个“够大”的层:站在 里看,它本身就是一个完整的宇宙。
2
INACCESSIBLE

不可达:够不着的无穷

什么样的 算“够大”?要求是:从比它小的东西出发,用 ZFC 允许的任何操作,都造不出它来。

定义不可达基数

不可数的基数 叫不可达,如果(1)它不是少于 个更小基数的并;(2)对任何 ,都有 。

满足这两条(有限个有限数的并还是有限,有限集的幂集还是有限),所以不可达基数就是“不可数版的 ”:从下面怎么够都够不着。1908 年 Hausdorff 第一个问这种数存不存在,说这个问题“只能悬而未决”;1930 年 Sierpiński 和 Tarski 给了上面的定义,“不可达”这个名字是 Kuratowski 起的。

定理 1Zermelo(1930)

如果 不可达,那么 满足 ZFC 的全部公理。

证明要点逐条检查。幂集公理: 意味着 (某个 ),,仍在里面。替换公理最要紧: 里一个集合的大小小于 (这里用到条件(2)),把它的每个元素换成 里的另一个集合,得到少于 个、每个都在某层 ()里的集合;由条件(1),这些层的上确界仍小于 ,所以结果还在 里。其余公理类似。∎

这条定理有一个惊人的推论:

定理 2ZFC 证明不了不可达基数存在

如果 ZFC 不矛盾,那么 ZFC 证明不了“存在不可达基数”。

证明假设 ZFC 能证明存在不可达基数 。由定理 1, 是 ZFC 的一个模型,所以 ZFC 能证明“ZFC 有模型”,也就是能证明“ZFC 不矛盾”。可 Gödel 第二不完备定理说,一个不矛盾且足够强的系统,证明不了它自己不矛盾。所以 ZFC 必定矛盾,与假设冲突。∎

这就是梯子的规则:每一级大基数的存在,都推出下面一级的系统不矛盾,因而不可能在下面一级里被证明。爬梯子不是“证明”出来的,只能“假设”上去。

3
MEASURABLE

可测:从测度问题里长出来

梯子上更高的一级,来自一个很具体的问题:能不能给实数的所有子集定义“长度”?要求可数可加、单点长度为 0、 长度为 1。Lebesgue 测度做不到所有子集(1905 年 Vitali 就造出过不可测集,用的正是平移不变性);但如果不要求平移不变呢?

1930 年 Ulam 研究了这个问题,发现答案取决于基数有多大。最干净的一步是这样的:

定理 3Ulam(1930)

在 的所有子集上,不存在可数可加、单点为 0、总和为 1 的测度。

证明对每个可数序数 ,比它小的序数只有可数个,取一个单射 。对 、,令 。

固定 ,各个 ()拼起来是 ,它只比 少了可数个点,测度为 1。所以有某个 使 。 有不可数个, 只有可数个,所以有某个 ,使得不可数个 都有 。

可对固定的 ,不同的 两两不交:若 同时在 和 里,就有 ,与单射矛盾。不可数个两两不交、测度都为正的集合,不可能放进总测度 1 里(测度 的至多 个)。矛盾。∎

列:(不可数列)
⋯
⋯
⋯
⋯
⋯
格子 ;圆点表示测度
某一行(金色)有不可数个圆点,而同一行的格子两两不交
图 5·3Ulam 矩阵:可数行、不可数列。每一列至少有一个圆点,所以必有一行有不可数个圆点,可同一行的格子两两不交。(本文脚本在有限的玩具版本上验证了“同一行两两不交”)

推论:如果连续统假设成立, 和 一样多,测度可以搬过去,所以 的所有子集上也不存在这样的测度(这一点 Banach 和 Kuratowski 1929 年已经证明)。Ulam 把连续统假设这个前提去掉了:要想有这样的测度, 至少要大到一个(弱)不可达基数。

把测度换成只取 0 和 1 两个值的,就得到“可测基数”:基数 的所有子集上有一个只取 0 和 1、单点为 0、对少于 个集合的不交并都可加的测度。Ulam 和 Tarski 证明这样的 必定是不可达的;1960 年代 Hanf、Keisler 和 Tarski 又证明,它远在最小的不可达基数之上。

定理 4Scott(1961)

如果存在可测基数,那么 :宇宙比 Gödel 的可构造宇宙大。

换句话说,可测基数一旦存在,上一讲那个“瘦宇宙”就不可能是全部。从这一级往上,大基数开始和宇宙的“形状”有关了:一个可测基数等价于存在一个从 到某个子宇宙 的“嵌入” ,它保持所有一阶性质,只把 往上挪。梯子再往上的几级,都是要求这个嵌入更“贴近”恒等。

定理 5Kunen(1971)

在 ZFC 里,不存在从 到 自身的非平凡初等嵌入。

这就是梯子的顶。1967 年 Reinhardt 在博士论文里提出“存在 ”这种最强的公理,Kunen 证明它和选择公理矛盾。梯子在这里撞上了天花板,或者说,撞上了选择公理:不承认选择公理时,它至今还没被驳倒。

4
WHAT THEY BUY

它们能买到什么

一个连自己存在都证不出的公理,凭什么值得相信?最有力的理由是:它们对“下面”的世界有可检验的后果,而且这些后果彼此一致、相当漂亮。最好的例子是无穷博弈。

3甲1乙4甲1乙5甲9乙2甲6乙⋯
两人轮流写一位数字,无穷多步后得到一个无穷数字串
事先给定一个数字串的集合 :结果在 里甲赢,否则乙赢
“决定性”:两人里总有一个有必胜策略
图 5·4Gale–Stewart 无穷博弈:甲乙轮流写数字,拼成一个无穷数字串(可以看成一个实数),看它在不在事先给定的集合 里。

对“简单”的 ,比如开集,这个博弈总是“决定的”:总有一方有必胜策略。但不是所有的 都这样:

定理 6Gale–Stewart(1953)

在选择公理下,存在一个由无穷数字串组成的集合 ,使得在它上面的博弈谁都没有必胜策略。

证明一个策略就是“看到目前的有限局面,决定下一位写什么”的规则,局面只有可数种,所以策略一共有 个。用选择公理把甲的全部策略排成 、乙的全部策略排成 (),让每个前段都少于 个。

逐步构造两个不相交的集合 、。第 步,看甲的策略 :乙随便怎么下,都会得到一局;乙的下法不同,得到的数字串就不同,所以 能产生 个不同的结果。到这一步为止只选过少于 个点,所以能挑一个还没被选过的结果放进 : 不是甲的必胜策略。同样,对乙的策略 挑一个新结果放进 。最后令 。每个甲的策略都输掉某一局(结果在 ,不在 ),每个乙的策略也都输掉某一局(结果在 ),谁都没有必胜策略。∎

这和第四讲 Sierpiński 的分解一样,是借一个良序“一个个对付过去”的论证。它造出的集合非常“病态”。那么,对所有能具体描述出来的集合,博弈都是决定的吗?

定理 7Martin–Steel(1985 年证明,1989 年发表)

如果存在无穷多个 Woodin 基数,那么所有“射影集”(从 Borel 集出发,反复取投影和补集得到的集合)上的博弈都是决定的。由此推出:所有射影集都 Lebesgue 可测,并且满足第四讲那条“要么可数、要么有完美子集”的性质。

这是大基数最漂亮的成绩之一:ZFC 本身证明不了“所有射影集都可测”,加上 Woodin 基数以后,一整片关于实数的问题都有了答案,而且答案都是“好”的那一边。反过来,射影集的决定性也推出 Woodin 基数的某种相容性,两者互相印证。

那么,大基数能不能也回答连续统假设?

定理 8Lévy–Solovay(1967)

已知的大基数公理,都不能决定连续统假设。

为什么上一讲改变 用的力迫法都很“小”,只动到 附近。Lévy 和 Solovay 证明,这样的小力迫不会破坏任何一个大基数:可测基数在力迫之后还是可测的。所以不管假设多大的基数,都可以随意让 CH 成立或不成立。(这里只讲思路,不证)

Gödel 1947 年其实已经料到了。他说集合的概念本身就提示着新的“无穷公理”,比如不可达基数,加进去并不武断;但他也指出,他构造 的论证对这些公理照样成立,所以靠它们解决连续统问题希望不大,得另找基于全新原理的公理。大基数确实解决了很多问题,偏偏绕开了这一个。

5
ONE UNIVERSE OR MANY

一个宇宙,还是很多个

一个宇宙
CH 有确定的真假
CH
CH
多宇宙:用力迫法互相到达
两种看法(示意)
图 5·5两种看法(示意)。左:只有一个集合宇宙,CH 在其中有确定的真假,只是我们还没找到对的公理。右:每个满足 ZFC 的模型都是一个合法的宇宙,力迫法在它们之间来回走。

CH 独立以后,集合论学者对“它到底对不对”分成了两大派。

一个宇宙。集合有一个确定的宇宙,我们的任务是找到描述它的正确公理。大基数之所以可信,是因为它们的后果彼此一致,就像一个物理理论被不同的实验从不同方向验证。Woodin 多年来在找这样的公理:早年他论证 CH 应该是假的;后来他转向一个叫“终极 ”的构想,它会让 CH 成立。

多宇宙。Hamkins 2012 年系统地提出另一种看法:根本没有唯一的宇宙。(早在 1930 年,Zermelo 就设想过一串没有尽头的“集合论宇宙”,每一个都是下一个里面的一个集合。)每个满足 ZFC 的模型都是一个真实的“世界”,力迫法让我们在世界之间穿梭。CH 在有的世界里真、有的世界里假,问“它到底对不对”,就像问平行公设到底对不对:在欧氏几何里对,在双曲几何里不对,两种几何都是好的数学。

这两派还在争。它们共同的出发点,是 Cantor 1883 年为他的超限数辩护时写下的一句话:

Das Wesen der Mathematik liegt gerade in ihrer Freiheit.Cantor,《一般集合论基础》§8,1883。意思是“数学的本质恰恰在于它的自由”

只要不矛盾,数学家就有权定义新的对象、研究它们。超限数当年被当成异端;今天,连“比 ZFC 能证明存在的一切都大”的无穷,也只是一架梯子上的又一级。

6
CODA

写在最后:五讲回头看

讲问题回答
Ⅰ无穷有大小吗有。有理数可数,实数不可数;对角线证明没有最大的无穷
Ⅱ怎么比较两个无穷两头都塞得进,就一样多。线段和正方形一样多;任何两个都能比,等价于选择公理
Ⅲ数完自然数之后呢接着数。序数和超限归纳;Goodstein 定理要借道无穷才证得出
Ⅳ实数有多少个公理答不出。Gödel 和 Cohen 证明连续统假设独立
Ⅴ加更大的无穷呢能回答很多,偏偏不是这个。大基数之梯、射影决定性、多宇宙
图 5·6五讲,五个问题。

这个系列从“正整数和偶数谁多”出发,一路走到了一个至今没有答案的问题。贯穿始终的工具只有一个:对角线。第一讲用它证明实数数不完;第四讲 Cohen 用它造出新的实数;这一讲 Gale–Stewart 的论证里,它又换成良序的样子出现了一次。一个一百多年前的小技巧,到今天还在撑着整门学科。

无穷的大小,到今天也没有被数完。也许,这就是它值得一直数下去的原因。

梯子没有顶;
爬上去的每一级,
都让下面看得更清楚。
✎ 留言区聊聊

你站哪一派:集合只有一个宇宙,连续统假设迟早会有答案;还是有很多个宇宙,这个问题本身就没有唯一答案?也欢迎说说,这五讲里哪一个结论最让你意外。

参考资料
  1. F. Hausdorff, Math. Ann. 65 (1908);E. Zermelo, “Über Grenzzahlen und Mengenbereiche”, Fund. Math. 16 (1930);W. Sierpiński, A. Tarski, Fund. Math. 15 (1930)
  2. S. Banach, C. Kuratowski, Fund. Math. 14 (1929);S. Ulam, “Zur Masstheorie in der allgemeinen Mengenlehre”, Fund. Math. 16 (1930);W. Hanf, Fund. Math. 53 (1964);H. J. Keisler, A. Tarski, Fund. Math. 53 (1964)
  3. D. Scott, “Measurable cardinals and constructible sets”, Bull. Acad. Polon. Sci. 9 (1961)
  4. K. Kunen, “Elementary embeddings and infinitary combinatorics”, J. Symbolic Logic 36 (1971)
  5. D. Gale, F. M. Stewart, “Infinite games with perfect information”(1953)
  6. D. A. Martin, J. R. Steel, “A proof of projective determinacy”, J. Amer. Math. Soc. 2 (1989)
  7. A. Lévy, R. M. Solovay, “Measurable cardinals and the continuum hypothesis”, Israel J. Math. 5 (1967)
  8. K. Gödel, “What is Cantor’s continuum problem?”, Amer. Math. Monthly 54 (1947)
  9. J. D. Hamkins, “The set-theoretic multiverse”, Rev. Symbolic Logic 5 (2012);W. H. Woodin, “In search of Ultimate-L”, Bull. Symbolic Logic 23 (2017)
  10. G. Cantor, Grundlagen einer allgemeinen Mannichfaltigkeitslehre(1883),§8;Math. Ann. 21, p. 564
  11. A. Kanamori, The Higher Infinite(第二版,2003);T. Jech, Set Theory(第三版,2003)
注:文中插图均为本文自制示意图。
犹剑在心
北极甜虾(剑心犹在!)
— 全系列完 —
Translated from the Chinese original, “无穷之上”.
SET THEORY · VCounting Past Infinity
Lecture 5 · Large Cardinals (Finale)

Above Infinity

Large cardinals, and “what is true”
The last lecture showed that the usual axioms cannot answer the continuum hypothesis. So why not add axioms? The most natural new axioms assert that “larger infinities exist.” These infinities are so large that their existence cannot even be proved, yet they answer a whole host of old questions about the real numbers, all except the continuum hypothesis. In this final lecture we climb a ladder and see what is at the top. Eight theorems, each with a proof or a proof sketch.
ⅠCountable
ⅡComparing Sizes
ⅢOrdinals
ⅣContinuum
ⅤLarge Cardinals
Last lecture

Gödel's constructible universe makes the continuum hypothesis true, and Cohen's forcing makes it false: it is independent of ZFC. The only thing ZFC can say about is that it cannot be approached in countably many steps.

Homework first

All that matters is whether it can be approached in countably many steps. is the limit of , so no; is the limit of , so no again. is a successor cardinal, so yes; approaching takes steps, and countably many are not enough, so yes too.

1
THE LADDER

A ladder

ZFC不可达inaccessibleMahlo弱紧weakly compact可测measurableWoodin超紧supercompact巨大hugeI0, I1, I3ReinhardtContradicts ACProves moreand moreStrength
Figure 5·1The ladder of large cardinals, ordered from bottom to top by “consistency strength” (only some of the rungs are shown; there are many more in between). Each rung up makes the axiom system stronger: the existence of a higher rung implies that the one below is “consistent.” The top rung contradicts the axiom of choice.

Back to the bottom first. How large are the sets that the axioms of ZFC can build? Start from the empty set, take power sets again and again, and take the union of everything so far; this gives the level-by-level “cumulative hierarchy”:

The last line is for limit ordinals .

have 1, 2, 4, 16 and 65,536 elements respectively. consists of all the “finite” sets; already contains all the real numbers. Every set lies in some level.

: all finite sets
: has all reals
: all sets
If is inaccessible,
is itself a
universe of ZFC
Figure 5·2The cumulative hierarchy. A large cardinal gives a level that is “big enough”: seen from inside , it is a whole universe in itself.
2
INACCESSIBLE

Inaccessible: the infinity out of reach

What kind of counts as “big enough”? The requirement is this: starting from things smaller than it, no operation that ZFC allows can build it.

DefinitionInaccessible cardinal

An uncountable cardinal is called inaccessible if (1) it is not the union of fewer than smaller cardinals, and (2) for every we have .

satisfies both conditions (a union of finitely many finite numbers is finite, and the power set of a finite set is finite), so an inaccessible cardinal is an “uncountable version of ”: however you reach for it from below, you cannot get there. In 1908 Hausdorff was the first to ask whether such numbers exist, and said that the question “can only be left open”; in 1930 Sierpiński and Tarski gave the definition above, and the name “inaccessible” is due to Kuratowski.

Theorem 1Zermelo (1930)

If is inaccessible, then satisfies all the axioms of ZFC.

Proof sketchCheck the axioms one at a time. Power set: means for some , and then , still inside. Replacement is the crucial one: a set in has size less than (this uses condition (2)); replacing each of its elements by another set in gives fewer than sets, each lying in some level (); by condition (1), the supremum of these levels is still less than , so the result is still in . The other axioms are similar.∎

This theorem has a startling consequence:

Theorem 2ZFC cannot prove that inaccessible cardinals exist

If ZFC is consistent, then ZFC cannot prove “there is an inaccessible cardinal.”

ProofSuppose ZFC proves that there is an inaccessible cardinal . By Theorem 1, is a model of ZFC, so ZFC proves “ZFC has a model,” that is, it proves “ZFC is consistent.” But Gödel's second incompleteness theorem says that a consistent and sufficiently strong system cannot prove its own consistency. So ZFC must be inconsistent, contrary to our assumption.∎

This is the rule of the ladder: the existence of each rung of large cardinals implies that the system one rung below is consistent, and so it cannot be proved there. You don't get up the ladder by “proving”; you can only get up by “assuming.”

3
MEASURABLE

Measurable: grown from a problem about measure

A higher rung of the ladder comes from a very concrete question: can we define a “length” for all subsets of the real line? We want it to be countably additive, to give each single point length 0, and to give length 1. Lebesgue measure cannot do this for all subsets (Vitali built a non-measurable set back in 1905, using precisely translation invariance); but what if we don't require translation invariance?

Ulam studied this question in 1930 and found that the answer depends on how large the cardinal is. The cleanest step goes like this:

Theorem 3Ulam (1930)

There is no measure on all subsets of that is countably additive, 0 on single points, and 1 in total.

ProofFor each countable ordinal , there are only countably many ordinals below it, so choose an injection . For and , let .

Fix . The sets () together make up , which misses only countably many points of , so it has measure 1. Hence there is some with . There are uncountably many but only countably many , so there is some such that uncountably many have .

But for a fixed , the different are pairwise disjoint: if were in both and , we would have , contradicting injectivity. Uncountably many pairwise disjoint sets of positive measure cannot fit into a total measure of 1 (at most of them can have measure ). Contradiction.∎

Columns: (uncountably many)
⋯
⋯
⋯
⋯
⋯
Cell ; a dot means measure
One row (gold) has uncountably many dots; its cells are disjoint
Figure 5·3The Ulam matrix: countably many rows, uncountably many columns. Every column has at least one dot, so some row must have uncountably many dots, yet the cells in a row are pairwise disjoint. (This article's script checked “pairwise disjoint within a row” on a finite toy version.)

A corollary: if the continuum hypothesis holds, then and are the same size, the measure can be carried over, and so there is no such measure on all subsets of either (Banach and Kuratowski had already proved this in 1929). Ulam removed the assumption of the continuum hypothesis: for such a measure to exist, must be at least as large as a (weakly) inaccessible cardinal.

Replace the measure by one that takes only the values 0 and 1, and you get “measurable cardinals”: a cardinal is measurable if there is a measure on all its subsets that takes only the values 0 and 1, is 0 on single points, and is additive over disjoint unions of fewer than sets. Ulam and Tarski proved that such a must be inaccessible; in the 1960s Hanf, Keisler and Tarski went on to show that it lies far above the least inaccessible cardinal.

Theorem 4Scott (1961)

If there is a measurable cardinal, then : the universe is bigger than Gödel's constructible universe.

In other words, once a measurable cardinal exists, the “thin universe” of the last lecture cannot be everything. From this rung up, large cardinals begin to bear on the “shape” of the universe: a measurable cardinal is equivalent to an “embedding” from into some sub-universe that preserves every first-order property and only moves upward. The rungs further up all ask for this embedding to be ever “closer” to the identity.

Theorem 5Kunen (1971)

In ZFC, there is no nontrivial elementary embedding from into itself.

This is the top of the ladder. In his 1967 doctoral thesis Reinhardt proposed the strongest axiom of this kind, “there exists ,” and Kunen proved that it contradicts the axiom of choice. Here the ladder hits the ceiling, or rather, it hits the axiom of choice: without the axiom of choice, it has not been refuted to this day.

4
WHAT THEY BUY

What they buy

Why should we believe an axiom when what it asserts cannot even be proved to exist? The strongest reason is that these axioms have testable consequences for the world “below,” and those consequences agree with one another and are rather beautiful. The best example is infinite games.

3I1II4I1II5I9II2I6II⋯
Players take turns writing digits, building an infinite string
Fix a set of strings : in , I wins; otherwise II does
“Determined”: one player or the other has a winning strategy
Figure 5·4The Gale–Stewart infinite game: players I and II take turns writing digits, which together form an infinite string of digits (think of it as a real number), and the question is whether it lies in the set fixed in advance.

For “simple” , such as open sets, this game is always “determined”: one side or the other has a winning strategy. But not every is like this:

Theorem 6Gale–Stewart (1953)

Under the axiom of choice, there is a set of infinite digit strings such that, in the game on it, neither player has a winning strategy.

ProofA strategy is a rule that “looks at the finite position so far and decides which digit to write next”; there are only countably many positions, so there are strategies in all. Using the axiom of choice, list all of I's strategies as and all of II's strategies as (), so that every initial segment of each list has fewer than members.

Build two disjoint sets and step by step. At step , look at I's strategy : each way II might play produces a game, and different plays by II produce different digit strings, so can produce different outcomes. Fewer than points have been chosen so far, so we can pick an outcome not yet chosen and put it into : is not a winning strategy for I. Likewise, for II's strategy , pick a new outcome and put it into . Finally let . Every strategy for I loses some game (the outcome is in , not in ), and every strategy for II loses some game too (the outcome is in ), so neither player has a winning strategy.∎

Like Sierpiński's decomposition in Lecture 4, this is an argument that uses a well-ordering to “deal with them one at a time.” The set it produces is extremely “pathological.” So is the game determined for every set that can be concretely described?

Theorem 7Martin–Steel (proved 1985, published 1989)

If there are infinitely many Woodin cardinals, then the games on all “projective sets” (the sets obtained from Borel sets by repeatedly taking projections and complements) are determined. It follows that every projective set is Lebesgue measurable and has the property from Lecture 4: “either countable, or has a perfect subset.”

This is one of the finest achievements of large cardinals. ZFC by itself cannot prove that “every projective set is measurable,” but once Woodin cardinals are added, a whole swathe of questions about the real numbers gets answered, and the answers all come down on the “nice” side. Conversely, projective determinacy also implies a certain consistency of Woodin cardinals, so each confirms the other.

So can large cardinals answer the continuum hypothesis too?

Theorem 8Lévy–Solovay (1967)

None of the known large cardinal axioms decides the continuum hypothesis.

WhyThe forcing used in the last lecture to change is all quite “small,” touching only the region around . Lévy and Solovay proved that such small forcing destroys no large cardinal: a measurable cardinal is still measurable after the forcing. So however large the cardinals you assume, you can still make CH true or false at will. (Only the idea is given here, not a proof.)

Gödel had in fact foreseen this in 1947. He said that the very concept of set suggests new “axioms of infinity,” such as inaccessible cardinals, and that adding them is not arbitrary; but he also pointed out that his argument constructing works just as well with these axioms, so there was little hope of settling the continuum problem with them, and axioms based on entirely new principles would be needed. Large cardinals have indeed settled many problems, but this one, of all problems, slips past them.

5
ONE UNIVERSE OR MANY

One universe, or many

One universe
CH is true or false
CH
CH
Multiverse: linked by forcing
Two views (schematic)
Figure 5·5Two views (schematic). Left: there is only one universe of sets, CH has a definite truth value in it, and we just have not yet found the right axioms. Right: every model of ZFC is a legitimate universe, and forcing travels back and forth between them.

After CH was shown to be independent, set theorists split into two main camps over “is it true or not?”

One universe. There is one definite universe of sets, and our task is to find the right axioms describing it. Large cardinals are credible because their consequences agree with one another, much as a physical theory is confirmed by different experiments from different directions. Woodin has spent many years looking for such axioms: early on he argued that CH should be false; later he turned to a proposal called “Ultimate ,” which would make CH true.

A multiverse. In 2012 Hamkins set out another view systematically: there is no unique universe at all. (As early as 1930, Zermelo had imagined an endless sequence of “set-theoretic universes,” each one a set inside the next.) Every model of ZFC is a real “world,” and forcing lets us travel between worlds. CH is true in some worlds and false in others, and asking “is it really true?” is like asking whether the parallel postulate is really true: it is true in Euclidean geometry and false in hyperbolic geometry, and both geometries are good mathematics.

The two camps are still arguing. Their common starting point is a sentence Cantor wrote in 1883, defending his transfinite numbers:

Das Wesen der Mathematik liegt gerade in ihrer Freiheit.Cantor, “Foundations of a General Theory of Manifolds,” §8, 1883. It means “the essence of mathematics lies precisely in its freedom”

As long as there is no contradiction, mathematicians have the right to define new objects and study them. The transfinite numbers were once treated as heresy; today even an infinity “bigger than everything ZFC can prove to exist” is just one more rung on a ladder.

6
CODA

In closing: five lectures in review

LectureQuestionAnswer
ⅠDo infinities come in sizes?Yes. The rationals are countable, the reals are not; the diagonal argument shows there is no largest infinity
ⅡHow do we compare two infinities?If each fits inside the other, they are the same size. A segment and a square have equally many points; that any two sets can be compared is equivalent to the axiom of choice
ⅢWhat comes after the natural numbers?Keep counting. Ordinals and transfinite induction; Goodstein's theorem can only be proved by a detour through the infinite
ⅣHow many real numbers are there?The axioms can't say. Gödel and Cohen proved the continuum hypothesis independent
ⅤWhat if we add bigger infinities?They answer a lot, just not this. The ladder of large cardinals, projective determinacy, the multiverse
Figure 5·6Five lectures, five questions.

This series set out from “are there more positive integers or more even numbers?” and has ended at a question that still has no answer. One tool ran through it from start to finish: the diagonal. Lecture 1 used it to show that the real numbers cannot be counted; in Lecture 4 Cohen used it to build new real numbers; and in this lecture it turned up once more, in the guise of a well-ordering, in the Gale–Stewart argument. A little trick from more than a century ago is still holding up an entire field.

To this day, no one has finished counting the sizes of infinity. Perhaps that is exactly why it is worth going on counting.

The ladder has no top;
each rung you climb
shows you more clearly what lies below.
✎ Let's talk in the comments

Which camp are you in: there is only one universe of sets, and the continuum hypothesis will be answered sooner or later; or there are many universes, and the question has no single answer? You are also welcome to say which result in these five lectures surprised you most.

References
  1. F. Hausdorff, Math. Ann. 65 (1908); E. Zermelo, “Über Grenzzahlen und Mengenbereiche,” Fund. Math. 16 (1930); W. Sierpiński, A. Tarski, Fund. Math. 15 (1930)
  2. S. Banach, C. Kuratowski, Fund. Math. 14 (1929); S. Ulam, “Zur Masstheorie in der allgemeinen Mengenlehre,” Fund. Math. 16 (1930); W. Hanf, Fund. Math. 53 (1964); H. J. Keisler, A. Tarski, Fund. Math. 53 (1964)
  3. D. Scott, “Measurable cardinals and constructible sets”, Bull. Acad. Polon. Sci. 9 (1961)
  4. K. Kunen, “Elementary embeddings and infinitary combinatorics”, J. Symbolic Logic 36 (1971)
  5. D. Gale, F. M. Stewart, “Infinite games with perfect information” (1953)
  6. D. A. Martin, J. R. Steel, “A proof of projective determinacy”, J. Amer. Math. Soc. 2 (1989)
  7. A. Lévy, R. M. Solovay, “Measurable cardinals and the continuum hypothesis”, Israel J. Math. 5 (1967)
  8. K. Gödel, “What is Cantor’s continuum problem?”, Amer. Math. Monthly 54 (1947)
  9. J. D. Hamkins, “The set-theoretic multiverse,” Rev. Symbolic Logic 5 (2012); W. H. Woodin, “In search of Ultimate-L,” Bull. Symbolic Logic 23 (2017)
  10. G. Cantor, Grundlagen einer allgemeinen Mannichfaltigkeitslehre (1883), §8; Math. Ann. 21, p. 564
  11. A. Kanamori, The Higher Infinite (2nd edition, 2003); T. Jech, Set Theory (3rd edition, 2003)
Note: All figures are schematic illustrations made for this article.
犹剑在心
北极甜虾(剑心犹在!)
— End of the series —

← All essays