Clubsuit
In mathematics, and particularly in axiomatic set theory, ♣S (clubsuit) is a family of combinatorial principles that are a weaker version of the corresponding ◊S; it was introduced in 1975.
Definition
For a given cardinal number and a stationary set , is the statement that there is a sequence such that
- every Aδ is a cofinal subset of δ
- for every unbounded subset , there is a so that
is usually written as just .
♣ and ◊
It is clear that ◊ ⇒ ♣, and it was shown in 1975 that ♣ + CH ⇒ ◊; however, Saharon Shelah gave a proof in 1980 that there exists a model of ♣ in which CH does not hold, so ♣ and ◊ are not equivalent (since ◊ ⇒ CH).
gollark: And PotatOS.
gollark: I could probably have something where you transmit commands to it over wireless, actually...
gollark: I mean, they aren't very practical, but you *could*, if you wanted to, ride places by pig.
gollark: Via kinetic augment.
gollark: We did make pigs fly a few times.
References
- A. J. Ostaszewski, On countably compact perfectly normal spaces, Journal of London Mathematical Society, 1975 (2) 14, pp. 505-516.
- S. Shelah, Whitehead groups may not be free, even assuming CH, II, Israel Journal of Mathematics, 1980 (35) pp. 257-285.
See also
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.