pith. sign in

arxiv: 2304.00139 · v2 · submitted 2023-03-31 · 🧮 math.LO

Classification Strength of Polish Groups: Involving S_infty

Shaun Allison This is my paper

Pith reviewed 2026-05-24 09:22 UTC · model grok-4.3

classification 🧮 math.LO
keywords Polish groupsclassification strengthBorel reducibilityS_inftyorbit equivalence relationsFraisse theorycoanalytic ranksindiscernibles
0
0 comments X

The pith

Non-Archimedean Polish groups involving S_∞ are exactly those that satisfy equivalent weakenings of amalgamation and indiscernibility and that alone can classify the equivalence relation =+.

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

The paper introduces classification strength as a way to compare Polish groups by whether the orbit equivalence relations from their continuous actions can be emulated, via Borel reduction, by actions of another group. It focuses on non-Archimedean Polish groups and proves that involving S_∞ is equivalent to a cluster of properties: a weakening of disjoint amalgamation from Fraïssé theory, a weakening of the existence of an absolute set of generating indiscernibles, and the absence of ordinal rank under a specific coanalytic rank function. The paper further shows that the benchmark equivalence relation =+ is classifiable by a non-Archimedean Polish group only when that group involves S_∞. A reader would care because the result carves out a clean dividing line in the partial order of classification strength and identifies which groups reach the top of that order.

Core claim

Among non-Archimedean Polish groups, involving S_∞ is equivalent to satisfying a weakening of the disjoint amalgamation property, a weakening of the existence of an absolute set of generating indiscernibles, and not having ordinal rank in a particular coanalytic rank function. In addition, the equivalence relation =+ is Borel reducible to an orbit equivalence relation coming from a continuous action of such a group if and only if the group involves S_∞.

What carries the argument

the technical condition that a non-Archimedean Polish group involves S_∞, which organizes the classification strength partial order and carries all the stated equivalences.

If this is right

  • Any orbit equivalence relation induced by a non-Archimedean Polish group that does not involve S_∞ is strictly simpler, in the Borel reducibility sense, than those inducible by groups that do involve S_∞.
  • The relation =+ lies at the top of the classification strength hierarchy for non-Archimedean Polish groups and cannot be reached without involvement of S_∞.
  • The weakened amalgamation and indiscernibility properties serve as concrete tests that decide whether a given non-Archimedean Polish group reaches maximal classification strength.
  • Groups satisfying the listed properties can emulate every orbit equivalence relation that any other non-Archimedean Polish group can produce.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The result suggests that classification strength among non-Archimedean Polish groups is determined by a single dividing line rather than a long chain of intermediate strengths.
  • One could test the equivalences on concrete groups by checking whether they admit the weakened amalgamation property or the indiscernibility condition.
  • The same dividing line may separate groups that can classify other simple benchmark relations beyond =+.
  • If the equivalences extend to Archimedean groups, the classification landscape would become even more sharply divided.

Load-bearing premise

The background notions of Polish groups, continuous actions, Borel reducibility, and the precise definition of involving S_∞ are enough to make the equivalences hold.

What would settle it

Exhibit a non-Archimedean Polish group that involves S_∞ yet possesses ordinal rank under the coanalytic rank function, or exhibit one that does not involve S_∞ yet classifies =+.

read the original abstract

In recent years, much work has been done to measure and compare the complexity of orbit equivalence relations, especially for certain classes of Polish groups. We start by introducing some language to organize this previous work, namely the notion of \textbf{classification strength} of Polish groups. Broadly speaking, a Polish group $G$ has stronger classification strength than $H$ if every orbit equivalence relation induced by a continuous action of $H$ on a Polish space can be ``emulated" by such an action of $G$ in the sense of Borel reduction. Among the non-Archimedean Polish groups, the groups with the highest classification strength are those that involve $S_\infty$, the Polish group of permutations of a countably-infinite set. We prove that several properties, including a weakening of the disjoint amalgamation in Fra\"{i}ss\'{e} theory, a weakening of the existence of an absolute set of generating indiscernibles, and not having ordinal rank in a particular coanalytic rank function, are all equivalent to a non-Archimedean Polish group involving $S_\infty$. Furthermore, we show the equivalence relation $=^+$, which is a relatively simple benchmark equivalence relation in the theory of Borel reducibility, can only be classified by such groups that involve $S_\infty$.

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

0 major / 3 minor

Summary. The paper introduces the notion of classification strength of Polish groups, where G has stronger strength than H if every orbit equivalence relation from a continuous H-action is Borel reducible to one from a G-action. It proves that, among non-Archimedean Polish groups, involving S_∞ is equivalent to a weakening of disjoint amalgamation in Fraïssé theory, a weakening of the existence of an absolute set of generating indiscernibles, and not having ordinal rank in a specified coanalytic rank function. It further shows that the equivalence relation =+ is classifiable only by groups involving S_∞.

Significance. If the equivalences hold, the results supply a clean characterization that organizes prior work on classification strength and isolates the special role of S_∞ among non-Archimedean Polish groups. The explicit definitions in §2 together with the reductions proved in §§3–5 constitute a concrete advance in the theory of Borel reducibility.

minor comments (3)
  1. [Abstract] Abstract: the phrase 'involving S_∞' is used before any definition is supplied; a one-sentence gloss would help readers who encounter the paper via the abstract alone.
  2. [§2] §2: the partial order of classification strength is described in prose; an explicit displayed definition (e.g., G ≼ H iff …) would improve precision and ease later reference.
  3. [§§3–5] §§3–5: while the equivalences are proved, a short summary table listing the four or five equivalent properties would make the main theorem easier to survey.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary of our work on classification strength of Polish groups and the recommendation for minor revision. The report accurately captures the main results: equivalences for non-Archimedean Polish groups involving S_∞ and the fact that =+ is classifiable only by such groups. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; equivalences rest on explicit definitions and internal proofs

full rationale

The paper introduces the notion of classification strength via explicit definitions in §2, then proves equivalences between several weakenings (disjoint amalgamation, generating indiscernibles, coanalytic rank) and the property of involving S_∞ in §§3–5. These are stated as equivalences derived from the definitions and constructions, not as predictions fitted to data or reduced by self-citation chains. The one-way result on =+ likewise follows from the same framework. No load-bearing step reduces by construction to an input parameter or prior self-citation; the argument is self-contained against the stated background notions of Polish groups and Borel reducibility.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Based solely on the abstract; no explicit free parameters, axioms, or invented entities are identifiable. The work appears to rest on standard background from descriptive set theory and Fraïssé theory rather than new postulates.

pith-pipeline@v0.9.0 · 5759 in / 1294 out tokens · 40473 ms · 2026-05-24T09:22:18.172816+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

18 extracted references · 18 canonical work pages

  1. [1]

    S. Allison. Non- A rchimedean TSI P olish groups and their potential B orel complexity spectrum

    work page

  2. [2]

    Allison and A

    S. Allison and A. Panagiotopoulos. Dynamical obstructions to classification by (co)homology and other TSI -group invariants. Trans. Amer. Math. Soc. , 374:8793--8811, 2021

    work page 2021

  3. [3]

    J. T. Baldwin, Sy D. Friedman, M. Koerwien, and M. C. Laskowski. Three red herrings around V aught's conjecture. Trans. Amer. Math. Soc. , 368:3673--3694, 2016

    work page 2016

  4. [4]

    J. D. Clemens and S. Coskey. New jump operators on equivalence relations. J. Math. Log. , 22:Paper No. 2250015, 44, 2022

    work page 2022

  5. [5]

    Deissler

    R. Deissler. Minimal models. J. Symbolic Logic , 42:254--260, 1977

    work page 1977

  6. [6]

    S. Gao. On automorphism groups of countable structures. J. Symbolic Logic , 63:891--896, 1998

    work page 1998

  7. [7]

    S. Gao. Invariant descriptive set theory , volume 293 of Pure and Applied Mathematics . CRC Press, 2009

    work page 2009

  8. [8]

    G. Hjorth. Orbit cardinals: on the effective cardinalities arising as quotient spaces of the form X/G where G acts on a P olish space X . Israel J. Math. , 111:221--261, 1999

    work page 1999

  9. [9]

    G. Hjorth. Classification and orbit equivalence relations , volume 75 of Mathematical Surveys and Monographs . American Mathematical Society, Providence, RI, 2000

    work page 2000

  10. [10]

    G. Hjorth. Vaught's conjecture on analytic sets. J. Amer. Math. Soc. , 14:125--143, 2001

    work page 2001

  11. [11]

    G. Hjorth. A dichotomy theorem for turbulence. J. Symbolic Logic , 67:1520--1540, 2002

    work page 2002

  12. [12]

    G. Hjorth. Knight's model, its automorphism group, and characterizing the uncountable cardinals. J. Math. Log. , 2:113--144, 2002

    work page 2002

  13. [13]

    Hjorth, A

    G. Hjorth, A. S. Kechris, and A. Louveau. Borel equivalence relations induced by actions of the symmetric group. Ann. Pure Appl. Logic , 92:63--112, 1998

    work page 1998

  14. [14]

    V. Kanovei. Borel equivalence relations , volume 44 of University Lecture Series . American Mathematical Society, Providence, RI, 2008

    work page 2008

  15. [15]

    Kruckman

    A. Kruckman. Notes on generalized F ra\" i ss\' e theory, 2015

    work page 2015

  16. [16]

    Lupini and A

    M. Lupini and A. Panagiotopoulos. Games orbits play and obstructions to B orel reducibility. Groups Geom. Dyn. , 12:1461--1483, 2018

    work page 2018

  17. [17]

    Laskowski and D

    M. Laskowski and D. Ulrich. Borel complexity of modules

    work page

  18. [18]

    Laskowski and D

    M. Laskowski and D. Ulrich. Characterizing the existence of a B orel complete expansion

    work page