In mathematics, a comma category (a special case being a slice category) is a construction in category theory. It provides another way of looking at morphisms: instead of simply relating objects of a category to one another, morphisms become objects in their own right. This notion was introduced in 1963 by F. W. Lawvere (Lawvere, 1963 p. 36), although the technique did not become generally known until many years later. Several mathematical concepts can be treated as comma categories. Comma categories also guarantee the existence of some limits and colimits. The name comes from the notation originally used by Lawvere, which involved the comma punctuation mark. Although standard notation has changed since the use of a comma as an operator is potentially confusing, and even Lawvere dislikes the uninformative term "comma category" (Lawvere, 1963 p. 13), the name persists.
The most general comma category construction involves two functors with the same codomain. Often one of these will have domain 1 (the one-object one-morphism category). Some accounts of category theory consider only these special cases, but the term comma category is actually much more general.
Suppose that A , B , and C are categories, and S and T (for source and target) are functors:
We can form the comma category ( S ↓ T ) as follows:
The objects are all triples ( α , β , f ) with α an object in A , β an object in B , and f : S ( α ) → T ( β ) a morphism in C .The morphisms from ( α , β , f ) to ( α ′ , β ′ , f ′ ) are all pairs ( g , h ) where g : α → α ′ and h : β → β ′ are morphisms in A and B respectively, such that the following diagram commutes:Morphisms are composed by taking ( g , h ) ∘ ( g ′ , h ′ ) to be ( g ∘ g ′ , h ∘ h ′ ) , whenever the latter expression is defined. The identity morphism on an object ( α , β , f ) is ( i d α , i d β ) .
The first special case occurs when A = C , S is the identity functor, and B = 1 (the category with one object ∗ and one morphism). Then T ( ∗ ) = B for some object B in C . In this case, the comma category is written ( C ↓ B ) , and is often called the slice category over B or the category of objects over B . The objects ( α , ∗ , f ) can be simplified to pairs ( α , f ) , where f : α → B . Sometimes, f is denoted π α . A morphism from ( A , π A ) to ( A ′ , π A ′ ) in the slice category is then an arrow g : A → A ′ making the following diagram commute:
The dual concept to a slice category is a coslice category. Here, S has domain 1 and T is an identity functor. In this case, the comma category is often written ( A ↓ C ) , where A is the object of C selected by S . It is called the coslice category with respect to A , or the category of objects under A . The objects are pairs ( B , i B ) with i B : A → B . Given ( B , i B ) and ( B ′ , i B ′ ) , a morphism in the coslice category is a map h : B → B ′ making the following diagram commute:
S and T are identity functors on C (so A = B = C ). In this case, the comma category is the arrow category C → . Its objects are the morphisms of C , and its morphisms are commuting squares in C .
In the case of the slice or coslice category, the identity functor may be replaced with some other functor; this yields a family of categories particularly useful in the study of adjoint functors. For example, if T is the forgetful functor mapping an abelian group to its underlying set, and s is some fixed set (regarded as a functor from 1), then the comma category ( s ↓ T ) has objects that are maps from s to a set underlying a group. This relates to the left adjoint of T , which is the functor that maps a set to the free abelian group having that set as its basis. In particular, the initial object of ( s ↓ T ) is the canonical injection s → T ( G ) , where G is the free group generated by s .
An object of ( s ↓ T ) is called a morphism from s to T or a T -structured arrow with domain s in. An object of ( S ↓ t ) is called a morphism from S to t or a S -costructured arrow with codomain t in.
Another special case occurs when both S and T are functors with domain 1. If S ( ∗ ) = A and T ( ∗ ) = B , then the comma category ( S ↓ T ) , written ( A ↓ B ) , is the discrete category whose objects are morphisms from A to B .
An inserter category is a (non-full) subcategory of the comma category where A = B and g = h are required. The comma category can also be seen as the inserter of S ∘ π 1 and T ∘ π 2 , where π 1 and π 2 are the two projection functors out of the product category A × B .
For each comma category there are forgetful functors from it.
Domain functor, S ↓ T → A , which maps:objects: ( α , β , f ) ↦ α ;morphisms: ( g , h ) ↦ g ;Codomain functor, S ↓ T → B , which maps:objects: ( α , β , f ) ↦ β ;morphisms: ( g , h ) ↦ h .Arrow functor, S ↓ T → C ↓ , which maps:objects: ( α , β , f ) ↦ f ;morphisms: ( g , h ) ↦ ( S g , T h ) ;Several interesting categories have a natural definition in terms of comma categories.
The category of pointed sets is a comma category, ( ∙ ↓ S e t ) with ∙ being (a functor selecting) any singleton set, and S e t (the identity functor of) the category of sets. Each object of this category is a set, together with a function selecting some element of the set: the "basepoint". Morphisms are functions on sets which map basepoints to basepoints. In a similar fashion one can form the category of pointed spaces ( ∙ ↓ T o p ) .The category of associative algebras over a ring R is the coslice category ( R ↓ R i n g ) , since any ring homomorphism f : R → S induces an associative R -algebra structure on S , and vice versa. Morphisms are then maps h : S → T that make the diagram commute.The category of graphs is ( S e t ↓ D ) , with D : S e t → S e t the functor taking a set s to s × s . The objects ( a , b , f ) then consist of two sets and a function; a is an indexing set, b is a set of nodes, and f : a → ( b × b ) chooses pairs of elements of b for each input from a . That is, f picks out certain edges from the set b × b of possible edges. A morphism in this category is made up of two functions, one on the indexing set and one on the node set. They must "agree" according to the general definition above, meaning that ( g , h ) : ( a , b , f ) → ( a ′ , b ′ , f ′ ) must satisfy f ′ ∘ g = T ( h ) ∘ f . In other words, the edge corresponding to a certain element of the indexing set, when translated, must be the same as the edge for the translated index.Many "augmentation" or "labelling" operations can be expressed in terms of comma categories. Let S be the functor taking each graph to the set of its edges, and let A be (a functor selecting) some particular set: then ( S ↓ A ) is the category of graphs whose edges are labelled by elements of A . This form of comma category is often called objects S -over A - closely related to the "objects over A " discussed above. Here, each object takes the form ( B , π B ) , where B is a graph and π B a function from the edges of B to A . The nodes of the graph could be labelled in essentially the same way.A category is said to be locally cartesian closed if every slice of it is cartesian closed (see above for the notion of slice). Locally cartesian closed categories are the classifying categories of dependent type theories.Limits and universal morphisms
Colimits in comma categories may be "inherited". If A and B are cocomplete, S : A → C is a cocontinuous functor, and T : B → C another functor (not necessarily cocontinuous), then the comma category ( S ↓ T ) produced will also be cocomplete. For example, in the above construction of the category of graphs, the category of sets is cocomplete, and the identity functor is cocontinuous: so graphs are also cocomplete - all (small) colimits exist. This result is much harder to obtain directly.
If A and B are complete, and both S : A → C and T : B → C are continuous functors, then the comma category ( S ↓ T ) is also complete, and the projection functors ( S ↓ T ) → A and ( S ↓ T ) → B are limit preserving.
The notion of a universal morphism to a particular colimit, or from a limit, can be expressed in terms of a comma category. Essentially, we create a category whose objects are cones, and where the limiting cone is a terminal object; then, each universal morphism for the limit is just the morphism to the terminal object. This works in the dual case, with a category of cocones having an initial object. For example, let C be a category with F : C → C × C the functor taking each object c to ( c , c ) and each arrow f to ( f , f ) . A universal morphism from ( a , b ) to F consists, by definition, of an object ( c , c ) and morphism ρ : ( a , b ) → ( c , c ) with the universal property that for any morphism ρ ′ : ( a , b ) → ( d , d ) there is a unique morphism σ : c → d with F ( σ ) ∘ ρ = ρ ′ . In other words, it is an object in the comma category ( ( a , b ) ↓ F ) having a morphism to any other object in that category; it is initial. This serves to define the coproduct in C , when it exists.
Lawvere showed that the functors F : C → D and G : D → C are adjoint if and only if the comma categories ( F ↓ i d D ) and ( i d C ↓ G ) , with i d D and i d C the identity functors on D and C respectively, are isomorphic, and equivalent elements in the comma category can be projected onto the same element of C × D . This allows adjunctions to be described without involving sets, and was in fact the original motivation for introducing comma categories.
If the domains of S , T are equal, then the diagram which defines morphisms in S ↓ T with α = β , α ′ = β ′ , g = h is identical to the diagram which defines a natural transformation S → T . The difference between the two notions is that a natural transformation is a particular collection of morphisms of type of the form S ( α ) → T ( α ) , while objects of the comma category contains all morphisms of type of such form. A functor to the comma category selects that particular collection of morphisms. This is described succinctly by an observation by Huq that a natural transformation η : S → T , with S , T : A → C , corresponds to a functor A → ( S ↓ T ) which maps each object α to ( α , α , η α ) and maps each morphism g to ( g , g ) . This is a bijective correspondence between natural transformations S → T and functors A → ( S ↓ T ) which are sections of both forgetful functors from S ↓ T .
