Topologically free minimal actions without dynamical comparison
Pith reviewed 2026-07-03 04:27 UTC · model grok-4.3
The pith
There exist topologically free minimal actions of the infinite free group on the Cantor space without dynamical comparison.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors prove the existence of a topologically free minimal action of F_∞ on the Cantor space that lacks dynamical comparison. This occurs in both the measure-preserving and non-measure-preserving cases. They additionally demonstrate that strict comparison in the associated reduced crossed product does not entail dynamical comparison. Their approach involves constructing a monoid which is not almost unperforated, embedding it into a countable refinement monoid, and realizing it as the type semigroup of the action.
What carries the argument
A non-almost-unperforated monoid embedded into a countable refinement monoid and realized as the type semigroup of the action.
If this is right
- Dynamical comparison can fail even for topologically free minimal actions on zero-dimensional compact spaces.
- The failure is possible regardless of the existence of invariant probability measures.
- Algebraic strict comparison in crossed products is strictly weaker than dynamical comparison for the action.
- The type semigroup can encode the absence of dynamical comparison while preserving minimality and topological freeness.
Where Pith is reading between the lines
- Actions of other amenable groups might admit similar counterexamples if their type semigroups can be engineered similarly.
- Classification programs for crossed products by minimal actions may need to account for this separation between comparison properties.
- This construction technique could be adapted to produce examples on other compact spaces beyond the Cantor set.
Load-bearing premise
A monoid that fails to be almost unperforated can be embedded into a countable refinement monoid and realized as the type semigroup for a topologically free minimal action on the Cantor set.
What would settle it
Finding a specific topologically free minimal action of F_∞ on the Cantor set and verifying directly whether its type semigroup is almost unperforated.
read the original abstract
We show the existence of a topologically free minimal action of $\mathbb F_\infty$ on the Cantor space that does not have dynamical comparison. Moreover, we show that this phenomenon can happen both in the presence and in the absence of invariant measures. We also show that strict comparison of the reduced crossed product C*-algebra does not imply dynamical comparison for minimal actions. Our technique involves constructing a monoid which is not almost unperforated, embedding it into a countable refinement monoid and then realising it as the type semigroup associated to a dynamical system.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper constructs a topologically free minimal action of the free group F_∞ on the Cantor set whose type semigroup is a countable refinement monoid that is not almost unperforated, thereby providing a counterexample to dynamical comparison. The same phenomenon is realized both in the presence and absence of invariant measures. It is further shown that strict comparison of the reduced crossed product does not imply dynamical comparison. The argument proceeds by exhibiting an explicit non-almost-unperforated monoid M, embedding M into a countable refinement monoid N, and realizing N as the type semigroup of a concrete dynamical system.
Significance. If the realization step preserves the exact monoid structure, the result separates dynamical comparison from both the existence of invariant measures and from strict comparison of the crossed product, supplying concrete counterexamples in the theory of minimal actions on zero-dimensional spaces. The explicit algebraic construction of M and its embedding into a refinement monoid is a clear technical strength that makes the counterexamples potentially verifiable and usable for further work.
major comments (2)
- [§4] §4 (Realization of the monoid): the claim that the constructed action realizes N exactly as its type semigroup (without additional relations forced by minimality or topological freeness) is load-bearing for the non-almost-unperforation property. The sketch does not contain an explicit verification that the generators corresponding to the perforation-witnessing elements of N remain distinct and satisfy no extra inequalities in the dynamical type semigroup.
- [§3.2] §3.2 (Embedding M ↪ N): while the embedding is stated to be order-preserving, it is not shown that the image of the non-almost-unperforated pair in M remains non-almost-unperforated inside the refinement monoid N; refinement could in principle introduce new relations that restore almost unperforation before the dynamical realization step.
minor comments (2)
- [§2] The notation for the type semigroup is introduced without a displayed definition; a displayed equation would clarify the precise monoid operation used throughout.
- Several references to prior work on almost unperforated monoids are given only by author names; full citations should be added in the bibliography.
Simulated Author's Rebuttal
We thank the referee for the thorough report and the recommendation for major revision. The two major comments identify places where additional explicit verification is needed to make the arguments fully rigorous. We agree that these points require expansion and will revise the manuscript accordingly. Our point-by-point responses follow.
read point-by-point responses
-
Referee: [§4] §4 (Realization of the monoid): the claim that the constructed action realizes N exactly as its type semigroup (without additional relations forced by minimality or topological freeness) is load-bearing for the non-almost-unperforation property. The sketch does not contain an explicit verification that the generators corresponding to the perforation-witnessing elements of N remain distinct and satisfy no extra inequalities in the dynamical type semigroup.
Authors: We agree that the current presentation in §4 provides only a sketch and lacks an explicit verification that the type semigroup of the realized action coincides exactly with N. In the revised manuscript we will add a detailed argument in §4 showing that the clopen sets corresponding to the generators of N can be chosen so that the only relations enforced by the minimal topologically free action are those already present in N. The construction proceeds by first realizing the free refinement monoid on the generators and then using the freeness of F_∞ to ensure no unintended dynamical relations are introduced among the perforation-witnessing elements; this will be verified by direct computation of the type semigroup using the explicit partition of the Cantor set. revision: yes
-
Referee: [§3.2] §3.2 (Embedding M ↪ N): while the embedding is stated to be order-preserving, it is not shown that the image of the non-almost-unperforated pair in M remains non-almost-unperforated inside the refinement monoid N; refinement could in principle introduce new relations that restore almost unperforation before the dynamical realization step.
Authors: We acknowledge that the current text in §3.2 asserts the embedding is order-preserving but does not explicitly prove preservation of non-almost-unperforation. In the revision we will insert a short lemma immediately after the construction of N showing that the specific pair witnessing non-almost-unperforation in M remains non-almost-unperforated in N. The argument relies on the fact that the refinement relations added to obtain N are generated by elements outside the submonoid generated by the image of M, so no new inequalities are forced between multiples of the original perforation-witnessing elements. revision: yes
Circularity Check
Explicit monoid construction and realization yields independent dynamical counterexample
full rationale
The paper's central result rests on an explicit three-step construction: define a monoid M that fails almost unperforation, embed M into a countable refinement monoid N, and realize N as the type semigroup of a topologically free minimal F_∞-action on the Cantor set. This chain is presented as a direct existence proof rather than any reduction of the target non-comparison property to a fitted parameter, self-referential definition, or load-bearing self-citation. No equation or step equates the output property to its input by construction, and the realization technique is described as producing the required dynamical system without tautological collapse. The argument therefore remains self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Standard properties of monoids, refinement monoids, and type semigroups associated to group actions on Cantor sets
Reference graph
Works this paper leans on
-
[1]
Systems43(2023), no
Pere Ara, Christian Bönicke, Joan Bosa, and Kang Li,The type semigroup, comparison, and almost finiteness for ample groupoids, Ergodic Theory Dynam. Systems43(2023), no. 2, 361–400. MR4534134
2023
-
[2]
Math.252(2014), 748–804
Pere Ara and Ruy Exel,Dynamical systems associated to separated graphs, graph algebras, and paradoxical decompositions, Adv. Math.252(2014), 748–804. MR3144248
2014
-
[3]
Systems40(2020), no
Christian Bönicke and Kang Li,Ideal structure and pure infiniteness of ample groupoid C∗-algebras, Ergodic Theory Dynam. Systems40(2020), no. 1, 34–63. MR4038024
2020
-
[4]
Emmanuel Breuillard, Mehrdad Kalantar, Matthew Kennedy, and Narutaka Ozawa,C∗- simplicity and the unique trace property for discrete groups, Publ. Math. Inst. Hautes Études Sci.126(2017), 35–71. MR3735864
2017
-
[5]
Smallness and Comparison Properties for Minimal Dynamical Systems
Julian Buck,Smallness and comparison properties for minimal dynamical systems, 2013, eprint. arXiv: 1306.6681
work page internal anchor Pith review Pith/arXiv arXiv 2013
-
[6]
Doctor,The categories of Boolean lattices, Boolean rings and Boolean spaces, Canad
Hoshang P. Doctor,The categories of Boolean lattices, Boolean rings and Boolean spaces, Canad. Math. Bull.7(1964), 245–252. MR161813
1964
-
[7]
Tomasz Downarowicz and Guohua Zhang,Symbolic extensions of amenable group actions and the comparison property, Mem. Amer. Math. Soc.281(2023), no. 1390, vi+95. MR4539364
2023
-
[8]
In preparation
Eusebio Gardella,Classification of crossed products beyond freeness: allosteric actions and random subgroups. In preparation
-
[9]
Reine Angew
Eusebio Gardella, Shirly Geffen, Julian Kranz, and Petr Naryshkin,Classifiability of crossed products by nonamenable groups, J. Reine Angew. Math.797(2023), 285–312. MR4565952
2023
-
[10]
MR2466574 28 PAOLO BOLDRINI AND AKSHARA PRASAD
Steven Givant and Paul Halmos,Introduction to Boolean algebras, Undergraduate Texts in Mathematics, Springer, New York, 2009. MR2466574 28 PAOLO BOLDRINI AND AKSHARA PRASAD
2009
-
[11]
Eli Glasner and Benjamin Weiss,Weak orbit equivalence of Cantor minimal systems, Internat. J. Math.6(1995), no. 4, 559–579. MR1339645
1995
-
[12]
42, Cambridge University Press, Cambridge, 1993
Wilfrid Hodges,Model theory, Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, Cambridge, 1993. MR1221741
1993
-
[13]
Kechris,Classical descriptive set theory, Graduate Texts in Mathematics, vol
Alexander S. Kechris,Classical descriptive set theory, Graduate Texts in Mathematics, vol. 156, Springer-Verlag, New York, 1995. MR1321597 (96e:03057)
1995
-
[14]
David Kerr,Dimension, comparison, and almost finiteness, J. Eur. Math. Soc. (JEMS)22 (2020), no. 11, 3697–3745. MR4167017
2020
-
[15]
Math.161(2025), no
David Kerr and Petr Naryshkin,Elementary amenability and almost finiteness, Compos. Math.161(2025), no. 12, 3321–3337. MR5062308
2025
-
[16]
David Kerr and Gábor Szabó,Almost finiteness and the small boundary property, Comm. Math. Phys.374(2020), no. 1, 1–31. MR4066584
2020
-
[17]
Ann.315(1999), no
Eberhard Kirchberg and Simon Wassermann,Exact groups and continuous bundles ofC∗- algebras, Math. Ann.315(1999), no. 2, 169–203. MR1721796
1999
-
[18]
Ganna Kudryavtseva,Boolean inverse semigroups and their type monoids, Recent progress in ring and factorization theory, 2025, pp. 315–341. MR4928642
2025
-
[19]
Bartosz Kosma Kwaśniewski, Ralf Meyer, and Akshara Prasad,Type semigroups for twisted groupoids and a dichotomy for groupoidC∗-algebras, 2025, eprint. arXiv: 2502.17190
-
[20]
In preparation
Bartosz Kosma Kwaśniewski, Akshara Prasad, Hannes Thiel, and Jianchao Wu,Comparison in dynamical systems and type semigroups, 2026. In preparation
2026
-
[21]
Lawson,Non-commutative Stone duality, Semigroups, algebras and operator theory, [2023]©2023, pp
Mark V. Lawson,Non-commutative Stone duality, Semigroups, algebras and operator theory, [2023]©2023, pp. 11–66. MR4731734
2023
-
[22]
,Introduction to inverse semigroups, Algebra without borders, 2025, pp. 35–92. MR 4999209
2025
-
[23]
MR5000115
,Inverse semigroups—the theory of partial symmetries, 2nd ed., World Scientific, Hackensack, NJ, 2026. MR5000115
2026
-
[24]
Systems41(2021), no
Xin Ma,A generalized type semigroup and dynamical comparison, Ergodic Theory Dynam. Systems41(2021), no. 7, 2148–2165. MR4266367
2021
-
[25]
,Comparison and pure infiniteness of crossed products, Trans. Amer. Math. Soc.372 (2019), no. 10, 7497–7520. MR4024559
2019
-
[26]
Dyn.19(2025), no
Julien Melleray,Clopen type semigroups of actions on 0-dimensional compact spaces, Groups Geom. Dyn.19(2025), no. 3, 957–987. MR4945536
2025
-
[27]
Petr Naryshkin,Polynomial growth, comparison, and the small boundary property, Adv. Math. 406(2022), Paper No. 108519, 9. MR4438064
2022
-
[28]
,Group extensions preserve almost finiteness, J. Funct. Anal.286(2024), no. 7, Paper No. 110348, 8. MR4700192
2024
-
[29]
Petr Naryshkin and Spyridon Petrakos,Almost finiteness and groups of dynamical origin, Int. Math. Res. Not. IMRN3(2025), Paper No. rnaf016, 9. MR4859136
2025
-
[30]
Eduard Ortega, Francesc Perera, and Mikael Rørdam,The corona factorization property and refinement monoids, Trans. Amer. Math. Soc.363(2011), no. 9, 4505–4525. MR2806681
2011
-
[31]
Systems40(2020), no
Timothy Rainone and Aidan Sims,A dichotomy for groupoidC∗-algebras, Ergodic Theory Dynam. Systems40(2020), no. 2, 521–563. MR4048304
2020
-
[32]
Entropy in operator algebras, 2002, pp
Mikael Rørdam,Classification of nuclear, simpleC∗-algebras, Classification of nuclearC∗- algebras. Entropy in operator algebras, 2002, pp. 1–145. MR1878882
2002
-
[33]
,The stable and the real rank ofZ-absorbing C∗-algebras, Internat. J. Math.15(2004), no. 10, 1065–1084. MR2106263
2004
-
[34]
M. H. Stone,The theory of representations for Boolean algebras, Trans. Amer. Math. Soc.40 (1936), no. 1, 37–111. MR1501865
1936
-
[35]
,Applications of the theory of Boolean rings to general topology, Trans. Amer. Math. Soc.41(1937), no. 3, 375–481. MR1501905
1937
-
[36]
1, 207–223
Alfred Tarski,Algebraische Fassung des Maßproblems, Fundamenta Mathematicae31(1938), no. 1, 207–223
1938
-
[37]
Hannes Thiel,Ranks of operators in simpleC∗-algebras with stable rank one, Comm. Math. Phys.377(2020), no. 1, 37–76. MR4107924
2020
-
[38]
Hannes Thiel and Wilhelm Winter,The generator problem forZ-stable C∗-algebras, Trans. Amer. Math. Soc.366(2014), no. 5, 2327–2343. MR3165640
2014
-
[39]
Toms and Wilhelm Winter,Strongly self-absorbing C∗-algebras, Trans
Andrew S. Toms and Wilhelm Winter,Strongly self-absorbing C∗-algebras, Trans. Amer. Math. Soc.359(2007), no. 8, 3999–4029. MR2302521
2007
-
[40]
1, 104–129
Friedrich Wehrung,Embedding simple commutative monoids into simple refinement monoids, Semigroup Forum56(1998), no. 1, 104–129. MR1490558
1998
-
[41]
2188, Springer, Cham, 2017
,Refinement monoids, equidecomposability types, and boolean inverse semigroups, Lecture Notes in Mathematics, vol. 2188, Springer, Cham, 2017. MR3700423 Email address:paolob@chalmers.se TOPOLOGICALLY FREE MINIMAL ACTIONS WITHOUT DYNAMICAL COMPARISON 29 Department of Mathematical Sciences, Chalmers University of Technology and University of Gothenburg, Göt...
2017
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.