##  [Monoidal Functor](/monoidal-functor-0) 

 Definition

A functor F between two monoidal categories (C, ⊗, I) and (D, ⊗', I') equipped with a specified collection of structure maps: a natural transformation φ_{A,B}: F(A) ⊗' F(B) → F(A ⊗ B) and a unit map φ_0: I' → F(I), subject to coherence diagrams (associativity and unit constraints). Variants include strict, strong (invertible φ), lax, and oplax monoidal functors.

 

 

 

 

 

 





## Principle

Principle

A monoidal functor organizes the transfer of tensorial (multiplicative) structure between categories by providing coherent comparison maps rather than demanding strict equality; it preserves the monoidal product and unit up to specified, compatible morphisms.

 

 

 

 

 





## Demonstration

Demonstration

The forgetful functor U: (Mon, ×, 1) → (Set, ×, *) is strict monoidal because the underlying set of a product of monoids equals the product of underlying sets and the unit maps agree strictly. Another example is a strong monoidal functor between categories of modules induced by scalar extension R→S, with canonical isomorphisms S⊗_R(M) ⊗_S S⊗_R(N) ≅ S⊗_R(M⊗_R N) furnishing φ.

 

 

 

 

## Misapplication

Misapplication

Treating any functor between tensor-equipped categories as monoidal without specifying structure maps or conflating lax and strong notions; or assuming a monoidal functor automatically preserves braiding or symmetry when no compatible structure is provided.

 

 

 

 

 





## Consequence

Consequence

A genuine monoidal functor transports algebraic structures internal to the source (monoids, comonoids, modules, enriched objects) to algebraic structures in the target, induces maps on categories of modules or algebras, and yields compatibility in constructions that use tensor products (e.g., monoidal equivalences preserve monoidal invariants).

 

 

 

 

## Reversal

Reversal

The formal inversion is a comonoidal functor (or an oplax monoidal functor seen dually), which provides maps F(A⊗B) → F(A)⊗'F(B); alternatively, a monoidal equivalence reverses the direction by an inverse functor carrying coherent inverse structure maps.

 

 

 

 

 





## Boundary

Boundary

Applies only between categories endowed with monoidal structures and requires explicit coherence data; it excludes plain functors without tensor comparison maps and must distinguish strict, strong, lax, and oplax cases. Homotopical or higher-categorical variants require higher coherent homotopies and different formulations.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Tension occurs between ‘‘strong/strict’’ monoidal (where comparison maps are isomorphisms or identities) and ‘‘lax/oplax’’ monoidal notions, and between preserving monoidal structure versus preserving symmetric/braided enhancements; the same phrase ‘‘monoidal functor’’ can hide these distinctions.

 

 

 

 

 





## Synthesis

Synthesis

A monoidal functor is a functor equipped with coherent comparison maps that, up to specified isomorphisms or morphisms, transfers the tensor product and unit from one monoidal category to another, thereby enabling transport of multiplicative structures while respecting necessary coherence conditions.