A partition theorem for perfect sets
HTML articles powered by AMS MathViewer
- by Andreas Blass
- Proc. Amer. Math. Soc. 82 (1981), 271-277
- DOI: https://doi.org/10.1090/S0002-9939-1981-0609665-0
- PDF | Request permission
Abstract:
Let $P$ be a perfect subset of the real line, and let the $n$-element subsets of $P$ be partitioned into finitely many classes, each open (or just Borel) in the natural topology on the collection of such subsets. Then $P$ has a perfect subset whose $n$-element subsets lie in at most $(n - 1)!$ of the classes.References
- John P. Burgess, A selector principle for $\sum ^{1}_{1}$ equivalence relations, Michigan Math. J. 24 (1977), no. 1, 65–76. MR 453530
- F. M. Filipczak, Sur les fonctions continues relativement monotones, Fund. Math. 58 (1966), 75–87 (French). MR 188381, DOI 10.4064/fm-58-1-75-87 F. Galvin, Partition theorems for the real line, Notices Amer. Math. Soc. 15 (1968), 660; Erratum 16 (1969), 1095.
- Fred Galvin and Saharon Shelah, Some counterexamples in the partition calculus, J. Combinatorial Theory Ser. A 15 (1973), 167–174. MR 329900, DOI 10.1016/s0097-3165(73)80004-4
- J. D. Halpern and H. Läuchli, A partition theorem, Trans. Amer. Math. Soc. 124 (1966), 360–367. MR 200172, DOI 10.1090/S0002-9947-1966-0200172-2
- Jan Mycielski, Independent sets in topological algebras, Fund. Math. 55 (1964), 139–147. MR 173645, DOI 10.4064/fm-55-2-139-147
- Jan Mycielski, Algebraic independence and measure, Fund. Math. 61 (1967), 165–169. MR 224762, DOI 10.4064/fm-61-2-165-169
Bibliographic Information
- © Copyright 1981 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 82 (1981), 271-277
- MSC: Primary 03E15; Secondary 03E05, 04A20, 54H05
- DOI: https://doi.org/10.1090/S0002-9939-1981-0609665-0
- MathSciNet review: 609665