pith. sign in

arxiv: 2510.10673 · v2 · submitted 2025-10-12 · 🧮 math.GR · math.LO

The isomorphism problem for finitely generated bi-orderable groups

Pith reviewed 2026-05-18 08:10 UTC · model grok-4.3

classification 🧮 math.GR math.LO
keywords bi-orderable groupsleft-orderable groupsisomorphism relationdescriptive set theoryBorel spacerelative conesweakly universalfinitely generated groups
0
0 comments X

The pith

The isomorphism relation on finitely generated bi-orderable groups is weakly universal.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. It sets up a standard Borel space for finitely generated left-orderable groups and a corresponding subspace for bi-orderable groups by using spaces of relative cones. The authors then prove that the isomorphism relation on the finitely generated bi-orderable groups is weakly universal. This matters because it gives a precise description of how hard it is to tell whether two such groups are the same up to isomorphism.

Core claim

We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely generated bi-orderable groups using spaces of relative cones. We use this setup to show that the isomorphism relation on finitely generated bi-orderable groups is weakly universal.

What carries the argument

The standard Borel space of finitely generated bi-orderable groups defined via spaces of relative cones, which parametrizes the groups along with their bi-orderings to allow analysis of their isomorphisms.

Load-bearing premise

The construction of the standard Borel space of finitely generated bi-orderable groups via spaces of relative cones correctly captures the isomorphism relation without introducing extraneous identifications or missing essential orderings.

What would settle it

Finding two finitely generated bi-orderable groups that are isomorphic but not related through the relative cone space construction would show the space does not fully capture the isomorphism relation.

read the original abstract

We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely generated bi-orderable groups using spaces of relative cones. We use this setup to show that the isomorphism relation on finitely generated bi-orderable groups is weakly universal.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript analyzes the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. It constructs the standard Borel space of finitely generated left-orderable groups and the subspace consisting of finitely generated bi-orderable groups via spaces of relative cones. Using this setup, the paper shows that the isomorphism relation on finitely generated bi-orderable groups is weakly universal.

Significance. If the central result holds, it would establish that the isomorphism problem for finitely generated bi-orderable groups is weakly universal among Borel equivalence relations, indicating maximal complexity within the descriptive set theoretic framework. This provides a new perspective on the decidability and classification difficulties for ordered groups and introduces the relative-cone encoding as a technical tool that could apply to related problems in left-orderable groups.

major comments (2)
  1. The construction of the standard Borel space of finitely generated bi-orderable groups via spaces of relative cones: it must be shown explicitly that this encoding distinguishes distinct bi-orderings on the same underlying group and separates non-isomorphic ordered groups, so that the induced equivalence relation coincides with genuine ordered-group isomorphism rather than a quotient. This is load-bearing for the weak-universality claim, as any collapse would restrict the result to a coarser relation.
  2. The transfer of weak universality from the ambient space of left-orderable groups to the bi-orderable subspace: the argument requires a clear reduction or embedding lemma showing that the universality property survives restriction to the subspace without additional assumptions on the cone data.
minor comments (1)
  1. The abstract states the main result but provides no indication of the key technical steps or verification of the cone construction; adding one sentence on the role of relative cones would improve accessibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for highlighting these important points regarding the technical foundations of our construction. We address each major comment below and will incorporate clarifications in a revised version.

read point-by-point responses
  1. Referee: The construction of the standard Borel space of finitely generated bi-orderable groups via spaces of relative cones: it must be shown explicitly that this encoding distinguishes distinct bi-orderings on the same underlying group and separates non-isomorphic ordered groups, so that the induced equivalence relation coincides with genuine ordered-group isomorphism rather than a quotient. This is load-bearing for the weak-universality claim, as any collapse would restrict the result to a coarser relation.

    Authors: We agree that an explicit verification is necessary to ensure the equivalence relation is precisely the isomorphism relation on ordered groups. The relative-cone encoding in Section 2 is constructed so that each bi-ordering on a fixed group corresponds to a distinct cone (via the positive cone and its conjugates), and isomorphisms of ordered groups induce Borel maps between cones. To make this fully rigorous and address the concern directly, we will add a new lemma (Lemma 2.7) in the revised manuscript proving injectivity on bi-orderings and separation of non-isomorphic ordered groups. This confirms the induced equivalence relation matches genuine ordered-group isomorphism. revision: yes

  2. Referee: The transfer of weak universality from the ambient space of left-orderable groups to the bi-orderable subspace: the argument requires a clear reduction or embedding lemma showing that the universality property survives restriction to the subspace without additional assumptions on the cone data.

    Authors: The weak universality for bi-orderable groups is obtained by a Borel embedding of the bi-orderable space into the left-orderable space that preserves the isomorphism relation, allowing the universality to transfer directly. We will strengthen the argument by adding an explicit embedding lemma (Lemma 4.3) in the revised version. This lemma will show that the restriction of the equivalence relation to the bi-orderable subspace inherits weak universality from the ambient space, with no further assumptions required on the cone data beyond those already used in the construction. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation is self-contained via explicit Borel-space construction

full rationale

The paper constructs the standard Borel space of finitely generated bi-orderable groups explicitly via spaces of relative cones on generating sets, then derives the weak universality of the isomorphism relation from that setup. No step reduces by definition to its own output, no fitted parameters are relabeled as predictions, and no load-bearing premise rests solely on a self-citation chain whose content is unverified outside the paper. The argument remains independent of the target universality statement and is presented as a theorem derived from the descriptive-set-theoretic encoding.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result relies on standard axioms of descriptive set theory and Borel reducibility; no free parameters or invented entities are mentioned.

axioms (1)
  • standard math Standard axioms of ZFC set theory and the existence of standard Borel spaces for countable structures.
    Invoked implicitly when defining the space of finitely generated groups and the isomorphism relation.

pith-pipeline@v0.9.0 · 5567 in / 1055 out tokens · 31354 ms · 2026-05-18T08:10:59.356462+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages · 1 internal anchor

  1. [1]

    The space of relative orders and a generalization of Morris indicability theorem.J

    Yago Antol´ ın and Crist´ obal Rivas. The space of relative orders and a generalization of Morris indicability theorem.J. Topol. Anal., 13(1):75–85, 2021

  2. [2]

    Slope detection and toroidal 3-manifolds

    Steven Boyer, Cameron McA. Gordon, and Ying Hu. Slope detection and toroidal 3-manifolds. Preprint, arXiv:2106.14378, 2021

  3. [3]

    Brown.Cohomology of groups, volume 87 ofGraduate Texts in Mathematics

    Kenneth S. Brown.Cohomology of groups, volume 87 ofGraduate Texts in Mathematics. Springer-Verlag, New York, 1994. Corrected reprint of the 1982 original

  4. [4]

    Borel structures on the space of left-orderings.Bull

    Filippo Calderoni and Adam Clay. Borel structures on the space of left-orderings.Bull. Lond. Math. Soc., 54:83–94, 2022

  5. [5]

    The Borel complexity of the space of left-orderings, low- dimensional topology, and dynamics.J

    Filippo Calderoni and Adam Clay. The Borel complexity of the space of left-orderings, low- dimensional topology, and dynamics.J. Lond. Math. Soc. (2), 110(5):Paper No. e70024, 22, 2024

  6. [6]

    Condensation and left-orderable groups.Proc

    Filippo Calderoni and Adam Clay. Condensation and left-orderable groups.Proc. Amer. Math. Soc. Ser. B, 11:579 – 588, 2024

  7. [7]

    Anti-classification results for groups acting freely on the line.Advances in Mathematics, 418:108938, 2023

    Filippo Calderoni, David Marker, Luca Motto Ros, and Assaf Shani. Anti-classification results for groups acting freely on the line.Advances in Mathematics, 418:108938, 2023

  8. [8]

    The completeness of the isomorphism relation for countable Boolean algebras.Trans

    Riccardo Camerlo and Su Gao. The completeness of the isomorphism relation for countable Boolean algebras.Trans. Amer. Math. Soc., 353(2):491–518, 2001

  9. [9]

    L’espace des groupes de type fini.Topology, 39(4):657–680, 2000

    Christophe Champetier. L’espace des groupes de type fini.Topology, 39(4):657–680, 2000

  10. [10]

    American Mathematical Society, Providence, RI, 2016

    Adam Clay and Dale Rolfsen.Ordered groups and topology, volume 176 ofGraduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2016

  11. [11]

    Bowen’s problem 32 and the conjugacy problem for systems with specification

    Konrad Deka, Dominik Kwietniak, Bo Peng, and Marcin Sabok. Bowen’s problem 32 and the conjugacy problem for systems with specification. Preprint, arXiv:2501.02723, 2025. 16 F. CALDERONI AND A. CLAY

  12. [12]

    The complexity of classifying separable Banach spaces up to isomorphism.J

    Valentin Ferenczi, Alain Louveau, and Christian Rosendal. The complexity of classifying separable Banach spaces up to isomorphism.J. Lond. Math. Soc. (2), 79(2):323–345, 2009

  13. [13]

    Rudolph, and Benjamin Weiss

    Matthew Foreman, Daniel J. Rudolph, and Benjamin Weiss. The conjugacy problem in er- godic theory.Ann. of Math. (2), 173(3):1529–1586, 2011

  14. [14]

    An anti-classification theorem for ergodic measure preserving transformations.J

    Matthew Foreman and Benjamin Weiss. An anti-classification theorem for ergodic measure preserving transformations.J. Eur. Math. Soc. (JEMS), 6(3):277–292, 2004

  15. [15]

    Measure preserving diffeomorphisms of the torus are unclassifiable.J

    Matthew Foreman and Benjamin Weiss. Measure preserving diffeomorphisms of the torus are unclassifiable.J. Eur. Math. Soc. (JEMS), 24(8):2605–2690, 2022

  16. [16]

    Coding subset shift by subgroup conjugacy.Bulletin of the London Mathematical Society, 32(6):653–657, 2000

    Su Gao. Coding subset shift by subgroup conjugacy.Bulletin of the London Mathematical Society, 32(6):653–657, 2000

  17. [17]

    Generic algebraic prop- erties in spaces of enumerated groups.Trans

    Isaac Goldbring, Srivatsav Kunnawalkam Elayavalli, and Yash Lodha. Generic algebraic prop- erties in spaces of enumerated groups.Trans. Amer. Math. Soc., 376(9):6245–6282, 2023

  18. [18]

    Solved and unsolved problems around one group

    Rostislav Grigorchuk. Solved and unsolved problems around one group. InInfinite groups: geometric, combinatorial and dynamical aspects, volume 248 ofProgr. Math., pages 117–218. Birkh¨ auser, Basel, 2005

  19. [19]

    Degrees of growth of finitely generated groups and the theory of invariant means.Izv

    Rotislav Grigorchuk. Degrees of growth of finitely generated groups and the theory of invariant means.Izv. Akad. Nauk SSSR Ser. Mat., 48(5):939–985, 1984

  20. [20]

    Algorithmic aspects of left-orderings of solvable baumslag–solitar groups via its dynamical realization

    Meng-Che “Turbo” Ho, Khanh Le, and Dino Rossegger. Algorithmic aspects of left-orderings of solvable baumslag–solitar groups via its dynamical realization. In Ludovic Levy Patey, Elaine Pimentel, Lorenzo Galeotti, and Florin Manea, editors,Twenty Years of Theoretical and Practical Synergies, pages 72–84, Cham, 2024. Springer Nature Switzerland

  21. [21]

    Finitely generated infinite simple groups of homeomorphisms of the real line.Invent

    James Hyde and Yash Lodha. Finitely generated infinite simple groups of homeomorphisms of the real line.Invent. Math., 218(1):83–112, 2019

  22. [22]

    Chain groups of homeomorphisms of the interval.Ann

    Sang-hyun Kim, Thomas Koberda, and Yash Lodha. Chain groups of homeomorphisms of the interval.Ann. Sci. ´Ec. Norm. Sup´ er. (4), 52(4):797–820, 2019

  23. [23]

    An introduction.Universitext

    Clara L¨ oh.Geometric group theory. An introduction.Universitext. Springer, 2017

  24. [24]

    On convex normal subgroups

    Junyu Lu. On convex normal subgroups. Master’s thesis, McGill University, 2018

  25. [25]

    Osin and K

    D. Osin and K. Oyakawa. Classifying group actions on hyperbolic spaces. Preprint, arXiv:2504.21203, 2025

  26. [26]

    A topological zero-one law and elementary equivalence of finitely generated groups.Annals of Pure and Applied Logic, 172(3):102915, 2021

    Denis Osin. A topological zero-one law and elementary equivalence of finitely generated groups.Annals of Pure and Applied Logic, 172(3):102915, 2021

  27. [27]

    Borel complexity of the isomorphism relation of archimedean orders in finitely generated groups.Proceedings of the American Mathematical Society, 153(08):3595–3605, 2025

    Antoine Poulin. Borel complexity of the isomorphism relation of archimedean orders in finitely generated groups.Proceedings of the American Mathematical Society, 153(08):3595–3605, 2025

  28. [28]

    Completeness of the isomorphism problem for separable C ∗-algebras.Invent

    Marcin Sabok. Completeness of the isomorphism problem for separable C ∗-algebras.Invent. Math., 204(3):833–868, 2016

  29. [29]

    On the borel complexity of the space of left-orderings of nilpotent groups

    Emir Molina Tauc´ an. On the borel complexity of the space of left-orderings of nilpotent groups. Preprint, arXiv:2507.06953, 2025

  30. [30]

    On the complexity of the quasi-isometry and virtual isomorphism problems for finitely generated groups.Groups Geom

    Simon Thomas. On the complexity of the quasi-isometry and virtual isomorphism problems for finitely generated groups.Groups Geom. Dyn., 2(2):281–307, 2008

  31. [31]

    On the complexity of the isomorphism relation for finitely generated groups.J

    Simon Thomas and Boban Velickovic. On the complexity of the isomorphism relation for finitely generated groups.J. Algebra, 217(1):352–373, 1999

  32. [32]

    Isomorphism of finitely generated solvable groups is weakly universal.J

    Jay Williams. Isomorphism of finitely generated solvable groups is weakly universal.J. Pure Appl. Algebra, 219(5):1639–1644, 2015. Department of Mathematics, Rutgers University, Hill Center for the Mathematical Sciences, 110 Frelinghuysen Rd., Piscataway, NJ 08854-8019 Email address:filippo.calderoni@rutgers.edu Department of Mathematics, 420 Machray Hall...