SearcharxivSearch

arXiv · 1308.2485

Permutation 2-groups I: structure and splitness

Abstract

By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group $\mathbb{S}ym(\mathcal{G})$ of self-equivalences of a groupoid $\mathcal{G}$ and natural isomorphisms between them, with the product given by composition of self-equivalences. These generalize the symmetric groups $\mathsf{S}_n$, $n\geq 1$, obtained when $\mathcal{G}$ is a finite discrete groupoid. After introducing the wreath 2-product $\mathsf{S}_n\wr\wr\ \mathbb{G}$ of the symmetric group $\mathsf{S}_n$ with an arbitrary 2-group $\mathbb{G}$, it is shown that for any (finite type) groupoid $\mathcal{G}$ the permutation 2-group $\mathbb{S}ym(\mathcal{G})$ is equivalent to a product of wreath 2-products of the form $\mathsf{S}_n\wr\wr\ \mathbb{S}ym(\mathcal{B}\mathsf{G})$, where $\mathcal{B}\mathsf{G}$ is the delooping of $\mathsf{G}$. This is next used to compute the homotopy invariants of $\mathbb{S}ym(\mathcal{G})$ which classify it up to equivalence. In particular, we prove that $\mathbb{S}ym(\mathcal{G})$ can be non-split, and that the step from the trivial groupoid $\mathcal{B}\mathsf{1}$ to an arbitrary one-object groupoid $\mathcal{B}\mathsf{G}$ is in fact the only source of non-splitness. Various examples of permutation 2-groups are explicitly computed, in particular the permutation 2-group of the underlying groupoid of a (finite type) 2-group. It also follows from well known results about the symmetric groups that the permutation 2-group of the groupoid of all finite sets and bijections between them is equivalent to the direct product 2-group $\mathbb{Z}_2[1]\times\mathbb{Z}_2[0]$, where $\mathbb{Z}_2[0]$ and $\mathbb{Z}_2[1]$ stand for the group $\mathbb{Z}_2$ thought of as a discrete and a one-object 2-group, respectively.

Explore related subjects

Keep this discovery

BibTeXRIS

Josep Elgueta. 2013-08-12. Permutation 2-groups I: structure and splitness. https://arxiv.org/abs/1308.2485

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

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT