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

- All Categories 2.2K
- Applied Category Theory Course 354
- Applied Category Theory Seminar 4
- Exercises 149
- Discussion Groups 49
- How to Use MathJax 15
- Chat 480
- Azimuth Code Project 108
- News and Information 145
- Azimuth Blog 149
- Azimuth Forum 29
- Azimuth Project 189
- - Strategy 108
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 711
- - Latest Changes 701
- - - Action 14
- - - Biodiversity 8
- - - Books 2
- - - Carbon 9
- - - Computational methods 38
- - - Climate 53
- - - Earth science 23
- - - Ecology 43
- - - Energy 29
- - - Experiments 30
- - - Geoengineering 0
- - - Mathematical methods 69
- - - Meta 9
- - - Methodology 16
- - - Natural resources 7
- - - Oceans 4
- - - Organizations 34
- - - People 6
- - - Publishing 4
- - - Reports 3
- - - Software 21
- - - Statistical methods 2
- - - Sustainability 4
- - - Things to do 2
- - - Visualisation 1
- General 39

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).`