鑽石原則

鑽石原則（ $◊$ ）是由羅納德·詹森（英語：Ronald Jensen）在Jensen (1972)引入的組合原理，它適用於哥德爾可構造全集（英語：Gödel's constructible universe）（ $L$ ）並暗示了連續統假設。羅納德·詹森在證明中提取了鑽石原理，即constructibility公理（英語：Axiom of constructibility）（ $V = L$ ）意味著存在蘇斯林樹（英語：Suslin tree）。

定義[編輯]

已隱藏部分未翻譯內容，歡迎參與翻譯。

The diamond principle $◊$ says that there exists a ◊-sequence, in other words sets $A α \subseteq α$ for $α < ω 1$ such that for any subset $A$ of ω₁ the set of $α$ with $A \cap α = 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 \cap α \in A α$ and $C \cap α \in A α$ . Another equivalent form states that there exist sets $A α \subseteq α$ for $α < ω 1$ such that for any subset $A$ of $ω 1$ there is at least one infinite $α$ with $A \cap α = A α$ .

More generally, for a given cardinal number $κ$ and a stationary set $S \subseteq κ$ , the statement $◊ S$ (sometimes written $◊(S)$ or $◊ κ (S)$ ) is the statement that there is a sequence $⟨ A α : α \in S ⟩$ such that

each $A α \subseteq α$
for every $A \subseteq κ$ , ${α \in S : A \cap α = 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 \cap α \in A α$ and $C \cap α \in A α$ .

屬性和使用[編輯]

已隱藏部分未翻譯內容，歡迎參與翻譯。

Jensen (1972) showed that the diamond principle $◊$ implies the existence of Suslin trees. He also showed that $V = L$ implies the diamond-plus principle, which implies the diamond principle, which implies CH. In particular the diamond principle and the diamond-plus principle are both independent of the axioms of ZFC. Also $♣ + CH$ implies $◊$ , but Shelah gave models of $♣ + \neg CH$ , so $◊$ and $♣$ are not equivalent (rather, $♣$ is weaker than $◊$ ).

The diamond principle $◊$ does not imply the existence of a Kurepa tree, but the stronger $◊ +$ principle implies both the $◊$ principle and the existence of a Kurepa tree.

Akemann & Weaver (2004) used $◊$ to construct a $C *$ -algebra serving as a counterexample to Naimark's problem.

For all cardinals $κ$ and stationary subsets $S \subseteq κ +$ , $◊ S$ holds in the constructible universe. Shelah (2010) proved that for $κ > ℵ 0$ , $◊ κ + (S)$ follows from $2 κ = κ +$ for stationary $S$ that do not contain ordinals of cofinality $κ$ .

Shelah showed that the diamond principle solves the Whitehead problem by implying that every Whitehead group is free.

參見[編輯]

參考文獻[編輯]

Akemann, Charles; Weaver, Nik. Consistency of a counterexample to Naimark's problem. Proceedings of the National Academy of Sciences. 2004, 101 (20): 7522–7525. Bibcode:2004PNAS..101.7522A. MR 2057719. PMC 419638 . PMID 15131270. arXiv:math.OA/0312135 . doi:10.1073/pnas.0401489101 .
Jensen, R. Björn. The fine structure of the constructible hierarchy. Annals of Mathematical Logic. 1972, 4 (3): 229–308. MR 0309729. doi:10.1016/0003-4843(72)90001-0 .
Rinot, Assaf. Jensen's diamond principle and its relatives. Set theory and its applications. Contemporary Mathematics 533. Providence, RI: AMS. 2011: 125–156. Bibcode:2009arXiv0911.2151R. ISBN 978-0-8218-4812-8. MR 2777747. arXiv:0911.2151 .
Shelah, Saharon. Infinite Abelian groups, Whitehead problem and some constructions. Israel Journal of Mathematics（英語：Israel Journal of Mathematics）. 1974, 18 (3): 243–256. MR 0357114. S2CID 123351674. doi:10.1007/BF02757281 .
Shelah, Saharon. Diamonds. Proceedings of the American Mathematical Society（英語：Proceedings of the American Mathematical Society）. 2010, 138 (6): 2151–2161. doi:10.1090/S0002-9939-10-10254-8 .