The Complexity of Arc-Connectedness Relation in the Plane
Yusuf Uyar
公開日: 2025/9/29
Abstract
In this paper, we show that the arc-connectedness equivalence relation on a Polish subspace of the real plane is an essentially hyperfinite Borel equivalence relation. This result provides the optimal upper bound for such a Borel equivalence relation.