Indecomposability of treed equivalence relations (Q1124002): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Geoffrey R. Goodson / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Geoffrey R. Goodson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and amenable equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4112980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An amenable equivalence relation is generated by a single transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic Equivalence Relations, Cohomology, and Von Neumann Algebras. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbit structure and countable sections for actions of continuous groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theory and virtual groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual groups and group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of ergodic group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperfinite factors and amenable ergodic actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic theory, semisimple Lie groups, and foliations by manifolds of negative curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ergodic actions of semisimple groups and product relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3687381 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02882427 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074359725 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Indecomposability of treed equivalence relations
scientific article

    Statements

    Indecomposability of treed equivalence relations (English)
    0 references
    0 references
    1989
    0 references
    The author gives a rigorous definition of a ``treed'' equivalence relation, which roughly speaking is an equivalence relation together with a measurably varying tree structure on each equivalence class. This idea, first suggested by Alain Connes in the late 1970's was studied in a special case by the author in Ergodic Theory Dyn. Syst. (to appear). In that example the treed equivalence relation comes from considering the orbits of the action of a finitely generated free group F acting freely on a measure space. The tree structure is then obtained on each orbit by saying that two points x and y are adjacent if there is a generator \(g\in F\) such that \(gx=y\) or \(gy=x.\) The main theorem of the author, an analogue of a theorem of \textit{R. J. Zimmer} [Ann. Math., II. Ser. 118, 9-19 (1983; Zbl 0545.22010)], is the following: Let R be a countable, non-amenable, measure preserving, properly ergodic equivalence relation on a finite measure space M. Assume that (M,R) admits a treeing. Then there do not exist equivalence relations \(R_ 1\) and \(R_ 2\) on measure spaces \(M_ 1\) and \(M_ 2\) such that R is stably isomorphic to \(R_ 1\times R_ 2\).
    0 references
    treed equivalence relation
    0 references
    orbits
    0 references
    action of a finitely generated free group
    0 references
    ergodic equivalence relation
    0 references
    treeing
    0 references
    stably isomorphic
    0 references

    Identifiers