Length functions on hypercentral groups

From MaRDI portal





A map \(\ell\) from a group G to the reals \({\mathbb{R}}\) is a length function whenever \(\ell (1)=0\) and for any x,y,z in G we have \(\ell (x)=\ell (x^{-1})\) and also \(d(x,y)<d(x,z)\) implies \(d(x,z)=d(y,z)\), where d(x,y) denotes \((\ell (x)+\ell (y)-\ell (xy^{-1})/2\). An element x of G is Archimedean if \(\ell (x^ 2)>\ell (x)\); the set N of non-Archimedean elements is a normal subset of G and is a subgroup when it coincides with G or the lengths of its elements are bounded. If \(N=1\), \(\ell\) is called Archimedean, if \(N=G\), non-Archimedean. It is known that an Archimedean length function on an abelian group is essentially the absolute value function on some additive subgroup of \({\mathbb{R}}\), and that a non- Archimedean length function arises from a chain of subgroups. The main theorem of this paper deals with the situation where G is hypercentral, where (the author notes) certain troublesome cases of an earlier theorem cannot arise. [Thm. 2.1, \textit{G. R. Chapman} and \textit{D. L. Wilkens}, Mich. Math. J. 30, 165-173 (1983; Zbl 0532.20021)]. The author shows that in this case \(\ell\) is an extension of a non- Archimedean length function \(\ell_ 1\) on N by an Archimedean length function \(\ell_ 2\) on the abelian group \(H=G/N\). Moreover there exists \(c\geq 0\) and an embedding \(g: H\to {\mathbb{R}}\) such that c is an upper bound for the length of the elements of N and \(\ell_ 2(u)=c+| g(u)|\) for any \(u\neq 1\) in H. He points out that hypercentral cannot be weakened to soluble, since an infinite dihedral group can be given a length function such that the relevant N is not a subgroup.











This page was built for publication: Length functions on hypercentral groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705612)