Search arXivSearch

arXiv · 2603.18183

Around Gromov's injectivity lemma and applications to post-injunctive groups

Abstract

Gottschalk's surjunctivity conjecture states that for all group universes and finite alphabets, every equivariant and continuous selfmap of the full shift, known as cellular automaton, cannot be a strict embedding. Not all surjective cellular automata are injective. However, if the surjectivity condition is replaced by a certain strengthened property called post-surjectivity then all post-surjective cellular automata must be bijective whenever the universe is a sofic group. A group universe is said to be post-injunctive if every post-surjective cellular automaton with finite alphabet over this group universe must be bijective. Gromov's injectivity lemma states each injective cellular automaton over a subshift can be extended to an injective cellular automaton over every subshift which is close enough to the initial subshift. In this paper, we obtain analogous results where injectivity is replaced by other fundamental dynamical properties namely post-surjectivity and pre-injectivity. We also study various stable properties of the class of post-injunctive groups in parallel to properties of surjunctive groups. Among the results, we show that semidirect extensions of post-injunctive groups with residually finite kernels must be post-injunctive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xuan Kien Phung. 2026-03-18. Around Gromov's injectivity lemma and applications to post-injunctive groups. https://arxiv.org/abs/2603.18183

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On commensurators of free groups and free pro-p groups

We study the commensurators of free groups and free pro-$p$ groups, as well as certain subgroups of these. We prove that the commensurator $Comm(F)$ of a non-abelian free group of finite rank $F$ is not virtually simple, answering a question of Lubotzky. On the other hand, we exhibit a family of easy-to-define finitely generated subgroups of $Comm(F)$ and show that some groups in this family are simple. For a prime $p$, we also consider the p-commensurator $Comm_p(F)$, which is the commensurator of $F$ viewed as a group with pro-$p$ topology. By contrast with $Comm(F)$, we prove that $Comm_p(F)$ has a simple subgroup of index at most 2. Further, while the isomorphism class of $Comm(F)$ does not depend on the rank of $F$, we prove that the isomorphism class of $Comm_p(F)$ depends on the rank of $F$ and determine the exact dependency. If $\mathbf F$ is the pro-$p$ completion of $F$ (which is a free pro-$p$ group), $Comm(\mathbf F)$ is a totally disconnected locally compact (tdlc) group containing $\mathbf F$ as an open subgroup. We use $Comm_p(F)$ to construct an abstractly simple subgroup of $Comm(\mathbf F)$ containing $\mathbf F$ as well as a family of non-discrete tdlc groups which are compactly generated and simple.

math.GR

Asymmetry of $\ell^{2}$-cohomology via skewed Følner geometry

We study the two $\ell^{2}$-Dirichlet structures on a countable group $G$ arising from the left and right regular actions on $\mathbb{R}^{G}$. Although the two regular representations are unitarily equivalent, their $\ell^{2}$-Dirichlet subspaces of $\mathbb{R}^{G}$ need not coincide. Our main result gives a complete classification of this asymmetry for countable amenable groups: $$\mathcal{D}_{2}\left(G,λ\right)=\mathcal{D}_{2}\left(G,ρ\right)\quad\Longleftrightarrow\quad G \text{ is an FC-group}.$$ The proof is based on a skewed Følner-geometric mechanism, called a left scheme, combining summability of left boundaries with displacement under a right translation. We develop this mechanism generally, and demonstrate it concretely in the Heisenberg group and amenable wreath products over $\mathbb{Z}$. We also show that this mechanism has a dynamical counterpart in the theory of nonsingular Bernoulli shifts: every countable amenable group that is not an FC-group admits Bernoulli schemes whose left shift is nonsingular, conservative and weakly mixing, whereas the right shift by some element is singular.

math.GR

Analogues of Sylow's first theorem, Cauchy's theorem, and Hall's theorem for skew braces

We establish an unconditional analogue of Sylow's first theorem for finite skew braces, and deduce an analogue of Cauchy's theorem. We also prove an analogue of the existence part of Hall's theorem for finite skew braces with soluble additive and multiplicative groups. We make some observations regarding the number of Sylow subskew braces of a skew brace in various cases. By applying these results we streamline the classification of skew braces of order $ pq $, where $ p,q $ are distinct prime numbers.

math.GR