Skip to content

Distributive Law Between Monads

A natural transformation λ:TS⇒ST coherent with both monads' units and multiplications, allowing the ordered composite ST to inherit a monad structure.

Version
v1 · 2026-10-03 · History
Domain-specific #
13160
Aliases
Beck Distributive Law Between Monads

Core Idea

A distributive law between two monads \(S\) and \(T\) on one category is a natural transformation \(\lambda:TS\Rightarrow ST\) that respects both monads' units and multiplications in four Beck equations. The verified interchange makes the ordered composite \(ST\) a monad: its multiplication swaps the middle \(TS\) layers of \(STST\) and then flattens the two \(S\) and two \(T\) layers. Authors sometimes exchange the letters \(S,T\); the arrow type, not the phrase “distributes over,” determines the composite order.[ref-486368f0ce9b][ref-5b3ca7541e0c]

Scope of Application

The free-monoid/list monad \(L\) distributes over the free-abelian-group monad \(A\) by \(LA\Rightarrow AL\), yielding the free-ring monad \(AL\). In computational semantics, the exception monad \(E(X)=X+E_0\) distributes over any monad \(M\) by \(EM\Rightarrow ME\); a singleton exception has the Maybe/optional-result form. These are different interactions with the same categorical proof obligations. Reversing a law is not automatic: the standard reverse \(AL\Rightarrow LA\) is a published no-go case.[ref-5b3ca7541e0c][ref-d687296bdb17]

Clarity

A plausible objectwise swap is insufficient. It must be natural and satisfy both unit and both multiplication compatibility diagrams. The law is distinct from ordinary distributivity between binary operations and from a monoidal monad's tensor comparison. It is also not a guarantee that every pair of monads combines in the desired order.[ref-486368f0ce9b][ref-5b3ca7541e0c]

Manages Complexity

The four Beck laws reduce a difficult composite-unit-and-multiplication construction to a reusable interchange test. Once established, \(STST\xrightarrow{S\lambda T}SSTT\to ST\) defines the composite multiplication coherently. The method certifies a specific interaction; it does not choose which interaction a program or algebra ought to use.[ref-486368f0ce9b][ref-d687296bdb17]

Abstract Reasoning

To assess a candidate composite, identify the two monads, type the proposed arrow, and verify naturality plus all four diagrams. If the arrow is \(TS\Rightarrow ST\), the licensed result is \(ST\). A failure of a unit or multiplication diagram blocks this Beck construction, while absence of one direction says nothing by itself about the other direction. The free-ring positive/reverse-negative pair shows why the distinction matters.[ref-486368f0ce9b][ref-5b3ca7541e0c]

Knowledge Transfer

The categorical test applies literally to ring construction, list/powerset choices and exception layering; what changes is the concrete action of \(\lambda\). A simple algebraic expansion may suggest a candidate, but cannot replace the naturality and coherence proof. No checked live prime currently supplies a necessary typed genus, so this draft is staged unparented rather than connected by word resemblance.[ref-486368f0ce9b][ref-5b3ca7541e0c][^ref-d687296bdb17]

[^ref-486368f0ce9b]: Louis Parlant, Monad Composition via Preservation of Algebras, University College London PhD thesis, PDF pp. 38–40, Definition 2.64, Eq. (2.16), Theorems 2.65–2.66. [^ref-5b3ca7541e0c]: Maaike Zwart and Dan Marsden, “No-Go Theorems for Distributive Laws”, Logical Methods in Computer Science 18(1):13 (2022), PDF pp. 5–6 and 44–45. [^ref-d687296bdb17]: Rasmus E. Møgelberg and Maaike Zwart, “What Monads Can and Cannot Do With a Few Extra Pages”, Logical Methods in Computer Science 21(4):5 (2025), PDF p. 9 §4 “Exceptions.”

Neighborhood in Abstraction Space

Distributive Law Between Monads sits in a sparse region of the domain-specific corpus (62nd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Abstract Algebra & Category Theory (24 abstractions)

Nearest neighbors

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