Monoidal Coherence Map From Applicative Formulation
Monoidal may refer to: * Monoidal category, concept in category theory ** Monoidal functor, between monoidal categories ** Monoidal natural transformation, between monoidal functors * Monoidal transformation, in algebraic geometry See also *Monoid, an algebraic structure *Monoid (category theory) In category theory, a branch of mathematics, a monoid (or monoid object, or internal monoid, or algebra) in a monoidal category is an object ''M'' together with two morphisms * ''μ'': ''M'' ⊗ ''M'' → ''M'' called ''multiplication'', * ''η ...

Monoidal Category
In mathematics, a monoidal category (or tensor category) is a category (mathematics), category \mathbf C equipped with a bifunctor :\otimes : \mathbf \times \mathbf \to \mathbf that is associative up to a natural isomorphism, and an Object (category theory), object ''I'' that is both a left identity, 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 diagram (category theory), diagrams commutative diagram, commute. The ordinary tensor product makes vector spaces, abelian groups, module (mathematics), ''R''-modules, or algebra (ring theory), ''R''-algebras into monoidal categories. Monoidal categories can be seen as a generalization of these and other examples. Every (small category, small) monoidal category may also be viewed as a "categorification" of an underlying monoid, namely the monoid whose elements are the isomorphism classes of the category ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Monoidal Functor
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 * The coherence maps of lax monoidal functors satisfy no additional properties; they are not necessarily invertible. * The coherence maps of strong monoidal functors are invertible. * The coherence maps of strict monoidal functors are identity maps. Although we distinguish between these different definitions here, authors may call any one of these simply monoidal functors. Defi ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Monoidal Natural Transformation
Suppose that (\mathcal C,\otimes,I) and (\mathcal D,\bullet, J) are two monoidal categories and :(F,m):(\mathcal C,\otimes,I)\to(\mathcal D,\bullet, J) and (G,n):(\mathcal C,\otimes,I)\to(\mathcal D,\bullet, J) are two lax monoidal functors between those categories. A monoidal natural transformation :\theta:(F,m) \to (G,n) between those functors is a natural transformation In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a natur ... \theta:F \to G between the underlying functors such that the diagrams : and commute for every objects A and B of \mathcal C. A symmetric monoidal natural transformation is a monoidal natural transformation between symmetric monoidal functors. Inline citations References * {{DEFAULTSORT:Monoidal Natural Transformation Monoidal categories ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Monoidal Transformation
In mathematics, blowing up or blowup is a type of geometric transformation which replaces a subspace of a given space with the space of all directions pointing out of that subspace. For example, the blowup of a point in a plane replaces the point with the projectivized tangent space at that point. The metaphor is that of zooming in on a photograph to enlarge part of the picture, rather than referring to an explosion. The inverse operation is called blowing down. Blowups are the most fundamental transformation in birational geometry, because every birational morphism between projective varieties is a blowup. The weak factorization theorem says that every birational map can be factored as a composition of particularly simple blowups. The Cremona group, the group of birational automorphisms of the plane, is generated by blowups. Besides their importance in describing birational transformations, blowups are also an important way of constructing new spaces. For instance, most proc ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  

Monoid
In abstract algebra, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being . Monoids are semigroups with identity. Such algebraic structures occur in several branches of mathematics. The functions from a set into itself form a monoid with respect to function composition. More generally, in category theory, the morphisms of an object to itself form a monoid, and, conversely, a monoid may be viewed as a category with a single object. In computer science and computer programming, the set of strings built from a given set of characters is a free monoid. Transition monoids and syntactic monoids are used in describing finite-state machines. Trace monoids and history monoids provide a foundation for process calculi and concurrent computing. In theoretical computer science, the study of monoids is fundamental for automata theory (Krohn–Rhodes ...
[...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]