Related papers: The core of adjoint functors
Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract…
Let A be an algebra with a countable basis and let B be, say, a Frechet algebra that contains A as a dense subalgebra. This embedding induces a functor from the derived category of B-modules to the derived category of A-modules. In many…
A new construction to associate an internal category to an enriched one is presented. The key concept is that of extensive ambient category, and the construction follows the one that associates a category whose idempotents split to a given…
In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in…
Rough sets are approximations of concrete sets. The theory of rough sets has been used widely for data-mining. While it is well-known that adjunctions are underlying in rough approximations, such adjunctions are not enough for…
A criterion for comonadicity of the extension-of- scalars functor associated to an extension of (not necessarily commutative) rings is given. As an application of this criterion, some known results on the comonadicity of such functors are…
In this paper, we first construct some complete cotorson pairs on the category $\mathbb{C}_N(\mathcal{G})$ of unbounded $N$-complexes of Grothendieck category $\mathcal{G}$, from two given cotorsion pairs in $\mathcal{G}$. Next as an…
We can define a module to be an exact functor on a small abelian category. This is explained and shown to be equivalent to the usual definition but it does offer a different perspective, inspired by the notions from model theory of…
We thoroughly treat several familiar and less familiar definitions and results concerning categories, functors and distributors enriched in a base quantaloid Q. In analogy with V-category theory we discuss such things as adjoint functors,…
A row and a column of two linear relations in Hilbert spaces are presented respectively as a sum and an intersection of two linear relations. As an application, necessary and sufficient conditions for the adjoint of a column to be a row are…
Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…
We show that contrary to appearances, Multimodal Type Theory (MTT) over a 2-category M can be interpreted in any M-shaped diagram of categories having, and functors preserving, M-sized limits, without the need for extra left adjoints. This…
Given an adjoint pair of functors $F,G$, the composite $GF$ naturally gets the structure of a monad. The same monad may arise from many such adjoint pairs of functors, however. Can one describe all of the adjunctions giving rise to a given…
In this paper we present background results in enriched category theory and enriched model category theory necessary for developing model categories of enriched functors suitable for doing functor calculus.
We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…
This paper aims to answer the following question: Given an adjunction between two categories, how is Quillen (co)homology in one category related to that in the other? We identify the induced comparison diagram, giving necessary and…
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…
The semantics of assignment and mutual exclusion in concurrent and multi-core/multi-processor systems is presented with attention to low level architectural features in an attempt to make the presentation realistic. Recursive functions on…
We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…
We determine a family of functors from a poset to abelian groups such that the higher direct limits vanish on them. This is done by first characterizing the projective functors. Then a spectral sequence arising from the grading of the poset…