// Workers AI · dad joke modeWhat did the diamond say? It's a gem of a principle.
In set theory, the diamond principle, denoted , is a combinatorial principle introduced by Ronald Jensen that holds in the constructible universe and that implies the continuum hypothesis.[1] Jensen extracted the diamond principle from his proof that the axiom of constructibility implies the existence of a Suslin tree.
Definitions
[edit]The diamond principle ◊ says that there exists a ◊-sequence; that is, a family of sets Aα ⊆ α for α < ω1 such that for any subset A of ω1 the set of α with A ∩ α = Aα is stationary in ω1.
There are several equivalent forms of the diamond principle. One states that there is a countable collection Aα of subsets of α for each countable ordinal α such that for any subset A of ω1 there is a stationary subset C of ω1 such that for all α in C we have A ∩ α ∈ Aα and C ∩ α ∈ Aα. Notice that, a weaken form which states that, there exist sets Aα ⊆ α for α < ω1 such that for any subset A of ω1 there is at least one infinite α with A ∩ α = Aα , is equivalent to the Continuum Hypothesis.
More generally, for a given cardinal number κ and a stationary set S ⊆ κ, the statement ◊S (sometimes written ◊(S) or ◊κ(S)) is the statement that there is a sequence ⟨Aα : α ∈ S⟩ such that
- each Aα ⊆ α
- for every A ⊆ κ, {α ∈ S : A ∩ α = Aα} is stationary in κ
The principle ◊ω1 is the same as ◊.
The diamond-plus principle ◊+ states that there exists a ◊+-sequence, in other words a countable collection Aα of subsets of α for each countable ordinal α such that for any subset A of ω1 there is a closed unbounded subset C of ω1 such that for all α in C we have A ∩ α ∈ Aα and C ∩ α ∈ Aα.
Properties and use
[edit]Jensen showed that the diamond principle implies the existence of Suslin trees. He also showed that the axiom of constructibility implies the stronger diamond-plus principle , which implies the diamond principle, which implies the continuum hypothesis.[1] The diamond principle does not imply the existence of a Kurepa tree, but does. Both and are independent of the axioms of ZFC. Also, the club principle ♣ and the continuum hypothesis CH together imply . However, there exist models of ♣ + ¬ CH, so and ♣ are not equivalent, rather, ♣ is weaker than .[2]
Matet proved the related principle , equivalent to a property of partitions of with diagonal intersection of initial segments of the partitions stationary in .[3][clarification needed]
Akemann and Weaver used to construct a C*-algebra serving as a counterexample to Naimark's problem.[4]
For all cardinals and stationary subsets , ◊S holds in the constructible universe. Shelah proved that for , follows from for stationary that do not contain ordinals of cofinality .[5] He also showed that the diamond principle solves the Whitehead problem by implying that every Whitehead group is free.
See also
[edit]References
[edit]- Akemann, Charles; Weaver, Nik (2004). "Consistency of a counterexample to Naimark's problem". Proceedings of the National Academy of Sciences of the United States of America. 101 (20): 7522–7525. doi:10.1073/pnas.0401489101. MR 2057719. PMC 419638.
- Jensen, R. Björn (1972). "The fine structure of the constructible hierarchy". Annals of Mathematical Logic. 4 (3): 229–308. doi:10.1016/0003-4843(72)90001-0. MR 0309729.
- Matet, Pierre (1988). "On diamond sequences". Fundamenta Mathematicae. 131 (1): 35–44. doi:10.4064/fm-131-1-35-44.
- Rinot, Assaf (2011). "Jensen's diamond principle and its relatives". In Babinkostova, L.; Caicedo, A. E.; Geschke, S.; Scheepers, M. (eds.). Set Theory and Its Applications. Contemporary Mathematics. Vol. 533. Providence, RI: American Mathematical Society. pp. 125–156. ISBN 978-0-8218-4812-8. MR 2777747.
- Shelah, Saharon (1974). "Infinite abelian groups, Whitehead problem and some constructions". Israel Journal of Mathematics. 18 (3): 243–256. doi:10.1007/BF02757281. MR 0357114.
- ——————— (1980). "Whitehead groups may not be free even assuming CH, II". Israel Journal of Mathematics. 35 (4): 257–285. doi:10.1007/BF02760652.
- ——————— (2010). "Diamonds". Proceedings of the American Mathematical Society. 138 (6): 2151–2161. doi:10.1090/S0002-9939-10-10254-8.