Commutative diagram

In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. Commutative diagrams play the role in category theory that equations play in algebra (see Barr–Wells, Section 1.7).

Description

Parts of the diagram:

objects (also known as vertices)
morphisms (also known as arrows or edges)
path or composition

Arrow symbols

In algebra texts, the type of morphism can be denoted with different arrow usages:

monomorphisms with a $\hookrightarrow$
epimorphisms with a $\twoheadrightarrow$
isomorphisms with a ${\overset {\sim }{\rightarrow }}$ .
the dashed arrow typically represents the claim that the indicated morphism exists whenever the rest of the diagram holds; the arrow may optionally be labeled $\exists$ $\exists$ .
- If the dashed arrow is labeled $!$ or $\exists !$ , the morphism is furthermore unique.

These conventions are common enough that texts often do not explain the meanings of the different types of arrow.

Verifying commutativity

Commutativity makes sense for a polygon of any finite number of sides (including just 1 or 2), and a diagram is commutative if every polygonal subdiagram is commutative.

Note that a diagram may be non-commutative, i.e., the composition of different paths in the diagram may not give the same result.

Phrases

Phrases like "this commutative diagram" or "the diagram commutes" may be used.

Examples

In the bottom-left diagram, which expresses the first isomorphism theorem, commutativity means that $f={\tilde {f}}\circ \pi$ while in the bottom-right diagram, commutativity of the square means $h\circ f=k\circ g$ :

For the diagram below to commute, we must have the three equalities: (1) $\;r\circ h\circ g=H\circ G\circ l,$ (2) $\;m\circ g=G\circ l,$ and (3) $\;r\circ h=H\circ m$ . Since the first equality follows from the last two, for the diagram to commute it suffices to show (2) and (3). However, since equality (3) does not generally follow from the other two equalities, for this diagram to commute it is generally not enough to only have equalities (1) and (2).

Diagram chasing

Diagram chasing (also called diagrammatic search) is a method of mathematical proof used especially in homological algebra. Given a commutative diagram, a proof by diagram chasing involves the formal use of the properties of the diagram, such as injective or surjective maps, or exact sequences. A syllogism is constructed, for which the graphical display of the diagram is just a visual aid. It follows that one ends up "chasing" elements around the diagram, until the desired element or result is constructed or verified.

Examples of proofs by diagram chasing include those typically given for the five lemma, the snake lemma, the zig-zag lemma, and the nine lemma.

In higher category theory

In higher category theory, one considers not only objects and arrows, but arrows between the arrows, arrows between arrows between arrows, and so on ad infinitum. For example, the category of small categories Cat is naturally a 2-category, with functors as its arrows and natural transformations as the arrows between functors. In this setting, commutative diagrams may include these higher arrows as well, which are often depicted in the following style: $\Rightarrow$ . For example, the following (somewhat trivial) diagram depicts two categories C and D, together with two functors F, G : C → D and a natural transformation α : F ⇒ G:

There are two kinds of composition in a 2-category (called vertical composition and horizontal composition), and they may also be depicted via pasting diagrams, see 2-category#Definition for examples.

Diagrams as functors

A commutative diagram in a category C can be interpreted as a functor from an index category J to C; one calls the functor a diagram.

More formally, a commutative diagram is a visualization of a diagram indexed by a poset category:

one draws a node for every object in the index category,
an arrow for a generating set of morphisms,
omitting identity maps and morphisms that can be expressed as compositions,
and the commutativity of the diagram (the equality of different compositions of maps between two objects) corresponds to the uniqueness of a map between two objects in a poset category.

Conversely, given a commutative diagram, it defines a poset category:

the objects are the nodes,
there is a morphism between any two objects if and only if there is a (directed) path between the nodes,
with the relation that this morphism is unique (any composition of maps is defined by its domain and target: this is the commutativity axiom).

However, not every diagram commutes (the notion of diagram strictly generalizes commutative diagram): most simply, the diagram of a single object with an endomorphism ( $f\colon X\to X$ ), or with two parallel arrows ( $\bullet \rightrightarrows \bullet$ , that is, $f,g\colon X\to Y$ , sometimes called the free quiver), as used in the definition of equalizer need not commute. Further, diagrams may be messy or impossible to draw when the number of objects or morphisms is large (or even infinite).

References

Adámek, Jiří; Horst Herrlich; George E. Strecker (1990). Abstract and Concrete Categories (PDF). John Wiley & Sons. ISBN 0-471-60922-6. Now available as free on-line edition (4.2MB PDF).
Barr, Michael; Wells, Charles (2002). Toposes, Triples and Theories (PDF). ISBN 0-387-96115-1. Revised and corrected free online version of Grundlehren der mathematischen Wissenschaften (278) Springer-Verlag, 1983).

External links

Diagram Chasing at MathWorld
WildCats is a category theory package for Mathematica. Manipulation and visualization of objects, morphisms, categories, functors, natural transformations.