In its usual form, the Eckmann–Hilton argument shows that a monoid object or group object internal to the category of monoids or Groups is commutative. In other terms, if a set is equipped with two monoid structures, such that one is a homomorphism for the other, then the two structures coincide and the resulting monoid is commutative.
From the nPOV, we may want to think of the statement in this way:
Let $C$ be a 2-category and $x \in C$ an object. Write $Id_x$ for the identity morphism of $X$ and $End(Id_x)$ for the set of endo-2-morphisms on $X$. Then:
horizontal composition and vertical composition define the same monoid object structure on $End(Id_x)$;
this is an abelian monoid.
On the face of it, this is a special case of the general situation, although in fact every case is an example for appropriate $C$.
A more general version is this: If a set is equipped with two binary operations with identity elements, as long as they commute with each other in the sense that one is (with respect to the other) a homomorphism of sets with binary operations, then everything else follows:
This can also be internalised in any monoidal category.
String diagrams allow an almost trivial proof. Since there is only one object, and the only 1-morphism is the identity, the diagram of $a \circ b$ (vertical composition) is simply two dots labelled $a, b$ arranged vertically. This diagram can be morphed continuously to a horizontal arrangement, which is the diagram for $a * b$ (horizontal composition). This is then morphed to $a$ below $b$, which is the diagram for $b \circ a$.
A pasting diagram-proof of is depicted in Cheng below. Here we prove the $6$-element general form in $Set$.
The basic equation that we have (that one operation $*$ is a homomorphism with respect to another operation $\circ$) is
In $End(Id_x)$, this is the exchange law.
We prove the list of results from above in order:
Simply read the basic equation backwards to see that $\circ$ is a homomorphism with respect to $*$.
Then
so the identities are the same; we will now write this identity simply as $1$.
Now
so the operations are the same; we will write them both with concatenation.
Then
so this operation is commutative.
Finally,
so the operation is associative.
If you start with a monoid object in $Mon$, then only (4&5) need to be shown; the others are part of the hypothesis. This classic form of the Eckmann–Hilton argument may be combined into a single calculation:
where the desired results involve the first, middle, and last expressions.
A $2$-tuply monoidal $0$-category, if defined as a pointed simply connected bicategory, is also the same as an abelian monoid.
A $2$-tuply monoidal $1$-category, if defined as a pointed simply connected tricategory, is the same as a braided monoidal category.
Every homotopy group $\pi_n$ for $n \geq 2$ is abelian.
There are variations on the Eckmann-Hilton argument that do not assume units. For example, if a set is equipped with two symmetric $(a * b = b * a)$ and idempotent $(a * a = a)$ binary operations that commute with each other, then the operations coincide.
For example, we might consider the algebraic theory of convex spaces, and the algebraic theory of semilattices. These theories both contain symmetric idempotent operations: in the theory of convex spaces, take the operation $a * b=c_{0.5}(a,b)$. Thus there can be no commutative algebraic theory that includes these two theories without conflating them. Furthermore, in any conflated theory, all the dyadic rationals are the same, e.g.
This is relevant in computer science because probability is modelled by the free convex spaces monad, and non-determinism is modelled by the free semilattice monad. These monads are both commutative monads, but there can be no commutative monad that contains both these monads non-degenerately.
Due to
reviewed (somewhat imperfectly) in:
Expositions of the argument are given here:
The diagram proof is displayed here
and an animation of it is here
For higher analogues see within the discussion of commutative algebraic monads at:
Last revised on March 21, 2021 at 12:38:33. See the history of this page for a list of all contributions to it.