Indecomposability of treed equivalence relations
- Cite this article as:
- Adams, S. Israel J. Math. (1988) 64: 362. doi:10.1007/BF02882427
- 54 Downloads
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.