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

If we apply the map "is \(\bullet\) connected to \(\star\)" to the diagram on the left we obtain the following diagram:

All the paths above are valid since they exist in the Boolean poset (as indicated by the colors in the diagram below); hence the map \(\phi\) is a monotone map.

`If we apply the map "is \\(\bullet\\) connected to \\(\star\\)" to the diagram on the left we obtain the following diagram: ![Phi applied to partition poset](https://doneata.bitbucket.io/applied-category-theory/ch1-ex54-a.png) All the paths above are valid since they exist in the Boolean poset (as indicated by the colors in the diagram below); hence the map \\(\phi\\) is a monotone map. ![The Boolean poset](https://doneata.bitbucket.io/applied-category-theory/ch1-ex54-b.png)`

Since \(\mathrm{false} \le a\) for all \(a \in \mathbb{B}\) and \(\mathrm{true} \le \mathrm{true}\), it is sufficient to check that if \(a \le a'\) and \(f(a) = \mathrm{true}\), then \(f(a') = \mathrm{true}\). Because \(a\) is finer than \(a'\), every part in \(a\) is a subset of a part in \(b\). Therefore, since \(\bullet\) and \(\ast\) are in the same part in \(a\), they will also be in the same part in \(a'\). Hence, \(f(a') = \mathrm{true}\).

`Since \\(\mathrm{false} \le a\\) for all \\(a \in \mathbb{B}\\) and \\(\mathrm{true} \le \mathrm{true}\\), it is sufficient to check that if \\(a \le a'\\) and \\(f(a) = \mathrm{true}\\), then \\(f(a') = \mathrm{true}\\). Because \\(a\\) is finer than \\(a'\\), every part in \\(a\\) is a subset of a part in \\(b\\). Therefore, since \\(\bullet\\) and \\(\ast\\) are in the same part in \\(a\\), they will also be in the same part in \\(a'\\). Hence, \\(f(a') = \mathrm{true}\\).`

We want to show that x≤y implies Φ(x)≤ Φ(y). If x≤y, that means that if • and ∗ are connected in x then they are connected in y. So • and ∗ are either connected in both x and y, disconnected in x and y, or disconnected in x and connected in y. Then (Φ(x), Φ(y)) is either (true, true), (false, false), or (false, true). In all cases Φ(x)≤Φ(y).

`We want to show that x≤y implies Φ(x)≤ Φ(y). If x≤y, that means that if • and ∗ are connected in x then they are connected in y. So • and ∗ are either connected in both x and y, disconnected in x and y, or disconnected in x and connected in y. Then (Φ(x), Φ(y)) is either (true, true), (false, false), or (false, true). In all cases Φ(x)≤Φ(y).`