18 Equation 1729
In this chapter we study magmas that obey equation 1729,
for all \(x,y\). Using the squaring operator \(Sy := y \diamond y\) and the left and right multiplication operators \(L_y x := y \diamond x\) and \(R_y x = x \diamond y\), this law can be written as
This implies that \(L_y\) is injective and \(L_{Sy}\) is surjective, hence \(L_{Sy}\) is invertible. If \(y\) is a square (i.e., \(y \in SM\)), then \(L_y\) and \(L_{Sy}\) are both invertible, hence now \(R_y\) is also invertible, with inverse \(R_y^{-1} = L_y L_{Sy}\). We rewrite this as
for all \(y \in SM\).
We have the following procedure for extending a small magma \(SM\) obeying Equation 1 to a larger one \(M\):
Let \(SM\) be a magma obeying 1729, and let \(N\) be another set disjoint from \(SM\), and set \(M := SM \uplus N\). Suppose that we have a squaring map \(S: N \to SM\), and bijections \(L_a, R_a: N \to N\) for all \(a \in SM\) (which, by abuse of notation, we will denote with the same symbols as the squaring map \(S\) and left and right multiplication operators \(L_a,R_a\) on \(SM\)), obeying the following axioms:
(i) For all \(a \in SM\), we have \(L_a = R_a^{-1} L_{Sa}^{-1}\).
(ii) For all \(y \in N\), the elements \(R_a y \in N\) are distinct from each other and from \(y\) as \(a \in SM\) varies.
(iii) If \(R_a x = y\) for some \(a \in SM\) and some \(x,y \in N\), then \(L_{Sy} L_{R_{Sx}^{-1} a} y = x\).
(iv) For all \(x \in N\), we have \(L_{Sx}^2 x = x\).
Suppose also that we have an operation \(\diamond ': N \times N \to M\) obeying the following axioms:
(v) For all \(x \in N\), we have \(x \diamond ' x = Sx\).
(vi) For all \(y \in N\) and \(a \in SM\), we have \(R_a y \diamond ' y = L_{Sy}^{-1} a\).
(vii) For all \(x,y \in N\) with \(x \diamond ' y\) not already covered by rules (iv) or (v), we have \(x \diamond ' y = z\) for some \(z \in N\). Furthermore, \(z \diamond ' x = L_{Sx}^{-1} y\).
Then one can endow \(M\) with an operation \(\diamond '': M \times M \to M\) obeying 1729 defined as follows:
If \(a,b \in SM\), then \(a \diamond '' b = a \diamond b\).
If \(a \in SM\) and \(x \in N\), then \(a \diamond '' b := L_a b\).
If \(x \in N\) and \(a \in SM\), then \(b \diamond '' a := R_a b\).
If \(x,y \in N\), then \(x \diamond '' y := x \diamond ' y\).
Furthermore, the 817 law \(S^2 x \diamond '' x = x\) fails for any \(x \in N\).
We need to show that \(\diamond ''\) verifies the law Equation 1. In the case when \(x,y \in SM\), then the claim follows from the fact that \(SM\) already obeyed this equation. If \(x\) was equal to an element \(a \in SM\) and \(y \in N\), then by construction the law is equivalent to \(L_{Sa} R_a S_a y = y\), which follows from axiom (i).
Now suppose that \(x \in N\) and \(y\) is equal to some element \(a\) of \(SM\). From axiom (v) we have \(x \diamond '' x = Sx\), and then this case of Equation 1 becomes
which follows from axiom (vi). So the only remaining case is when \(x,y \in N\). Using axiom (ii), we can divide into cases:
Case 1: \(x=y\). Then by (v) we need to show that \(L_{Sx} L_{Sx} x = x\), which follows from axiom (iv).
Case 2: \(y = R_a x\) for some \(a \in SM\). Then by axiom (vi), we need to show that \(L_{Sy} L_{L_{Sx}^{-1} a} y = x\), which follows from axiom (iii).
Case 3: We are not in case 1 or case 2. Then by axiom (vii), we have \(y \diamond '' x = z\) for some \(z \in N\) with \(z \diamond '' y = L_{Sy}^{-1} x\). But this implies \(L_{Sy} (z \diamond '' y) = x\), which is Equation 1.
We have now verified that \(\diamond ''\) obeys 1729. For any \(x \in N\), we have \(x \diamond '' S^2 x = R_{S^2 x} x\), and so the final claim follows from axiom (ii).
To build a magma obeying 1729 but not 817, it thus suffices to produce
a 1729 magma \(SM\);
a set \(N\) of “non-squares”;
a squaring map \(S: N \to SM\);
bijections \(L_a, R_a: N \to N\) for all \(a \in SM\) obeying the axioms (i)-(iv); and
an operation \(\diamond ': N \times N \to M\) obeying the axioms (v)-(vii).
We will take \(SM\) to be a countably infinite abelian group of exponent \(4\), generated by generators \(E_n\) for \(n \in \mathbb {N}\) subject to the relations \(4E_n=0\). Here the squaring operation \(S\) is just the doubling map \(Sa = 2a\), and the double squaring map is constant: \(S^2 a = 0\).
We take \(N\) to be the free non-abelian group with one generator \(e_a\) for each \(a \in SM\), then this is a countable set that we view as disjoint from \(SM\). We do not attempt to define the squaring map \(S: N \to SM\) at this point, but we define the right multiplication operators \(R_a\) using the group action, setting
for all \(a \in SM\) and \(x \in N\). Note that this automatically satisfies axiom (ii). We view \(N\) as an infinite Cayley graph rooted at the identity \(1\), with all other elements of \(N\) obtainable uniquely from \(1\) by a finite path with edges \(x \mapsto e_a x\).
What about left multiplication? From two applications of Equation 2 and the exponent 4 hypothesis we have
(Here we abuse notation by identifying \(e_a\) with the operation of left-multiplication by \(e_a\).) Thus, once \(L_0\) is specified, we can define \(L_a\) for all other \(a \in SM\) by the rule
Furthermore, from the \(a=0\) case of Equation 2 we must also have the axiom
(i’) \(L_0^2 = e_0^{-1}\),
which also implies the \(a=0\) case of Equation 4 (note that it implies \(L_0\) commutes with \(e_0\)); note also that this axiom and the bijectivity of \(e_0\) forces \(L_0\) to be a bijection, and hence by Equation 4 all of the \(L_a\) are bijections, so we can now drop the bijectivity requirements here. We leave the function \(L_0: N \to N\) unspecified for now, but observe that if axiom (i’) is obeyed, one can use Equation 4 as a definition of \(L_a\) for all other \(a\), so that axiom (i) is now a consequence of axiom (i’). We also observe from Equation 4 and (i’) that
We now write the other remaining axioms in terms of \(L_0\) rather than \(L_a\) using Equation 4, Equation 5, Equation 3, and the magma law on \(SM\):
(iii’) If \(e_a x = y\) for some \(a \in SM\) and some \(x,y \in N\), then \(e_{Sy} L_0 e_{2Sy}^{-1} e_{a - Sx} L_0 e_{2(R_{Sx}^{-1} a)}^{-1} y = x\).
(iv’) For all \(x \in N\), we have \(e_{Sx} L_0 e_{2Sx}^{-1} e_{Sx} L_0 e_{2Sx} x = x\).
(v) For all \(x \in N\), we have \(x \diamond ' x = Sx\).
(vi’) For all \(y \in N\) and \(a \in SM\), we have \(e_a y \diamond ' y = a - Sy\).
(vii’) For all \(x,y \in N\) with \(x \diamond ' y\) not already covered by rules (iv) or (v), we have \(x \diamond ' y = z\) for some \(z \in N\). Furthermore, \(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\).
Our task is now to find a function \(L_0: N \to N\) and an operation \(\diamond ': N \times N \to M\) obeying axioms (i’), (iii’), (iv’), (v), (vi’), (vii’).
We will again use a greedy construction for this, but with some modifications. Firstly, the axiom (i’) means that we cannot restrict \(L_0\) to be partially defined on just finitely many values: any relation of the form
for some \(x,y \in N\) would automatically imply that
and also
for all \(n \in \mathbb {Z}\). Thus, \(L_0\) becomes defined on two right cosets \(\langle e_0 \rangle x\), \(\langle e_0 \rangle y\) of \(N\), where \(\langle e_0 \rangle := \{ e_0^n: n \in \mathbb {Z}\} \) is an infinite cyclic subgroup of \(N\). In general, we will require that \(L_0\) is defined on a finite union of cosets of \(\langle e_0\rangle \).
In a somewhat similar vein, axiom (vii’), if iterated naively, would mean that a given entry \(x \diamond ' y = z\) of the multiplication table could potentially generate an infinite sequence of further entries, which unfortunately do not have as regular a pattern as the iterations Equation 6, Equation 7 of axiom (i’). So we will need to truncate this iteration by creating an addition category of “pending” identities of the form “\(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\)” for some \(x,y,z \in N\), which will be temporarily undefined because \(Sx\) is undefined.
More precisely, we define a partial solution to consist of the following data:
A partially defined function \(L_0: N \to N\), defined on a finite union of right cosets of \(\langle R_0\rangle \);
A partially defined operation \(\diamond ': N \times N \to M\), defined on a finite set;
A partially defined function \(S: N \to SM\), defined on a finite set;and
A finite collection of “pending identities”, which are strings of the form “\(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\)” for some \(x,y,z \in N\).
Furthermore, the following axioms are satisfied:
(i”) \(L_0 x\) is defined and equal to \(y\), then we have the identities Equation 6, Equation 7 for all \(n\in \mathbb {Z}\).
(S) If \(Sx\) is defined for some \(x \in N\), then \(Sy\) is defined for all \(y\) on the path in the Cayley graph connecting \(1\) to \(x\).
(iii”) If \(e_a x = y\) for some \(a \in SM\) and some \(x,y \in N\), and \(Sx, Sy\) are defined, then \(e_{Sy} L_0 e_{2Sy}^{-1} e_{a-Sx} L_0 e_{2(a-Sx)}^{-1} y\) is defined and equal to \(x\).
(iv”) If \(x \in N\) is such that \(Sx\) is defined, then \(e_{Sx} L_0 e_{2Sx}^{-1} e_{Sx} L_0 e_{2Sx} x\) is defined and equal to \(x\).
(v”) If \(x \in N\) and \(x \diamond ' x\) is defined, then \(Sx\) is defined and equal to \(x \diamond ' x\).
(vi”) For all \(y \in N\) and \(a \in SM\), if \(e_a y \diamond ' y\) is defined, then \(a - Sy\) is defined and equal to \(e_a y \diamond ' y\).
(vii”) For all \(x,y \in N\) and \(x\) is not equal to \(y\) or \(e_a y\) for any \(a \in SM\), and \(x \diamond ' y\) is defined, then it is equal to some \(z \in N\). Furthermore, either “\(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\)” is a pending identity, or else \(z \diamond ' x\) and \(e_{2Sx} L_0 e_0 e_{Sx} y\) are defined and equal to each other.
(P) If “\(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\)” is a pending identity, then \(x,y,z \in N\), and \(Sx\) and \(z \diamond ' x\) are undefined. Furthermore, \(z\) is not equal to \(x\) or \(e_a x\) for any \(a \in SM\).
A trivial example of a partial solution is obtained by setting \(L_0, \diamond ', S\) to be empty functions, and to have an empty set pending identities.
Now we seek to enlarge a partial solution. We first make an easy observation:
Suppose one has a partial solution in which \(L_0 x\) is undefined for some \(x \in N\). Then one can extend the partial solution so that \(L_0 x\) is now defined.
By axiom (i”), \(L_0 e_0^n x\) is undefined for every integer \(n\). Let \(d = E_m\) be a generator of \(SM\) that does not appear as a component of any index of any of the generators \(e_a\) appearing anywhere in the partial solution; such a \(d\) exists due to the finiteness hypotheses. We set \(L_0 x := e_d\), and then extend by Equation 6, Equation 7, thus
and
Because of the new nature of \(d\), no collisions in the partial function \(L_0\) are created by this operation. It is then easy to check that axiom (i”) is preserved by this operation, whereas none of the other axioms (S), (iii”), (iv”), (v”), (vi”), (vii”), (P) are affected by this extension.
Next, we provide a tool for enlarging the domain of definition of \(S\):
Suppose one has a partial solution in which \(Sx\) is undefined for some \(x \in N\). Then one can extend the partial solution so that \(Sx\) is now defined.
By iteration we may assume inductively that \(Sy\) is already defined for all \(y\) on the unique path in the Cayley graph from \(1\) to \(x\). (This hypothesis is vacuous if \(x=1\).) Let \(y_0\) be the parent of \(x\), that is to say the unique neighbor of \(x\) in the path to \(1\) (this is only defined for \(x \neq 1\)), then by axiom (i”) \(y_0\) is the unique neighbor for which \(Sy_0\) is defined, and we either have \(x = e_a y_0\) or \(e_a x = y_0\) for some \(a \in SM\).
Let \(d_0, d_1, d_2 \in SM\) be distinct generators \(E_{n_0}, E_{n_1}, E_{n_2}\) of \(SM\) that do not appear in the index \(a\) of any \(e_a\) that currently appears in the partial solution (of which there are only finitely many). We also set some further distinct generators \(d'_{y,z}, d''_{y,z} \in SM\) for \(y,z \in SM\) that are distinct from each other and all previous generators (this is possible as we have infinitely many generators). We set \(Sx := e_{d_0}\); this preserves axiom (S). In order to retain axiom (iv”), we now also set
and then extend these choices using Equation 6, Equation 7 to recover axiom (i’), thus for instance
and
for all \(n \in \mathbb {Z}\). To retain axiom (iii”), we perform the following actions:
If \(y_0\) is undefined, do nothing.
If \(e_a x = y_0\) for some \(a \in SM\), set \(L_0 e_{2(a-d_0)}^{-1} y_0 := e_{d_2}\) and \(L_0 e_{2Sy_0}^{-1} e_{a-d_0} e_{d_2} := e_{Sy_0}^{-1} x\). Then extend using Equation 6, Equation 7.
If \(x = e_a y_0\) for some \(a \in SM\), and \(L_0 e_{2(a-Sy_0)}^{-1} x\) is already defined, set \(L_0 e_{2d_0}^{-1} e_{a-Sy_0} L_0 e_{2(a-Sy_0)}^{-1} x :=e_{d_0}^{-1} x\), and extend using Equation 6, Equation 7.
If \(x = e_a y_0\) for some \(a \in SM\), and \(L_0 e_{2(a-Sy_0)}^{-1} x\) is not yet defined, set \(L_0 e_{2(a-Sy_0)}^{-1} x := e_{d_2}\) and \(L_0 e_{2d_0}^{-1} e_{a-Sy_0} e_{d_2} := e_{d_0}^{-1} x\), and extend using Equation 6, Equation 7.
To retain axiom (P), we perform the following actions for each pending identity of the form “\(z \diamond ' x = e_{2Sx} L_0 e_0 e_{Sx} y\)” for some \(y,z\), executed in some arbitrary order.
Remove this identity from the list of pending identities.
Set \(L_0 e_0 e_{d_0} y := e_{d'_{y,z}}\), and \(x' \diamond y' = z'\), where \((x',y',z') := (z, x, e_{2d_0} e_{d'_{y,z}})\).
If \(Sx'\) is undefined, add “\(z' \diamond ' x' = e_{2Sx'} L_0 e_0 e_{Sx'} y'\)” as a pending identity.
If instead \(Sx'\) is defined, but \(L_0 e_0 e_{Sx'} y'\) is undefined, set \(L_0 e_0 e_{Sx'} y' = e_{d''_{y,z}}\). Then set \(x'' \diamond y'' = z''\), where \((x'',y'',z'') := (z', x', e_{2Sx'} e_{d''_{y,z}})\). Then add “\(z'' \diamond ' x'' = e_{2Sx''} L_0 e_0 e_{Sx''} y''\)” as a pending identity.
If instead \(L_0 e_0 e_{Sx'} y'\) is defined, set \(x'' \diamond y'' = z''\), where \((x'',y'',z'') := (z', x', e_{2Sx'} L_0 e_0 e_{Sx'} y')\). Then add “\(z'' \diamond ' x'' = e_{2Sx''} L_0 e_0 e_{Sx''} y''\)” as a pending identity.
Extend all the new definitions of \(L_0\) using Equation 6, Equation 7.
One can check that these definitions do not cause any collisions in the partial function \(L_0\), and that axioms (i’), (iii’), (iv”), (vii’), (P) are preserved; the remaining axioms (v”), (vi’) are unaffected by this extension.
Finally, we give a tool for enlarging \(\diamond \):
Suppose one has a partial solution in which \(x \diamond ' y\) is undefined for some \(x,y \in N\). Then one can extend the partial solution so that \(x \diamond ' y\) is now defined.
By applying Proposition 18.3 as needed, we may assume without loss of generality that \(Sx\) and \(Sy\) are already defined (among other things, this removes the possibility that \(x \diamond ' y\) is part of a pending identity). If this makes \(x \diamond ' y\) defined, then we are done, so we may assume that this is not the case.
We now divide into cases:
Case 1: \(x=y\). In this case we set \(x \diamond ' y := Sx\). It is clear that this preserves axiom (v”), and no other axiom is impacted.
Case 2: If \(x = e_a y\) for some \(a \in SM\), then we set \(x \diamond ' y := a - Sy\). This preserves axiom (vi”), and no other axiom is impacted.
Case 3: If \(x\) is not equal to \(y\) or \(e_a y\) for any \(a \in SM\). Let \(d_0, d_1 \in SM\) be a generator that does not appear as a component of any index of any of the generators \(e_a\) appearing anywhere in the partial solution. We set \(x \diamond ' y := z\) with \(z := e_{d_0}\).
This temporarily disrupts axiom (vii”). To recover it, we perform the following actions.
If \(L_0 e_0 e_{Sx} y\) is not currently defined, we set it equal to \(e_{d_1}\), and extend by Equation 6, Equation 7.
Set \(x' \diamond y' = z'\), where \((x',y',z') := (z, x, e_{2Sx} L_0 e_0 e_{Sx} y)\).
Add “\(z' \diamond ' x' = e_{2Sx'} L_0 e_0 e_{Sx'} y'\)” as a pending identity.
One can check that these definitions do not cause any collisions in the partial function \(L_0\), and that axioms (i’), (vii’), (P) are preserved; the remaining axioms (S), (iii”), (iv”), (v”), (vi”) are unaffected by this extension.
There exists a magma that obeys equation 1729 but not equation 817.
Applying the above propositions alternatingly, we can end up with a situation in which \(S, \diamond ', L_0\) are all total functions, which by axiom (P) ensures that no pending identities remain. Invoking Theorem 18.1, we conclude the claim.