We introduce the notion of $(Γ,E)$-determinacy for $Γ$ a pointclass and $E$ an equivalence relation on a Polish space $X$. A case of particular interest is the case when $E=E_G$ is the (left) shift-action of $G$ on $S^G$ where $S=2=\{0,1\}$ or $S=ω$. We show that for all shift actions by countable groups $G$, and any "reasonable" pointclass $Γ$, that $(Γ,E_G)$-determinacy implies $Γ$-determinacy. We also prove a corresponding result when $E$ is a subshift of finite type of the shift map on $2^\mathbb{Z}$.
We prove, in ZF+$\bfΣ^1_2$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a cone, and (3) relative to some oracle, for every equivalence class $[Y]_E$ we have that a real $X$ computes a member of the equivalence class if and only if $\om_1^X\geq\om_1^{[Y]}$. We also show that the implication from (1) to (2) is equivalent to the existence of sharps over $ZF$.
Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic operator of supervenience as a sole modality. The semantics of supervenience modality is very natural to correspond to the supervenience-determined consequence relation, in a quite similar way that the strict implication corresponds to the inference-determined consequence relation. We show that this new logic is more expressive than the modal logic of agreement, …
Composition and lattice join (transitive closure of a union) of equivalence relations are operations taking pairs of decidable equivalence relations to relations that are semi-decidable, but not necessarily decidable. This article addresses the question, is every semi-decidable equivalence relation obtainable in those ways from a pair of decidable equivalence relations? It is shown that every semi-decidable equivalence relation, of which every equivalence class is infinite, is obtainable as both a composition and a lattice join of decidable equivalence relations having infinite equivalence cla…
In this paper, we study Schauder equivalence relations, which are Borel equivalence relations generated by Banach spaces with basic sequences. We prove that the set of equivalence relations generated by basic sequences has boundaries. Then we show that equivalence relations generated by the basis in Tsirelson spaces has similar properties of Tsirelson spaces in the Banach space theory. In particular, we prove that both l_p and c_0 are not reducible to the equivalence relation generated by Tsirelson space T with the unit vector basis \{t_n\}. We also show that Borel equivalence relation generat…
The transitive closure of a reflexive, symmetric, analytic relation is an analytic equivalence relation. Does some smaller class contain the transitive closure of every reflexive, symmetric, closed relation? An essentially negative answer is provided here. Every analytic equivalence relation on an arbitrary Polish space is Borel embeddable in the transitive closure of the union of two smooth Borel equivalence relations on that space. In the case of the Baire space, the two smooth relations are closed and the embedding is homeomorphic.
We introduce a notion of relative primeness for equivalence relations, strengthening the notion of non-reducibility, and show for many standard benchmark equivalence relations that non-reducibility may be strengthened to relative primeness. We introduce several analogues of cardinal properties for Borel equivalence relations, including the notion of a prime equivalence relation and Borel partition properties on quotient spaces. In particular, we introduce a notion of Borel weak compactness, and characterize partition properties for the equivalence relations ${\mathbb F}_2$ and ${\mathbb E}_1$.…
We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $Σ$ 0 $ξ$ (or $Π$ 0 $ξ$). We characterize when all the equivalence classes of such a relation are $Σ$ 0 $ξ$ (or $Π$ 0 $ξ$). We prove analogous results for the Borel equivalence relations with countably many equivalence classes. We also completely solve these two problems for the first two ranks. In order to do this, we prove some extensions of the Louveau-Saint Raymond theorem which itself generalized the Hurewi…
We consider countable Borel equivalence relations on quotient Borel spaces. We prove a generalization of the Feldman-Moore representation theorem, but provide some examples showing that other very simple properties of countable equivalence relations on standard Borel spaces may fail in the context of nonsmooth quotients.
We study Borel equivalence relations induced by Borel actions of tsi Polish groups on standard Borel spaces. We characterize when such an equivalence relation admits classification by countable structures using a variant of the $\mathbb G_0$-dichotomy. In particular, we find a class that serves as a base for non-classification by countable structures for these equivalence relations under Borel reducibility. We use this characterization together with the result of [B. D. Miller, to appear in the Journal of Mathematical Logic] to show that if such an equivalence relation admits classification by…
We discuss combinatorial conditions for the existence of various types of reductions between equivalence relations, and in particular identify necessary and sufficient conditions for the existence of injective reductions.
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
For a class $\mathcal K$ of countable relational structures, a countable Borel equivalence relation $E$ is said to be $\mathcal K$-structurable if there is a Borel way to put a structure in $\mathcal K$ on each $E$-equivalence class. We study in this paper the global structure of the classes of $\mathcal K$-structurable equivalence relations for various $\mathcal K$. We show that $\mathcal K$-structurability interacts well with several kinds of Borel homomorphisms and reductions commonly used in the classification of countable Borel equivalence relations. We consider the poset of classes of $\…
We ask whether $\mathbf{Δ^1_2}$ or $\mathbf{Σ^1_2}$ equivalence relations with $I$-small classes for $I$ a $σ$-ideal must have perfectly many classes. We show that for a wide class of ccc $σ$-ideals, a positive answer for $\mathbf{Δ^1_2}$ equivalence relations is equivalent to the $I$-measurability of $\mathbf{Δ^1_2}$ sets. However, the analogous statement for $\mathbf{Σ^1_2}$ equivalence relations is false: $\mathbf{Σ^1_2}$ equivalence relations with meager classes have a perfect set of pairwise inequivalent elements if and only if $\mathbf{Δ^1_2}$ sets have the Baire property.
This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if $E$ is strongly ergodic with respect to $μ$ then $E^\mathbb{N}$ is strongly ergodic with respect to $μ^\mathbb{N}$. We answer questions of Clemens and Coskey regarding their recently defined $Γ$-jump operations, in particular showing that the $\mathbb{Z}^2$-jump of $E_\infty$ is strictly above the $\mathbb{Z}$-jump of $E_\infty$. We study a notion of equivalence relations which can be classified by infinite sequences…
In this paper we complete the attempt of H. Lefmann to show that Borel equivalence relations on the $n$-element subsets of $2^ω$, that respect an order type, have a finite Ramsey basis.
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this paper, we shall give an overview of some work that has been done on Martin's conjecture, and applications that it has had in descriptive set theory. We will present a long unpublished result of Slaman and…
Let $E\subseteq F$ and $E'\subseteq F'$ be Borel equivalence relations on the standard Borel spaces $X$ and $Y$, respectively. The pair $(E,F)$ is simultaneously Borel reducible to the pair $(E',F')$ if there is a Borel function $f:X\to Y$ that is both a reduction from $E$ to $E'$ and a reduction from $F$ to $F'$. Simultaneous Borel embeddings and isomorphisms are defined analogously. We classify all pairs $E\subseteq F$ of smooth countable Borel equivalence relations up to simultaneous Borel bireducibility and biembeddability, and a significant portion of such pairs up to simultaneous Borel i…
We prove that for every equivalence relation on a barrier on the space $\langle FIN^{[\infty]}_k,\leq,r\rangle$, for any $k$, there exists $Y\in FIN_k^{[\infty]}$ so that the restriction of the coloring on $\langle Y\rangle$ is canonical.
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal co-computably enumerable equivalence relation. (3) Each c.e. truth-table degree contains the word problem of a finitely generated group of computable permutations.
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility spectrum of computably enumerable…
We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel sets of these equivalence relations which are related to Martin's ultrafilter on the Turing degrees.
A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with $I$-small equivalence classes, where $I$ is a proper $σ$-ideal, and ask whether they have a perfect set of pairwise inequivalent elements. We give a positive answer for $E$ universally Baire. We show that the answer for $E$ $\mathbf{Δ_{2}^{1}}$ is independent of $ZFC$, and find set theoretic assumptions equivalent to it when $I$ is the countable ideal. For equivalen…
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time generalization of the countable Borel equivalence relations, a key subclass of the Borel equivalence rel…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be $Π_{n+2}$-complete under computable reducibility, we show that, for every $n$, there does exist a natural equivalence relation which is $Π_{n+2}$-complete under finitary reducibility. We also show that our hierarchy of finitary reducibilities does not collapse, and illustrate how it sharpens certain known results. Along …
A standard tool for classifying the complexity of equivalence relations on $ω$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce minimal degrees with respect to computable reducibility. Let $Γ$ be one of the following classes: $Σ^0_α$, $Π^0_α$, $Σ^1_n$, or $Π^1_n$, where $α\geq 2$ is a computable ordinal and $n$ is a non-zero natural number. We prove that there are infinitely many pairwise incomparable minimal equivalence relations that are properly in $Γ$.
The following will be shown: Let $I$ be a $σ$-ideal on a Polish space $X$ with the property that the associated forcing of $I^+$ Borel subsets ordered by $\subseteq$ is a proper forcing. Let E be an analytic or coanalytic equivalence relation on this Polish space with all equivalence classes Borel. If sharps of certain sets exist, then there is an $I^+$ Borel subset $C$ of $X$ such that $E \upharpoonright C$ is a Borel equivalence relation.
The main question here is the possible generalization of the following theorem on ``simple'' equivalence relation on 2^omega to higher cardinals. Theorem: (1) Assume that: (a) E is a Borel 2-place relation on 2^omega, (b) E is an equivalence relation, (c) if eta, nu in 2^omega and (exists ! n)(eta(n) not= nu(n)), then eta, nu are not E --equivalent. Then there is a perfect subset of 2^omega of pairwise non E-equivalent members. (2) Instead of ``E is Borel'', ``E is analytic (or even a Borel combination of analytic relations)'' is enough. (3) If E is a Pi^1_2 relation which is an equivalence re…
Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we introduce a family of properties of countable Borel equivalence relations which correspond to combinatorial cardinal characteristics of the continuum in the same way that Borel boundedness corresponds to the bounding number $\mathfrak b$. We analyze some of the basic behavior of these properties, showing for instance that the property corresponding to the splitting …
We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially countable if and only if there is no continuous embedding of E1 into E. Our techniques also yield the first classical proof of the analogous result for hypersmooth equivalence relations, and allow us to show that up to continuous Kakutani embeddability, there is a minimum Borel function which is not essentially countable-to-one.
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on $ω$ is above equality on ${\cal P}(ω)$, the power set of $ω$, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on ${\cal P}(ω)$. In this article we examine the effective content of these and related results by studying effectively Borel equivalence relat…
A selection of basic results on Borel reducibility of ideals and equivalence relations, especially those with comparably short proofs. This is an unfinished text as yet. Some proofs have missing parts and loose ends. kanovei@mccme.ru and vkanovei@math.uni-wuppertal.de are my contact addresses.
This paper improves two existing theorems of interest to neo-logicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic. The improved theorem states that if an equivalence relation $E$ is defined without non-logical vocabulary, then the bicardinal slice of any equivalence class---those equinumerous elements of the equivalence class with equinumerous complements---can have one of only three profiles. The improvements to Fine's theorem allow for an analysis of the well-behaved m…
In $\mathsf{ZFC}$, if there is a measurable cardinal with infinitely many Woodin cardinals below it, then for every equivalence relation $E \in L(\mathbb{R})$ on $\mathbb{R}$ with all $\mathbfΔ_1^1$ classes and every $σ$-ideal $I$ on $\mathbb{R}$ so that the associated forcing $\mathbb{P}_I$ of $I^+$ $\mathbfΔ_1^1$ subsets is proper, there exists some $I^+$ $\mathbfΔ_1^1$ set $C$ so that $E \upharpoonright C$ is a $\mathbfΔ_1^1$ equivalence relation. In $\mathsf{ZF} + \mathsf{DC} + \mathsf{AD}_\mathbb{R} + V = L(\mathscr{P}(\mathbb{R}))$, for every equivalence relation $E$ on $\mathbb{R}$ with…
We present a selection of basic results on Borel reducibility of Borel ideals and equivalence relations, especially those with comparably short proofs. The focal point are reducibility/irreducibility results related to some special equivalences like $E_0, E_1, E_2, E_3, E_\infty, Z_0,$ and Banach-induced equivalences $l_p,$ in particular several dichotomy theorems. The bulk of results included in the book were obtained in the 1990s, but some rather recent theorems are presented as well, like Rosendal's proof that Borel ideals are cofinal within Borel equivalences of general form.
Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are Σ^1_1-complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in ZFC whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is Σ^1_1-complete (it is, if V = L, but can be forced not to be).
A canonization scheme for smooth equivalence relations on $\mathbb R^ω$ modulo restriction to infinite perfect products is proposed. It shows that given a pair of Borel smooth equivalence relations $\mathsf E,\mathsf F$ on $\mathbb R^ω$, there is an infinite perfect product $P\subseteq\mathbb R^ω$ such that either ${\mathsf F}\subseteq{\mathsf E}$ on $P$, or, for some $j<ω$, the following is true for all $x,y\in P$: $x\,\mathsf E \,y$ implies $x(j)=y(j)$, and $x\restriction{(ω\smallsetminus\{j\})}=y\restriction{(ω\smallsetminus\{j\})}$ implies $x\,\mathsf F \,y$.
We introduce a new family of jump operators on Borel equivalence relations; specifically, for each countable group $Γ$ we introduce the $Γ$-jump. We study the elementary properties of the $Γ$-jumps and compare them with other previously studied jump operators. One of our main results is to establish that for many groups $Γ$, the $Γ$-jump is \emph{proper} in the sense that for any Borel equivalence relation $E$ the $Γ$-jump of $E$ is strictly higher than $E$ in the Borel reducibility hierarchy. On the other hand there are examples of groups $Γ$ for which the $Γ$-jump is not proper. To establish…
We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ER s of a family which includes Polish actions of S_\infty, the group of all permutations of N, and is closed under the Fubini product modulo the ideal Fin of all finite sets, and some other operations. Our second main result shows that T_2, the equivalence relation called ``the equality of countable sets of the reals'', is not Borel reducible to another family of ERs which includes continuous actions of Polish CLI groups, Borel equivalence relations with G_δclasses, …
We generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between fundamental properties of bounded invariant equivalence relations (such as smoothness or type-definability) which also requires finding a series of counterexamples. Finally, we apply the generalisation mentioned above to prove a conjecture from a paper by the first author and J. Gismatullin, showing that the key technical assumption of the main theorem (conc…
Following the topic of the book Canonical Ramsey Theory on Polish Spaces by V. Kanovei, M. Sabok and J. Zapletal we study Borel equivalences on Laver trees. Here we prove that equivalence relations Borel reducible to an equivalence relation on $2^ω$ given by some $F_σ$ $P$-ideal on $ω$ can be canonized to the full equivalence relation or to the identity relation. This has several corollaries, e.g. Silver type dichotomy for the Laver ideal and equivalences Borel reducible to equivalence relations given by $F_σ$ $P$-ideals.
The aim of this paper is to give new representation theorems for extended contact algebras. These representation theorems are based on equivalence relations.
We introduce the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given equivalence relation. We investigate those.
We give an elementary proof that there are two topological generators for the full group of every aperiodic hyperfinite probability measure preserving Borel equivalence relation. Our proof explicitly constructs topological generators for the orbit equivalence relation of the irrational rotation of the circle, and then appeals to Dye's theorem and a Baire category argument to conclude the general case.
For a finite lattice $Λ$, $Λ$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $Λ$. This makes use of an isomorphism of categories between $Λ$-ultrametric spaces and structures equipped with certain families of equivalence relations. We extend this isomorphism to the case of infinite lattices. We also pose questions about representing a given finite lattice as the lattice of $\emptyset$-definable equivalence relations of structures with model-theoretic symmetry properties.
In this paper, we show that, for each $p>1$, there are continuum many Borel equivalence relations between $\Bbb R^ω/\ell_1$ and $\Bbb R^ω/\ell_p$ ordered by $\le_B$ which are pairwise Borel incomparable.
