Finite-Index Lifting of Strong Topological Rokhlin Property and Descriptive Complexity

Abstract: We give a finite symbolic reformulation of the strong topological Rokhlin property in terms of globally realizable tuples. We prove that the strong topological Rokhlin property passes from a finite-index subgroup to a finitely generated overgroup. We also study the descriptive complexity of the class of countable groups having the strong topological Rokhlin property. In the standard compact space of countable groups, this class belongs to $\mathbfΠ<sup>0_4$ and is $\mathbfΣ<sup>0_2$-hard. We also isolate a barrier to Borel rank four: if the class is not $\mathbfΣ<sup>0_3$, then there is a non-finitely-presented group with the strong topological Rokhlin property.

• The paper reformulates the strong topological Rokhlin property through globally realizable finite symbolic tuples and one-block factor maps, replacing generic Cantor-action conditions with finite combinatorial data.
• The paper proves that STRP ascends from a finite-index subgroup to any finitely generated overgroup, establishing STRP for finitely generated virtually free groups and, in particular, for \(\mathrm{SL}_2(\mathbb Z)\).
• The paper places the STRP locus in the Borel hierarchy as \(\Sigma^0_2\)-hard and in \(\Pi^0_4\), while leaving its exact rank and the infinitely generated extension case open.

This paper, by Jintao Luo, contributes to the theory of the strong topological Rokhlin property (STRP) for countable group actions on the Cantor space $\mathfrak C = 2^{\mathbb N}$, in the sense of Doucha: a countable group $G$ has STRP when the conjugation action of $Homeo(\mathfrak C)$ on the Polish space $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$ has a comeager orbit. The paper makes three contributions: a finite symbolic reformulation of STRP via "globally realizable tuples"; a finite-index ascent theorem showing that STRP passes from a finite-index subgroup to a finitely generated overgroup; and an analysis of the descriptive set-theoretic complexity of the class of groups with STRP within the standard compact space of countable groups.

A finite characterization via globally realizable tuples

The paper works with subshifts $X \subseteq A^G$ under the left shift action. For finite $F \subseteq G$ and $\mathcal F \subseteq A^F$, the cylinder $[F,\mathcal F]_G$ consists of configurations all of whose translated $F$-patterns lie in $\mathcal F$. A normalization lemma shows that any nonempty SFT satisfies $G$0, and that this presentation is stable under enlarging the window. This motivates the central notion: a tuple $G$1 is globally realizable over $G$2 if $G$3 and $G$4, i.e., every pattern in $G$5 actually occurs somewhere in the global SFT it defines. Every subshift together with a finite window yields such a tuple by restriction.

The key structural result (Proposition 2.3) characterizes Doucha's projectively isolated subshifts: $G$6 is projectively isolated if and only if there exist a finite alphabet $G$7, a globally realizable tuple $G$8, and a surjection $G$9 such that every subshift $Homeo(\mathfrak C)$0 with $Homeo(\mathfrak C)$1 satisfies $Homeo(\mathfrak C)$2. The proof uses Doucha's lemmas that SFTs are dense in the space of subshifts and that projective-isolation witnesses can be recoded to one-block alphabet maps; surjectivity of $Homeo(\mathfrak C)$3 is arranged by adding unused symbols, which cannot occur because the identity belongs to the defining window.

Combining this with Doucha's theorem that $Homeo(\mathfrak C)$4 has STRP exactly when projectively isolated subshifts are dense over every alphabet of size at least two yields the main finite characterization (Theorem 2.4): $Homeo(\mathfrak C)$5 has STRP if and only if for every globally realizable tuple $Homeo(\mathfrak C)$6 there are a globally realizable $Homeo(\mathfrak C)$7 and a surjection $Homeo(\mathfrak C)$8 whose projected SFT has $Homeo(\mathfrak C)$9-language exactly $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$0 and whose image is constant across the entire cylinder $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$1. This reduces STRP to quantification over finite combinatorial data, which is what enables both the ascent argument and the complexity bounds.

Finite-index ascent

The second section proves that STRP ascends finite-index extensions: if $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$2 has finite index and $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$3 has STRP, then any finitely generated countable $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$4 containing $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$5 also has STRP (Theorem 3.3). The proof verifies the finite characterization directly, using two elementary symbolic constructions: a higher-power recoding identifying $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$6 with $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$7 as an $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$8-system, and a free-extension lemma showing that the $Act_G(\mathfrak C) = Hom(G, Homeo(\mathfrak C))$9-SFT generated from an $X \subseteq A^G$0-SFT decorates each left coset independently by points of the original subshift.

The technical core is the construction of a marker structure: for a finite symmetric generating set $X \subseteq A^G$1 of $X \subseteq A^G$2, the set of maps $X \subseteq A^G$3 satisfying $X \subseteq A^G$4 forms an SFT whose points are exactly right translates of the coset map $X \subseteq A^G$5. An auxiliary SFT $X \subseteq A^G$6 on the alphabet $X \subseteq A^G$7 carries a coset marker together with a point of the free extension $X \subseteq A^G$8 and its base-phase reindexing. Any subshift $X \subseteq A^G$9 realizing the normalized window $F \subseteq G$0 projects, fiberwise over the marker, to an $F \subseteq G$1-subshift $F \subseteq G$2 contained in $F \subseteq G$3 with full $F \subseteq G$4-language $F \subseteq G$5; hence $F \subseteq G$6 by the witness property over $F \subseteq G$7. A coordinate computation then shows that the one-block map $F \subseteq G$8 sends $F \subseteq G$9 onto the union of phase-translates of $\mathcal F \subseteq A^F$0, and that the $\mathcal F \subseteq A^F$1-language condition transfers because the phase-$\mathcal F \subseteq A^F$2 $\mathcal F \subseteq A^F$3-language depends only on $\mathcal F \subseteq A^F$4, where $\mathcal F \subseteq A^F$5 is the finite cocycle window determined by $\mathcal F \subseteq A^F$6 and the chosen coset representatives.

Two remarks are worth emphasizing. First, the author notes that this theorem appears independently as Theorem 7.3 of Xu's preprint (Xu, 17 Aug 2026), submitted one day after the argument recorded here was obtained; the acknowledgments state the result was derived in a single interaction with ChatGPT 5.6 Sol Pro while investigating STRP for $\mathcal F \subseteq A^F$7, and the appendix reproduces the full prompt and response verbatim. Second, the theorem answers a question left open by Doucha, who had asked whether STRP is closed under commensurability and noted that even the virtually cyclic case was unresolved. As an immediate corollary, every finitely generated virtually free group has STRP, since finite-rank free groups have STRP by Kwiatkowska's ample-generics theorem for $\mathcal F \subseteq A^F$8, and the finite case follows directly from the finiteness of the space of subshifts. In particular, since $\mathcal F \subseteq A^F$9 contains the index-12 subgroup $[F,\mathcal F]_G$0, the motivating case $[F,\mathcal F]_G$1 has STRP.

Descriptive complexity

The third section locates the class $[F,\mathcal F]_G$2 of normal subgroups $[F,\mathcal F]_G$3 with $[F,\mathcal F]_G$4 having STRP, inside the compact space $[F,\mathcal F]_G$5. Countable groups are coded by their marked quotients of the free group of countable rank, and finite symbolic codes $[F,\mathcal F]_G$6 pull back to SFTs $[F,\mathcal F]_G$7 over $[F,\mathcal F]_G$8.

Three preparatory facts drive the analysis. The occurrence relation $[F,\mathcal F]_G$9 is closed, by compactness of the product and the fact that membership is an intersection of clopen conditions. Consequently, global realizability of a fixed code is a closed condition on $F$0. Finally, a finite-obstruction lemma shows that failure of the universal-image condition in the finite characterization is witnessed by some finite pair $F$1: either every subshift of $F$2 with full $F$3-language projects onto $F$4, or there is a pattern $F$5 occurring in $F$6 whose global forbidding still preserves the $F$7-language. Since there are only countably many such pairs, and each corresponding failure condition is closed, the witnessing relation is $F$8.

Assembling these, the paper establishes the upper bound

$F$9

where the bracketed expression is $\mathcal F$0 for fixed $\mathcal F$1. Hence $\mathcal F$2 (Theorem 3.5).

For the lower bound, the reduction $\mathcal F$3 sends a binary sequence $\mathcal F$4 to the kernel of the homomorphism $\mathcal F$5. This map is continuous, and $\mathcal F$6 (the $\mathcal F$7-complete set of sequences with finitely many ones) if and only if $\mathcal F$8 is finite, hence has STRP; if $\mathcal F$9, then $G$00 is non-finitely-generated abelian and fails STRP by Doucha's Corollary 5.7. Thus $G$01 is $G$02-hard (Proposition 3.6). Combined with the upper bound, the exact Borel rank lies strictly between these bounds and is not determined — the paper states this explicitly as an open gap.

Limitations and open questions

The paper is candid about several restrictions. The ascent theorem requires $G$03 to be finitely generated; the proof uses a finite symmetric generating set both to define the marker SFT and to control the cocycle window, and no extension to infinitely generated overgroups is given. The complexity analysis leaves the exact Borel rank of $G$04 undetermined, with only the sandwich $G$05-hard $G$06 established. Most notably, Proposition 3.7 isolates a barrier to improving the lower bound past $G$07: each isomorphism class of finitely generated groups is $G$08, so the finitely presented STRP locus is contained in $G$09. Consequently, if $G$10, then some non-finitely-presented group must have STRP — a dichotomy that ties the purely descriptive-set-theoretic question to the existence of concrete examples outside the finitely presented world. Whether such groups exist is not resolved here.

Conclusion

The paper provides a finite, combinatorial reformulation of the strong topological Rokhlin property that converts a genericity statement about Cantor actions into quantification over globally realizable tuples and one-block factor maps. This reformulation yields two concrete payoffs: closure of STRP under finite-index supergroups of finitely generated groups, resolving a previously open commensurability question and giving STRP for all finitely generated virtually free groups including $G$11; and placement of the STRP locus in the Borel hierarchy between $G$12-hardness and $G$13, together with a structural barrier indicating that any sharper lower bound would require exhibiting non-finitely-presented examples. The exact Borel rank, and the behavior of STRP under infinitely generated finite-index extensions, remain open.