commutative diagram
collection of maps in which all map compositions starting from the same set and ending with the same set give the same result
≈ 3 min read
Names in other languages
- Русскийкоммутативная диаграмма
- Françaisdiagramme commutatif
- Englishcommutative diagram
- Portuguêsdiagrama comutativo
- עבריתדיאגרמה קומוטטיבית
- Polskidiagram przemienny
- 简体中文交换图表
- 繁體中文交換圖表
- 中文交換圖表
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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. It is said that commutative diagrams play the role in category theory that equations play in algebra.
Description
A commutative diagram often consists of three parts: objects (also known as vertices) morphisms (also known as arrows or edges) paths or composites
Arrow symbols
In algebra texts, the type of morphism can be denoted with different arrow usages: A monomorphism may be labeled with a \hookrightarrow or a \rightarrowtail . An epimorphism may be labeled with a \twoheadrightarrow . An isomorphism may be labeled 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 be optionally labeled as \exists . If the morphism is in addition unique, then the dashed arrow may be labeled ! or \exists! .
If the morphism acts between two arrows (such as in the case of higher category theory), it's called preferably a natural transformation and may be labelled as \Rightarrow (as seen below in this article). The meanings of different arrows are not entirely standardized: the arrows used for monomorphisms, epimorphisms, and isomorphisms are also used for injections, surjections, and bijections, as well as the cofibrations, fibrations, and weak equivalences in a model category.
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.
Example 1
In the left diagram, which expresses the first isomorphism theorem, commutativity of the triangle means that f = \tilde{f} \circ \pi . In the right diagram, commutativity of the square means h \circ f = k \circ g .
Example 2
In order for the diagram below to commute, three equalities must be satisfied: r \circ h \circ g = H \circ G \circ l m \circ g = G \circ l r \circ h = H \circ m Here, since the first equality follows from the last two, it suffices to show that (2) and (3) are true in order for the diagram to commute. However, since equality (3) generally does not follow from the other two, it is generally not enough to have only equalities (1) and (2) if one were to show that the diagram commutes.
Diagram chasing
Diagram chasing (also called diagrammatic search) is a method of mathematical proof used especially in homological algebra, where one establishes a property of some morphism by tracing the elements of a commutative diagram. A proof by diagram chasing typically 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.
Bibliography
Now available as free on-line edition (4.2MB PDF). Revised and corrected free online version of Grundlehren der mathematischen Wissenschaften (278) Springer-Verlag, 1983).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1335445864 under CC BY-SA 4.0; modifications have been made.