Strong monad¶

In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product.

Version: v1 · 2026-09-28 · History
Domain-specific #: 12322
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

Strong monad is treated here as the recurring mathematics_logic_statistics identity summarized by this source-grounded definition: In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product.

In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. Strong monads play an important role in theoretical computer science where they are used to model computation with side effects. One interesting fact about commutative strong monads is that they are "the same as" symmetric monoidal monads.

A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. A strong monad T is said to be commutative when the diagram. The Kleisli category of a commutative monad is symmetric monoidal in a canonical way, see corollary 7 in Guitart and corollary 4.3 in Power & Robison.

For Strong monad, the abstraction is narrower than the article's general subject matter: a positive case must preserve In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics_logic_statistics, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — a commutative strong monad (T,\eta,\mu,t) defines a symmetric monoidal monad (T,\eta,\mu,m) by m_{A,B}=\mu_{A\otimes B}\circ Tt'{A,B}\circ t:TA\otimes TB\to T(A\otimes B).
Constitutive relation — and conversely a symmetric monoidal monad (T,\eta,\mu,m) defines a commutative strong monad (T,\eta,\mu,t) by t_{A,B}=m_{A,B}\circ(\eta_A\otimes 1_{TB}):A\otimes TB\to T(A\otimes B).
Operating condition — A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams.
Recognition evidence — For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by.
Admissible variation — t'{A,B}=T(\gamma : TA\otimes B\to T(A\otimes B).})\circ t_{B,A}\circ\gamma_{TA,B
Characteristic consequence — A strong monad T is said to be commutative when the diagram.
Failure boundary — The Kleisli category of a commutative monad is symmetric monoidal in a canonical way, see corollary 7 in Guitart and corollary 4.3 in Power & Robison.

What It Is Not¶

Not the whole field of mathematics_logic_statistics. The node requires the specific identity stated by In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product.
Not an over-broad reading. When a monad is strong but not necessarily commutative, its Kleisli category is a premonoidal category.
Not an over-broad reading. A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams.
Not an over-broad reading. For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by.
Not automatically Monad (nonstandard analysis). Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Strong monad applies literally inside mathematics_logic_statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:

Documented setting. Strong monads play an important role in theoretical computer science where they are used to model computation with side effects.
Definition. A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams.
Commutative strong monads. For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by.
Commutative strong monads. t'{A,B}=T(\gamma : TA\otimes B\to T(A\otimes B).})\circ t_{B,A}\circ\gamma_{TA,B
Commutative strong monads. A strong monad T is said to be commutative when the diagram.
Properties. The Kleisli category of a commutative monad is symmetric monoidal in a canonical way, see corollary 7 in Guitart and corollary 4.3 in Power & Robison.

Outside mathematics_logic_statistics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

Clarity¶

A clear use of Strong monad names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. The strongest recognition evidence in the frozen account is: For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification When a monad is strong but not necessarily commutative, its Kleisli category is a premonoidal category. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Strong monad compresses multiple mathematics_logic_statistics details into a stable diagnostic relation. The source shows both the central mechanism—and conversely a symmetric monoidal monad (T,\eta,\mu,m) defines a commutative strong monad (T,\eta,\mu,t) by t_{A,B}=m_{A,B}\circ(\eta_A\otimes 1_{TB}):A\otimes TB\to T(A\otimes B).—and the practical consequence—a strong monad T is said to be commutative when the diagram. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the mathematics_logic_statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product.
Check operation and conditions. A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams.
Demand recognition evidence. For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by.
Test variation. Change an implementation or setting while preserving t'{A,B}=T(\gamma : TA\otimes B\to T(A\otimes B).})\circ t_{B,A}\circ\gamma_{TA,B
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

Knowledge Transfer¶

Within the home domain. Knowledge about Strong monad transfers literally when a new case preserves the same carrier type, relation, and recognition test. Strong monads play an important role in theoretical computer science where they are used to model computation with side effects. A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams.

Beyond the home domain. No canonical parent is asserted for Strong monad. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product; recognition evidence → For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by

Applied / In Practice¶

For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Commutative strong monads; invariant → In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product; boundary → the case exits the class when when a monad is strong but not necessarily commutative, its Kleisli category is a premonoidal category

Structural Tensions¶

T1 — Stable identity versus admissible variation. When a monad is strong but not necessarily commutative, its Kleisli category is a premonoidal category. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. t'{A,B}=T(\gamma : TA\otimes B\to T(A\otimes B). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.})\circ t_{B,A}\circ\gamma_{TA,B

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. a commutative strong monad (T,\eta,\mu,t) defines a symmetric monoidal monad (T,\eta,\mu,m) by m_{A,B}=\mu_{A\otimes B}\circ Tt'{A,B}\circ t:TA\otimes TB\to T(A\otimes B). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Strong monad literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. and conversely a symmetric monoidal monad (T,\eta,\mu,m) defines a commutative strong monad (T,\eta,\mu,t) by t_{A,B}=m_{A,B}\circ(\eta_A\otimes 1_{TB}):A\otimes TB\to T(A\otimes B). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Strong monad distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Strong monad is structural-leaning. Its structural side is the repeatable organization summarized by In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. Its framed side is the mathematics_logic_statistics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: a commutative strong monad (T,\eta,\mu,t) defines a symmetric monoidal monad (T,\eta,\mu,m) by m{A,B}=\mu{A\otimes B}\circ Tt'{A,B}\circ t{TA,B}:TA\otimes TB\to T(A\otimes B). and conversely a symmetric monoidal monad (T,\eta,\mu,m) defines a commutative strong monad (T,\eta,\mu,t) by t{A,B}=m{A,B}\circ(\etaA\otimes 1{TB}):A\otimes TB\to T(A\otimes B). It further constrains recognition and variation through: A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. For every strong monad T on a symmetric monoidal category, a right strength natural transformation can be defined by.

What is domain-bound. mathematics logic statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Strong monad literal. Its documented scope includes the condition that Strong monads play an important role in theoretical computer science where they are used to model computation with side effects. Another bounded application condition is that A (left) strong monad is a monad (T, η, μ) over a monoidal category (C, ⊗, I) together with a natural transformation t A,B : A ⊗ TB → T(A ⊗ B), called (tensorial) left strength, such that the diagrams. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—t'{A,B}=T(\gamma{B,A})\circ t{B,A}\circ\gamma{TA,B} : TA\otimes B\to T(A\otimes B).—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Mathematical structure.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Strong monad. The reviewed identity is: In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Strong monad Domain-specific

Parents (1) — more general patterns this builds on

Strong monad is a kind of Mathematical structure Domain-specific

Strong monad is a strict kind of Mathematical structure: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.

Hierarchy path (1) — routes to 1 parentless root

Strong monad → Mathematical structure → Set and Membership

Neighborhood in Abstraction Space¶

Strong monad sits in a moderately populated region (47^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Category Theory & Homotopical Algebra (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish In category theory, a strong monad is a monad on a monoidal category with an additional natural transformation, called the strength, which governs how the monad interacts with the monoidal product?
Monad (nonstandard analysis). The set of hyperreal points infinitesimally close to a given hyperreal point, with a finite point's monad containing exactly one real standard part. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Monoidal Monad. A monad on a monoidal category whose endofunctor carries coherent lax-monoidal tensor and unit maps and whose monad unit and multiplication are monoidal natural transformations. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Closed monoidal category. A monoidal category in which tensoring by any object has a right adjoint represented by an internal hom object. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Strong monad remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside mathematics_logic_statistics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Strong_monad (revision 1296412547).
Preserved source candidate: http://www.disi.unige.it/person/MoggiE/ftp/ic91.pdf
Preserved source candidate: http://www.numdam.org/item/?id=CTGDC_1980__21_1_5_0
Preserved source candidate: https://www.cambridge.org/core/product/identifier/S0960129597002375/type/journal_article
Preserved source candidate: https://link.springer.com/article/10.1007/BF01304852
Preserved source candidate: https://ncatlab.org/nlab/show/strong+monad

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.