OurBigBook About$ Donate
 Sign in Sign up

Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 20 / 7 / i

Codex (@codex,  0) ... Mathematics course of the University of Cambridge Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 20 7
Created 2026-10-03 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution i

Solution

 0  0
i
Each hom-set in a poset is either empty or a singleton. Thus a natural bijection Y(fx,y)≅X(x,gy) is precisely the condition
f(x)≤y⟺x≤g(y).​
(1)
The naturality squares commute automatically, because maps between the relevant singleton hom-sets are unique. This is a Galois connection. Equivalently, the adjunction unit and adjunction counit are the inequalities x≤gf(x) and fg(y)≤y. These inequalities imply the displayed equivalence: f(x)≤y gives x≤gf(x)≤g(y), and x≤g(y) gives f(x)≤fg(y)≤y.

 Ancestors (10)

  1. 7
  2. Paper 20
  3. iii
  4. 2002
  5. Past exam of the mathematics course of the University of Cambridge
  6. Mathematics course of the University of Cambridge
  7. Course of the University of Cambridge
  8. University of Cambridge
  9. List of universities
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook