Michael Shulman
adjunctions in 2-logic

Our goal here is to show that all the equivalent ways of defining an adjunction in ordinary naive category theory are still valid in the internal logic of a 2-category, and all produce the usual internal notion of adjunction in a 2-category.

    Unit + Counit + Triangle identities

    The most obvious way of describing an adjunction in the internal logic of a 2-category is via the unit-counit-triangle identities definition.

    • x:Af(x):B
    • y:Bg(x):A
    • x:Aη x:hom A(x,g(f(x)))
    • y:Bε y:hom B(f(g(y)),y)
    • x:Aε f(x)f(η x)=1 f(x)
    • y:Bg(ε y)η g(y)=1 g(y)

    It is evident that a model of this theory in any lex 2-category is precisely an internal adjunction in the usual sense, consisting of two 1-cells f:AB and g:BA and 2-cells η and ε satisfying the triangle identities.

    Bijection on hom-sets

    It is proven in

    • Street, Fibrations and Yoneda’s lemma in a 2-category

    that to give an internal adjunction fg in a lex 2-category it is equivalent to give an isomorphism (f/B)(A/g) of two-sided discrete fibrations from B to A. With this in hand, it is easy to see that the following theory also defines an adjunction.

    • x:Af(x):B
    • y:Bg(x):A
    • x:A,y:B,α:hom A(x,g(y))i(α):hom B(f(x),y)
    • x:A,y:B,β:hom B(f(x),y)j(β):hom A(x,g(y))
    • x:A,y:B,α:hom A(x,g(y))α=j(i(α))
    • x:A,y:B,β:hom B(f(x),y)β=i(j(β))

    Note that the naturality of the isomorphism is assured automatically; the theory doesn’t have to assert it separately.

    Universal arrows