Every CBER is smooth below the Carlson-Simpson generic partition
Logic
2022-06-30 v1 Combinatorics
Dynamical Systems
Abstract
Let be a countable Borel equivalence relation on the space of all infinite partitions of the natural numbers. We show that coincides with equality below a Carlson-Simpson generic element of . In contrast, we show that there is a hypersmooth equivalence relation on which is Borel bireducible with on every Carlson-Simpson cube. Our arguments are classical and require no background in forcing.
Cite
@article{arxiv.2206.14224,
title = {Every CBER is smooth below the Carlson-Simpson generic partition},
author = {Aristotelis Panagiotopoulos and Allison Wang},
journal= {arXiv preprint arXiv:2206.14224},
year = {2022}
}