Canonical Ramsey Theory on Polish Spaces (Encyclopedia of Mathematics and its Applications 202) By Vladimir Kanovei, Marcin Sabok and Jindrich Zapletal
Canonical Ramsey Theory on Polish Spaces (Encyclopedia of Mathematics and its Applications 202) By Vladimir Kanovei, Marcin Sabok and Jindrich Zapletal
复制标题
波兰空间的规范拉姆齐理论(数学及其应用百科全书 202) 作者:Vladimir Kanovei、Marcin Sabok 和 Jindrich Zapletal
DOI:
10.1112/blms/bdv016
复制
发表时间:
2015
影响因子:
0.9
通讯作者:
Brooke-Taylor A
中科院分区:
文献类型:
--
作者:
Brooke-Taylor A
The study of canonization of equivalence relations goes back to a beautiful result of Erdos and Rado [1]: for any equivalence relation∼ on the increasing n-tuples from N, there is an infinite subset A of N and a subset σ of {1,..., n} such that for all increasing tuples a=(a1,..., an) and b=(b1,..., bn) in An, a∼ b if and only if ai= bi for all i in σ. This ability to reduce the domain so that the relation in question becomes well-behaved may be seen as an extension of the standard Ramsey Theorem; in fact, one may immediately deduce the standard Ramsey Theorem from this result, taking n= 2 and for a graph G on N considering the equivalence relation (m, n)∼(o, p) if and only if each or neither pair is an edge of G (in this case, σ must be∅, since there are only two equivalence classes). It is natural to ask the analogous question in other contexts: given an equivalence relation on a set X, can one move to a suitable subset A⊆ X on which the equivalence relation takes a canonical form? The present book studies this question for the case when X is a Polish space, that is, a separable topological space that can be endowed with a complete metric (the archetypal example being R). The study of Borel and analytic equivalence relations on Polish spaces has become a major focus of modern descriptive set theory, in part because of its broad applicability: any kind of object that may be reasonably encoded by reals fits into this framework. For example, the isomorphism relation on countable structures of a given type (be they groups, rings or what have you) with underlying set N is a central example of such an equivalence relation. We say that an equivalence relation E on X is Borel reducible to an equivalence relation F on Y, written E≤ B F, if there is a Borel function f: X→ Y such that xEy if and only if f (x) Ff (y) for all x, y∈ X. Using the techniques of descriptive set theory to determine whether certain equivalence relations are Borel reducible to others has had important ramifications for various classification programmes, such as the results of Thomas and Velickovic for finitely generated groups [5], and more recent results of Farah, Toms and Törnquist for C∗-algebras [2]. For more on this area, see, for example, Hjorth [3]. The next question is what constitutes a ‘suitable’subset A⊆ X to restrict to. The set A should be in some sense ‘not small’; this is formalized using a σ-ideal I considered to be the family of ‘small’sets. The set A should also be reasonably definable from a descriptive settheoretic point of view; Borel is taken to be the appropriate notion here. We thus arrive at the central definition of the book, for which the authors in true Ramsey-theoretic style introduce an arrow notation.Definition 1.15. Let E and F be classes of equivalence relations, and let I be a σ-ideal on a Polish space X. We denote by E→ I F the statement that for every I-positive (that is, not in I) Borel set B⊆ X and every E∈ E on B there is an I-positive Borel set A⊆ B such