Abstract

In this chapter, we shall construct various models of Set Theory in which the Axiom of Choice fails. In particular, we shall construct a model in which \(\textsf{C}(\aleph _{0},2)\) fails, and another one in which a cardinal \(\mathfrak{m}\) exists such that \(\mathop{\mathrm{seq}}\nolimits (\mathfrak{m}) <[\mathfrak{m}]^{2}\). These somewhat strange models are constructed like models of ZF (see the cumulative hierarchy introduced in Chap. 2). However, instead of starting with the empty set (in order to build the cumulative hierarchy) we start with a set of atoms and define a certain group \(\mathcal{G}\) of permutations of these atoms. Roughly speaking, a set x is in the model if x is “stable” under certain subgroups \(\mathscr{H} \subseteq \mathcal{G}\) (i.e., for all permutations \(\pi \in \mathscr{ H}\), πx = x). In this way we can make sure that some particular sets (e.g., choice functions for a given family in the model) do not belong to the model. Unfortunately, since we have to introduce atoms to construct these models, we do not get models of ZF; however, using the Jech–Sochor Embedding Theorem 17.2, we can embed arbitrarily large fragments of these models into models of ZF, which is sufficient for our purposes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.