Indecomposability of treed equivalence relations

Scot Adams

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)362-380
Number of pages19
JournalIsrael Journal of Mathematics
Issue number3
StatePublished - Dec 1 1988


Dive into the research topics of 'Indecomposability of treed equivalence relations'. Together they form a unique fingerprint.

Cite this