Suppose F⊣G is an adjunction, and G:B→A is fully faithful, then counit ε:FG→1B is an isomorphism
Proof
Forward direction
To prove counit εB:FG(B)→B is an isomorphism, we need to find an inverse ε−1 and show pre and post composition of them are identity. Let ε−1:=G−1η, then we have two targets
- ε−1≫ε=idX
Apply G to get
GG−1η=Gε−1≫Gε=idG(X)
hence the target is η≫Gε=idG(X), right triangle fills the target.
- ε≫ε−1=idFG(X)
Use counit naturality on ε−1 to get
Fη≫εFG(B)=εB≫ε−1=G−1η
Therefore, we have target Fη≫εFG(B)=idFG(X), left triangle fills the target.
Backward direction
For G is faithful, we want to know if Gf=Gg then f=g. We first obtain two equations via naturality of counit:
FGf≫εY=εX≫fFGg≫εY=εX≫g
Replace Gf with Gg then we have εX≫f=εX≫g, counit is an isomorphism and hence left-cancellable, f=g.
For G is full, we want to show every f there is a a such that Ga=f. Let a=εX−1≫φ−1f (where φ is the hom-set equivalence of adjunction), this is same as asking
G(εX−1)=ηGX
because isomorphism property, we have
= = = G(εX−1)G(εX−1≫εX)G(εX−1)≫G(εX)ηGX≫G(εX)
now we use isomorphism to cancel right, so G(εX−1)=ηGX.