SearcharxivSearch

arXiv · 2004.12937

A model 2-category of enriched combinatorial premodel categories

Abstract

In his book on model categories, Hovey asked whether the 2-category $\mathbf{Mod}$ of model categories admits a "model 2-category structure" whose weak equivalences are the Quillen equivalences. We show that $\mathbf{Mod}$ does not have pullbacks and so cannot form a model 2-category. This lack of pullbacks can be traced to the two-out-of-three axiom on the weak equivalences of a model category. Accordingly, we define a premodel category to be a complete and cocomplete category equipped with two nested weak factorization systems. Combinatorial premodel categories form a complete and cocomplete closed symmetric monoidal 2-category $\mathbf{CPM}$ whose tensor product represents Quillen bifunctors. For a monoidal combinatorial premodel category $V$, the 2-category $V\mathbf{CPM}$ of $V$-enriched combinatorial premodel categories is simply the category of modules over $V$ (viewed as a monoid object of $\mathbf{CPM}$), and therefore inherits the algebraic structure of $\mathbf{CPM}$. The homotopy theory of a model category depends in an essential way on the weak equivalences, so it does not extend directly to a general premodel category. We develop a substitute homotopy theory for premodel categories satisfying an additional property which holds automatically for model categories and also for premodel categories enriched in a monoidal model category. In particular, for a monoidal model category $V$, we obtain a notion of Quillen equivalence of $V$-premodel categories which extends the one for $V$-model categories. When $V$ is a tractable symmetric monoidal model category, we construct a model 2-category structure on $V\mathbf{CPM}$ with these Quillen equivalences as the weak equivalences, by adapting Szumi\l{}o's construction of a fibration category of cofibration categories.

Explore related subjects

Keep this discovery

BibTeXRIS

Reid William Barton. 2020-04-27. A model 2-category of enriched combinatorial premodel categories. https://arxiv.org/abs/2004.12937

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