Given a partition P:L → ω of the lines in , n ≥ 2, into countably many pieces, we ask if it is possible to find a partition of the points, , so that each line meets at most m points of its color. Assuming Martin’s Axiom, we show this is the case for m ≥ 3. We reduce the problem for m = 2 to a purely finitary geometry problem. Although we have established a very similar, but somewhat simpler, version of the geometry conjecture, we leave the general problem open. We consider also various generalizations of these results, including to higher dimension spaces and planes.
@article{bwmeta1.element.bwnjournal-article-fmv152i1p75bwm,
author = {Paul Erd\"os and Steve Jackson and R. Mauldin},
title = {On infinite partitions of lines and space},
journal = {Fundamenta Mathematicae},
volume = {154},
year = {1997},
pages = {75-95},
zbl = {0883.03031},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-fmv152i1p75bwm}
}
Erdös, Paul; Jackson, Steve; Mauldin, R. On infinite partitions of lines and space. Fundamenta Mathematicae, Tome 154 (1997) pp. 75-95. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-fmv152i1p75bwm/
[00000] [1] R. Davies, On a denumerable partition problem of Erdős, Proc. Cambridge Philos. Soc. 59 (1963), 33-36. | Zbl 0121.25702
[00001] [2] P. Erdős, S. Jackson and R. D. Mauldin, On partitions of lines and space, Fund. Math. 145 (1994), 101-119. | Zbl 0809.04004
[00002] [3] S. Jackson and R. D. Mauldin, Set Theory and Geometry, to appear.
[00003] [4] T. Jech, Set Theory, Academic Press, 1978.
[00004] [5] K. Kunen, Set Theory, an Introduction to Independence Proofs, North-Holland, 1980. | Zbl 0443.03021
[00005] [6] S. Todorčević, Partitioning pairs of countable ordinals, Acta Math. 159 (1987), 261-294. | Zbl 0658.03028