Jump to content

Mac Lane coherence theorem

From Wikipedia, the free encyclopedia

In category theory, a branch of mathematics, Mac Lane's coherence theorem states, in the words of Saunders Mac Lane, “every diagram commutes”.[1] This result was once thought to be the essence of the coherence theorem, but regarding a result about certain commutative diagrams, Kelly argued that, "no longer be seen as constituting the essence of a coherence theorem".[2][3] More precisely (cf. #Counter-example), it states every "formal diagram",[note 1] where "formal diagram" is an analog of well-formed formulae and terms in proof theory.

The theorem can be stated as a strictification result; namely, every monoidal category is monoidally equivalent to a strict monoidal category.[5]

Proof

[edit]

Coherence condition (Monoidal category)

[edit]
  • Let a bifunctor called the tensor product, a natural isomorphism , called the associator:
  • Also, let an identity object and has a left identity, a natural isomorphism called the left unitor:
as well as, let has a right identity, a natural isomorphism called the right unitor:
.

Since there are many ways to construct an isomorphism using the above natural isomorphisms, they impose a condition called the coherence condition on the above natural isomorphisms. If the above isomorphisms satisfies the following conditions, they are called coherence conditions: the arrows constructed by get tensor products and compositions from identity morphisms, natural isomorphisms, and their inverses are equal, if their domains and codomains of the arrows are same.[6][7] If the coherence condition is satisfied, then no matter how they construct the isomorphism, they will always end up with the same isomorphism. That is, the coherence conditions imply commutativity of all "formal diagrams" that one can build from the constraints.[5]

Pentagon and triangle identity (Coherence axiom)

[edit]

To satisfy the coherence condition, it is enough to prove just the pentagon identity for associativity and triangle identity for identities,[5][8] which is essentially the same as what is stated in Kelly's (1964) paper.[6]

Mac Lane coherence theorem for monoidal category

[edit]

Mac Lane coherence theorem: In a monoidal category (), every diagram whose vertices come from words in and and whose edges come from the natural isomorphisms commute.[9][10] To prove this theorem, it is enough to show that the pentagon and triangle identities hold.

Counter-example

[edit]

It is not reasonable to expect we can show literally every diagram commutes, due to the following example of Isbell.[11]

Let be a skeleton of the category of sets and D a unique countable set in it; note by uniqueness. Let be the projection onto the first factor. For any functions , we have . Now, suppose the natural isomorphisms are the identity; in particular, that is the case for . Then for any , since is the identity and is natural,

.

Since is an epimorphism, this implies . Similarly, using the projection onto the second factor, we get and so , which is absurd.

See also

[edit]

Notes

[edit]
  1. ^ Mac Lane 1998, Ch VII, § 2.
  2. ^ Kelly 1974, 1.2
  3. ^ Power 1989, 1. Introduction
  4. ^ Johnson & Yau 2020
  5. ^ a b c Schauenburg 2001
  6. ^ a b Kelly 1964
  7. ^ Laplaza 1972b
  8. ^ Joyal & Street 1986
  9. ^ Loday & Vallette 2012
  10. ^ Yau & Johnson 2024, Theorem 1.3.3
  11. ^ Mac Lane 1998, Ch VII. the end of § 1.

References

[edit]

Further reading

[edit]

Footnote

[edit]
  1. ^ A formal diagram is a diagram that involves only the associativity isomorphism, the unit isomorphisms, their inverses, identity morphisms, the monoidal product, and composites commutes.[4]
[edit]