The Borel complexity of von Neumann equivalence

نویسندگان

چکیده

We prove that for a countable discrete group Γ containing copy of the free Fn, some 2≤n≤∞, as normal subgroup, equivalence relations conjugacy, orbit and von Neumann ergodic a.e. probability measure preserving actions are analytic non-Borel in Polish space Γ-actions. As consequence we obtain isomorphism spaces separably acting factors type II1, II∞ IIIλ, 0≤λ≤1, not Borel when these given Effros structure.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elementary Complexity and von Neumann Algebras

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the hyperfinite II1 factor, starting from the class of Kalmar recursive functions. More methodologically, we address the problem of finding the right perspective ...

متن کامل

Amenability, Bilipschitz Equivalence, and the Von Neumann Conjecture

1. Introduction and statement of results. The geometry of discrete metric spaces has recently been a very active research area. The motivation comes primarily from two (not completely separate) areas of mathematics. The first is the study of non-compact manifolds equipped with metrics well defined up to uniformly bounded distortion. The equivalence classes of these manifolds arise naturally in ...

متن کامل

The expected bit complexity of the von Neumann rejection algorithm

In 1952, von Neumann introduced the rejection method for random variate generation. We revisit this algorithm when we have a source of perfect bits at our disposal. In this random bit model, there are universal lower bounds for generating a random variate with a given density to within an accuracy derived by Knuth and Yao, and refined by the authors. In general, von Neumann’s method fails in th...

متن کامل

The Complexity of Von Neumann Coordinatization; 2-distributive Lattices

A complemented modular lattice L is coordinatizable, if it is isomorphic to the lattice L(R) of principal right ideals of some von Neumann regular ring R. All known sufficient conditions for coordinatizability, due first to J. von Neumann, then to B. Jónsson, are first-order. Nevertheless, we prove that coordinatizability of complemented modular lattices is not firstorder, even for countable 2-...

متن کامل

Countable Borel equivalence relations, Borel reducibility, and orbit equivalence

ing from the proof given above for Gaboriau-Popa we obtain theorems such as: Theorem 2.10 Let (X, d) be a complete, separable metric space equipped with an atomless Borel probability measure μ. Suppose Γ acts ergodically by measure preserving transformations on (X,μ) and the action on (X, d) is expansive. Let (Et)0<t<1 be a collection of distinct countable Borel equivalence relations on X with:...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2021

ISSN: ['0168-0072', '1873-2461']

DOI: https://doi.org/10.1016/j.apal.2020.102913