Codensity monad

Last updated

In mathematics, especially in category theory, the codensity monad is a fundamental construction associating a monad to a wide class of functors.

Contents

Definition

The codensity monad of a functor is defined to be the right Kan extension of along itself, provided that this Kan extension exists. Thus, by definition it is in particular a functor

The monad structure on stems from the universal property of the right Kan extension.

The codensity monad exists whenever is a small category (has only a set, as opposed to a proper class, of morphisms) and possesses all (small, i.e., set-indexed) limits. It also exists whenever has a left adjoint.

By the general formula computing right Kan extensions in terms of ends, the codensity monad is given by the following formula:

where denotes the set of morphisms in between the indicated objects and the integral denotes the end. The codensity monad therefore amounts to considering maps from to an object in the image of and maps from the set of such morphisms to compatible for all the possible Thus, as is noted by Avery, [1] codensity monads share some kinship with the concept of integration and double dualization.

Examples

Codensity monads of right adjoints

If the functor admits a left adjoint the codensity monad is given by the composite together with the standard unit and multiplication maps.

Concrete examples for functors not admitting a left adjoint

In several interesting cases, the functor is an inclusion of a full subcategory not admitting a left adjoint. For example, the codensity monad of the inclusion of FinSet into Set is the ultrafilter monad associating to any set the set of ultrafilters on This was proven by Kennison and Gildenhuys, [2] though without using the term "codensity". In this formulation, the statement is reviewed by Leinster. [3]

A related example is discussed by Leinster: [4] the codensity monad of the inclusion of finite-dimensional vector spaces (over a fixed field ) into all vector spaces is the double dualization monad given by sending a vector space to its double dual

Thus, in this example, the end formula mentioned above simplifies to considering (in the notation above) only one object namely a one-dimensional vector space, as opposed to considering all objects in Adámek and Sousa [5] show that, in a number of situations, the codensity monad of the inclusion

of finitely presented objects (also known as compact objects) is a double dualization monad with respect to a sufficiently nice cogenerating object. This recovers both the inclusion of finite sets in sets (where a cogenerator is the set of two elements), and also the inclusion of finite-dimensional vector spaces in vector spaces (where the cogenerator is the ground field).

Sipoş showed that the algebras over the codensity monad of the inclusion of finite sets (regarded as discrete topological spaces) into topological spaces are equivalent to Stone spaces. [6] Avery shows that the Giry monad arises as the codensity monad of natural forgetful functors between certain categories of convex vector spaces to measurable spaces. [1]

Relation to Isbell duality

Di Liberti [7] shows that the codensity monad is closely related to Isbell duality: for a given small category Isbell duality refers to the adjunction

between the category of presheaves on (that is, functors from the opposite category of to sets) and the opposite category of copresheaves on The monad

induced by this adjunction is shown to be the codensity monad of the Yoneda embedding

Conversely, the codensity monad of a full small dense subcategory in a cocomplete category is shown to be induced by Isbell duality. [8]

See also

Related Research Articles

In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied.

In category theory, a branch of mathematics, a Grothendieck topology is a structure on a category C that makes the objects of C act like the open sets of a topological space. A category together with a choice of Grothendieck topology is called a site.

<span class="mw-page-title-main">Universal property</span> Characterizing property of mathematical constructions

In mathematics, more specifically in category theory, a universal property is a property that characterizes up to an isomorphism the result of some constructions. Thus, universal properties can be used for defining some objects independently from the method chosen for constructing them. For example, the definitions of the integers from the natural numbers, of the rational numbers from the integers, of the real numbers from the rational numbers, and of polynomial rings from the field of their coefficients can all be done in terms of universal properties. In particular, the concept of universal property allows a simple proof that all constructions of real numbers are equivalent: it suffices to prove that they satisfy the same universal property.

In commutative algebra, the prime spectrum of a commutative ring R is the set of all prime ideals of R, and is usually denoted by ; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings .

In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Informally, the notion of a natural transformation states that a particular map between functors can be done consistently over an entire category.

In mathematics, an abelian category is a category in which morphisms and objects can be added and in which kernels and cokernels exist and have desirable properties.

In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems, such as the construction of a free group on a set in algebra, or the construction of the Stone–Čech compactification of a topological space in topology.

In mathematics, a monoidal category is a category equipped with a bifunctor

In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. Informally, a free object over a set A can be thought of as being a "generic" algebraic structure over A: the only equations that hold between elements of the free object are those that follow from the defining axioms of the algebraic structure. Examples include free groups, tensor algebras, or free lattices.

The following outline is provided as an overview of and guide to category theory, the area of study in mathematics that examines in an abstract way the properties of particular mathematical concepts, by formalising them as collections of objects and arrows, where these collections satisfy certain basic conditions. Many significant areas of mathematics can be formalised as categories, and the use of category theory allows many intricate and subtle mathematical results in these fields to be stated, and proved, in a much simpler way than without the use of categories.

In category theory, a branch of mathematics, a monad is a monoid in the category of endofunctors of some fixed category. An endofunctor is a functor mapping a category to itself, and a monad is an endofunctor together with two natural transformations required to fulfill certain coherence conditions. Monads are used in the theory of pairs of adjoint functors, and they generalize closure operators on partially ordered sets to arbitrary categories. Monads are also useful in the theory of datatypes, the denotational semantics of imperative programming languages, and in functional programming languages, allowing languages without mutable state to do things such as simulate for-loops; see Monad.

In category theory, a branch of abstract mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned. In some cases, these structures may appear to be unrelated at a superficial or intuitive level, making the notion fairly powerful: it creates the opportunity to "translate" theorems between different kinds of mathematical structures, knowing that the essential meaning of those theorems is preserved under the translation.

In mathematics, a duality translates concepts, theorems or mathematical structures into other concepts, theorems or structures in a one-to-one fashion, often by means of an involution operation: if the dual of A is B, then the dual of B is A. Such involutions sometimes have fixed points, so that the dual of A is A itself. For example, Desargues' theorem is self-dual in this sense under the standard duality in projective geometry.

In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.

In mathematics, especially in category theory, a closed monoidal category is a category that is both a monoidal category and a closed category in such a way that the structures are compatible.

In category theory, a branch of mathematics, Beck's monadicity theorem gives a criterion that characterises monadic functors, introduced by Jonathan Mock Beck in about 1964. It is often stated in dual form for comonads. It is sometimes called the Beck tripleability theorem because of the older term triple for a monad.

This is a glossary of properties and concepts in category theory in mathematics.

In category theory, a branch of mathematics, a dual object is an analogue of a dual vector space from linear algebra for objects in arbitrary monoidal categories. It is only a partial generalization, based upon the categorical properties of duality for finite-dimensional vector spaces. An object admitting a dual is called a dualizable object. In this formalism, infinite-dimensional vector spaces are not dualizable, since the dual vector space V doesn't satisfy the axioms. Often, an object is dualizable only when it satisfies some finiteness or compactness property.

Isbell conjugacy or Isbell duality is a fundamental construction of enriched category theory formally introduced by William Lawvere in 1986. That is a duality between covariant and contravariant representable presheaves associated with an objects of categories under the Yoneda embedding.

In representation theory, the category of representations of some algebraic structure A has the representations of A as objects and equivariant maps as morphisms between them. One of the basic thrusts of representation theory is to understand the conditions under which this category is semisimple; i.e., whether an object decomposes into simple objects.

References

Footnotes

  1. 1 2 Avery, Tom (2016). "Codensity and the Giry monad". Journal of Pure and Applied Algebra. 220 (3): 1229–1251. arXiv: 1410.4432 . doi:10.1016/j.jpaa.2015.08.017.
  2. Kennison, J.F.; Gildenhuys, Dion (1971). "Equational completion, model induced triples and pro-objects". Journal of Pure and Applied Algebra. 1 (4): 317–346. doi: 10.1016/0022-4049(71)90001-6 .
  3. Leinster 2013, §3.
  4. Leinster 2013, §7.
  5. Adámek, Jirí; Sousa, Lurdes (2019). D-Ultrafilters and their Monads. arXiv: 1909.04950 .
  6. Sipoş, Andrei (2018). "Codensity and stone spaces". Mathematica Slovaca. 68: 57–70. arXiv: 1409.1370 . doi:10.1515/ms-2017-0080.
  7. Di Liberti 2019.
  8. Di Liberti 2019, §2.