SearcharxivSearch

arXiv · 2509.13973

Split Lemma and First Isomorphism Theorem for groupoids

Abstract

Groupoids are the oidification of groups, and they are largely used in topology and representation theory. We consider here the category $\mathsf{Gpd}$ of all groupoids with all morphisms, and the category $\mathsf{Gpd}_\Lambda$ of groupoids over a fixed set of vertices $\Lambda$, with morphisms fixing $\Lambda$. In $\mathsf{Gpd}_\Lambda$, a First Isomorphism Theorem is already well known; see \'Avila, Mar\'in, and Pinedo (2020). Famously, the First Isomorphism Theorem fails to hold in $\mathsf{Gpd}$. However, we retrieve here a universally lifted version of the First Isomorphism Theorem in $\mathsf{Gpd}$, through the definition of virtual kernels. Semidirect products of a group by a groupoid are well known. We define crossed products in $\mathsf{Gpd}$, and prove that they are equivalent to split epimorphisms, i.e. that they are the `categorial' notion of semidirect product in $\mathsf{Gpd}$ in the sense of Bourn and Janelidze (1998). We observe that in $\mathsf{Gpd}_\Lambda$ crossed products and semidirect products are essentially equivalent, under mild assumptions, and our Split Lemma in $\mathsf{Gpd}$ collapses to a much simpler Split Lemma in $\mathsf{Gpd}_\Lambda$ that appears in Metere and Montoli (2010) and Ibort and Marmo (2023).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Davide Ferri. 2025-09-17. Split Lemma and First Isomorphism Theorem for groupoids. https://arxiv.org/abs/2509.13973

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