Category theory/Natural transformation

Example: maybeToList

 map even $ maybeToList $ Just 5

yields the same as

 maybeToList $ map even $ Just 5

yields: both yield

 [False]

Vertical arrows: sides of objects

… showing how the natural transformation works.

$\eta :\mathrm{\Phi }\to \mathrm{\Psi }$

maybeToList :: Maybe a -> [a]

Left: side of X object

${\eta }_X:\mathrm{\Phi }(X)\to \mathrm{\Psi }(X)$

	maybeToList :: Maybe Int -> [Int]
Nothing	[]
Just 0	[0]
Just 1	[1]

Right: side of Y object

${\eta }_Y:\mathrm{\Phi }(Y)\to \mathrm{\Psi }(Y)$

	maybeToList :: Maybe Bool -> [Bool]
Nothing	[]
Just True	[True]
Just False	[False]

Horizontal arrows: sides of functors

$f:X\to Y$

 even :: Int -> Bool

Side of $\mathrm{\Phi }$ functor

$\mathrm{\Phi }(f):\mathrm{\Phi }(X)\to \mathrm{\Phi }(Y)$

	map even:: Maybe Int -> Maybe Bool
Nothing	Nothing
Just 0	Just True
Just 1	Just False

Side of $\mathrm{\Psi }$ functor

$\mathrm{\Psi }(f):\mathrm{\Psi }(X)\to \mathrm{\Psi }(Y)$

	map even:: [Int] -> [Bool]
[]	[]
[0]	[True]
[1]	[False]

Commutativity of the diagram

$\mathrm{\Psi }(f)\cdot {\eta }_X={\eta }_Y\cdot \mathrm{\Phi }(f)$

both paths span between

$\mathrm{\Phi }(X)\to \mathrm{\Psi }(Y)$

	Maybe Int -> [Bool]
	map even . maybeToList	maybeToList . map even
Nothing	[]	[]
Just 0	[True]	[True]
Just 1	[False]	[False]

Remarks

• even has a more general type (Integral a => a -> Bool) than described here
• Words “side”, “horizontal”, “vertical”, “left”, “right” serve here only to point to the discussed parts of a diagram, thus, they are not part of the scientific terminology.