Worked solution: Independence of Suslin's Hypothesis from ZFC (Jensen, Solovay–Tennenbaum, 1971)
Imagine a fortune-teller who, before you even choose a subset of , hands you a long list of guesses , 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 , the guess exactly matches 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 : whenever , such a sequence of guesses provably exists.
The diamond principle asserts the existence of a sequence with for each , such that for every , the set is stationary in (it meets every closed unbounded subset of , so in particular it is uncountable and "large" in a precise topological sense, even though it can still have size rather than all of ).
Jensen proved, through his fine-structural analysis of the constructible hierarchy described in the earlier steps of the continuum hypothesis proof, that holds whenever : the same definability control that pins down cardinalities in also lets one build, level by level, a sequence of guesses that stays correct stationarily often.
is a strictly stronger hypothesis than (it implies but is not implied by ), 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.
- Stationary set
- A subset of that meets every closed unbounded ("club") subset of ; stationary sets are the notion of "topologically large" used throughout combinatorial set theory, even though they need not have size in the naive counting sense of covering almost everything.