Strong Topological Rokhlin Property: Finite-Index Ascent, Descriptive Complexity, and Effective Obstructions
Jintao Luo
Abstract
We give a finite symbolic characterization of the strong topological Rokhlin property in terms of globally realizable finite pattern systems. We use this characterization to prove finite-index ascent: if H≤ G has finite index, G is finitely generated, and H has STRP, then G has STRP. Consequently every finitely generated virtually free group has STRP, whereas among countable locally virtually free groups STRP holds exactly for the finitely generated ones. In the compact coding space NSub(Fω) of countable groups, the STRP locus belongs to Π04, is Σ03-hard; the locus of finitely generated virtually free groups is Σ03-complete. For quotients Fω/N with N recursively enumerable, every projectively isolated subshift has decidable finite tuple-language and contains an N-recursive configuration. This yields effective SFT obstructions to STRP, including subgroup and direct-product obstructions, and implies that SLn( Q) does not have for any n≥2.
Create a lesson
Related papers
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski
Coding is non-robust
Sam Sanders
Scott topologies on products of countable complete Heyting algebras
Xiaoquan Xu
1-genericity and almost everywhere domination
Xuanheng Zhao
Almost-everywhere computation of weak generics relative to r.e. sets
Xuanheng Zhao
On definable Galois theory and definable Galois cohomology in the totally transcendental setting
David Meretzky