A Partition Theorem for Perfect Sets
نویسنده
چکیده
Let P be a perfect subset of the real line, and let the «-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 «-element subsets he in at most (n — 1)! of the classes. Let C be the set of infinite sequences of zeros and ones, topologized as the product of countably many discrete two-point spaces, and ordered lexicographically. For X C C, let [X]n be the set of «-element subsets of X. When we describe a finite subset of C by listing its elements, we always assume that they are listed in increasing order. Thus, [C]" is identified with a subset of the product space C, from which it inherits a topology. A subset of C is perfect if it is nonempty and closed and has no isolated points. The purpose of this paper is to prove the following partition theorem, which was conjectured by F. Galvin who proved it [3] for n < 3. Theorem. Let P be a perfect subset of C and let [P]n be partitioned into a finite number of open (in [P]") pieces. Then there is a perfect set Q E P such that [Q]n intersects at most (n — 1)! of the pieces. Before setting up the machinery for the proof of this theorem, we point out some of its consequences. First, the therem remains true if C is replaced by the real line R with its usual topology and order. To see this, it suffices to observe that every perfect subset of R has a subset (a generalized Cantor set) homeomorphic to C via an order-preserving map and that any one-to-one continuous image in R of a perfect subset of C is perfect in R. Second, the hypothesis that the pieces of the partition are open can be greatly relaxed. Mycielski [6], [7] has shown that any meager set or any set of measure zero in [R]" is disjoint from [P]" for some perfect PçR. For the meager case, he obtains the same result with R replaced by any complete metric space X without isolated points. It follows that, if [R]" (or [X]") is partitioned into finitely many pieces that have the Baire property, then their intersections with [P]" are open in [P]" for some perfect P. Similarly, if the pieces are Lebesgue measurable, they become Gs sets when restricted to [P']n for suitable perfect 7"; since Gs sets have the Baire property, we can apply the preceding sentence, with 7" as X, to get a perfect PCP' such that the pieces intersected with [P]n are open in [P]". Thus, our theorem, as extended by the first remark above, implies the following partition theorem. Received by the editors April 27, 1979 and, in revised form, May 6, 1980; presented at a meeting on combinatorial set theory, Aachen, West Germany, June 1976. 1980 Mathematics Subject Classification. Primary 03E15, 03E05, 54H05. © 1981 American Mathematical Society 0002-9939/81/0000-0272/$02.75 271 License or copyright restrictions may apply to redistribution; see http://www.ams.org/journal-terms-of-use
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملRamsey and Freeness Properties of Polish Planes
Let X be a Polish space, that is, a separable, completely metrizable topological space. We always assume that X is non-empty and perfect, that is, X has no isolated points. An old theorem of Mycielski (see [8]) says that given a sequence of meager sets Bn Í X k n: n < q, where 1 < k n < q, there exists a perfect set P Í X such that P is free for each Bn , that is, P k n Ç Bn Í f x0 ; . . ....
متن کاملSmall Sets Satisfying the Central Sets Theorem
The Central Sets Theorem is a powerful theorem, one of whose consequences is that any central set in N contains solutions to any partition regular system of homogeneous linear equations. Since at least one set in any finite partition of N must be central, any of the consequences of the Central Sets Theorem must be valid for any partition of N. It is a result of Beiglböck, Bergelson, Downarowicz...
متن کاملThe Strong Perfect Graph Conjecture
A graph is perfect if, in all its induced subgraphs, the size of a largest clique is equal to the chromatic number. Examples of perfect graphs include bipartite graphs, line graphs of bipartite graphs and the complements of such graphs. These four classes of perfect graphs will be called basic. In 1960, Berge formulated two conjectures about perfect graphs, one stronger than the other. The weak...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کامل