It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 2.4K
- Chat 504
- Study Groups 21
- Petri Nets 9
- Epidemiology 4
- Leaf Modeling 2
- Review Sections 9
- MIT 2020: Programming with Categories 51
- MIT 2020: Lectures 20
- MIT 2020: Exercises 25
- Baez ACT 2019: Online Course 339
- Baez ACT 2019: Lectures 79
- Baez ACT 2019: Exercises 149
- Baez ACT 2019: Chat 50
- UCR ACT Seminar 4
- General 75
- Azimuth Code Project 111
- Statistical methods 4
- Drafts 10
- Math Syntax Demos 15
- Wiki - Latest Changes 3
- Strategy 113
- Azimuth Project 1.1K
- - Spam 1
- News and Information 148
- Azimuth Blog 149
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 718

Options

## Comments

Let \(S_1, \cdots, S_5\) denote the five partitions:

$$ \begin{eqnarray} S_1 &=& \left\{\{\bullet\}, \{\circ\}, \{\star\}\right\}\\ S_2 &=& \left\{\{\bullet\}, \{\circ, \star\}\right\}\\ S_3 &=& \left\{\{\circ\}, \{\bullet, \star\}\right\}\\ S_4 &=& \left\{\{\star\}, \{\bullet, \circ\}\right\}\\ S_5 &=& \left\{\{\bullet, \circ, \star\}\right\}\\ \end{eqnarray} $$ Then the twelve pairs are:

$$ \begin{eqnarray} (S_1, S_1) \\ (S_1, S_2) \\ (S_1, S_3) \\ (S_1, S_4) \\ (S_1, S_5) \\ (S_2, S_2) \\ (S_2, S_5) \\ (S_3, S_3) \\ (S_3, S_5) \\ (S_4, S_4) \\ (S_4, S_5) \\ (S_5, S_5) \\ \end{eqnarray} $$

`Let \\(S_1, \cdots, S_5\\) denote the five partitions: $$ \begin{eqnarray} S_1 &=& \left\\{\\{\bullet\\}, \\{\circ\\}, \\{\star\\}\right\\}\\\\ S_2 &=& \left\\{\\{\bullet\\}, \\{\circ, \star\\}\right\\}\\\\ S_3 &=& \left\\{\\{\circ\\}, \\{\bullet, \star\\}\right\\}\\\\ S_4 &=& \left\\{\\{\star\\}, \\{\bullet, \circ\\}\right\\}\\\\ S_5 &=& \left\\{\\{\bullet, \circ, \star\\}\right\\}\\\\ \end{eqnarray} $$ Then the twelve pairs are: $$ \begin{eqnarray} (S_1, S_1) \\\\ (S_1, S_2) \\\\ (S_1, S_3) \\\\ (S_1, S_4) \\\\ (S_1, S_5) \\\\ (S_2, S_2) \\\\ (S_2, S_5) \\\\ (S_3, S_3) \\\\ (S_3, S_5) \\\\ (S_4, S_4) \\\\ (S_4, S_5) \\\\ (S_5, S_5) \\\\ \end{eqnarray} $$`

To summarize: there are 5 identity arrows; 6 drawn arrows, and; 1 composed arrow [3 equivalent composed arrows] from \( S_1 \dots S_5 \). \( 5 + 6 + 1 = 12 \)

`To summarize: there are 5 identity arrows; 6 drawn arrows, and; 1 composed arrow [3 equivalent composed arrows] from \\( S_1 \dots S_5 \\). \\( 5 + 6 + 1 = 12 \\)`

Just a minor additional explanation point that might help others. Coarser partition (as per John's lecture 10), means that more points are connected (or equivalent). Which is why in Dan's answer \(S_5\) always appears on the right, because it is the most coarse --that is, in that partition most points are equivalent. May be another way to think about 'coarsest' partition, is that it will contain the 'least' number of blocks.

`Just a minor additional explanation point that might help others. Coarser partition (as per John's lecture 10), means that more points are connected (or equivalent). Which is why in Dan's answer \\(S_5\\) always appears on the right, because it is the most coarse --that is, in that partition most points are equivalent. May be another way to think about 'coarsest' partition, is that it will contain the 'least' number of blocks.`