Countable Borel relation explained

In descriptive set theory, specifically invariant descriptive set theory, countable Borel relations are a class of relations between standard Borel space which are particularly well behaved. This concept encapsulates various more specific concepts, such as that of a hyperfinite equivalence relation, but is of interest in and of itself.

Motivation

A main area of study in invariant descriptive set theory is the relative complexity of equivalence relations. An equivalence relation

E on a set X is considered more complex than an equivalence relation F on a set Y if one can "compute F using E " - formally, if there is a function f:Y \to X which is well behaved in some sense (for example, one often requires that f is Borel measurable) such that \forall x,y \in Y: xFy \iff f(x)Ef(y) . Such a function If this holds in both directions, that one can both "compute F using E " and "compute E using F ", then E and F have a similar level of complexity. When one talks about Borel equivalence relations and requires f to be Borel measurable, this is often denoted by E \sim _{B} F .

Countable Borel equivalence relations, and relations of similar complexity in the sense described above, appear in various places in mathematics (see examples below, and see ^[1] for more). In particular, the Feldman-Moore theorem described below proved useful in the study of certain Von Neumann algebras (see ^[2]).

Definition

Let

X and Y be standard Borel spaces. A countable Borel relation between X and Y is a subset R of the cartesian product X x Y which is a Borel set (as a subset in the Product topology) and satisfies that for any x \in X , the set \lbrace y \in Y | (x,y) \in R \rbrace is countable.

Note that this definition is not symmetric in

X and Y , and thus it is possible that a relation R is a countable Borel relation between X and Y but the converse relation is not a countable Borel relation between Y and X .

Examples

• A countable union of countable Borel relations is also a countable Borel relation.
• The intersection of a countable Borel relation with any Borel subset of

X x Y is a countable Borel relation.

• If

f:X\to Y is a function between standard Borel spaces, the graph \Gamma(f) of the function is a countable Borel relation between X and Y if and only if f is Borel measurable (this is a consequence of the Luzin-Suslin theorem^[3] and the fact that \lbrace y \in Y | (x,y) \in \Gamma(f) \rbrace = \lbrace f(x) \rbrace ). The converse relation of the graph, \lbrace (f(x),x) | x \in X \rbrace , is a countable Borel relation if and only if f is Borel measurable and has countable fibers.

• If

E is an equivalence relation, it is a countable Borel relation if and only if it is a Borel set and all equivalence classes are countable. In particular hyperfinite equivalence relations are countable Borel relations.

• The equivalence relation induced by the continuous action of a countable group is a countable Borel relation. As a concrete example, let

X be the set of subgroups of F _{2} , the Free group of rank 2, with the topology generated by basic open sets of the form \lbrace G \in X | a \in G \rbrace and \lbrace G \in X | a \notin G \rbrace for some a \in F _{2} (this is the Product topology on 2 ^{F _{2}} ). The equivalence relation G \sim H \iff \exists a \in F _{2} : G = a ^{-1} Ha is then a countable Borel relation.

• Let

l{C} be the space of subsets of the naturals, again with the product topology (a basic open set is of the form \lbrace X \in l{C} | n \in X \rbrace or \lbrace X \in l{C} | n \notin X \rbrace ) - this is known as the Cantor space. The equivalence relation of Turing equivalence is a countable Borel equivalence relation.^[4]

• The isomorphism equivalence relation between various classes of models, while not being countable Borel equivalence relations, are of similar complexity to a Borel equivalence relation in the sense described above. Examples include:
  • The class of countable graphs where the degree of each vertex is finite.
  • The class field extensions of finite transcendence degree over the rationals.

The Luzin–Novikov theorem

This theorem, named after Nikolai Luzin and his doctoral student Pyotr Novikov, is an important result used is many proofs about countable Borel relations.

Theorem. Suppose

X and Y are standard Borel spaces and R is a countable Borel relation between X and Y . Then the set Proj _{X(R)=\lbrace} x \in X | \exists y \in Y:(x,y) \in R\rbrace is a Borel subset of Y . Furthermore, there is a Borel function f:Proj _{X(R)} \to Y (known as a Borel uniformization) such that the graph of f is a subset of R . Finally, there exist Borel subsets \lbrace A _{n} \rbrace ^{inf ty} _{n =1} of X and Borel functions f _{n:A} _{n} \to Y such that R is the union of the graphs of the f _{n} , that is R = \lbrace (x,y) \in X x Y | \exists n \in \N : x \in A _{n} ∧ y = f _{n(x)} \rbrace .^[5]

This has a couple of easy consequences:

• If

f:X\to Y is a Borel measurable function with countable fibers, the image of f is a Borel subset of Y (since the image is exactly Proj _{Y(R)} where R is the converse relation of the graph of f ) .

• Assume

E is a Borel equivalence relation on a standard Borel space X which has countable equivalence classes. Assume A is a Borel subset of X . Then [A] _{E=\lbrace} x \in X | \exists x' \in A:xEx'\rbrace is also a Borel subset of X (since this is precisely Proj _{X(R)} where R = E\cap(X x A) , and X x A is a Borel set).Below are two more results which can be proven using the Luzin-Novikov Novikov theorem, concerning countable Borel equivalence relations:

Feldman–Moore theorem

The Feldman–Moore theorem, named after Jacob Feldman and Calvin C. Moore, states:

Theorem. Suppose

E is a Borel equivalence relation on a standard Borel space X which has countable equivalence classes. Then there exists a countable group G and action of G on X such that for every g \in G the function x \mapsto g.x is Borel measurable, and for any x \in X , the equivalence class of x with respect to E is exactly the orbit of x under the action.^[6]

That is to say, countable Borel equivalence relations are exactly those generated by Borel actions by countable groups.

Marker lemma

This lemma is due to Theodore Slaman and John R. Steel, and can be proven using the Feldman–Moore theorem:

Lemma. Suppose

E is a Borel equivalence relation on a standard Borel space X which has countable equivalence classes. Let B = \lbrace x \in X | |[x] _{E|=\aleph} _{0} \rbrace . Then there is a decreasing sequence B \supseteq S _{1} \supseteq S _{2} \supseteq ... such that [S _{n]} _{E=B} for all S _{n} and c ap ^{inf ty} _{n =1} S _{n} = \emptyset .\mu on X the lemma implies that \lim _{n} \mu(S _{n)} = 0 by the continuity of the measure).

References

1. Adams . Scot . Kechris . Alexander . 2000 . Linear algebraic groups and countable Borel equivalence relations . Journal of the American Mathematical Society . en . 13 . 4 . 911 . 10.1090/S0894-0347-00-00341-6 . 0894-0347. free .
2. Feldman . Jacob . Moore . Calvin C. . 1977 . Ergodic equivalence relations, cohomology, and von Neumann algebras. II . Transactions of the American Mathematical Society . en . 234 . 2 . 325–359 . 10.1090/S0002-9947-1977-0578730-2 . 0002-9947. free .
3. Book: Kechris, Alexander S. . Classical Descriptive Set Theory. . 1995 . Springer New York . 978-1-4612-4190-4 . N . New York . Theorem 15.1 . 958524358.
4. Hjorth . Greg . Kechris . Alexander S. . 1996-12-15 . Borel equivalence relations and classifications of countable models . Annals of Pure and Applied Logic . en . 82 . 3 . Part 4.2 . 10.1016/S0168-0072(96)00006-1 . 0168-0072. free .
5. Book: Kechris, Alexander S. . Classical Descriptive Set Theory. . 1995 . Springer New York . 978-1-4612-4190-4 . N . New York . Theorem 18.10 . 958524358.
6. Feldman . Jacob . Moore . Calvin C. . 1977 . Ergodic equivalence relations, cohomology, and von Neumann algebras. I . Transactions of the American Mathematical Society . en . 234 . 2 . 289–324 . 10.1090/S0002-9947-1977-0578656-4 . 0002-9947. free .