Category theory/Natural transformation
From HaskellWiki
(Difference between revisions)
m (Commutative diagram is in D category) |
(Categorizing under Category:Theoretical foundations) |
||
| Line 142: | Line 142: | ||
* [http://haskell.org/hawiki/CategoryTheory_2fNaturalTransformation?action=highlight&value=natural+transformation The corresponding HaWiki article] is not migrated here yet, so You can see it for more information. | * [http://haskell.org/hawiki/CategoryTheory_2fNaturalTransformation?action=highlight&value=natural+transformation The corresponding HaWiki article] is not migrated here yet, so You can see it for more information. | ||
* Wikipedia's [http://en.wikipedia.org/wiki/Natural_transformation Natural transformation] article | * Wikipedia's [http://en.wikipedia.org/wiki/Natural_transformation Natural transformation] article | ||
| + | |||
| + | [[Category:Theoretical foundations]] | ||
Revision as of 16:23, 3 October 2006
Contents |
1 Example: maybeToList
maybeToList
map even $ maybeToList $ Just 5
yields the same as
maybeToList $ fmap even $ Just 5
yields: both yield
[False]
1.1 Commutative diagram
- Let
,
denote categories.
- Let
be functors.
- Let
. Let
.
Let us define the
natural transformation. It associates to each object of
a morphism of
in the following way (usually, not sets are discussed here, but proper classes, so I do not use term “function” for this
mapping):
-
. We call ηA the component of η at A.
-
Thus, the following diagram commutes (in
):
1.2 Vertical arrows: sides of objects
… showing how the natural transformation works.
maybeToList :: Maybe a -> [a]
1.2.1 Left: side of X object
| maybeToList :: Maybe Int -> [Int] | |
| Nothing | [] |
| Just 0 | [0] |
| Just 1 | [1] |
1.2.2 Right: side of Y object
| maybeToList :: Maybe Bool -> [Bool] | |
| Nothing | [] |
| Just True | [True] |
| Just False | [False] |
1.3 Horizontal arrows: sides of functors
even :: Int -> Bool
1.3.1 Side of Φ functor
| fmap even:: Maybe Int -> Maybe Bool | |
| Nothing | Nothing |
| Just 0 | Just True |
| Just 1 | Just False |
1.3.2 Side of Ψ functor
| map even:: [Int] -> [Bool] | |
| [] | [] |
| [0] | [True] |
| [1] | [False] |
1.4 Commutativity of the diagram
both paths span between
Maybe Int -> [Bool] | ||
| map even . maybeToList | maybeToList . fmap even | |
| Nothing | [] | [] |
| Just 0 | [True] | [True] |
| Just 1 | [False] | [False] |
1.5 Remarks
- has a more general type (even) than described hereIntegral a => a -> Bool
- 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.
- If You want to modifiy the #Commutative diagram, see its source code (in LaTeX using
amscd).
1.6 External links
- The corresponding HaWiki article is not migrated here yet, so You can see it for more information.
- Wikipedia's Natural transformation article

