Search arXivSearch

arXiv · 1405.7263

Comparing algebraic and non-algebraic foundations of $n$-category theory

Abstract

Many definitions of weak n-category have been proposed. It has been widely observed that each of these definitions is of one of two types: algebraic definitions, in which composites and coherence cells are explicitly specified, and non-algebraic definitions, in which a coherent choice of composites and constraint cells is merely required to exist. Relatively few comparisons have been made between definitions, and most of those that have concern the relationship between definitions of just one type. The aim of this thesis is to establish more comparisons, including a comparison between an algebraic definition and a non-algebraic definition. The thesis is divided into two parts. Part 1 concerns the relationships between three algebraic definitions of weak n-category: those of Penon and Batanin, and Leinster's variant of Batanin's definition. A correspondence between the structures used to define composition and coherence in the definitions of Batanin and Leinster has long been suspected; we make this precise for the first time. We use this correspondence to prove several coherence theorems that apply to all three definitions, and to take the first steps towards describing the relationship between the weak n-categories of Batanin and Leinster. In Part 2 we take the first step towards a comparison between Penon's definition of weak n-category and a non-algebraic definition, Simpson's variant of Tamsamani's definition, in the form of a nerve construction. As a prototype for this nerve construction, we recall a nerve construction for bicategories proposed by Leinster, and prove that the nerve of a bicategory given by this construction is a Tamsamani--Simpson weak 2-category. We then define our nerve functor for Penon weak n-categories. We prove that the nerve of a Penon weak 2-category is a Tamsamani--Simpson weak 2-category, and conjecture that this result holds for higher n.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Cottrell. 2014-05-28. Comparing algebraic and non-algebraic foundations of $n$-category theory. https://arxiv.org/abs/1405.7263

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