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

- All Categories 2.3K
- Chat 494
- ACT Study Group 5
- Azimuth Math Review 6
- MIT 2020: Programming with Categories 53
- MIT 2020: Lectures 21
- MIT 2020: Exercises 25
- MIT 2019: Applied Category Theory 339
- MIT 2019: Lectures 79
- MIT 2019: Exercises 149
- MIT 2019: Chat 50
- UCR ACT Seminar 4
- General 64
- Azimuth Code Project 110
- Drafts 1
- Math Syntax Demos 15
- Wiki - Latest Changes 1
- Strategy 110
- Azimuth Project 1.1K

Options

**Galois connection a.k.a. Adjunction Formula**
$$
f(p) \le q \iff p \le g(q) \\
\text{Where g is right-adjoint to f and f is left-adjoint to g}
$$

- Choose a nontrivial partition \( c : S \twoheadrightarrow P \) and let \( g_!(c) \) be its push forward partition on T.
- Choose any coarser partition \( d : T \twoheadrightarrow P' \), i.e. where \( g_!(c) \le d \) .
- Choose any non-coarser partition \( e : T \twoheadrightarrow Q \), i.e. where \( g_!(c) \nleq e \). (If you can’t do this, revise your answer for #1.)
- Find \( g^*(d) \text{ and } g^*(e) \) .
- The adjunction formula, in this case, says that since \( g_!(c) \le d \text{ and } g_!(c) \nleq e \) , we should have \( c \le g^*(d) \text{ and } c \nleq g^*(e) \) . Show that this is true.

## Comments

Thanks for the great diagram!

`Thanks for the great diagram!`

The easiest, and probably most illuminating, method is to look at the diagram above. Nevertheless, I thought I would give an explicit example.

\(S=\{1,2,3,4\},\,\,T=\{12,3,4\}\).

c=[124][3], d=[1234], e=[12][3][4]

\(g^* (\mathrm{d})\)=[1234], \(g^* (\mathrm{e})\)=[12][3][4]

[124][3]\(\leq\)[1234] and [124][3]\(\nleq\)[12][3][4].

`The easiest, and probably most illuminating, method is to look at the diagram above. Nevertheless, I thought I would give an explicit example. \\(S=\\{1,2,3,4\\},\,\,T=\\{12,3,4\\}\\). c=[124][3], d=[1234], e=[12][3][4] \\(g^* (\mathrm{d})\\)=[1234], \\(g^* (\mathrm{e})\\)=[12][3][4] [124][3]\\(\leq\\)[1234] and [124][3]\\(\nleq\\)[12][3][4].`