Diamond principle

In mathematics, and particularly in axiomatic set theory, the diamond principle $◊$ is a combinatorial principle introduced by Ronald Jensen in that holds in the constructible universe and that implies the continuum hypothesis. Jensen extracted the diamond principle from his proof that the axiom of constructibility implies the existence of a Suslin tree.

Definitions

The diamond principle ◊ says that there exists a Template:Vanchor, a family of sets A_α ⊆ α for α < ω₁ such that for any subset A of ω₁ the set of α with A ∩ α = A_α is stationary in ω₁.

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 ω₁ there is a stationary subset C of ω₁ such that for all α in C we have A ∩ α ∈ A_α and C ∩ α ∈ A_α. Another equivalent form states that there exist sets A_α ⊆ α for α < ω₁ such that for any subset Template:Mvar of Template:Mvar there is at least one infinite Template:Mvar with Template:Mvar.

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 ω₁ there is a closed unbounded subset C of ω₁ such that for all α in C we have A ∩ α ∈ A_α and C ∩ α ∈ A_α.

Properties and use

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 ♣ + ¬ CH, so ◊ and ♣ are not equivalent (rather, ♣ is weaker than ◊).

Matet proved the principle ${\mathrm{♢}}_{\kappa }$ equivalent to a property of partitions of $\kappa$ with diagonal intersection of initial segments of the partitions stationary in $\kappa$.

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.

used ◊ to construct a C*-algebra serving as a counterexample to Naimark's problem.

For all cardinals κ and stationary subsets S ⊆ κ⁺, ◊_S holds in the constructible universe. proved that for κ > ℵ₀, ◊_κ⁺(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.

See also

• List of statements independent of ZFC
• [[Statements true in L|Statements true in Template:Mvar]]