Biclosed Monoidal Category
   HOME
*





Biclosed Monoidal Category
In mathematics, especially in category theory, a closed monoidal category (or a ''monoidal closed category'') is a category that is both a monoidal category and a closed category in such a way that the structures are compatible. A classic example is the category of sets, Set, where the monoidal product of sets A and B is the usual cartesian product A \times B, and the internal Hom B^A is the set of functions from A to B. A non-cartesian example is the category of vector spaces, ''K''-Vect, over a field K. 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. The internal language of closed symmetric monoidal categories is linear logic and the type system is the linear type system. Many examples of closed monoidal categories are symmetric. However, this need not always be the case, as non-symmetric monoidal categories can be encountered in category-theoretic formulations of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Type System
In computer programming, a type system is a logical system comprising a set of rules that assigns a property called a type to every "term" (a word, phrase, or other set of symbols). Usually the terms are various constructs of a computer program, such as variables, expressions, functions, or modules. A type system dictates the operations that can be performed on a term. For variables, the type system determines the allowed values of that term. Type systems formalize and enforce the otherwise implicit categories the programmer uses for algebraic data types, data structures, or other components (e.g. "string", "array of float", "function returning boolean"). Type systems are often specified as part of programming languages and built into interpreters and compilers, although the type system of a language can be extended by optional tools that perform added checks using the language's original type syntax and grammar. The main purpose of a type system in a programming language ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Cartesian Closed Category
In category theory, a category is Cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in mathematical logic and the theory of programming, in that their internal language is the simply typed lambda calculus. They are generalized by closed monoidal categories, whose internal language, linear type systems, are suitable for both quantum and classical computation. Etymology Named after (1596–1650), French philosopher, mathematician, and scientist, whose formulation of analytic geometry gave rise to the concept of Cartesian product, which was later generalized to the notion of categorical product. Definition The category ''C'' is called Cartesian closed if and only if it satisfies the following three properties: * It has a terminal object. * Any two objects ''X'' and ''Y'' of ''C'' have a product ''X'' ×''Y'' in ''C' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Left Adjoint
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 (i.e., constructions of objects having a certain universal property), 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. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal   and   G: \mathcal \rightarrow \mathcal and, for all objects X in \mathcal and Y in \mathcal a bijection between the respective morphism s ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Braided Monoidal Category
In mathematics, a ''commutativity constraint'' \gamma on a monoidal category ''\mathcal'' is a choice of isomorphism \gamma_ : A\otimes B \rightarrow B\otimes A for each pair of objects ''A'' and ''B'' which form a "natural family." In particular, to have a commutativity constraint, one must have A \otimes B \cong B \otimes A for all pairs of objects A,B \in \mathcal. A braided monoidal category is a monoidal category \mathcal equipped with a braiding—that is, a commutativity constraint \gamma that satisfies axioms including the hexagon identities defined below. The term ''braided'' references the fact that the braid group plays an important role in the theory of braided monoidal categories. Partly for this reason, braided monoidal categories and other topics are related in the theory of knot invariants. Alternatively, a braided monoidal category can be seen as a tricategory with one 0-cell and one 1-cell. Braided monoidal categories were introduced by André Joyal an ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Symmetric Monoidal Category
In category theory, a branch of mathematics, a symmetric monoidal category is a monoidal category (i.e. a category in which a "tensor product" \otimes is defined) such that the tensor product is symmetric (i.e. A\otimes B is, in a certain strict sense, naturally isomorphic to B\otimes A for all objects A and B of the category). One of the prototypical examples of a symmetric monoidal category is the category of vector spaces over some fixed field ''k,'' using the ordinary tensor product of vector spaces. Definition A symmetric monoidal category is a monoidal category (''C'', ⊗, ''I'') such that, for every pair ''A'', ''B'' of objects in ''C'', there is an isomorphism s_: A \otimes B \to B \otimes A that is natural in both ''A'' and ''B'' and such that the following diagrams commute: *The unit coherence: *: *The associativity coherence: *: *The inverse law: *: In the diagrams above, ''a'', ''l'' , ''r'' are the associativity isomorphism, the left unit isomorphism, and the right un ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Exponential Object
In mathematics, specifically in category theory, an exponential object or map object is the categorical generalization of a function space in set theory. Categories with all finite products and exponential objects are called cartesian closed categories. Categories (such as subcategories of Top) without adjoined products may still have an exponential law. Definition Let \mathbf be a category, let Z and Y be objects of \mathbf, and let \mathbf have all binary products with Y. An object Z^Y together with a morphism \mathrm\colon (Z^Y \times Y) \to Z is an ''exponential object'' if for any object X and morphism g \colon X\times Y \to Z there is a unique morphism \lambda g\colon X\to Z^Y (called the ''transpose'' of g) such that the following diagram commutes: This assignment of a unique \lambda g to each g establishes an isomorphism (bijection In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function b ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Internal Hom Functor
In mathematics, specifically in category theory, hom-sets (i.e. sets of morphisms between objects) give rise to important functors to the category of sets. These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Formal definition Let ''C'' be a locally small category (i.e. a category for which hom-classes are actually sets and not proper classes). For all objects ''A'' and ''B'' in ''C'' we define two functors to the category of sets as follows: : The functor Hom(–, ''B'') is also called the ''functor of points'' of the object ''B''. Note that fixing the first argument of Hom naturally gives rise to a covariant functor and fixing the second argument naturally gives a contravariant functor. This is an artifact of the way in which one must compose the morphisms. The pair of functors Hom(''A'', –) and Hom(–, ''B'') are related in a natural manner. For any pair of morphisms ''f'' : ''B'' → ''B'' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Hom-set
In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphisms are functions; in linear algebra, linear transformations; in group theory, group homomorphisms; in topology, continuous functions, and so on. In category theory, ''morphism'' is a broadly similar idea: the mathematical objects involved need not be sets, and the relationships between them may be something other than maps, although the morphisms between the objects of a given category have to behave similarly to maps in that they have to admit an associative operation similar to function composition. A morphism in category theory is an abstraction of a homomorphism. The study of morphisms and of the structures (called "objects") over which they are defined is central to category theory. Much of the terminology of morphisms, as well as the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Currying
In mathematics and computer science, currying is the technique of translating the evaluation of a function that takes multiple arguments into evaluating a sequence of functions, each with a single argument. For example, currying a function f that takes three arguments creates a nested unary function g, so that the code :\textx=f(a,b,c) gives x the same value as the code : \begin \texth = g(a) \\ \texti = h(b) \\ \textx = i(c), \end or called in sequence, :\textx = g(a)(b)(c). In a more mathematical language, a function that takes two arguments, one from X and one from Y, and produces outputs in Z, by currying is translated into a function that takes a single argument from X and produces as outputs ''functions'' from Y to Z. This is a natural one-to-one correspondence between these two types of functions, so that the sets together with functions between them form a Cartesian closed category. The currying of a function with more than two arguments can then be defined by induction. Cur ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Right Adjoint
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 (i.e., constructions of objects having a certain universal property), 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. By definition, an adjunction between categories \mathcal and \mathcal is a pair of functors (assumed to be covariant) :F: \mathcal \rightarrow \mathcal   and   G: \mathcal \rightarrow \mathcal and, for all objects X in \mathcal and Y in \mathcal a bijection between the respective morphism ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Functor
In mathematics, specifically category theory, a functor is a Map (mathematics), mapping between Category (mathematics), categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous function, 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. The words ''category'' and ''functor'' were borrowed by mathematicians from the philosophers Aristotle and Rudolf Carnap, respectively. The latter used ''functor'' in a Linguistics, linguistic context; see function word. Definition Let ''C'' and ''D'' be category (mathematics), categories. A functor ''F'' from ''C'' to ''D'' is a mapping that * associates each object X in ''C'' to an object F(X) in ''D' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]