Borel equivalence relations which are highly unfree

2008 ◽  
Vol 73 (4) ◽  
pp. 1271-1277 ◽  
Author(s):  
Greg Hjorth

AbstractThere is an ergodic, measure preserving, countable Borel equivalence relation E on a standard Borel probability space (X, μ) such that E∣c is not essentially free on any conull C ⊂ X.

2005 ◽  
Vol 70 (3) ◽  
pp. 979-992 ◽  
Author(s):  
Greg Hjorth

This note answers a questions from [2] by showing that considered up to Borel reducibility, there are more essentially countable Borel equivalence relations than countable Borel equivalence relations. Namely:Theorem 0.1. There is an essentially countable Borel equivalence relation E such that for no countable Borel equivalence relation F (on a standard Borel space) do we haveThe proof of the result is short. It does however require an extensive rear guard campaign to extract from the techniques of [1] the followingMessy Fact 0.2. There are countable Borel equivalence relationssuch that:(i) eachExis defined on a standard Borel probability space (Xx, μx); each Ex is μx-invariant and μx-ergodic;(ii) forx1 ≠ x2 and A μxι -conull, we haveExι/Anot Borel reducible toEx2;(iii) if f: Xx → Xxis a measurable reduction ofExto itself then(iv)is a standard Borel space on which the projection functionis Borel and the equivalence relation Ê given byif and only ifx = x′ andzExz′ is Borel;(V)is Borel.We first prove the theorem granted this messy fact. We then prove the fact.(iv) and (v) are messy and unpleasant to state precisely, but are intended to express the idea that we have an effective parameterization of countable Borel equivalence relations by points in a standard Borel space. Examples along these lines appear already in the Adams-Kechris constructions; the new feature is (iii).Simon Thomas has pointed out to me that in light of theorem 4.4 [5] the Gefter-Golodets examples of section 5 [5] also satisfy the conclusion of 0.2.


1993 ◽  
Vol 58 (3) ◽  
pp. 894-907 ◽  
Author(s):  
Alexander S. Kechris

LetXbe a standard Borel space (i.e., a Polish space with the associated Borel structure), and letEbe acountableBorel equivalence relation onX, i.e., a Borel equivalence relationEfor which every equivalence class [x]Eis countable. By a result of Feldman-Moore [FM],Eis induced by the orbits of a Borel action of a countable groupGonX.The structure of general countable Borel equivalence relations is very little understood. However, a lot is known for the particularly important subclass consisting of hyperfinite relations. A countable Borel equivalence relation is calledhyperfiniteif it is induced by a Borel ℤ-action, i.e., by the orbits of a single Borel automorphism. Such relations are studied and classified in [DJK] (see also the references contained therein). It is shown in Ornstein-Weiss [OW] and Connes-Feldman-Weiss [CFW] that for every Borel equivalence relationEinduced by a Borel action of a countable amenable groupGonXand for every (Borel) probability measure μ onX, there is a Borel invariant setY⊆Xwith μ(Y) = 1 such thatE↾Y(= the restriction ofEtoY) is hyperfinite. (Recall that a countable group G isamenableif it carries a finitely additive translation invariant probability measure defined on all its subsets.) Motivated by this result, Weiss [W2] raised the question of whether everyEinduced by a Borel action of a countable amenable group is hyperfinite. Later on Weiss (personal communication) showed that this is true forG= ℤn. However, the problem is still open even for abelianG. Our main purpose here is to provide a weaker affirmative answer for general amenableG(and more—see below). We need a definition first. Given two standard Borel spacesX, Y, auniversally measurableisomorphism betweenXandYis a bijection ƒ:X→Ysuch that both ƒ, ƒ-1are universally measurable. (As usual, a mapg:Z→W, withZandWstandard Borel spaces, is calleduniversally measurableif it is μ-measurable for every probability measure μ onZ.) Notice now that to assert that a countable Borel equivalence relation onXis hyperfinite is trivially equivalent to saying that there is a standard Borel spaceYand a hyperfinite Borel equivalence relationFonY, which isBorelisomorphic toE, i.e., there is a Borel bijection ƒ:X→YwithxEy⇔ ƒ(x)Fƒ(y). We have the following theorem.


2005 ◽  
Vol 70 (4) ◽  
pp. 1325-1340 ◽  
Author(s):  
Christian Rosendal

AbstractFamilies of Borel equivalence relations and quasiorders that are cofinal with respect to the Borel reducibility ordering. ≤B, are constructed. There is an analytic ideal on ω generating a complete analytic equivalence relation and any Borel equivalence relation reduces to one generated by a Borel ideal. Several Borel equivalence relations, among them Lipschitz isomorphism of compact metric spaces, are shown to be Kσ complete.


2020 ◽  
pp. 1-33
Author(s):  
RUIYUAN CHEN

Abstract We show that the uniform measure-theoretic ergodic decomposition of a countable Borel equivalence relation $(X, E)$ may be realized as the topological ergodic decomposition of a continuous action of a countable group $\Gamma \curvearrowright X$ generating E. We then apply this to the study of the cardinal algebra $\mathcal {K}(E)$ of equidecomposition types of Borel sets with respect to a compressible countable Borel equivalence relation $(X, E)$ . We also make some general observations regarding quotient topologies on topological ergodic decompositions, with an application to weak equivalence of measure-preserving actions.


2017 ◽  
Vol 17 (01) ◽  
pp. 1750003
Author(s):  
Andrew S. Marks

We prove a number of results motivated by global questions of uniformity in computabi- lity theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional uniformity hypothesis, we can answer many questions concerning how countable groups, probability measures, the subset relation, and increasing unions interact with universality. For many natural classes of countable Borel equivalence relations, we can also classify exactly which are uniformly universal. We also show the existence of refinements of Martin’s ultrafilter on Turing invariant Borel sets to the invariant Borel sets of equivalence relations that are much finer than Turing equivalence. For example, we construct such an ultrafilter for the orbit equivalence relation of the shift action of the free group on countably many generators. These ultrafilters imply a number of structural properties for these equivalence relations.


2000 ◽  
Vol 65 (4) ◽  
pp. 1881-1894 ◽  
Author(s):  
Sławomir Solecki

AbstractWe show that each non-compact Polish group admits a continuous action on a Polish space with non-smooth orbit equivalence relation. We actually construct a free such action. Thus for a Polish group compactness is equivalent to all continuous free actions of this group being smooth. This answers a question of Kechris. We also establish results relating local compactness of the group with its inability to induce orbit equivalence relations not reducible to countable Borel equivalence relations. Generalizing a result of Hjorth, we prove that each non-locally compact, that is, infinite dimensional, separable Banach space has a continuous action on a Polish space with non-Borel orbit equivalence relation, thus showing that this property characterizes non-local compactness among Banach spaces.


2016 ◽  
Vol 37 (7) ◽  
pp. 2084-2098
Author(s):  
CLINTON T. CONLEY ◽  
BENJAMIN D. MILLER

Suppose that $X$ is a Polish space, $E$ is a countable Borel equivalence relation on $X$, and $\unicode[STIX]{x1D707}$ is an $E$-invariant Borel probability measure on $X$. We consider the circumstances under which for every countable non-abelian free group $\unicode[STIX]{x1D6E4}$, there is a Borel sequence $(\cdot _{r})_{r\in \mathbb{R}}$ of free actions of $\unicode[STIX]{x1D6E4}$ on $X$, generating subequivalence relations $E_{r}$ of $E$ with respect to which $\unicode[STIX]{x1D707}$ is ergodic, with the further property that $(E_{r})_{r\in \mathbb{R}}$ is an increasing sequence of relations which are pairwise incomparable under $\unicode[STIX]{x1D707}$-reducibility. In particular, we show that if $E$ satisfies a natural separability condition, then this is the case as long as there exists a free Borel action of a countable non-abelian free group on $X$, generating a subequivalence relation of $E$ with respect to which $\unicode[STIX]{x1D707}$ is ergodic.


1990 ◽  
Vol 10 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Scot Adams

AbstractLet R be a Borel equivalence relation with countable equivalence classes on a measure space M. Intuitively, a ‘treeing’ of R is a measurably-varying way of makin each equivalence class into the vertices of a tree. We make this definition rigorous. We prove that if each equivalence class becomes a tree with polynomial growth, then the equivalence relation is amenable. We prove that if the equivalence relation is finite measure-preserving and amenable, then almost every tree (i.e., equivalence class) must have one or two ends.


2006 ◽  
Vol 71 (4) ◽  
pp. 1081-1096 ◽  
Author(s):  
Longyun Ding ◽  
Su Gao

AbstractWe investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence relation is characterized and is shown to be connected with the Borelness of the intersection operator. We also consider relatively tame Polish groups and give a characterization of them in the class of countable products of countable abelian groups. Finally an example of a logic action is considered and its complexity in the Borel reducbility hierarchy determined.


2021 ◽  
pp. 1-10
Author(s):  
Narjes Firouzkouhi ◽  
Abbas Amini ◽  
Chun Cheng ◽  
Mehdi Soleymani ◽  
Bijan Davvaz

Inspired by fuzzy hyperalgebras and fuzzy polynomial function (term function), some homomorphism properties of fundamental relation on fuzzy hyperalgebras are conveyed. The obtained relations of fuzzy hyperalgebra are utilized for certain applications, i.e., biological phenomena and genetics along with some elucidatory examples presenting various aspects of fuzzy hyperalgebras. Then, by considering the definition of identities (weak and strong) as a class of fuzzy polynomial function, the smallest equivalence relation (fundamental relation) is obtained which is an important tool for fuzzy hyperalgebraic systems. Through the characterization of these equivalence relations of a fuzzy hyperalgebra, we assign the smallest equivalence relation α i 1 i 2 ∗ on a fuzzy hyperalgebra via identities where the factor hyperalgebra is a universal algebra. We extend and improve the identities on fuzzy hyperalgebras and characterize the smallest equivalence relation α J ∗ on the set of strong identities.


Sign in / Sign up

Export Citation Format

Share Document