, Volume 64, Issue 3, pp 362-380

Indecomposability of treed equivalence relations

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We define rigorously a “treed” equivalence relation, which, intuitively, is an equivalence relation together with a measurably varying tree structure on each equivalence class. We show, in the nonamenable, ergodic, measure-preserving case, that a treed equivalence relation cannot be stably isomorphic to a direct product of two ergodic equivalence relations.