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 352
- Applied Category Theory Seminar 4
- Exercises 149
- Discussion Groups 49
- How to Use MathJax 15
- Chat 478
- Azimuth Code Project 108
- News and Information 145
- Azimuth Blog 148
- Azimuth Forum 29
- Azimuth Project 189
- - Strategy 108
- - Conventions and Policies 21
- - Questions 43
- Azimuth Wiki 710
- - 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

Complete the proof of Proposition 1.84 by showing that left adjoints preserve joins.

**Proposition 1.89** (Left adjoints preserve joins).

Let \( f: P \rightarrow Q \) have as its right adjoint \( g: Q \rightarrow P \).

Suppose \( A \subseteq P \) any subset, and let \( f(A) = { f(a) = a \in A } \) be its image.

Then if \( A \subseteq P \) is any subset that has a join \( \bigvee f(A) \in P \) and we have $$ f \Big( \bigvee A \Big) = \bigvee f(A) $$.

## Comments

This proof is dual to the one given in the first half of the proof of the proposition.

By definition, an element \(t\in P\) is the join of the elements of \(A\) if(f) for every p\(\in A\), p≤t, and t is the least such element of \(P\). By monotonicity of f, f(p)≤f(t), so f(t) is an upper bound for f(\(A\)) in \(Q\). Let u\(\in Q\) be any upper bound for f(\(A\)), so, for every p\(\in A\), f(p)≤u. By adjointness of f,g, p≤g(u) must hold for every p\(\in A\), so g(u) is an upper bound for \(A\) in \(P\). By definition, the join t is the least upper bound, so t≤g(u). By adjointness of f,g one has that f(t)≤u, so, f(t) is the least upper bound in \(Q\) for f(\(A\)). In symbols \[f\left(\bigvee A\right)=\bigvee f(A)\].

Note that, in general, the last equation is only true up to isomorphism, i.e.: \[f\left(\bigvee A\right)\cong\bigvee f(A)\]

`This proof is dual to the one given in the first half of the proof of the proposition. By definition, an element \\(t\in P\\) is the join of the elements of \\(A\\) if(f) for every p\\(\in A\\), p≤t, and t is the least such element of \\(P\\). By monotonicity of f, f(p)≤f(t), so f(t) is an upper bound for f(\\(A\\)) in \\(Q\\). Let u\\(\in Q\\) be any upper bound for f(\\(A\\)), so, for every p\\(\in A\\), f(p)≤u. By adjointness of f,g, p≤g(u) must hold for every p\\(\in A\\), so g(u) is an upper bound for \\(A\\) in \\(P\\). By definition, the join t is the least upper bound, so t≤g(u). By adjointness of f,g one has that f(t)≤u, so, f(t) is the least upper bound in \\(Q\\) for f(\\(A\\)). In symbols \\[f\left(\bigvee A\right)=\bigvee f(A)\\]. Note that, in general, the last equation is only true up to isomorphism, i.e.: \\[f\left(\bigvee A\right)\cong\bigvee f(A)\\]`