Commutative diagram

For help on drawing commutative diagrams on Wikipedia, see meta:Help:Displaying a formula#Commutative_diagrams.

In mathematics, especially the many applications of category theory, a commutative diagram is a diagram of objects and morphisms such that, when picking two objects, one can follow any path through the diagram and obtain the same result by composition. Commutative diagrams play the role in category theory that equations play in algebra.

Examples

The first isomorphism theorem is a commutative triangle as follows:

Since Failed to parse (Missing texvc executable; please see math/README to configure.): f = h \circ \varphi , the left diagram is commutative; and since Failed to parse (Missing texvc executable; please see math/README to configure.): \varphi = k \circ f , so is the right diagram.

Image:FourCommDiag.svg

Similarly, the square above is commutative if Failed to parse (Missing texvc executable; please see math/README to configure.): y \circ w = z \circ x .

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.

Diagram chasing

Diagram chasing is a method of mathematical proof used especially in homological algebra. Given a commutative diagram, a proof by diagram chasing involves formally using 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. 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.

External links

• Diagram Chasing at MathWorldde:Kommutatives Diagramm

fr:Diagramme commutatif it:Diagramma commutativo he:דיאגרמה (תורת הקטגוריות)