In mathematics, a collapsing algebra is a type of Boolean algebra sometimes used in forcing to reduce ("collapse") the size of cardinals. The posets used to generate collapsing algebras were introduced by Azriel Lévy in 1963.[1]

The collapsing algebra of λω is a complete Boolean algebra with at least λ elements but generated by a countable number of elements. As the size of countably generated complete Boolean algebras is unbounded, this shows that there is no free complete Boolean algebra on a countable number of elements.

Definition

There are several slightly different sorts of collapsing algebras.

If κ and λ are cardinals, then the Boolean algebra of regular open sets of the product space κλ is a collapsing algebra. Here κ and λ are both given the discrete topology. There are several different options for the topology of κλ. The simplest option is to take the usual product topology. Another option is to take the topology generated by open sets consisting of functions whose value is specified on less than λ elements of λ.

References

  1. ↑ Lévy 1963, p. 593.
  • Bell, J. L. (1985). Boolean-Valued Models and Independence Proofs in Set Theory. Oxford Logic Guides. Vol. 12 (2nd ed.). Oxford: Oxford University Press (Clarendon Press). ISBN 0-19-853241-5. Zbl 0585.03021.
  • Jech, Thomas (2003). Set theory (third millennium (revised and expanded) ed.). Springer-Verlag. ISBN 3-540-44085-2. OCLC 174929965. Zbl 1007.03002.
  • Lévy, Azriel (1963). "Independence results in set theory by Cohen's method. IV". Notices Amer. Math. Soc. 10.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.