SearcharxivSearch

arXiv · 1512.07577

Decomposition spaces, incidence algebras and Möbius inversion II: completeness, length filtration, and finiteness

Abstract

This is the second in a trilogy of papers introducing and studying the notion of decomposition space as a general framework for incidence algebras and Möbius inversion, with coefficients in $\infty$-groupoids. A decomposition space is a simplicial $\infty$-groupoid satisfying an exactness condition weaker than the Segal condition. Just as the Segal condition expresses composition, the new condition expresses decomposition. In this paper, we introduce various technical conditions on decomposition spaces. The first is a completeness condition (weaker than Rezk completeness), needed to control simplicial nondegeneracy. For complete decomposition spaces we establish a general Möbius inversion principle, expressed as an explicit equivalence of $\infty$-groupoids. Next we analyse two finiteness conditions on decomposition spaces. The first, that of locally finite length, guarantees the existence of the important length filtration on the associated incidence coalgebra. We show that a decomposition space of locally finite length is actually the left Kan extension of a semi-simplicial space. The second finiteness condition, local finiteness, ensures we can take homotopy cardinality to pass from the level of $\infty$-groupoids to the level of vector spaces. These three conditions - completeness, locally finite length, and local finiteness - together define our notion of Möbius decomposition space, which extends Leroux's notion of Möbius category (in turn a common generalisation of the locally finite posets of Rota et al. and of the finite decomposition monoids of Cartier-Foata), but which also covers many coalgebra constructions which do not arise from Möbius categories, such as the Faà di Bruno and Connes-Kreimer bialgebras. Note: The notion of decomposition space was arrived at independently by Dyckerhoff and Kapranov (arXiv:1212.3563) who call them unital 2-Segal spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Imma Gálvez-Carrillo, Joachim Kock, Andrew Tonks. 2020-01-31. Decomposition spaces, incidence algebras and Möbius inversion II: completeness, length filtration, and finiteness. https://doi.org/10.1016/j.aim.2018.03.017

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