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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
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
Property / Recommended article
 
Property / Recommended article: A lemma for cost attained / rank
 
Normal rank
Property / Recommended article: A lemma for cost attained / qualifier
 
Similarity Score: 0.84027886
Amount0.84027886
Unit1
Property / Recommended article: A lemma for cost attained / qualifier
 
Property / Recommended article
 
Property / Recommended article: Trees and amenable equivalence relations / rank
 
Normal rank
Property / Recommended article: Trees and amenable equivalence relations / qualifier
 
Similarity Score: 0.7607412
Amount0.7607412
Unit1
Property / Recommended article: Trees and amenable equivalence relations / qualifier
 
Property / Recommended article
 
Property / Recommended article: Affable equivalence relations and orbit structure of Cantor dynamical systems / rank
 
Normal rank
Property / Recommended article: Affable equivalence relations and orbit structure of Cantor dynamical systems / qualifier
 
Similarity Score: 0.75155705
Amount0.75155705
Unit1
Property / Recommended article: Affable equivalence relations and orbit structure of Cantor dynamical systems / qualifier
 
Property / Recommended article
 
Property / Recommended article: A converse to Dye’s theorem / rank
 
Normal rank
Property / Recommended article: A converse to Dye’s theorem / qualifier
 
Similarity Score: 0.7432341
Amount0.7432341
Unit1
Property / Recommended article: A converse to Dye’s theorem / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4537526 / rank
 
Normal rank
Property / Recommended article: Q4537526 / qualifier
 
Similarity Score: 0.7364857
Amount0.7364857
Unit1
Property / Recommended article: Q4537526 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Examples of amalgamated free products and coupling rigidity / rank
 
Normal rank
Property / Recommended article: Examples of amalgamated free products and coupling rigidity / qualifier
 
Similarity Score: 0.72639716
Amount0.72639716
Unit1
Property / Recommended article: Examples of amalgamated free products and coupling rigidity / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3758169 / rank
 
Normal rank
Property / Recommended article: Q3758169 / qualifier
 
Similarity Score: 0.7245561
Amount0.7245561
Unit1
Property / Recommended article: Q3758169 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Topological properties of full groups / rank
 
Normal rank
Property / Recommended article: Topological properties of full groups / qualifier
 
Similarity Score: 0.72414076
Amount0.72414076
Unit1
Property / Recommended article: Topological properties of full groups / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3789826 / rank
 
Normal rank
Property / Recommended article: Q3789826 / qualifier
 
Similarity Score: 0.71401787
Amount0.71401787
Unit1
Property / Recommended article: Q3789826 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4511101 / rank
 
Normal rank
Property / Recommended article: Q4511101 / qualifier
 
Similarity Score: 0.71149206
Amount0.71149206
Unit1
Property / Recommended article: Q4511101 / qualifier
 

Latest revision as of 20:19, 27 January 2025

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