Let A,B,C be categories, and let F:A⇒C and G:B⇒C be functors. The comma category, written (F↓G), is the category: with objects Σa:A,b:B.C[F(a),G(b)] with morphisms from (a1,b1,f1:F(a1)→G(b1)) to (a2,b2,f2:F(a2)→G(b2)) given by pairs (α:a1→a2, β:b1→b2) such that G(β)∘f1=f2∘F(α). F(a1)G(b1)F(a2)G(b2)F(®)f1G(¯)f2