SearcharxivSearch

arXiv · 1509.05730

Commutator theory for loops

Abstract

Using the Freese-McKenzie commutator theory for congruence modular varieties as the starting point, we develop commutator theory for the variety of loops. The fundamental theorem of congruence commutators for loops relates generators of the congruence commutator to generators of the total inner mapping group. We specialize the fundamental theorem into several varieties of loops, and also discuss the commutator of two normal subloops. Consequently, we argue that some standard definitions of loop theory, such as elementwise commutators and associators, should be revised and linked more closely to inner mappings. Using the new definitions, we prove several natural properties of loops that could not be so elegantly stated with the standard definitions of loop theory. For instance, we show that the subloop generated by the new associators defined here is automatically normal. We conclude with a preliminary discussion of abelianess and solvability in loops.

Explore related subjects

Keep this discovery

BibTeXRIS

David Stanovský, Petr Vojtěchovský. 2015-09-18. Commutator theory for loops. https://arxiv.org/abs/1509.05730

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