scholarly journals FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS

2016 ◽  
Vol 81 (4) ◽  
pp. 1225-1254 ◽  
Author(s):  
RUSSELL MILLER ◽  
KENG MENG NG
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Arithmetical Hierarchy ◽  
Natural Equivalence ◽  
Image Position ◽  
The Way

AbstractWe introduce the notion of finitary computable reducibility on equivalence relations on the domainω. 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${\rm{\Pi }}_{n + 2}^0$-complete under computable reducibility, we show that, for everyn, there does exist a natural equivalence relation which is${\rm{\Pi }}_{n + 2}^0$-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 the way, we present several new results which use computable reducibility to establish the complexity of various naturally defined equivalence relations in the arithmetical hierarchy.

Bi-Borel reducibility of essentially countable Borel equivalence relations

2005 ◽  
Vol 70 (3) ◽  
pp. 979-992 ◽  
Author(s):  
Greg Hjorth
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Borel Space ◽  
Borel Equivalence Relations ◽  
Borel Equivalence Relation ◽  
Standard Borel Space ◽  
Borel Reducibility ◽  
New Feature ◽  
Borel Probability ◽  
Image Position

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.

A dichotomy theorem for turbulence

2002 ◽  
Vol 67 (4) ◽  
pp. 1520-1540 ◽  
Author(s):  
Greg Hjorth
Keyword(s):  
Equivalence Relation ◽  
Borel Function ◽  
Equivalence Relations ◽  
Orbit Equivalence ◽  
Borel Set ◽  
Polish Group ◽  
Strengthened Version ◽  
Dichotomy Theorem ◽  
Image Position

In this note we show:Theorem 1.1. Let G be a Polish group and X a Polish G-space with the induced orbit equivalence relation EG Borel as a subset of X × X. Then exactly one of the following:(I) There is a countable languageℒand a Borel functionsuch that for all x1, x2 ∈ Xor(II) there is a turbulent Polish G-space Y and a continuous G-embeddingThere are various bows and ribbons which can be woven into these statements. We can strengthen (I) by asking that θ also admit a Borel orbit inverse, that is to say some Borel functionfor some Borel set B ⊂ Mod(ℒ), such that for all x ∈ Xand then after having passed to this strengthened version of (I) we still obtain the exact same dichotomy theorem, and hence the conclusion that the two competing versions of (I) are equivalent. Similarly (II) can be relaxed to just asking that τ be a Borel G-embedding, or even simply a Borel reduction of the relevant orbit equivalence relations. It is in fact a consequence of 1.1 that all the plausible weakenings and strengthenings of (I) and (II) are respectively equivalent to one another.I will not closely examine these possible variations here. The equivalences alluded to above follow from our main theorem and the results of [3]. That monograph had previously shown that (I) and (II) are incompatible, and proved a barbaric forerunner of 1.1, and gone on to conjecture the dichotomy result above.

scholarly journals EQUIVALENCE RELATIONS WHICH ARE BOREL SOMEWHERE

2017 ◽  
Vol 82 (3) ◽  
pp. 893-930 ◽  
Author(s):  
WILLIAM CHAN
Keyword(s):  
Equivalence Relation ◽  
Polish Space ◽  
Equivalence Classes ◽  
Equivalence Relations ◽  
Proper Forcing ◽  
Image Position

AbstractThe following will be shown: Let I be a σ-ideal on a Polish space X so that the associated forcing of I+${\bf{\Delta }}_1^1$ sets ordered by ⊆ is a proper forcing. Let E be a ${\bf{\Sigma }}_1^1$ or a ${\bf{\Pi }}_1^1$ equivalence relation on X with all equivalence classes ${\bf{\Delta }}_1^1$. If for all $z \in {H_{{{\left( {{2^{{\aleph _0}}}} \right)}^ + }}}$, z♯ exists, then there exists an I+${\bf{\Delta }}_1^1$ set C ⊆ X such that E ↾ C is a ${\bf{\Delta }}_1^1$ equivalence relation.

scholarly journals COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY

2014 ◽  
Vol 79 (3) ◽  
pp. 859-881 ◽  
Author(s):  
EGOR IANOVSKI ◽  
RUSSELL MILLER ◽  
KENG MENG NG ◽  
ANDRÉ NIES
Keyword(s):  
Complexity Theory ◽  
Polynomial Time ◽  
Equivalence Relation ◽  
Computability Theory ◽  
Equivalence Relations ◽  
Binary Relations ◽  
Exponential Time ◽  
Relative Complexity ◽  
Turing Reducibility ◽  
Image Position

AbstractWe study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relationsR,S, a componentwise reducibility is defined byR≤S⇔ ∃f∀x, y[x R y↔f(x)S f(y)].Here,fis taken from a suitable class of effective functions. For us the relations will be on natural numbers, andfmust be computable. We show that there is a${\rm{\Pi }}_1^0$-complete equivalence relation, but no${\rm{\Pi }}_k^0$-complete fork≥ 2. We show that${\rm{\Sigma }}_k^0$preorders arising naturally in the above-mentioned areas are${\rm{\Sigma }}_k^0$-complete. This includes polynomial timem-reducibility on exponential time sets, which is${\rm{\Sigma }}_2^0$, almost inclusion on r.e. sets, which is${\rm{\Sigma }}_3^0$, and Turing reducibility on r.e. sets, which is${\rm{\Sigma }}_4^0$.

Fundamental relations and identities of fuzzy hyperalgebras

2021 ◽  
pp. 1-10
Author(s):  
Narjes Firouzkouhi ◽  
Abbas Amini ◽  
Chun Cheng ◽  
Mehdi Soleymani ◽  
Bijan Davvaz
Keyword(s):  
Universal Algebra ◽  
Equivalence Relation ◽  
Polynomial Function ◽  
Equivalence Relations ◽  
Fundamental Relation ◽  
Term Function ◽  
Biological Phenomena ◽  
Definition Of

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.

scholarly journals The absorption theorem for affable equivalence relations

2008 ◽  
Vol 28 (5) ◽  
pp. 1509-1531 ◽  
Author(s):  
THIERRY GIORDANO ◽  
HIROKI MATUI ◽  
IAN F. PUTNAM ◽  
CHRISTIAN F. SKAU
Keyword(s):  
Dynamical Systems ◽  
Equivalence Relation ◽  
Closed Subset ◽  
Cantor Set ◽  
Equivalence Relations ◽  
Orbit Structure ◽  
Orbit Equivalent ◽  
Finite Set ◽  
Significant Generalization

AbstractWe prove a result about extension of a minimal AF-equivalence relation R on the Cantor set X, the extension being ‘small’ in the sense that we modify R on a thin closed subset Y of X. We show that the resulting extended equivalence relation S is orbit equivalent to the original R, and so, in particular, S is affable. Even in the simplest case—when Y is a finite set—this result is highly non-trivial. The result itself—called the absorption theorem—is a powerful and crucial tool for the study of the orbit structure of minimal ℤn-actions on the Cantor set, see Remark 4.8. The absorption theorem is a significant generalization of the main theorem proved in Giordano et al [Affable equivalence relations and orbit structure of Cantor dynamical systems. Ergod. Th. & Dynam. Sys.24 (2004), 441–475] . However, we shall need a few key results from the above paper in order to prove the absorption theorem.

EDGE-TRANSITIVE GRAPH AUTOMORPHISMS AND PERIODIC SURFACE HOMEOMORPHISMS

1999 ◽  
Vol 09 (09) ◽  
pp. 1803-1813 ◽  
Author(s):  
JÉRÔME E. LOS ◽  
ZBIGNIEW H. NITECKI
Keyword(s):  
Equivalence Relation ◽  
Complete List ◽  
Transitive Graph ◽  
Periodic Surface ◽  
Natural Equivalence ◽  
Surface Homeomorphisms ◽  
Edge Transitive ◽  
Automorphism Of A Graph

An automorphism of a graph is edge-transitive if it acts transitively on the set of geometric edges (components of the complement of the vertices), or equivalently, if there is no nontrivial invariant subgraph. Every such automorphism can be embedded as the restriction to an invariant spine of some orientation-preserving periodic homeomorphism of a punctured surface. We find all the edge-transitive graph automorphisms and for each, find a complete list (up to a natural equivalence relation) of the possible ways that it can be embedded in a periodic homeomorphism.

On Constructing Ergodic Hyperfinite Equivalence Relations of Non-Product Type

2013 ◽  
Vol 56 (1) ◽  
pp. 136-147
Author(s):  
Radu-Bogdan Munteanu
Keyword(s):  
Equivalence Relation ◽  
Product Type ◽  
Bratteli Diagram ◽  
Equivalence Relations ◽  
Orbit Equivalence ◽  
Property A

AbstractProduct type equivalence relations are hyperfinitemeasured equivalence relations, which, up to orbit equivalence, are generated by product type odometer actions. We give a concrete example of a hyperfinite equivalence relation of non-product type, which is the tail equivalence on a Bratteli diagram. In order to show that the equivalence relation constructed is not of product type we will use a criterion called property A. This property, introduced by Krieger for non-singular transformations, is defined directly for hyperfinite equivalence relations in this paper.

Sublattices and Initial Segments of the Degrees of Unsolvability

1970 ◽  
Vol 22 (3) ◽  
pp. 569-581 ◽  
Author(s):  
S. K. Thomason
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Lattice Theory ◽  
Initial Segment ◽  
Finite Lattice ◽  
Equivalence Relations ◽  
Finite Lattices ◽  
Image Position ◽  
Degrees Of Unsolvability

In this paper we shall prove that every finite lattice is isomorphic to a sublattice of the degrees of unsolvability, and that every one of a certain class of finite lattices is isomorphic to an initial segment of degrees.Acknowledgment. I am grateful to Ralph McKenzie for his assistance in matters of lattice theory.1. Representation of lattices. The equivalence lattice of the set S consists of all equivalence relations on S, ordered by setting θ ≦ θ’ if for all a and b in S, a θ b ⇒ a θ’ b. The least upper bound and greatest lower bound in are given by the ⋃ and ⋂ operations:

Cauchy Points of Metric Locales

1989 ◽  
Vol 41 (5) ◽  
pp. 830-854 ◽  
Author(s):  
B. Banaschewski ◽  
A. Pultr
Keyword(s):  
Equivalence Relation ◽  
Metric Spaces ◽  
Equivalence Classes ◽  
Classical Description ◽  
Natural Approach ◽  
Precise Meaning ◽  
Natural Equivalence ◽  
Cauchy Sequences

A natural approach to topology which emphasizes its geometric essence independent of the notion of points is given by the concept of frame (for instance [4], [8]). We consider this a good formalization of the intuitive perception of a space as given by the “places” of non-trivial extent with appropriate geometric relations between them. Viewed from this position, points are artefacts determined by collections of places which may in some sense by considered as collapsing or contracting; the precise meaning of the latter as well as possible notions of equivalence being largely arbitrary, one may indeed have different notions of point on the same “space”. Of course, the well-known notion of a point as a homomorphism into 2 evidently fits into this pattern by the familiar correspondence between these and the completely prime filters. For frames equipped with a diameter as considered in this paper, we introduce a natural alternative, the Cauchy points. These are the obvious counterparts, for metric locales, of equivalence classes of Cauchy sequences familiar from the classical description of completion of metric spaces: indeed they are decreasing sequences for which the diameters tend to zero, identified by a natural equivalence relation.

Sign in / Sign up

Export Citation Format

Share Document