Related papers: Functorial Factorizations in Pro Categories
In this paper we present a new way to construct the pro-category of a category. This new model is very convenient to work with in certain situations. We present a few applications of this new model, the most important of which solves an…
We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…
We prove that any right Quillen functor between arbitrary model categories admits non trivial functorial factorizations that are similar to those of a model structure. We also prove that these factorizations can be made for lax monoidal…
We construct an iterative method for factorising small strict n-categories into a unique (up to isomorphism) collection of small 1- categories. Following this we develop the theory to include a large class of $\infty$-categories. We use…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
Generalizing Eisenbud's matrix factorizations, we define factorization categories. Following work of Positselski, we define their associated derived categories. We construct specific resolutions of factorizations built from a choice of…
We establish a correspondence between consistent comprehension schemes and complete orthogonal factorisation systems. The comprehensive factorisation of a functor between small categories arises in this way. Similar factorisation systems…
In this paper we develop the theory of topological categories over a base category, that is, a theory of topological functors. Our notion of topological functor is similar to (but not the same) the existing notions in the literature (see…
We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…
Classification questions are often about understanding components of a category. It is much more desirable however to be able to understand the entire homotopy type of this category and not just the set of its components. In this paper we…
Dilatations modify categories by imposing that some morphisms factorize through some others. This is formalized by a universal property. This text is devoted to introduce and study this construction. Examples of dilatations of categories…
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.
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…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We prove functorial weak factorization of projective birational morphisms of regular quasi-excellent schemes in characteristic 0 broadly based on the existing line of proof for varieties. From this general functorial statement we deduce…
For a regular normal element in an arbitrary ring, we study the category of its module factorizations. The cokernel functor relates module factorizations with Gorenstein projective components to Gorenstein projective modules over the…
This article is first in a series of papers where we reprove the statements in constructing the Enhanced Operation Map and the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem regarding constructing…
We present general techniques for constructing functorial factorizations appropriate for model structures that are not known to be cofibrantly generated. Our methods use "algebraic" characterizations of fibrations to produce factorizations…
We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid $A$, which we denote $\mathcal{F}(A)$. The objects of $\mathcal{F}(A)$ are factorizations of elements of $A$, and…
In this work we discuss a new type of factorisation systems for \textbf{Ord}-enriched categories. We start by defining the new notion of lax weak orthogonality, which involves the existence of lax diagonal morphisms for lax squares. Using…