Jump to content

Clubsuit

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Lazy Maniik (talk | contribs) at 09:56, 8 October 2021 (Reverted edits by 2A02:1812:110C:DC00:BC26:BC15:CA67:234F (talk) to last version by TheMathCat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 by Adam Ostaszewski.[1]

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).[2]

See also

References

  1. ^ Ostaszewski, Adam J. (1975). "On countably compact perfectly normal spaces". Journal of the London Mathematical Society. 14: 505–516. doi:10.1112/jlms/s2-14.3.505.
  2. ^ Shelah, S. (1980). "Whitehead groups may not be free even assuming CH, II". Israel Journal of Mathematics. 35: 257–285. doi:10.1007/BF02760652.