Monoidal Monad¶
A monad on a monoidal category equipped with coherent lax-monoidal comparison maps compatible with the monad unit and multiplication.
Core Idea¶
A monoidal monad on a monoidal category is a monad whose endofunctor is lax monoidal and whose unit and multiplication are monoidal natural transformations, so monadic effects combine coherently with tensor products and the tensor unit.
A monad T carries coherent maps TA⊗TB→T(A⊗B) and I→TI, while η and μ commute with those maps. A monad has no tensor comparison maps, so its Kleisli category has no canonical monoidal structure supplied by this definition.
Structural Signature¶
Sig role-phrases:
- Monoidal category — Supplies tensor product, tensor unit, associators, and unitors. It is base. Counterfactual: Without a tensor structure there is no monoidal compatibility to assert.
- Monad endofunctor T — Carries the effectful or algebraic construction on the category. It is carrier. Counterfactual: A lax monoidal functor without monad structure is not a monoidal monad.
- Tensor comparison — Maps TA⊗TB into T(A⊗B). It is lax structure. Counterfactual: Reversing this arrow gives opmonoidal rather than monoidal structure.
- Unit comparison — Maps the tensor unit I into TI. It is lax structure. Counterfactual: Omitting it leaves the unit coherence incomplete.
- Monad unit η — Introduces pure values and must respect the tensor structure. It is monoidal cell. Counterfactual: A nonmonoidal η breaks compatibility between purity and combination.
- Monad multiplication μ — Flattens nested effects and must also be monoidal. It is monoidal cell. Counterfactual: Coherence of T alone does not control nested effects.
What It Is Not¶
- It is not every monad on a category that happens to have products.
- It is not a lax monoidal functor without η and μ.
- It is not an opmonoidal monad with arrows reversed.
- It is not established by a single tensor comparison lacking coherence.
- Closest near-miss. An opmonoidal monad is the closest directional neighbor: its comparison maps go from T(A⊗B) to TA⊗TB and its algebraic consequences differ.
Scope of Application¶
- Category theory. Studies monads internal to the 2-category of monoidal categories.
- Programming semantics. Models compatible combination of computational effects.
- Kleisli construction. Induces monoidal structure under the stated compatibility.
- Algebraic structures. Relates monads, tensors, and monoidal natural transformations.
Clarity¶
Include monads whose endofunctor has specified lax-monoidal maps and whose η and μ satisfy the corresponding monoidal naturality and coherence laws. Exclude plain monads, lax monoidal functors lacking monad operations, opmonoidal monads with reversed maps, and informal claims that effects merely coexist with products.
Manages Complexity¶
Tensoring effectful objects is useful only when comparison maps agree with associativity, units, η, and μ. Changing arrow direction changes whether T combines separate effects or decomposes a combined object.
Abstract Reasoning¶
- Specify the ambient tensor product, tensor unit, and coherence isomorphisms.
- Verify that T, η, and μ first form a monad.
- Exhibit TA⊗TB→T(A⊗B) and I→TI with their lax-monoidal coherence.
- Check that η respects both tensor and unit comparisons.
- Check that μ respects the comparisons through T².
- Distinguish every use from the arrow-reversed opmonoidal construction.
Knowledge Transfer¶
Monad-plus-tensor compatibility transfers to effects, algebraic semantics, and enriched constructions only after the tensor, coherence maps, and monoidality of unit and multiplication are re-established; oplax structure reverses the comparison arrows and is not interchangeable.
Examples¶
Canonical¶
A monad T carries coherent maps TA⊗TB→T(A⊗B) and I→TI, while η and μ commute with those maps.
Mapped back: base → monoidal category; functor → lax monoidal T; cells → monoidal η and μ.
Applied / In Practice¶
A monad has no tensor comparison maps, so its Kleisli category has no canonical monoidal structure supplied by this definition.
Mapped back: monad → present; monoidal structure → absent.
Structural Tensions¶
T1 — Effect Combination versus Coherence Burden. Tensoring effectful objects is useful only when comparison maps agree with associativity, units, η, and μ.
Diagnostic: Which coherence diagram licenses the combination?
T2 — Monoidal versus Opmonoidal. Changing arrow direction changes whether T combines separate effects or decomposes a combined object.
Diagnostic: Which comparison orientation is actually given?
Structural–Framed Character¶
The portable structure is a monad internal to monoidal categories: tensor comparisons coexist with η and μ under common coherence laws. The choice of tensor, effect interpretation, and categorical application supplies the frame.
Structural Core vs. Domain Accent¶
The core combines two algebraic organizations—monad composition and monoidal combination—without letting either ignore the other. Category theory contributes the coherence diagrams, natural transformations, Kleisli consequence, and directional distinction from opmonoidal monads.
Instantiates / Related Primes¶
This entry presupposes Monoid.
-
Approved root. The frozen graph retains monoidal monad without a parent edge.
-
Related — Plain monad and Opmonoidal monad. Has η and μ but no required tensor compatibility. Uses comparison maps in the opposite direction.
Relationships to Other Abstractions¶
Current abstraction Monoidal Monad Domain-specific
Parents (1) — more general patterns this builds on
-
Monoidal Monad presupposes Monoid Prime
Monoidal Monad presupposes Monoid because its unit and multiplication form a monoid object in endofunctors compatible with monoidal comparison maps.Every reviewed Monoidal Monad instance depends on the parent role: its unit and multiplication form a monoid object in endofunctors compatible with monoidal comparison maps. Removing that role makes the frozen child identity undefined or changes it into a different abstraction. Monoid can occur without Monoidal Monad, so the relation is dependency rather than subsumption.
Hierarchy paths (5) — routes to 5 parentless roots
- Monoidal Monad → Monoid → Semigroup → Set and Membership
- Monoidal Monad → Monoid → Identity Element
- Monoidal Monad → Monoid → Semigroup → Closure
- Monoidal Monad → Monoid → Semigroup → Associativity → Invariance
- Monoidal Monad → Monoid → Semigroup → Associativity → Symmetry
Neighborhood in Abstraction Space¶
Monoidal Monad sits in a moderately populated region (45th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Category Theory & Higher Structures (18 abstractions)
Nearest neighbors
- Monoidal Natural Transformation — 0.91
- Simplicial Localization — 0.87
- Mac Lane's coherence theorem — 0.87
- K-theory — 0.87
- Day Convolution — 0.85
Computed from structural-signature embeddings · 2026-10-08
Not to Be Confused With¶
- Plain monad. Tell: Has η and μ but no required tensor compatibility.
- Opmonoidal monad. Tell: Uses comparison maps in the opposite direction.
- Monoidal functor. Tell: Need not carry monad operations.
- Commutative monad. Tell: Adds another compatibility condition and should not be assumed synonymous.
References¶
- Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Monoidal_monad (revision 1349513639).
- Preserved source candidate: http://www.tac.mta.ca/tac/volumes/10/19/10-19abs.html
The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.