DEFINITION

The most general comma category construction involves two converging having only one object is used.)

General form

Suppose that

\mathcal{A}

\mathcal{B}

, and

\mathcal{C}

are categories, and

T

and

S

are Functor s
:
We can form the comma category

(T \downarrow S)

as follows:

The objects are triples $(\alpha, \beta, f)$ , with $\alpha$ an object in $\mathcal{A}$ , $\beta$ an object in $\mathcal{B}$ , and $f : T(\alpha)
ightarrow S(\beta)$ a morphism in $\mathcal{C}$ .

The morphisms from $(\alpha, \beta, f)$ to $(\alpha', \beta', f')$ are pairs $(g, h)$ where $g : \alpha
ightarrow \alpha'$ and $h : \beta
ightarrow \beta'$ are morphisms in $\mathcal A$ and $\mathcal B$ respectively, such that the following diagram Commutes :

Morphisms are composed by taking

(g, h) \circ (g', h')

to be

(g \circ g', h \circ h')

, whenever the latter expression is defined.

Category of objects under A

The first special case occurs with

T

being a selection functor, and

S

an identity functor (so

\mathcal{B} = \mathcal{C}

). (Then

T(\alpha) = A

for some ''fixed''

A

\mathcal{C}

and every

\alpha

\mathcal{A}

). We then have the category of ''objects under

A

'', sometimes called ''objects co-over

A

'', written

(A \downarrow \mathcal{C})

. This is also known as the ''coslice category'' with respect to

A

. The objects

(\alpha, \beta, f)

can be simplified to

(\beta, f)

, since fixing

A

makes

\alpha

irrelevant; and

f : T(\alpha) 
ightarrow S(\beta)

simplifies to

f : A 
ightarrow \beta

- often,

f

is called something like

i_\beta

, to indicate injection. In a similar way, morphisms like

(g, h) : (B, i_B) 
ightarrow (B', i_{B'})

reduce to simply

h : B 
ightarrow B'

, as

g

is just the identity morphism on

A

. The following must be a commutative diagram:

Category of objects over A

Similarly,

T

might be an identity functor and

S

a selection functor: this is the category of ''objects over

A

'' (where

A

is the object of

\mathcal{C}

selected by

S

), written

(\mathcal{C} \downarrow A)

. This is also known as the ''slice category'' over

A

. It is the Dual concept to objects-under-

A

. The objects are pairs

(\beta, \pi_\beta)

with

\pi_\beta : \beta 
ightarrow A

; the

\pi

stands for projection onto

A

. Given

(B, \pi_B)

and

(B', \pi_{B'})

, a morphism in the comma category is a map

g : B 
ightarrow B'

making the following diagram commute:

Other variations

In either of these two cases, the identity functor may be replaced with some other functor; this yields a family of categories particularly useful in the study of Adjoint Functor s. For example, if

S

is the Forgetful Functor mapping an Abelian Group to its underlying Set , and

t

is the set selected by

T

, then

(t \downarrow S)

is a comma category whose objects are maps from

t

to certain sets. This relates to the left adjoint of

S

, which is the functor that maps a set to the Free Abelian Group having that set as its basis: some of the objects of

(t \downarrow S)

will be sets underlying such groups.

Another special case occurs when both

S

and

T

are selection functors. If

S

selects

A

and

T

selects

B

, then the comma category produced is equivalent to the set of morphisms between

A

and

B

. (Strictly, it is a discrete category - all the morphisms are identity morphisms - which may be identified with the set of its objects.)

EXAMPLES OF USE

Some notable categories

Several interesting categories have a natural definition in terms of comma categories.

The category of s $(\bull \downarrow \mathbf{Top})$ .

The category of Graphs is $(\mathbf{Set} \downarrow D)$ , with $D : \mathbf{Set}
ightarrow \mathbf{Set}$ the functor taking a set $s$ to $s imes 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 \mapsto (b imes b)$ chooses pairs of elements of $b$ for each input from $a$ . That is, $f$ picks out certain edges from the set $b imes 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) \mapsto (a', b', f')$ must satisfy $f' \circ g = S(h) \circ 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 $T$ be the functor taking each graph to the set of its edges, and let $A$ be (a functor selecting) some particular set: then $(T \downarrow A)$ is the category of graphs whose edges are labelled by elements of $A$ . This form of comma category is often called ''objects $T$ -over $A$ '' - closely related to the "objects over $A$ " discussed above. Here, each object takes the form $(B, \pi_B)$ , where $B$ is a graph and $\pi_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". There is a theorem which says that if

\mathcal{A}

and

\mathcal{B}

are cocomplete,

T : \mathcal{A} 
ightarrow \mathcal{C}

is a cocontinuous functor, and

S : \mathcal{B} 
ightarrow \mathcal{C}

another functor (not necessarily cocontinuous), then the comma category

(T \downarrow S)

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) limits exist. This result is much harder to obtain directly. See Limit (category Theory) for more information on the terminology used in this example.

The notion of a in

\mathcal{C}

, when it exists.

Adjunctions

Lawvere showed that the functors

F : \mathcal{C} 
ightarrow \mathcal{D}

and

G : \mathcal{D} 
ightarrow \mathcal{C}

are Adjoint if and only if the comma categories

(F \downarrow \mathcal{D})

and

(\mathcal{C} \downarrow G)

are isomorphic, and equivalent elements in the comma category can be projected onto the same element of

\mathcal{C} 	imes \mathcal{D}

. This allows adjunctions to be described without involving sets, and was in fact the original motivation for introducing comma categories.

Articles about Comma Category


Template:user Comma-splice	Template:user Serial Comma	Template:user Serial Comma:no
Template:user Serial Comma:sometimes	Template:user Serial Comma:yes

	APPAREL
	BABY
	BEAUTY
	BOOKS
	CAR TOYS
	CELL PHONES
	DVD'S
	ELECTRONICS
	GOURMET FOOD
	GROCERIES
	HEALTH & PERSONAL
	HOME & GARDEN
	JEWELRY
	MUSIC
	MUSIC INSTRUMENTS
	OFFICE PRODUCTS
	SOFTWARE
	SPORTING GOODS
	TOOLS & HARDWARE
	TOYS
	VIDEO GAMES
	SHOPPING HOME

	MORE SHOPPING...

Information About

Comma Category

Articles about Comma Category