Premonoidal category

Last updated

In category theory, a premonoidal category [1] is a generalisation of a monoidal category where the monoidal product need not be a bifunctor, but only to be functorial in its two arguments separately. This is in analogy with the concept of separate continuity in topology.

Contents

Premonoidal categories naturally arise in theoretical computer science as the Kleisli categories of strong monads. [2] They also have a graphical language given by string diagrams with an extra wire going through each box so that they cannot be reordered. [3] [4] [5]

Funny tensor product

The category of small categories is a closed monoidal category in exactly two ways: with the usual categorical product and with the funny tensor product. [6] Given two categories and , let be the category with functors as objects and unnatural transformations as arrows, i.e. families of morphisms which do not necessarily satisfy the condition for a natural transformation.

The funny tensor product is the left adjoint of unnatural transformations, i.e. there is a natural isomorphism for currying. It can be defined explicitly as the pushout of the span where are the discrete categories of objects of and the two functors are inclusions. In the case of groups seen as one-object categories, this is called the free product.

Sesquicategories

The same way we can define a monoidal category as a one-object 2-category, i.e. an enriched category over with the Cartesian product as monoidal structure, we can define a premonoidal category as a one-object sesquicategory, [7] i.e. a category enriched over with the funny tensor product as monoidal structure. This is called a sesquicategory (literally, "one-and-a-half category") because it is like a 2-category without the interchange law .

Related Research Articles

In mathematics, a product is the result of multiplication, or an expression that identifies objects to be multiplied, called factors. For example, 21 is the product of 3 and 7, and is the product of and . When one factor is an integer, the product is called a multiple.

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 category theory, a branch of mathematics, an enriched category generalizes the idea of a category by replacing hom-sets with objects from a general monoidal category. It is motivated by the observation that, in many practical applications, the hom-set often has additional structure that should be respected, e.g., that of being a vector space of morphisms, or a topological space of morphisms. In an enriched category, the set of morphisms associated with every pair of objects is replaced by an object in some fixed monoidal category of "hom-objects". In order to emulate the (associative) composition of morphisms in an ordinary category, the hom-category must have a means of composing hom-objects in an associative manner: that is, there must be a binary operation on objects giving us at least the structure of a monoidal category, though in some contexts the operation may also need to be commutative and perhaps also to have a right adjoint.

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

In category theory, a branch of mathematics, a monad is a triple consisting of a functor T from a category to itself and two natural transformations that satisfy the conditions like associativity. For example, if are functors adjoint to each other, then together with determined by the adjoint relation is a monad.

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 mathematics, a commutativity constraint on a monoidal category is a choice of isomorphism for each pair of objects A and B which form a "natural family." In particular, to have a commutativity constraint, one must have for all pairs of objects .

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

In category theory, a strict 2-category is a category with "morphisms between morphisms", that is, where each hom-set itself carries the structure of a category. It can be formally defined as a category enriched over Cat.

<span class="mw-page-title-main">Cartesian product of graphs</span> Operation in graph theory

In graph theory, the Cartesian productGH of graphs G and H is a graph such that:

In mathematics, a *-autonomous category C is a symmetric monoidal closed category equipped with a dualizing object . The concept is also referred to as Grothendieck—Verdier category in view of its relation to the notion of Verdier duality.

String diagrams are a formal graphical language for representing morphisms in monoidal categories, or more generally 2-cells in 2-categories. They are a prominent tool in applied category theory. When interpreted in the monoidal category of vector spaces and linear maps with the tensor product, string diagrams are called tensor networks or Penrose graphical notation. This has led to the development of categorical quantum mechanics where the axioms of quantum theory are expressed in the language of monoidal categories.

In category theory, monoidal functors are functors between monoidal categories which preserve the monoidal structure. More specifically, a monoidal functor between two monoidal categories consists of a functor between the categories, along with two coherence maps—a natural transformation and a morphism that preserve monoidal multiplication and unit, respectively. Mathematicians require these coherence maps to satisfy additional properties depending on how strictly they want to preserve the monoidal structure; each of these properties gives rise to a slightly different definition of monoidal functors

In category theory, a branch of mathematics, compact closed categories are a general context for treating dual objects. The idea of a dual object generalizes the more familiar concept of the dual of a finite-dimensional vector space. So, the motivating example of a compact closed category is FdVect, the category having finite-dimensional vector spaces as objects and linear maps as morphisms, with tensor product as the monoidal structure. Another example is Rel, the category having sets as objects and relations as morphisms, with Cartesian monoidal structure.

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.

In category theory, a branch of mathematics, dagger compact categories first appeared in 1989 in the work of Sergio Doplicher and John E. Roberts on the reconstruction of compact topological groups from their category of finite-dimensional continuous unitary representations. They also appeared in the work of John Baez and James Dolan as an instance of semistrict k-tuply monoidal n-categories, which describe general topological quantum field theories, for n = 1 and k = 3. They are a fundamental structure in Samson Abramsky and Bob Coecke's categorical quantum mechanics.

In the mathematical field of category theory, a dagger symmetric monoidal category is a monoidal category that also possesses a dagger structure. That is, this category comes equipped not only with a tensor product in the category theoretic sense but also with a dagger structure, which is used to describe unitary morphisms and self-adjoint morphisms in : abstract analogues of those found in FdHilb, the category of finite-dimensional Hilbert spaces. This type of category was introduced by Peter Selinger as an intermediate structure between dagger categories and the dagger compact categories that are used in categorical quantum mechanics, an area that now also considers dagger symmetric monoidal categories when dealing with infinite-dimensional quantum mechanical concepts.

In category theory, a branch of mathematics, a rigid category is a monoidal category where every object is rigid, that is, has a dual X* and a morphism 1XX* satisfying natural conditions. The category is called right rigid or left rigid according to whether it has right duals or left duals. They were first defined by Neantro Saavedra Rivano in his thesis on Tannakian categories.

In the fields of computer vision and image analysis, the scale-invariant feature operator is an algorithm to detect local features in images. The algorithm was published by Förstner et al. in 2009.

In category theory, a branch of mathematics, Mac Lane's coherence theorem states, in the words of Saunders Mac Lane, “every diagram commutes”. But regarding a result about certain commutative diagrams, Kelly is states as follows: "no longer be seen as constituting the essence of a coherence theorem". More precisely, it states every formal diagram commutes, where "formal diagram" is an analog of well-formed formulae and terms in proof theory.

References

  1. Anderson, S.O.; Power, A.J. (April 1997). "A representable approach to finite nondeterminism". Theoretical Computer Science. 177 (1): 3–25. doi:10.1016/s0304-3975(96)00232-0. ISSN   0304-3975.
  2. Power, John; Robinson, Edmund (October 1997). "Premonoidal categories and notions of computation". Mathematical Structures in Computer Science. 7 (5): 453–468. doi:10.1017/S0960129597002375. ISSN   0960-1295.
  3. Jeffrey, Alan (1998). "Premonoidal categories and flow graphs". Electronic Notes in Theoretical Computer Science. 10: 51. doi: 10.1016/s1571-0661(05)80688-7 . ISSN   1571-0661.
  4. Jeffrey, Alan (1997). "Premonoidal categories and a graphical view of programs".
  5. Román, Mario (2023-08-07). "Promonads and String Diagrams for Effectful Categories". Electronic Proceedings in Theoretical Computer Science. 380: 344–361. arXiv: 2205.07664 . doi:10.4204/EPTCS.380.20. ISSN   2075-2180.
  6. Foltz, F.; Lair, C.; Kelly, G. M. (1980-05-01). "Algebraic categories with few monoidal biclosed structures or none". Journal of Pure and Applied Algebra. 17 (2): 171–177. doi:10.1016/0022-4049(80)90082-1. ISSN   0022-4049.
  7. Stell, John (1994). "Modelling Term Rewriting Systems by Sesqui-Categories" (PDF). Proc. Categories, Algebres, Esquisses et Neo-Esquisses.