What distinguishes a morphism (h, k): (a,b,f) → (a',b',f') in the comma category (F↓G) from simply a pair of morphisms h: a→a' in A and k: b→b' in B?
ANothing — any pair of morphisms in A and B constitutes a morphism in the comma category
BThe pair must satisfy the commutativity condition G(k) ∘ f = f' ∘ F(h) in C
CThe pair must be an isomorphism in both A and B simultaneously
Dh and k must be identity morphisms unless F and G are identity functors
The defining feature of comma category morphisms is the commutativity square: G(k) ∘ f = f' ∘ F(h). This condition says that (h, k) is genuinely a 'morphism of bridges' — it transforms the bridge f: F(a)→G(b) coherently into f': F(a')→G(b'). Without this condition, you would just have the product category A×B, which ignores the morphisms f and f' entirely. The commutativity condition is what makes the comma category a category *over* C rather than just beside it.
Question 2 Multiple Choice
In the comma category (c↓G) for a fixed object c in C and functor G: D→C, what does an initial object represent?
AA universal arrow from c to G — a pair (d, f: c→G(d)) through which every other such pair factors uniquely
BThe terminal object of D mapped back into C via G
CA natural isomorphism between the constant functor at c and G
DThe colimit of G taken over the whole category D
An initial object in (c↓G) is a pair (d, u: c→G(d)) such that for any other object (d', f: c→G(d')) there is a unique morphism h: d→d' in D with G(h) ∘ u = f. This is precisely the definition of a universal arrow from c to G. When such initial objects exist for every c ∈ C and vary naturally in c, the assignment c↦d is a functor F: C→D and F is the left adjoint of G. This is why comma categories provide the natural language for adjunctions.
Question 3 True / False
The slice category C/X is a special case of the comma category, obtained by taking F = Id_C (the identity functor) and G as the functor selecting the object X.
TTrue
FFalse
Answer: True
Setting A = C, F = Id_C, B = 1 (one-object category), and G = const_X recovers C/X exactly. Objects of C/X are morphisms A→X in C (triples (A, *, f: A→X) with the B-component trivial), and morphisms are commutative triangles over X. This makes C/X a special case of the comma construction, not an independent concept. The coslice category X/C is the dual, recovering objects under X.
Question 4 True / False
The comma category (F↓G) is generally a small category whenever A, B, and C are small categories.
TTrue
FFalse
Answer: False
This is false. Even when A, B, and C are small, the comma category (F↓G) can be large because its objects include a morphism f: F(a)→G(b) in C for each pair (a,b), and the collection of such morphisms can be a proper class if the morphism sets in C are large. Smallness of a comma category requires additional conditions beyond the smallness of A, B, and C individually.
Question 5 Short Answer
Why are comma categories the natural setting for adjunctions? Explain the connection between initial objects in a comma category and the left adjoint of a functor.
Think about your answer, then reveal below.
Model answer: Given G: D→C, a left adjoint F is exactly the functor that assigns to each c ∈ C an initial object in the comma category (c↓G). The initial object (F(c), η_c: c→G(F(c))) is the universal arrow from c to G — any other morphism c→G(d) factors uniquely through η_c via a morphism F(c)→d. When these initial objects exist for all c and the assignment is natural, F becomes a functor satisfying the universal property of a left adjoint, with η assembling into the unit of the adjunction.
The key insight is that an adjunction L ⊣ R is not a single relationship but a family of universal arrows, one for each object in the source category. The comma category (c↓R) packages all morphisms from c into the image of R, and an initial object in this category is the 'best' such morphism — the unit η_c. The comma construction thus turns the adjunction concept from a natural isomorphism Hom(Lc, d) ≅ Hom(c, Rd) into a statement about the existence and naturality of initial objects, which is often easier to verify.