In mathematics, and particularly in axiomatic set theory, ◊_S (diamondsuit or diamond) is a certain family of combinatorial principles .

Definition

For a given cardinal number κ and a stationary set S ⊆ κ, ◊_S is the statement that there is a sequence such that

• every A_δ a subset of δ
• for every A ⊆ κ, the set is stationary

is usually written as just ◊.

Properties and use

It can be shown that ◊ ⇒ CH; also, ♣ + CH ⇒ ◊, but there also exist models of ♣ + ¬ CH, so ◊ and ♣ are not equivalent (rather, ♣ is weaker than ◊).

Charles Akemann and Nik Weaver used ◊ to construct a C^*-algebra serving as a counterexample to Naimark's problem.

References

• Charles Akemann, Nik Weaver, Consistency of a counterexample to Naimark's problem, online