World Library  
Flag as Inappropriate
Email this Article

Commutative diagram

Article Id: WHEBN0000138484
Reproduction Date:

Title: Commutative diagram  
Author: World Heritage Encyclopedia
Language: English
Subject: Category theory, Bialgebra, Homological algebra, Five lemma, Coalgebra
Collection: Category Theory, Diagrams, Homological Algebra, Mathematical Proofs, Mathematical Terminology
Publisher: World Heritage Encyclopedia

Commutative diagram

The commutative diagram used in the proof of the five lemma.

In mathematics, and especially in category theory, a commutative diagram is a diagram of objects (also known as vertices) and morphisms (also known as arrows or edges) such that all directed paths in the diagram with the same start and endpoints lead to the same result by composition. Commutative diagrams play the role in category theory that equations play in algebra (see Barr-Wells, Section 1.7).

Note that a diagram may not be commutative, i.e., the composition of different paths in the diagram may not give the same result. For clarification, phrases like "this commutative diagram" or "the diagram commutes" may be used.


  • Examples 1
    • Symbols 1.1
  • Verifying commutativity 2
  • Diagram chasing 3
  • Diagrams as functors 4
  • See also 5
  • References 6
  • External links 7


In the following diagram expressing the first isomorphism theorem, commutativity means that f = \tilde{f} \circ \pi:

Below is a generic commutative square, in which h \circ f = k \circ g


In algebra texts, the type of morphism can be denoted with different arrow usages: monomorphisms with a \hookrightarrow, epimorphisms with a \twoheadrightarrow, and 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. 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.

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 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.

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).

See also


External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.