where as we said <code>γ</code> is a natural transformation from `G` to some `MR'G`.
+Summarizing then, the monad laws can be expressed as:
+
+<pre>
+ For all ρ, γ, φ in T for which ρ <=< γ and γ <=< φ are defined:
+
+ (i) γ <=< φ etc are also in T
+
+ (ii) (ρ <=< γ) <=< φ = ρ <=< (γ <=< φ)
+
+ (iii.1) (unit G') <=< γ = γ
+ when γ is a natural transformation from some FG' to MG'
+
+ (iii.2) γ = γ <=< (unit G)
+ when γ is a natural transformation from G to some MR'G
+</pre>
-The standard category-theory presentation of the monad laws
------------------------------------------------------------
+Getting to the standard category-theory presentation of the monad laws
+----------------------------------------------------------------------
In category theory, the monad laws are usually stated in terms of `unit` and `join` instead of `unit` and `<=<`.
<!--
* functors "distribute over composition", that is for any morphisms `f` and `g` in `F`'s source category: <code>F(g ∘ f) = F(g) ∘ F(f)</code>
-* if <code>η</code> is a natural transformation from `F` to `G`, then for every <code>f:C1→C2</code> in `F` and `G`'s source category <b>C</b>: <code>η[C2] ∘ F(f) = G(f) ∘ η[C1]</code>.
+* if <code>η</code> is a natural transformation from `G` to `H`, then for every <code>f:C1→C2</code> in `G` and `H`'s source category <b>C</b>: <code>η[C2] ∘ G(f) = H(f) ∘ η[C1]</code>.
+
+* <code>(η F)[E] = η[F(E)]</code>
+
+* <code>(K η)[E} = K(η[E])</code>
+
+* <code>((φ -v- η) F) = ((φ F) -v- (η F))</code>
Let's use the definitions of naturalness, and of composition of natural transformations, to establish two lemmas.
-Recall that join is a natural transformation from the (composite) functor `MM` to `M`. So for elements `C1` in <b>C</b>, `join[C1]` will be a morphism from `MM(C1)` to `M(C1)`. And for any morphism <code>f:C1→C2</code> in <b>C</b>:
+Recall that `join` is a natural transformation from the (composite) functor `MM` to `M`. So for elements `C1` in <b>C</b>, `join[C1]` will be a morphism from `MM(C1)` to `M(C1)`. And for any morphism <code>f:C1→C2</code> in <b>C</b>:
<pre>
(1) join[C2] ∘ MM(f) = M(f) ∘ join[C1]
</pre>
-Next, consider the composite transformation <code>((join MG') -v- (MM γ))</code>.
+Next, let <code>γ</code> be a transformation from `G` to `MG'`, and
+ consider the composite transformation <code>((join MG') -v- (MM γ))</code>.
-* <code>γ</code> is a transformation from `G` to `MG'`, and assigns elements `C1` in <b>C</b> a morphism <code>γ\*: G(C1) → MG'(C1)</code>. <code>(MM γ)</code> is a transformation that instead assigns `C1` the morphism <code>MM(γ\*)</code>.
+* <code>γ</code> assigns elements `C1` in <b>C</b> a morphism <code>γ\*:G(C1) → MG'(C1)</code>. <code>(MM γ)</code> is a transformation that instead assigns `C1` the morphism <code>MM(γ\*)</code>.
-* `(join MG')` is a transformation from `MMMG'` to `MMG'` that assigns `C1` the morphism `join[MG'(C1)]`.
+* `(join MG')` is a transformation from `MM(MG')` to `M(MG')` that assigns `C1` the morphism `join[MG'(C1)]`.
Composing them:
(2) ((join MG') -v- (MM γ)) assigns to C1 the morphism join[MG'(C1)] ∘ MM(γ*).
</pre>
-Next, consider the composite transformation <code>((M γ) -v- (join G))</code>.
+Next, consider the composite transformation <code>((M γ) -v- (join G))</code>:
<pre>
- (3) This assigns to C1 the morphism M(γ*) ∘ join[G(C1)].
+ (3) ((M γ) -v- (join G)) assigns to C1 the morphism M(γ*) ∘ join[G(C1)].
</pre>
So for every element `C1` of <b>C</b>:
<pre>
((join MG') -v- (MM γ))[C1], by (2) is:
- join[MG'(C1)] ∘ MM(γ*), which by (1), with f=γ*: G(C1)→MG'(C1) is:
+ join[MG'(C1)] ∘ MM(γ*), which by (1), with f=γ*:G(C1)→MG'(C1) is:
M(γ*) ∘ join[G(C1)], which by 3 is:
((M γ) -v- (join G))[C1]
</pre>
So our **(lemma 1)** is:
<pre>
- ((join MG') -v- (MM γ)) = ((M γ) -v- (join G)), where γ is a transformation from G to MG'.
+ ((join MG') -v- (MM γ)) = ((M γ) -v- (join G)),
+ where as we said γ is a natural transformation from G to MG'.
</pre>
-Next recall that unit is a natural transformation from `1C` to `M`. So for elements `C1` in <b>C</b>, `unit[C1]` will be a morphism from `C1` to `M(C1)`. And for any morphism <code>f:a→b</code> in <b>C</b>:
+Next recall that `unit` is a natural transformation from `1C` to `M`. So for elements `C1` in <b>C</b>, `unit[C1]` will be a morphism from `C1` to `M(C1)`. And for any morphism <code>f:C1→C2</code> in <b>C</b>:
<pre>
- (4) unit[b] ∘ f = M(f) ∘ unit[a]
+ (4) unit[C2] ∘ f = M(f) ∘ unit[C1]
</pre>
-Next consider the composite transformation <code>((M γ) -v- (unit G))</code>:
+Next, consider the composite transformation <code>((M γ) -v- (unit G))</code>:
<pre>
- (5) This assigns to C1 the morphism M(γ*) ∘ unit[G(C1)].
+ (5) ((M γ) -v- (unit G)) assigns to C1 the morphism M(γ*) ∘ unit[G(C1)].
</pre>
-Next consider the composite transformation <code>((unit MG') -v- γ)</code>.
+Next, consider the composite transformation <code>((unit MG') -v- γ)</code>:
<pre>
- (6) This assigns to C1 the morphism unit[MG'(C1)] ∘ γ*.
+ (6) ((unit MG') -v- γ) assigns to C1 the morphism unit[MG'(C1)] ∘ γ*.
</pre>
So for every element C1 of <b>C</b>:
<pre>
((M γ) -v- (unit G))[C1], by (5) =
- M(γ*) ∘ unit[G(C1)], which by (4), with f=γ*: G(C1)→MG'(C1) is:
+ M(γ*) ∘ unit[G(C1)], which by (4), with f=γ*:G(C1)→MG'(C1) is:
unit[MG'(C1)] ∘ γ*, which by (6) =
((unit MG') -v- γ)[C1]
</pre>
So our **(lemma 2)** is:
<pre>
- (((M γ) -v- (unit G)) = ((unit MG') -v- γ)), where γ is a transformation from G to MG'.
+ (((M γ) -v- (unit G)) = ((unit MG') -v- γ)),
+ where as we said γ is a natural transformation from G to MG'.
</pre>
Finally, we substitute <code>((join G') -v- (M γ) -v- φ)</code> for <code>γ <=< φ</code> in the monad laws. For simplicity, I'll omit the "-v-".
<pre>
- for all φ,γ,ρ in T, where φ is a transformation from F to MF', γ is a transformation from G to MG', R is a transformation from R to MR', and F'=G and G'=R:
+ For all ρ, γ, φ in T,
+ where φ is a transformation from F to MF',
+ γ is a transformation from G to MG',
+ ρ is a transformation from R to MR',
+ and F'=G and G'=R:
- (i) γ <=< φ etc are also in T
+ (i) γ <=< φ etc are also in T
==>
- (i') ((join G') (M γ) φ) etc are also in T
+ (i') ((join G') (M γ) φ) etc are also in T
+
- (ii) (ρ <=< γ) <=< φ = ρ <=< (γ <=< φ)
+ (ii) (ρ <=< γ) <=< φ = ρ <=< (γ <=< φ)
==>
(ρ <=< γ) is a transformation from G to MR', so:
(ρ <=< γ) <=< φ becomes: (join R') (M (ρ <=< γ)) φ
substituting in (ii), and helping ourselves to associativity on the rhs, we get:
((join R') (M ((join R') (M ρ) γ)) φ) = ((join R') (M ρ) (join G') (M γ) φ)
- ---------------------
+
which by the distributivity of functors over composition, and helping ourselves to associativity on the lhs, yields:
- ------------------------
+
((join R') (M join R') (MM ρ) (M γ) φ) = ((join R') (M ρ) (join G') (M γ) φ)
- ---------------
+
which by lemma 1, with ρ a transformation from G' to MR', yields:
- -----------------
+
((join R') (M join R') (MM ρ) (M γ) φ) = ((join R') (join MR') (MM ρ) (M γ) φ)
which will be true for all ρ,γ,φ just in case:
which will in turn be true just in case:
- (ii') (join (M join)) = (join (join M))
+ (ii') (join (M join)) = (join (join M))
+
+ (iii.1) (unit G') <=< γ = γ
+ when γ is a natural transformation from some FG' to MG'
(iii.1) (unit F') <=< φ = φ
==>
(unit F') is a transformation from F' to MF', so:
(iii.1') (join (M unit) = the identity transformation
+
+
+ (iii.2) γ = γ <=< (unit G)
+ when γ is a natural transformation from G to some MR'G
(iii.2) φ = φ <=< (unit F)
==>
φ is a transformation from F to MF', so:
-7. The functional programming presentation of the monad laws
-------------------------------------------------------------
+Getting to the functional programming presentation of the monad laws
+--------------------------------------------------------------------
In functional programming, unit is usually called "return" and the monad laws are usually stated in terms of return and an operation called "bind" which is interdefinable with <=< or with join.
Additionally, whereas in category-theory one works "monomorphically", in functional programming one usually works with "polymorphic" functions.