Ends of graphed equivalence relations. I (Q1001452)

Let \(E\) be a Borel equivalence relation on a Polish space \(X\). \(E\) is called finite (countable, aperiodic) if all of its equivalence classes are finite (countable, infinite). \(E\) is called smooth if there exists a sequence \(\langle B_n\rangle_{n\in\mathbb N}\) of \(E\)-invariant Borel sets such that \(xEy\Leftrightarrow\forall n\in\mathbb N\) \((x\in B_n\Leftrightarrow y\in B_n)\), for all \(x,y\in X\). \(E\) is called hyperfinite if there exists an increasing sequence \(\langle E_n\rangle_{n\in\mathbb N}\) of finite Borel equivalence relations such that \(E=\bigcup_{n\in\mathbb N}E_n.\) A Borel graph \(G\) on \(X\) is called a graphing of \(E\) if its connected components coincide with the equivalence classes of \(E\). A ray through \(G\) is an injective sequence \(\alpha\in X^\mathbb N\) such that \(\langle\alpha(n),\alpha(n+1)\rangle\in G\), for all \(n\in\mathbb N\). Two rays \(\alpha,\beta\) are called end equivalent if for any finite \(S\subseteq X\), there exists a path from \(\alpha\) to \(\beta\) through \(G|(X\setminus S)\). An end of \(G\) is an end equivalence class. A graphing is called endless if it has no rays. The author investigates relationships between Borel equivalence relations and their graphings. The main results of the paper: (1) \(E\) admits an endless graphing iff \(E\) is smooth; (2) \(E\) admits a locally finite single-ended graphing iff \(E\) is aperiodic; (3) \(E\) admits a graphing for which there is a Borel way of selecting two ends from each component iff \(E\) is hyperfinite; and (4) \(E\) admits a graphing for which there is a Borel way of selecting a finite set of at least three ends from each component iff \(E\) is smooth. For Part II see [\textit{G. Hjorth} and \textit{B. D. Miller}, Isr. J. Math. 169, 393--415 (2009; Zbl 1167.03031)].