Metraipolis › archive › dc_73bfc7c7fc16

Ergodic treeable equivalence relations are richly ergodic — arXiv:2610.40237

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40237
License (as archived)
CC0-1.0
Archived
2026-11-01T02:39:54.089Z
SHA-256 of the archived text
80155c1807bc9479a1be49f5cc2c99970d13106da190e7e3f57be131298356c9
Stable URL of this page
https://metraipolis.com/documento/dc_73bfc7c7fc16

How to cite

Ergodic treeable equivalence relations are richly ergodic — arXiv:2610.40237 — arXiv (en), https://arxiv.org/abs/2610.40237 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_73bfc7c7fc16 (Metraipolis archive dc_73bfc7c7fc16, sha256 80155c1807bc9479a1be49f5cc2c99970d13106da190e7e3f57be131298356c9)
BibTeX
@misc{dc73bfc7c7fc16,
  title = {Ergodic treeable equivalence relations are richly ergodic — arXiv:2610.40237},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40237},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_73bfc7c7fc16; sha256 80155c1807bc9479a1be49f5cc2c99970d13106da190e7e3f57be131298356c9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40237. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the density of ergodic subrelations in the canonical Polish space of subequivalence relations of a probability-measure-preserving countable Borel equivalence relation. Our main result establishes rich ergodicity for ergodic treeable equivalence relations. The proof combines a strongly increasing exhaustion with relative ergodic hyperfinite decomposition. As an application, for every $2\leq r<\infty$, we show that the product of the dyadic odometer action of $\mathbb{Z}$ with the Bernoulli action of $\mathbb{F}_r$ has a richly ergodic orbit relation, whereas the Bernoulli action of $\mathbb{Z}\times\mathbb{F}_r$ does not. Thus rich ergodicity of a free ergodic action is not determined by the acting group.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno).
Categorie arXiv: Dynamical Systems (math.DS) ; Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.40237 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:15:58.507Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).