Borel graphs generated by finitely many bounded-to-1 commuting Borel functions and hyperfinite equivalence relations

Ruijun Wang

Borel graphs generated by finitely many bounded-to-1 commuting Borel functions and hyperfinite equivalence relations

Logic 2026-08-02 v1

Authors: Ruijun Wang

Abstract

We show that a Borel graph generated by finitely many bounded-to-1 commuting functions is hyperfinite. This recovers a theorem in the forthcoming paper by Naryshkin, Shinko, Weilacher and Yu.

Keywords

Borel graph bounded-to-1 functions commuting functions hyperfinite equivalence relation descriptive set theory

Cite

@article{arxiv.2608.01231,
  title  = {Borel graphs generated by finitely many bounded-to-1 commuting Borel functions and hyperfinite equivalence relations},
  author = {Ruijun Wang},
  journal= {arXiv preprint arXiv:2608.01231},
  year   = {2026}
}

Comments

10 pages