Abstract
We shall color the Cartesian product ω × ω1with two colors. Can an infinite subset A ⊂ω and an uncountable subset B ⊂ω1 be found such that the product A × B can be one-colored? This problem proves to be unsolvable in ZFC.
This is a preview of subscription content, log in via an institution to check access.
Literature cited
P. Erdös and R. Rado, “Combinatorial theorems on classifications of subsets of a given set,” Proc. London Math. Soc.,2, No. 3, 417–439 (1952).
J. Barwise (ed.), Handbook of Mathematical Logic, Set Theory, North-Holland, Amsterdam (1977).
V. I. Malykhin, “Topological properties of Cohen's generic extensions,” Dokl. Akad. Nauk SSSR,274, No. 3, 540–544 (1984).
V. I. Malykhin, “Existence of topological objects for an arbitrary cardinal arithmetic,” Dokl. Akad. Nauk SSSR,286, No. 3, 542–546 (1986).
K. Kunen and I. E. Vaughan (eds.), Handbook of Set-Theoretic Topology, North-Holland, Amsterdam (1984).
K. Kunen, Set Theory, North-Holland, Amsterdam (1980).
V. I. Arnautov, A. V. Arkhangel'skii, P. I. Kirku, et al. (eds.), Unsolved Problems in Topological Algebra, Shtiintsa, Kishinev (1985).
Author information
Authors and Affiliations
Additional information
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 6, pp. 850–854, June, 1990.
Rights and permissions
About this article
Cite this article
Zelenyuk, E.G., Malykhin, V.I. A two-coloring of Cartesian products. Ukr Math J 42, 751–754 (1990). https://doi.org/10.1007/BF01058929
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01058929