MathLabs

Worked solution: Independence of Suslin's Hypothesis from ZFC (Jensen, Solovay–Tennenbaum, 1971)

Step 3 of 8: Diamond (♢\diamondsuit): a guessing principle true in Gödel's LL
In plain words

Imagine a fortune-teller who, before you even choose a subset ZZ of ω1\omega_1, hands you a long list of guesses ⟨Aα⟩α<ω1\langle A_\alpha \rangle_{\alpha<\omega_1}, one guess for each countable stage. The diamond principle says this fortune-teller is right astonishingly often: on a "stationary" (topologically unavoidable) set of stages α\alpha, the guess AαA_\alpha exactly matches ZZ restricted to that stage.

Ronald Jensen discovered in the late 1960s that this eerie predicting power is a hidden structural feature of Gödel's constructible universe LL: whenever V=LV = L, such a sequence of guesses provably exists.

♢:∃⟨Aα:α<ω1⟩, Aα⊆α, {α:Z∩α=Aα} stationary, ∀Z⊆ω1\diamondsuit: \exists \langle A_\alpha : \alpha<\omega_1\rangle,\ A_\alpha\subseteq\alpha,\ \{\alpha : Z\cap\alpha=A_\alpha\} \text{ stationary}, \ \forall Z\subseteq\omega_1
Detailed analysis

The diamond principle ♢\diamondsuit asserts the existence of a sequence ⟨Aα:α<ω1⟩\langle A_\alpha : \alpha < \omega_1 \rangle with Aα⊆αA_\alpha \subseteq \alpha for each α\alpha, such that for every Z⊆ω1Z \subseteq \omega_1, the set {α<ω1:Z∩α=Aα}\{ \alpha < \omega_1 : Z \cap \alpha = A_\alpha \} is stationary in ω1\omega_1 (it meets every closed unbounded subset of ω1\omega_1, so in particular it is uncountable and "large" in a precise topological sense, even though it can still have size ℵ1\aleph_1 rather than all of ω1\omega_1).

Jensen proved, through his fine-structural analysis of the constructible hierarchy LL described in the earlier steps of the continuum hypothesis proof, that ♢\diamondsuit holds whenever V=LV = L: the same definability control that pins down cardinalities in LL also lets one build, level by level, a sequence of guesses that stays correct stationarily often.

♢\diamondsuit is a strictly stronger hypothesis than CH\mathrm{CH} (it implies CH\mathrm{CH} but is not implied by CH\mathrm{CH}), and its real power is combinatorial rather than just about cardinal arithmetic: it supplies exactly the kind of "oracle" needed to guide a transfinite construction while avoiding every possible obstruction in advance, which the next step uses to build a Suslin tree.

Terms in this step
Stationary set
A subset of ω1\omega_1 that meets every closed unbounded ("club") subset of ω1\omega_1; stationary sets are the notion of "topologically large" used throughout combinatorial set theory, even though they need not have size ℵ1\aleph_1 in the naive counting sense of covering almost everything.
Knowledge used in this step