Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-22T22:03:36.912Z Has data issue: false hasContentIssue false

THE ONTO MAPPING OF SIERPINSKI AND NONMEAGER SETS

Published online by Cambridge University Press:  16 May 2017

OSVALDO GUZMÁN GONZÁLEZ*
Affiliation:
CENTRO DE CIENCIAS MATEMATICAS UNAM, A.P. 61-3, XANGARI, MORELIA MICHOACÁN, 58089, MEXICOE-mail: [email protected]

Abstract

The principle (*) of Sierpinski is the assertion that there is a family of functions $\left\{ {{\varphi _n}:{\omega _1} \to {\omega _1}|n \in \omega } \right\}$ such that for every $I \in {[{\omega _1}]^{{\omega _1}}}$ there is n ε ω such that ${\varphi _n}[I] = {\omega _1}$. We prove that this principle holds if there is a nonmeager set of size ω1 answering question of Arnold W. Miller. Combining our result with a theorem of Miller it then follows that (*) is equivalent to $non\left( {\cal M} \right) = {\omega _1}$. Miller also proved that the principle of Sierpinki is equivalent to the existence of a weak version of a Luzin set, we will construct a model where all of these sets are meager yet $non\left( {\cal M} \right) = {\omega _1}$.

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Bartoszyński, Tomek and Judah, Haim, Set Theory: on the Structure of the Real Line, Peters, A. K., Wellesley, MA, 1995.Google Scholar
Baumgartner, James E., Iterated forcing, Surveys in Set Theory, London Mathematical Society Lecture Note Series, vol. 87, Cambridge University Press, Cambridge, 1983, pp. 159.Google Scholar
Blass, Andreas, Combinatorial cardinal characteristics of the continuum, Handbook of Set Theory, Springer, Dordrecht, 2010, pp. 395489.Google Scholar
Judah, H. and Shelah, Saharon, Killing Luzin and Sierpinski sets. Proceedings of the American Mathematical Society, vol. 120 (1994), no. 3, pp. 917920.Google Scholar
Kechris, Alexander S., Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995.Google Scholar
Miller, Arnold, The onto mapping property of Sierpinski, preprint. Available at http://www.math.wisc.edu/~ miller/res/sier.pdf.Google Scholar
Raghavan, Dilip, Madness in set theory, Ph.D. thesis. University of Wisconsin–Madison, 2008.Google Scholar
Todorčević, Stevo, Partition Problems in Topology, Contemporary Mathematics, vol. 84, American Mathematical Society, Providence, RI, 1989.Google Scholar