4 General implications
We will be interested in seeing which laws imply which other laws, in the sense that magmas obeying the former law automatically obey the latter. We will also be interested in anti-implications showing that one law does not imply another, by producing examples of magmas that obey the former law but not the latter. Here is a formal definition.
A law \(E\) is said to imply another law \(E'\) if \(\{ E\} \models E'\), or equivalently:
Two laws are said to be equivalent if they imply each other.
If we define \(E \leq E'\) if \(E\) implies \(E'\), then this is a pre-order on the set of laws, and equivalence is an equivalence relation.
Note that we view the stronger law as less than or equal to the weaker law. This is because the class of magmas that obey the stronger law is a subset of the class of magmas that obey the weaker law. It is also consistent with the conventions of Lean’s Mathlib.
Trivial.
Implications between the laws from Chapter 2 are depicted in Figure 4.1.
![\includegraphics[width=1\linewidth ]{../../images/subgraph.png}](images/img-0001.png)
The law \(0 \simeq 0\) is the maximal element in this pre-order.
Trivial.
The law \(0 \simeq 1\) is the minimal element in this pre-order.
Trivial.
Every magma \(G\) has a reversal \(G^{\mathrm{op}}\), formed by by replacing the magma operation \(\diamond \) with its opposite \(\diamond ^{\mathrm{op}}:(x,y) \mapsto y \diamond x\). There is a natural isomorphism between these magmas, which induces an involution \(w \mapsto w^{\mathrm{op}}\) on words \(w \in M_X\). Every law \(w \simeq w'\) then has a dual \(w^{\mathrm{op}} \simeq (w')^{\mathrm{op}}\).
For instance, the dual of the law \(0 \diamond 1 = 0 \diamond 2\) is \(1 \diamond 0 = 2 \diamond 0\), which after relabeling is \(0 \diamond 1 = 2 \diamond 1\). A list of equations and their duals can be found here. Of the 4694 equations under consideration, 84 are self-dual, leaving 2305 pairs of dual equations.
The pre-ordering on laws has a duality symmetry:
The law \(w \simeq w'\) implies \(w''\simeq w'''\), if and only if \(w^{\mathrm{op}} \simeq (w')^{\mathrm{op}}\) implies \(w''^{\mathrm{op}} \simeq (w''')^{\mathrm{op}}\).
This follows from the fact that a magma \(G\) satisfies a law \(w \simeq w'\) if and only if \(G^{\mathrm{op}}\) satisfies \(w^{\mathrm{op}} \simeq (w')^{\mathrm{op}}\).
Some equational laws can be “diagonalized”:
An equational law of the form
where \(x_1,\dots ,x_n\) and \(y_1,\dots ,y_m\) are distinct elements of the alphabet, implies the diagonalized law
where \(x'_1,\dots ,x'_n\) are distinct from \(x_1,\dots ,x_n\) In particular, if \(G(y_1,\dots ,y_m)\) can be viewed as a specialization of \(F(x'_1,\dots ,x'_n)\), then these two laws are equivalent.
From two applications of Equation 1 one has
and
whence the claim.
Thus for instance, Definition 2.7 is equivalent to Definition 2.2.
If \(w, w'\) each have order at least one, then the law \(w \simeq w'\) is implied by the constant law (Definition 2.20). If exactly one of \(w, w'\) has order zero, and the law \(w \simeq w'\) is not implied by the constant law.
Routine.
If \(w \simeq w'\) is such that every variable appears the same number of times in both \(w\) and \(w'\), and \(w \simeq w'\) implies another law \(w'' \simeq w'''\), then every variable appears the same number of times in both \(w''\) and \(w'''\).
Consider the magma \(\mathrm{MS}\) of multisets over an arbitrary set \(A\) (which can be seen as finitely supported maps \(A\rightarrow \mathbb {N}\)), with the multiset addition law \(+\). By hypothesis, this magma obeys \(w \simeq w'\), and hence \(w'' \simeq w'''\), giving the claim by comparing the orders of the elements of \(A\) appearing in \(w''\) and \(w'''\) in this magma.