Related concepts (18)
Closed monoidal category
In mathematics, especially in , a closed monoidal category (or a monoidal closed category) is a that is both a and a in such a way that the structures are compatible. A classic example is the , Set, where the monoidal product of sets and is the usual cartesian product , and the internal Hom is the set of functions from to . A non- example is the , K-Vect, over a field . Here the monoidal product is the usual tensor product of vector spaces, and the internal Hom is the vector space of linear maps from one vector space to another.
Presheaf (category theory)
In , a branch of mathematics, a presheaf on a is a functor . If is the poset of open sets in a topological space, interpreted as a category, then one recovers the usual notion of presheaf on a topological space. A morphism of presheaves is defined to be a natural transformation of functors. This makes the collection of all presheaves on into a category, and is an example of a . It is often written as . A functor into is sometimes called a profunctor.
Representable functor
In mathematics, particularly , a representable functor is a certain functor from an arbitrary into the . Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory.
Monoidal category
In mathematics, a monoidal category (or tensor category) is a equipped with a bifunctor that is associative up to a natural isomorphism, and an I that is both a left and right identity for ⊗, again up to a natural isomorphism. The associated natural isomorphisms are subject to certain coherence conditions, which ensure that all the relevant s commute. The ordinary tensor product makes vector spaces, abelian groups, R-modules, or R-algebras into monoidal categories. Monoidal categories can be seen as a generalization of these and other examples.
Exponential object
In mathematics, specifically in , an exponential object or map object is the generalization of a function space in set theory. with all and exponential objects are called . Categories (such as of ) without adjoined products may still have an exponential law. Let be a category, let and be of , and let have all with .
Tensor-hom adjunction
In mathematics, the tensor-hom adjunction is that the tensor product and hom-functor form an adjoint pair: This is made more precise below. The order of terms in the phrase "tensor-hom adjunction" reflects their relationship: tensor is the left adjoint, while hom is the right adjoint. Say R and S are (possibly noncommutative) rings, and consider the right module categories (an analogous statement holds for left modules): Fix an -bimodule and define functors and as follows: Then is left adjoint to .
Tensor product of modules
In mathematics, the tensor product of modules is a construction that allows arguments about bilinear maps (e.g. multiplication) to be carried out in terms of linear maps. The module construction is analogous to the construction of the tensor product of vector spaces, but can be carried out for a pair of modules over a commutative ring resulting in a third module, and also for a pair of a right-module and a left-module over any ring, with result an abelian group.
Simply typed lambda calculus
The simply typed lambda calculus (), a form of type theory, is a typed interpretation of the lambda calculus with only one type constructor () that builds function types. It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus was originally introduced by Alonzo Church in 1940 as an attempt to avoid paradoxical use of the untyped lambda calculus. The term simple type is also used to refer extensions of the simply typed lambda calculus such as products, coproducts or natural numbers (System T) or even full recursion (like PCF).
Exact functor
In mathematics, particularly homological algebra, an exact functor is a functor that preserves short exact sequences. Exact functors are convenient for algebraic calculations because they can be directly applied to presentations of objects. Much of the work in homological algebra is designed to cope with functors that fail to be exact, but in ways that can still be controlled. Let P and Q be abelian categories, and let F: P→Q be a covariant additive functor (so that, in particular, F(0) = 0).
Duality (mathematics)
In mathematics, a duality translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one-to-one fashion, often (but not always) 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 mathematical contexts, duality has numerous meanings.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.