Related papers: Understanding the small object argument

The small object argument is a method for transfinitely constructing weak factorization systems originally motivated by homotopy theory. We establish a variant of the small object argument that is enriched over a cofibrantly generated weak…

We analyze the structure of left maps in algebraic weak factorization systems constructed using Garner's algebraic small object argument. We find that any left map can be constructed from generators in Bourke and Garner's double category of…

We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen's small object argument). The necessity of such a generalization arose with appearance of several…

Bourke and Garner described how to cofibrantly generate algebraic weak factorisation systems by a small double category of morphisms. However they did not give an explicit construction of the resulting factorisations as in the classical…

We show that in a locally lambda-presentable category, every lambda(m)-injectivity class (i.e., the class of all the objects injective with respect to some class of lambda-presentable morphisms) is a weakly reflective subcategory determined…

We will construct an algebraic weak factorisation system on the category of 01 substitution sets such that the R-algebras are precisely the Kan fibrations together with a choice of Kan filling operation. The proof is based on Garner's small…

Good colimits introduced by J. Lurie generalize transfinite composites and provide an important tool for understanding cofibrant generation in locally presentable categories. We will explore the relation of good colimits to transfinite…

There is an ``algebraisation'' of the notion of weak factorisation system (w.f.s.) known as a natural weak factorisation system. In it, the two classes of maps of a w.f.s. are replaced by two categories of maps-with-structure, where the…

We present a variant of the small object argument, inspired by Kelly, better suited to construct unique factorisation systems. Our main result is to compare it to the plus-construction involved in sheafification. We apply this to construct…

We prove that a weak factorization system on a locally presentable category is accessible if and only if it is small generated in the sense of R. Garner. Moreover, we discuss an analogy of Smith's theorem for accessible model categories.

We develop the theory of weak Fraisse categories, where the crucial concept is the weak amalgamation property, discovered relatively recently in model theory. We show that, in a suitable framework, every weak Fraisse category has its unique…

Objects $T$ whose exponential functor $(-)^T$ admits a right adjoint $(-)_T$ are known under different names. The fact that they exist, yet that the only set that satisfies this in the category of sets is the singleton made Lawvere suggest…

The simplicial extension of any functor from Sets to Sets which commutes with directed colimits takes weak equivalences to weak equivalences. The goal of the present paper is construct a framework which can be used to proof results of this…

This article re-examines Lawvere's abstract, category-theoretic proof of the fixed-point theorem whose contrapositive is a `universal' diagonal argument. The main result is that the necessary axioms for both the fixed-point theorem and the…

We consider subtorus actions on complex toric varieties. A natural candidate for a categorical quotient of such an action is the so-called toric quotient, a universal object constructed in the toric category. We prove that if the toric…

A folklore result in category theory is that a (weakly) Cartesian closed category with finite co-products is distributive. Usually, the proof of this small result is carried on using the fact that the exponential functor is right adjoint to…

This paper introduces the construction of a weakly globular double category of fractions for a category and studies its universal properties. It shows that this double category is locally small and considers a couple of concrete examples.

Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…

Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.

In this paper we develop a theory for correctness of concurrent objects under weak memory models. Central to our definitions is the concept of observations which determine when effects of operations become visible, and hence determine the…