nLab
commutative diagram

Commutative diagrams

Idea

A commutative diagram is a diagram in which composition is path-independent?.

Definitions

Slick definition

For our purposes, a diagram D in a category C consists of a quiver J and a functor to C from the free category on J:

JDC,Ja quiver.J \overset{D}\to C ,\; J\;\text{a quiver}.

Then this diagram D commutes if this functor D factors (up to natural isomorphism) through a poset P:

JPCJC,Pa poset;J \to P \to C \;\cong\; J \to C ,\; P\;\text{a poset} ;

or equivalently (treating C as a strict category) if the functor factors up to equality through a proset Q:

JQCJC,Qa proset.J \to Q \to C \;\cong\; J \to C ,\; Q\;\text{a proset} .

In the above, we are identifying quivers, posets, and prosets with certain categories in the usual ways.

Elementary definition

Recall that a quiver J consists of a set V of vertices, a set E of edges, and two functions s,t:EV. Given a category C, a diagram D of shape J in a category C is consists of a map from V to the objects of C and a map from E to the morphisms of C, both denoted F, such that F(s(e))=S(F(e)) and F(t(e))=T(F(e)) for each edge e, where S,T are the source and target maps in C.

Recall that a path p in J consists of a list (v 0,v 1,,v n) of vertices and a list (e 1,,e n) of edges such that s(e i)=v i1 and t(e i)=v i for each i, where n is any natural number (possibly zero). We say that v 0 is the source of the path and that v n is its target. Given a path p and a diagram D, the composite of p under D is the composite F(e 1);;F(e n):F(v 0)F(v n) in C.

A diagram D commutes if, given any two vertices x,y in J and any two paths p,p with source x and target y, the composites of p and p under D are equal in C.

Revised on February 13, 2011 19:26:57 by Toby Bartels (75.88.68.70)