2-natural transformation?
The notion of comma object or comma square is a generalization of the notion of pullback or pullback square from category theory to 2-category theory: it is a special kind of 2-limit.
Where a pullback involves a commuting square, for a comma object this square is filled by a 2-morphism.
The comma object of two morphisms and in a 2-category is an object equipped with projections and and a 2-cell
which is universal in the sense of a 2-limit. Comma objects are also sometimes called lax pullbacks, but this term more properly refers to the lax limit of a cospan.
Part of this (to be explicit) is the statement that for any object , 1-morphisms , and 2-cell there is a 1-morphism and isomorphisms , such that modulo these isomorphisms, we have . There is also an additional “2-dimensional universality” saying that given and and 2-cells and such that , there exists a unique 2-cell such that and . Note that the 2-dimensional property implies that in the 1-dimensional property, the 1-morphism is unique up to unique isomorphism. A square containing a 2-cell with this property is sometimes called a comma square.
A strict comma object is analogous but has the universal property of a strict 2-limit. This means that given , , and as above, there exists a unique such that , , and . Note that any strict comma object is a comma object, but the converse is not in general true.
The comma object can be constructed by means of pullbacks and cotensors:
where is the cotensor of with the arrow category .
Suppose given a diagram
where the right-hand square is a comma square. Then the following are equivalent:
The proof is analogous to that at pullback.
In Cat, a comma category is a comma object (in fact a strict one, as normally defined); these give their name to the general notion.
Eduardo Pareja-Tobes?: Not sure about this but, with the strict definition I think you end up having specified isos all around at the level of morphisms; comma categories as normally defined are comma objects in Cat, but not strict ones (of course they’re equivalent to the strict ones). I remember reading something like this in Makkai-Paré Accessible categories book
Mike Shulman: As far as I can tell, they are strict. Given , functors , and a natural transformation , these data specify exactly for every , a triple which is an object of the comma category. Perhaps you are remembering a related remark about pseudo-pullbacks versus iso-comma objects? (If you post your comments at the nForum, for instance on this discussion, other people will be more likely to see it.)