Related papers: A Finitary Adjoint Functor Theorem
State monads in cartesian closed categories are those defined by the familiar adjunction between product and exponential. We investigate the structure of their algebras, and show that the exponential functor is monadic provided the base…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.
Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…
From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect…
Representation theorems are established for fixed points of adjoint functors between categories enriched in a small quantaloid. In a very general setting these results set up a common framework for representation theorems of concept…
Conceiving of premises as collected into sets or multisets, instead of sequences, may lead to triviality for classical and intuitionistic logic in general proof theory, where we investigate identity of deductions. Any two deductions with…
A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…
Adjoint functors and projectivization in representation theory of partially ordered sets are used to generalize the algorithms of differentiation by a maximal and by a minimal point. Conceptual explanations are given for the combinatorial…
There is a lot of redundancy in the usual definition of adjoint functors. We define and prove the core of what is required. First we do this in the hom-enriched context. Then we do it in the cocompletion of a bicategory with respect to…
We establish a relative monadicity theorem for relative monads with dense roots in a virtual equipment, specialising to a relative monadicity theorem for enriched relative monads. In particular, for a dense $\mathbb V$-functor $j \colon A…
For each pair of lax-idempotent pseudomonads $R$ and $I$, for which $I$ is locally fully faithful and $R$ distributes over $I$, we establish an adjoint functor theorem, relating $R$-cocontinuity to adjointness relative to $I$. This provides…
Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
For any 0-cell $B$ in a 2-category $\Bc$ we introduce the notion of adjoint algebra $\adj_B$. This is an algebra in the center of $\Bc$. We prove that, if $\ca$ is a finite tensor category, this notion applied to the 2-category of…
We introduce and describe the $2$-category $\mathsf{Grt}_{\flat}$ of Grothendieck categories and flat morphisms between them. First, we show that the tensor product of locally presentable linear categories $\boxtimes$ restricts nicely to…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
We observe that an enriched right adjoint functor between model categories which preserves acyclic fibrations and fibrant objects is quite generically a right Quillen functor.