Eckmann-Hilton argument #
The Eckmann-Hilton argument says that if a type carries two monoid structures that distribute
over one another, then they are equal, and in addition commutative.
The main application lies in proving that higher homotopy groups (πₙ
for n ≥ 2
) are commutative.
Main declarations #
EckmannHilton.commMonoid
: If a type carries a unital magma structure that distributes over a unital binary operation, then the magma is a commutative monoid.EckmannHilton.commGroup
: If a type carries a group structure that distributes over a unital binary operation, then the group is commutative.
If a type carries two unital binary operations that distribute over each other, then they have the same unit elements.
In fact, the two operations are the same, and give a commutative monoid structure,
see eckmann_hilton.CommMonoid
.
If a type carries two unital binary operations that distribute over each other, then these operations are equal.
In fact, they give a commutative monoid structure, see eckmann_hilton.CommMonoid
.
If a type carries two unital binary operations that distribute over each other, then these operations are commutative.
In fact, they give a commutative monoid structure, see eckmann_hilton.CommMonoid
.
If a type carries two unital binary operations that distribute over each other, then these operations are associative.
In fact, they give a commutative monoid structure, see eckmann_hilton.CommMonoid
.
If a type carries a unital magma structure that distributes over a unital binary operation, then the magma structure is a commutative monoid.
Instances For
If a type carries a unital additive magma structure that distributes over a unital binary operation, then the additive magma structure is a commutative additive monoid.
Instances For
If a type carries a group structure that distributes over a unital binary operation, then the group is commutative.
Instances For
If a type carries an additive group structure that distributes over a unital binary operation, then the additive group is commutative.