SearcharxivSearch

arXiv · 2507.22507

Weakly branch actions: first-order theory, rigidity and Boston's conjecture

Abstract

We disprove a well-known conjecture of Boston (2000), which claims that a just-infinite pro-$p$ group is branch if and only if it admits a positive-dimensional embedding in the group of $p$-adic automorphisms. This is obtained as a result of a comprehensive study of the rigidity of branch actions. Firstly, we generalize the notion of the structure graph, introduced by Wilson in 2000, to weakly branch groups and use it to prove several results on the first-order theory of weakly branch groups, extending previous results of Wilson on branch groups. Secondly, we completely characterize the rigidity of weakly branch and branch actions on arbitrary spherically homogeneous rooted trees, extending previous partial results (for branch actions) by Hardy, Garrido, Grigorchuk and Wilson. Moreover, we prove that rigidity of a weakly branch group is equivalent to rigidity of its closure in the full automorphism group. Thirdly, we extend greatly the sufficient conditions $(*)$ and $(**)$ of Grigorchuk and Wilson, which leads to a complete and very easy-to-check characterization of the rigidity of the weakly branch actions of a fractal group of $p$-adic automorphisms. We further establish the first connection in the literature between the Hausdorff dimension of a weakly branch action and its rigidity. Lastly, we put everything together to show that the zero-dimensional just-infinite branch pro-$p$ groups introduced recently by the author admit rigid branch actions on a tree obtained by deletion of levels. This, together with previous results of the author, shows that these groups are indeed counterexamples to the aforementioned conjecture of Boston.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge Fariña-Asategui. 2025-07-30. Weakly branch actions: first-order theory, rigidity and Boston's conjecture. https://arxiv.org/abs/2507.22507

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR