Complete orbit equivalence relation and non-universal Polish groups
Pith reviewed 2026-05-16 13:31 UTC · model grok-4.3
The pith
Non-universal Polish groups can induce complete orbit equivalence relations.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
There exists a non-universal Polish group whose continuous action on a Polish space induces a complete orbit equivalence relation.
What carries the argument
Continuous action of a non-universal Polish group on a Polish space that produces a complete orbit equivalence relation.
If this is right
- Universality of a Polish group is not required to achieve a complete orbit equivalence relation.
- The complexity hierarchy of orbit equivalence relations extends to actions of non-universal groups.
- Classification problems previously studied only with universal groups can now be examined using non-universal examples.
Where Pith is reading between the lines
- The result opens the possibility of constructing complete relations with groups that have simpler algebraic or topological structure.
- It may connect to questions about the minimal size or specific properties needed for completeness in orbit relations.
- Further examples could clarify whether particular non-universal groups, such as those with countable dense subgroups, suffice for the construction.
Load-bearing premise
A non-universal Polish group exists whose continuous action generates a complete orbit equivalence relation without topological or measurability obstructions.
What would settle it
An explicit proof that every continuous action of every non-universal Polish group yields only non-complete orbit equivalence relations would refute the claim.
read the original abstract
We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from \cite{OPENPROBLEMS}.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript constructs an explicit non-universal Polish group G together with a continuous action on a Polish space X such that the induced orbit equivalence relation E_G^X is complete (every orbit equivalence relation continuously reduces to it). Non-universality is witnessed by a Polish group that fails to embed continuously into G, while completeness is obtained by arranging that the action factors through a universal equivalence relation. This answers an open question of Sabok.
Significance. If the construction is correct, the result separates universality of Polish groups from the property of inducing complete orbit equivalence relations. The explicit verification of the Polish topology, the non-embedding, and the continuous reduction supplies a concrete counterexample that can be used to test further conjectures about the hierarchy of orbit equivalence relations arising from Polish group actions.
minor comments (2)
- The bibliography entry for the OPENPROBLEMS citation should be expanded to include the specific problem number or section where Sabok poses the question.
- In the paragraph introducing the main construction, the notation for the orbit equivalence relation E_G^X is used before it is formally defined; a forward reference or earlier definition would improve readability.
Simulated Author's Rebuttal
We thank the referee for their positive report, accurate summary of the main result, and recommendation to accept the manuscript. We are pleased that the construction is recognized as providing a concrete counterexample separating non-universality of Polish groups from the completeness of induced orbit equivalence relations, and that it may serve as a test case for further conjectures in the area.
Circularity Check
Explicit construction is self-contained with no circular reductions
full rationale
The manuscript supplies an explicit construction of a non-universal Polish group G together with a continuous action on a Polish space X whose orbit equivalence relation is complete. Non-universality is witnessed by a concrete non-embedding, and completeness follows from arranging the action to factor through a universal equivalence relation via explicitly constructed Polish topologies and Borel reductions. No equations, fitted parameters, self-definitional steps, or load-bearing self-citations appear in the derivation chain; the result is presented as a direct answer to an open question of Sabok rather than a renaming or re-derivation of prior inputs. The argument is therefore independent of the circularity patterns.
Axiom & Free-Parameter Ledger
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We show that a non-universal Polish group can induce a complete orbit equivalence relation, which answers a question of Sabok from [4].
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
On surjectively universal polish groups.Advances in Mathematics, 2012
Longyun Ding. On surjectively universal polish groups.Advances in Mathematics, 2012
work page 2012
-
[2]
Graev metric groups and polishable subgroups.Advances in Mathematics, 2007
Longyun Ding and Su Gao. Graev metric groups and polishable subgroups.Advances in Mathematics, 2007
work page 2007
-
[3]
New metrics on free groups.Topology and its Applications, 2007
Longyun Ding and Su Gao. New metrics on free groups.Topology and its Applications, 2007
work page 2007
-
[4]
Open questions in descriptive set theory and dynamical systems.Arxiv 2305.00248, 2023
Jerome Buzzi et al. Open questions in descriptive set theory and dynamical systems.Arxiv 2305.00248, 2023
- [5]
-
[6]
Countable abelian group actions and hyperfinite equivalence relations.Invent
Su Gao and Steve Jackson. Countable abelian group actions and hyperfinite equivalence relations.Invent. math, Volume 201, pages 309–383, 2015
work page 2015
-
[7]
Macjel Malicki. Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures.he Journal of Symbolic Logic. 2016;81(3):876-886. doi:10.1017/jsl.2015.73, 2016
-
[8]
Aspects of automatic continuity
Christian Rosendal and Luis Carlos Suarze. Aspects of automatic continuity. arXiv:2406.12143, 2024. COMPLETE ORBIT EQUIVALENCE RELATIONS 7
-
[9]
Marcin Sabok. Completeness of the isomorphism problem for separable C*-algebras.Inven- tions mathematicae, 204, 2016
work page 2016
-
[10]
Marcin Sabok. Orbit equivalence relation.Journal of Applied Logics-IfCoLog Journal of Log- ics and their applications, 2017
work page 2017
-
[11]
Automatic continuity for isometry groups.Journal of the Institute of Mathe- matics of Jussieu, 2019
Marcin Sabok. Automatic continuity for isometry groups.Journal of the Institute of Mathe- matics of Jussieu, 2019
work page 2019
-
[12]
Marcin Sabok. Automatic continuity for isometry groups – erratum.Journal of the Institute of Mathematics of Jussieu, 21(6), 2253-2255, 2021
work page 2021
-
[13]
Joseph Zielinski. The complexity of the homeomorphism relation between compact metric spaces.Advances in Mathematics, 291, 2016. Nankai university Current address: School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, P.R. China Email address:dingly@nankai.edu.cn Nankai university Current address: School of Mathematical Sciences and...
work page 2016
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.