A relevant category is a symmetric monoidal closed category with a diagonal natural transformation that satisfies some coherence conditions. Every cartesian closed category is a relevant category in this sense. The denomination 'relevant' comes from the connection with relevant logic. It is shown that the category of sets with partial functions, which is isomorphic to the category of pointed sets, is a category that is relevant, but not cartesian closed.
We construct a category of fibrant objects $\mathbb{C}\langle P\rangle$ in the sense of K. Brown from any indexed frame (a kind of indexed poset generalizing triposes) $P$, and show that its homotopy category is the Barr-exact category $\mathbb{C}[P]$ of partial equivalence relations and compatible functional relations. In particular this gives a presentation of realizability toposes as homotopy categories. We give criteria for the existence of left and right derived functors to functors $\mathbb{C}\langleΦ\rangle : \mathbb{C}\langle P\rangle\to \mathbb{C}\langle Q\rangle$ induced by finite-me…
This paper deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every symmetric monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int-construction.
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 the usual theory of factorisation systems as a blueprint, we introduce a lax version of weak and functorial factorisation systems. We provide a characterisation of lax functorial weak factorisation systems, namely lax weak factorisation systems such that their factorisations are lax functorial. Then, we present a particular case of such lax functorial weak fa…
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int…
Latent fibrations are an adaptation, appropriate for categories of partial maps (as presented by restriction categories), of the usual notion of fibration. The paper initiates the development of the basic theory of latent fibrations and explores some key examples. Latent fibrations cover a wide variety of examples, some of which are partial versions of standard fibrations, and some of which are particular to partial map categories (particularly those that arise in computational settings). Latent fibrations with various special properties are identified: hyperconnected latent fibrations, in par…
We investigate fibrancy conditions in the Thomason model structure on the category of small categories. In particular, we show that the category of weak equivalences of a partial model category is fibrant. Furthermore, we describe connections to calculi of fractions.
A restriction category is an abstract formulation for a category of partial maps, defined in terms of certain specified idempotents called the restriction idempotents. All categories of partial maps are restriction categories; conversely, a restriction category is a category of partial maps if and only if the restriction idempotents split. Restriction categories facilitate reasoning about partial maps as they have a purely algebraic formulation. In this paper we consider colimits and limits in restriction categories. As the notion of restriction category is not self-dual, we should not expect …
We introduce a general framework for generating dualities between categories of partial orders and categories of ordered Stone spaces; we recover in particular the classical Priestley duality for distributive lattices and establish several other dualities for different kinds of partially ordered structures.
In this note we consider partial model categories, by which we mean relative categories that satisfy a weakened version of the model category axioms involving only the weak equivalences. More precisely, a partial model category will be a relative category that has the two out of six property and admits a 3-arrow calculus. We then show that Charles Rezk's result that the simplicial space obtained from a simplicial model category by taking a Reedy fibrant replacement of its simplicial nerve is a complete Segal space also holds for these partial model categories. We also note that conversely ever…
We give a computational approach to theorem proving in homological algebra. This approach is based on computations in the free abelian category of an additive category $\mathbf{A}$. We show that the free abelian category is amenable to explicit computations whenever we can decide homotopy equations in $\mathbf{A}$. As some consequences of our investigations, we recover Dowker's explicit formula for the connecting homomorphism $\partial$ in the snake lemma, we find a universal sense in which $\partial$ is unique, and we give a refined version of the 5-lemma.
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that preserves the antisymmetry of the order Relation. Finally some suggestions are given, how the orbit categories can be represented by simple directed and annotated graphs and annotated binary relations. These relations are reflexive, and, in many cases, they can be chosen to be antisymmetric. From these constructions arise different suggestions for fundamental syste…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative process of stacking certain normal subgroup lattices on top of each other to successively build congruence lattices of a chain of ideals. This is applied to several specific categories of: transformations; order/orientation preserving/reversing transformations; partitions; planar/annular partitions; Brauer, Temperley--Lieb and Jones partitions; linear and projec…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are partially defined with respect to this spatial structure. We introduce a construction that turns a firm monoidal category into a restriction category and axiomatise the monoidal restriction categories that arise this way, called tensor-restriction categories.
The skew monoidal categories of Szlachányi are a weakening of monoidal categories where the three structural laws of left and right unitality and associativity are not required to be isomorphisms but merely transformations in a particular direction. In previous work, we showed that the free skew monoidal category on a set of generating objects can be concretely presented as a sequent calculus. This calculus enjoys cut elimination and admits focusing, i.e. a subsystem of canonical derivations, which solves the coherence problem for skew monoidal categories. In this paper, we develop sequent cal…
The purpose of this short and elementary note is to identify some classes of exact categories introduced in L. Previdi's thesis. Among other things we show: (1) An exact category is partially abelian exact if and only if it is abelian. (2) An exact category satisfies the axioms AIC and AIC° if and only if it is quasi-abelian in the sense of J.-P. Schneiders. (3) An exact category satisfies AIC if and only if it is an additive category of the type considered by G. Laumon in his work on derived categories of filtered ${\cal D}$-modules. In all of the above classes all morphisms have kernels and …
The closure of chains of embedding-projection pairs (ep-pairs) under bilimits in some categories of predomains and domains is standard and well-known. For instance, Scott's $D_\infty$ construction is well-known to produce directed bilimits of ep-pairs in the category of directed-complete partial orders, and de Jong and Escardó have formalized this result in the constructive domain theory of a topos. The explicit construcition of bilimits for categories of predomains and partial maps is considerably murkier as far as constructivity is concerned; most expositions employ the constructive taboo th…
We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The category $\textbf{Set}_F$ may be embedded in the category $\mathbf{Pfn}_F$ of $F$-coalgebras and partial morphisms, which is a $P$-category that is prodominical but not dominical in general. An existence theorem of A. Heller is applied to certain subcategories of $\textbf{Pfn}_F$ to obtain examples of recursion categories of coalgebras.
Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its domain, to be thought of as the partial identity that is defined to just the same degree as the original map. In this paper, we show that restriction categories can be identified with \emph{enriched categories} in the sense of Kelly for a suitable enrichment base. By varying that base appropriately, we are also able to capture the notions of join and range rest…
This paper uncovers the fundamental relationship between total and partial computation in the form of an equivalence of certain categories. This equivalence involves on the one hand effectuses, which are categories for total computation, introduced by Jacobs for the study of quantum/effect logic. On the other hand, it involves what we call FinPACs with effects; they are finitely partially additive categories equipped with effect algebra structures, serving as categories for partial computation. It turns out that the Kleisli category of the lift monad (-)+1 on an effectus is always a FinPAC wit…
We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of string diagrams as terms. This allows for equational reasoning about the class of models defined by a partial theory. We demonstrate the expressivity of such equational theories by considering a number of examples, including partial combinatory algebras and cartesian closed categories. Moreover, despite the increase in expressivity of the syntax we retain a …
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in terms of natural transformations equipped with ``graphs'' (g-natural transformations), and corresponding morphism theorems are given as consequences. Using these results, some basic relations between the free categories of these classes are obtained.
Restriction categories were introduced as a way of generalising the notion of partial map categories. In this paper, we define cocomplete restriction category, and give the free cocompletion of a small restriction category as a suitably defined category of restriction presheaves. We also consider the case where our restriction category is locally small.
For a relational Horn theory $\mathbb{T}$, we provide useful sufficient conditions for the exponentiability of objects and morphisms in the category $\mathbb{T}\text{-}\mathsf{Mod}$ of $\mathbb{T}$-models; well-known examples of such categories, which have found recent applications in the study of programming language semantics, include the categories of preordered sets and (extended) metric spaces. As a consequence, we obtain useful sufficient conditions for $\mathbb{T}\text{-}\mathsf{Mod}$ to be cartesian closed, locally cartesian closed, and even a quasitopos; in particular, we provide two …
A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial subalgebra together with a semilattice-valued distance, that we call gamps. This part of the theory is formulated in any variety of (universal) algebras. Let V and W be varieties of algebras (on a finite similarity type). Let P be a finite lattice of order-dimension d>0. Assume that we have a diagram of semilattice with a lifting in V, but with no "partial lift…
A partial combinatory algebra (PCA) is a set equipped with a partial binary operation that models a notion of computability. This paper studies a generalization of PCAs, introduced by W. Stekelenburg, where a PCA is not a set but an object in a given regular category. The corresponding class of categories of assemblies is closed both under taking small products and under slicing, which is to be contrasted with the situation for ordinary PCAs. We describe these two constructions explicitly at the level of PCAs, allowing us to compute a number of examples of products and slices of PCAs. Moreover…
We prove that the triangle order $\leq_{\bigtriangleup}$ in the singular category $D_{sg}(A)$ defines a partial order on the set of isomorphism classes of objects in $D_{sg}(A)$ for a finite-dimensional $k$-algebra $A$.
We introduce a new method to construct a Grothendieck category from a given colored quiver. This is a variant of the construction used to prove that every partially ordered set arises as the atom spectrum of a Grothendieck category. Using the new method, we prove that for every finite partially ordered set, there exists a locally noetherian Grothendieck category such that every nonzero object contains a compressible subobject and its atom spectrum is isomorphic to the given partially ordered set.
It is well-known that small categories have equivalent descriptions as partial monoids. We provide a formulation of partial monoid and partial monoid homomorphism involving $s$ and $t$ instead of identities and then following a recent investigation into involutive double categories, we prove that a double category is equivalent to a set equipped with two partial monoid structures in which all structure maps $(s,t,\circ)$ are partial monoid homomorphisms. We discuss the light this purely algebraic perspective sheds on the symmetries of these structures and its applications. Iteration of the pro…
We prove that the category of models of any relational Horn theory satisfying a mild syntactic condition is infinitely extensive. Central examples of such categories include the categories of preordered sets and partially ordered sets, and the categories of small $\mathscr{V}$-categories, (symmetric) pseudo-$\mathscr{V}$-metric spaces, and (symmetric) $\mathscr{V}$-metric spaces for a commutative unital quantale $\mathscr{V}$. We also explicitly characterize initial sources and final sinks in such categories, and in particular embeddings and quotients.
For any small quantaloid $\Q$, there is a new quantaloid $\D(\Q)$ of diagonals in $\Q$. If $\Q$ is divisible then so is $\D(\Q)$ (and vice versa), and then it is particularly interesting to compare categories enriched in $\Q$ with categories enriched in $\D(\Q)$. Taking Lawvere's quantale of extended positive real numbers as base quantale, $\Q$-categories are generalised metric spaces, and $\D(\Q)$-categories are generalised partial metric spaces, i.e.\ metric spaces in which self-distance need not be zero and with a suitably modified triangular inequality. We show how every small quantaloid-e…
In this paper we study wall-crossing functors between categories of modules over quantizations of symplectic resolutions. We prove that wall-crossing functors through faces are perverse equivalences and use this to verify an Etingof type conjecture for quantizations of Nakajima quiver varieties associated to affine quivers. In the case when there is a Hamiltonian torus action on the resolution with finitely many fixed points so that it makes sense to speak about categories $\mathcal{O}$ over quantizations, we introduce new standardly stratified structures on these categories $\mathcal{O}$ and …
Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider constellations in full generality, giving many examples. We characterise those small constellations that are isomorphic to constellations of partial functions. We examine in detail the relationship between constellations and categories, showing the latter to be special cases of the former. In particular, we characterise those constellations that arise as (su…
We study the question when a *-autonomous (Mix-)category has a representation as a $*$-autonomous category of a compact one. We prove that necessary and sufficient condition is that weak distributivity maps are monic (or, equivalently epic). For a Mix-category, this condition is, in turn, equivalent to the requirement that Mix-maps be monic (or epic). We call categories satisfying this property torsion-free. An important side result is that torsion-free categories have canonical partial traces.
We prove that the homotopy theory of parsummable categories (as defined by Schwede) with respect to the underlying equivalences of categories is equivalent to the usual homotopy theory of symmetric monoidal categories. In particular, this yields a model of symmetric monoidal categories in terms of categories equipped with a strictly commutative, associative, and unital (but only partially defined) operation.
We consider recollements of derived categories of dg-algebras induced by self orthogonal compact objects obtaining a generalization of Rickard's Theorem. Specializing to the case of partial tilting modules over a ring, we extend the results on triangle equivalences proved in [B2] and [BMT]. In the end we focus on the connection between recollements of derived categories of rings, bireflective subcategories and generalized universal localizations".
We consider categories of relational structures that fully embed every category of universal algebras, and prove a partial characterisation of these in terms of an infinitary variant of the notion of nowhere density of Nešetřil and Ossona de Mendez. More precisely, we show that the Gaifman class of an algebraically universal category contains subdivided complete graphs of any infinite size, and establish that any monotone category satisfying this may be oriented to obtain an algebraically universal category. For the proof of the above, we also develop a categorical framework for relational gad…
Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors on them. We study the canonical total computability model over a category, and the partial one over a category with pullbacks. Our notions and results are generalised to categories with a base of computability, connecting Rosolini's theory of dominions with the theory of computability models.
A successful theme in the development of triangulated categories has been the study of compact objects. A weak dual notion called 0-cocompact objects was introduced in arXiv:1801.07995, motivated by the fact that sets of such objects cogenerate co-t-structures, dual to the t-structures generated by sets of compact objects. In the present paper, we show that the notion of 0-cocompact objects also appears naturally in the presence of certain dualities. We introduce "partial Serre duality", which is shown to link compact to 0-cocompact objects. We show that partial Serre duality gives rise to an …
We introduce a new class of categories generalizing locally presentable ones. The distinction does not manifest in the abelian case and, assuming Vopenka's principle, the same happens in the regular case. The category of complete partial orders is the natural example of a nearly locally finitely presentable category which is not locally presentable.
We construct an exact completion for regular categories enriched in the cartesian closed category $\mathsf{Pos}$ of partially ordered sets and monotone functions by employing a suitable calculus of relations. We then characterize the embedding of any regular category into its completion and use this to obtain examples of concrete categories which arise as such completions. In particular, we prove that the exact completion in this enriched sense of both the categories of Stone and Priestley spaces is the category of compact ordered spaces of L. Nachbin. Finally, we consider the relationship bet…
We study the question when a $*$-autonomous Mix-category has a representation as a $*$-autonomous Mix-subcategory of a compact one. We define certain partial trace-like operation on morphisms of a Mix-category, which we call a mixed trace, and show that any structure preserving embedding of a Mix-category into a compact one induces a mixed trace on the former. We also show that, conversely, if a Mix-category ${\bf K}$ has a mixed trace, then we can construct a compact category and structure preserving embedding of ${\bf K}$ into it, which induces the same mixed trace. Finally, we find a specif…