SearcharxivSearch

arXiv · math/0302201

Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices

Abstract

Let αbe an automorphism of the totally disconnected group G. The compact open subgroup, V, if G is tidy for αif [α(V') : α(V')\cap V'] is minimised at V, where V' ranges over all compact open subgroups of G. Identifying a subgroup tidy for αis analogous to identifying a basis which puts a linear transformation into Jordan canonical form. This analogy is developed here by showing that commuting automorphisms have a common tidy subgroup of G and, conversely, that a group H of automorphisms having a common tidy subgroup V is abelian modulo the automorphisms which leave V invariant. Certain subgroups of G are the analogues of eigenspaces and corresponding real characters of H the analogues of eigenvalues.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

George A. Willis. 2003-02-18. Tidy subgroups for commuting automorphisms of totally disconnected groups: an analogue of simultaneous triangularisation of matrices. https://arxiv.org/abs/math/0302201

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