summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGregor Kleen <gkleen@yggdrasil.li>2016-01-29 21:42:06 +0100
committerGregor Kleen <gkleen@yggdrasil.li>2016-01-29 21:42:06 +0100
commit2a28e0b12f256ee7c109c0646d7daac5807f741c (patch)
tree6bffc41a8f55ce0281c2334d08596e0528608727
parent2b133152c5af28d0f419e5ce78f529b99159500f (diff)
downloaddirty-haskell.org-2a28e0b12f256ee7c109c0646d7daac5807f741c.tar
dirty-haskell.org-2a28e0b12f256ee7c109c0646d7daac5807f741c.tar.gz
dirty-haskell.org-2a28e0b12f256ee7c109c0646d7daac5807f741c.tar.bz2
dirty-haskell.org-2a28e0b12f256ee7c109c0646d7daac5807f741c.tar.xz
dirty-haskell.org-2a28e0b12f256ee7c109c0646d7daac5807f741c.zip
fixed math
-rw-r--r--provider/posts/simmons-intro-to-cat-t/1.1.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/provider/posts/simmons-intro-to-cat-t/1.1.md b/provider/posts/simmons-intro-to-cat-t/1.1.md
index f95c068..d1ece85 100644
--- a/provider/posts/simmons-intro-to-cat-t/1.1.md
+++ b/provider/posts/simmons-intro-to-cat-t/1.1.md
@@ -10,7 +10,7 @@ Sets and functions do form a category $\ca{Set}$.
10<div class="proof"> 10<div class="proof">
11The objects of $\ca{Set}$ are sets and its arrows are functions. 11The objects of $\ca{Set}$ are sets and its arrows are functions.
12 12
13For any set $A$ we construct \idarr{A} by restricting \id to $A$: 13For any set $A$ we construct $\idarr{A}$ by restricting $\id$ to $A$:
14$$\idarr{A} = \id \upharpoonright A$$ 14$$\idarr{A} = \id \upharpoonright A$$
15 15
16$\circ$ is indeed associative. 16$\circ$ is indeed associative.
@@ -23,7 +23,7 @@ Each [poset](https://en.wikipedia.org/wiki/Partially_ordered_set) is a category.
23<div class="proof"> 23<div class="proof">
24The objects of each poset are its elements and we construct an arrow $\begin{tikzcd} a \arrow[r, "\leq"] & b \end{tikzcd}$ for every pair of objects $(a, b)$ iff $a \leq b$. 24The objects of each poset are its elements and we construct an arrow $\begin{tikzcd} a \arrow[r, "\leq"] & b \end{tikzcd}$ for every pair of objects $(a, b)$ iff $a \leq b$.
25 25
26Reflexivity ($a \leq a$) and transitivity ($a \leq b \land b \leq c \implies a \leq c$) provide a construction for \idarr{a} and $\circ$, respectively. 26Reflexivity ($a \leq a$) and transitivity ($a \leq b \land b \leq c \implies a \leq c$) provide a construction for $\idarr{a}$ and $\circ$, respectively.
27</div> 27</div>
28</div> 28</div>
29 29
@@ -33,6 +33,6 @@ Each [monoid](https://en.wikipedia.org/wiki/Monoid) is a category.
33<div class="proof"> 33<div class="proof">
34The objects of each monoid are its elements and we construct for every pair of elements $(a, b)$ an arrow $\begin{tikzcd} a \arrow[r, "\cdot b"] & a \cdot b \end{tikzcd}$. 34The objects of each monoid are its elements and we construct for every pair of elements $(a, b)$ an arrow $\begin{tikzcd} a \arrow[r, "\cdot b"] & a \cdot b \end{tikzcd}$.
35 35
36The existence of an identity element and associativity, as required by the monoid structure, immediately provide us with a construction for \id and associativity of $\circ$. 36The existence of an identity element and associativity, as required by the monoid structure, immediately provide us with a construction for $\id$ and associativity of $\circ$.
37</div> 37</div>
38</div> 38</div>