Containment does not imply Borel reducibility

2002 ◽  
pp. 1-23 ◽  
Author(s):  
Scot Adams
Keyword(s):  
Borel Reducibility

THE CLASSIFICATION PROBLEM FOR p-LOCAL TORSION-FREE ABELIAN GROUPS OF RANK TWO

2006 ◽  
Vol 06 (02) ◽  
pp. 233-251 ◽  
Author(s):  
GREG HJORTH ◽  
SIMON THOMAS
Keyword(s):  
Abelian Groups ◽  
Classification Problem ◽  
Classification Problems ◽  
Borel Reducibility ◽  
Free Abelian Groups ◽  
Torsion Free

We prove that if p ≠ q are distinct primes, then the classification problems for p-local and q-local torsion-free abelian groups of rank two are incomparable with respect to Borel reducibility.

scholarly journals THE QUANDARY OF QUANDLES: A BOREL COMPLETE KNOT INVARIANT

2019 ◽  
Vol 108 (2) ◽  
pp. 262-277 ◽  
Author(s):  
ANDREW D. BROOKE-TAYLOR ◽  
SHEILA K. MILLER
Keyword(s):  
Isomorphism Problem ◽  
Algebraic Structures ◽  
Knot Invariant ◽  
Borel Reducibility ◽  
Special Case

We show that the isomorphism problems for left distributive algebras, racks, quandles and kei are as complex as possible in the sense of Borel reducibility. These algebraic structures are important for their connections with the theory of knots, links and braids. In particular, Joyce showed that a quandle can be associated with any knot, and this serves as a complete invariant for tame knots. However, such a classification of tame knots heuristically seemed to be unsatisfactory, due to the apparent difficulty of the quandle isomorphism problem. Our result confirms this view, showing that, from a set-theoretic perspective, classifying tame knots by quandles replaces one problem with (a special case of) a much harder problem.

BASIS THEOREMS FOR NON-POTENTIALLY CLOSED SETS AND GRAPHS OF UNCOUNTABLE BOREL CHROMATIC NUMBER

2008 ◽  
Vol 08 (02) ◽  
pp. 121-162 ◽  
Author(s):  
DOMINIQUE LECOMTE ◽  
BENJAMIN D. MILLER
Keyword(s):  
Chromatic Number ◽  
Closed Sets ◽  
Borel Reducibility

We show that there is an antichain basis for neither (1) the class of non-potentially closed Borel subsets of the plane under Borel rectangular reducibility nor (2) the class of analytic graphs of uncountable Borel chromatic number under Borel reducibility.

scholarly journals Ioana's Superrigidity Theorem and Orbit Equivalence Relations

ISRN Algebra ◽  
2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Samuel Coskey
Keyword(s):  
Ergodic Theory ◽  
Set Theory ◽  
Equivalence Relations ◽  
Orbit Equivalence ◽  
Borel Reducibility ◽  
Free Abelian Groups ◽  
Property T ◽  
Expository Paper ◽  
Torsion Free

We give a survey of Adrian Ioana's cocycle superrigidity theorem for profinite actions of Property (T) groups and its applications to ergodic theory and set theory in this expository paper. In addition to a statement and proof of Ioana's theorem, this paper features the following: (i) an introduction to rigidity, including a crash course in Borel cocycles and a summary of some of the best-known superrigidity theorems; (ii) some easy applications of superrigidity, both to ergodic theory (orbit equivalence) and set theory (Borel reducibility); and (iii) a streamlined proof of Simon Thomas's theorem that the classification of torsion-free abelian groups of finite rank is intractable.

Borel reductions and cub games in generalised descriptive set theory

2013 ◽  
Vol 78 (2) ◽  
pp. 439-458 ◽  
Author(s):  
Vadim Kulikov
Keyword(s):  
Partial Order ◽  
Set Theory ◽  
Regular Cardinal ◽  
Equivalence Relations ◽  
Descriptive Set Theory ◽  
Borel Equivalence Relations ◽  
Power Set ◽  
Borel Reducibility ◽  
Descriptive Set

AbstractIt is shown that the power set of κ ordered by the subset relation modulo various versions of the non-stationary ideal can be embedded into the partial order of Borel equivalence relations on 2κ under Borel reducibility. Here κ is an uncountable regular cardinal with κ<κ = κ.

scholarly journals A descriptive Main Gap Theorem

2020 ◽  
Vol 21 (01) ◽  
pp. 2050025
Author(s):  
Francesco Mangraviti ◽  
Luca Motto Ros
Keyword(s):  
Order Theory ◽  
Classification Theory ◽  
Gap Theorem ◽  
First Order Theory ◽  
Borel Hierarchy ◽  
Borel Reducibility ◽  
Tight Connection ◽  
Descriptive Set ◽  
Theory Formula

Answering one of the main questions of [S.-D. Friedman, T. Hyttinen and V. Kulikov, Generalized descriptive set theory and classification theory, Mem. Amer. Math. Soc. 230(1081) (2014) 80, Chap. 7], we show that there is a tight connection between the depth of a classifiable shallow theory [Formula: see text] and the Borel rank of the isomorphism relation [Formula: see text] on its models of size [Formula: see text], for [Formula: see text] any cardinal satisfying [Formula: see text]. This is achieved by establishing a link between said rank and the [Formula: see text]-Scott height of the [Formula: see text]-sized models of [Formula: see text], and yields to the following descriptive set-theoretical analog of Shelah’s Main Gap Theorem: Given a countable complete first-order theory [Formula: see text], either [Formula: see text] is Borel with a countable Borel rank (i.e. very simple, given that the length of the relevant Borel hierarchy is [Formula: see text]), or it is not Borel at all. The dividing line between the two situations is the same as in Shelah’s theorem, namely that of classifiable shallow theories. We also provide a Borel reducibility version of the above theorem, discuss some limitations to the possible (Borel) complexities of [Formula: see text], and provide a characterization of categoricity of [Formula: see text] in terms of the descriptive set-theoretical complexity of [Formula: see text].

scholarly journals Borel Reductibility and Classification of von Neumann Algebras

2009 ◽  
Vol 15 (2) ◽  
pp. 169-183 ◽  
Author(s):  
Román Sasyk ◽  
Asger Törnquist
Keyword(s):  
Von Neumann Algebras ◽  
Classification Problem ◽  
Von Neumann ◽  
Borel Reducibility

AbstractWe announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for separable von Neumann algebras.

scholarly journals Games orbits play and obstructions to Borel reducibility

2018 ◽  
Vol 12 (4) ◽  
pp. 1461-1483
Author(s):  
Martino Lupini ◽  
Aristotelis Panagiotopoulos
Keyword(s):  
Borel Reducibility

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.

Sign in / Sign up

Export Citation Format

Share Document