Distributive biracks and solutions of the Yang-Baxter equation
P\v{r}emysl Jedli\v{c}ka, Agata Pilitowska, Anna Zamojska-Dzienio

TL;DR
This paper explores a new class of solutions to the Yang-Baxter equation called distributive biracks, demonstrating their properties and the nilpotency of their associated groups, thus broadening understanding of algebraic structures related to the equation.
Contribution
It introduces distributive biracks as a generalization of self-distributive solutions and analyzes their properties, including the nilpotency of their Yang-Baxter groups.
Findings
Yang-Baxter groups of these solutions are nilpotent
Distributive biracks generalize self-distributive solutions
Results are formulated using the language of biracks
Abstract
We investigate a class of non-involutive solutions of the Yang-Baxter equation which generalize self-distributive (derived) solutions. In particular, we study generalized multipermutation solutions in this class. We show that the Yang-Baxter (permutation) groups of such solutions are nilpotent. We formulate the results in the language of biracks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Distributive biracks and solutions of the Yang-Baxter equation
Přemysl Jedlička
,
Agata Pilitowska
and
Anna Zamojska-Dzienio
(P.J.) Department of Mathematics, Faculty of Engineering, Czech University of Life Sciences, Kamýcká 129, 16521 Praha 6, Czech Republic
(A.P., A.Z.) Faculty of Mathematics and Information Science, Warsaw University of Technology, Koszykowa 75, 00-662 Warsaw, Poland
Abstract.
We investigate a class of non-involutive solutions of the Yang-Baxter equation which generalize derived (self-distributive) solutions. In particular, we study generalized multipermutation solutions in this class. We show that the Yang-Baxter (permutation) groups of such solutions are nilpotent. We formulate the results in the language of biracks which allows us to apply universal algebra tools.
Key words and phrases:
Yang-Baxter equation, set-theoretic solution, multipermutation solution, birack, distributivity, nilpotency, congruences.
2010 Mathematics Subject Classification:
Primary: 16T25. Secondary: 20F18, 20B35, 08A30.
1. Introduction
The Yang-Baxter equation is a fundamental equation occurring in integrable models in statistical mechanics and quantum field theory [17]. Let be a vector space. A solution of the Yang–Baxter equation is a linear mapping such that
[TABLE]
Since description of all possible solutions seems to be extremely difficult, Drinfeld [4] introduced the following simplification.
Let be a basis of the space and let and be two mappings. We say that is a set-theoretic solution of the Yang–Baxter equation if the mapping extends to a solution of the Yang–Baxter equation. It means that , where satisfies the braid relation:
[TABLE]
A solution is called non-degenerate if the mappings and are bijections, for all . A solution is involutive if , and it is square free if , for every .
In [6, Section 3.2] Etingof, Schedler and Soloviev introduced, for each involutive solution , the equivalence relation on the set : for each
[TABLE]
They showed that the quotient set can be again endowed with a structure of an involutive solution. This does not work for non-involutive solutions. In [15] we showed that in the non-involutive case the role similar to the relation is played by the relation defined on the set as follows: for each
[TABLE]
We call a solution obtained on the set , the retraction of the solution and denote it by . A solution is said to be a multipermutation solution of level , if is the smallest integer such that .
Two types of solutions are particularly well studied: involutive solutions and derived solutions, i.e. those with all or all being the identity mappings. In [19] Lebed and Vendramin have thoroughly investigated injective solutions, which generalize involutive ones. In this paper, we focus on generalization of derived solutions given by distributive solutions.
The Yang-Baxter group of a solution is the group generated by all bijections and , for . There were several results for involutive solutions connecting properties of the Yang-Baxter group and multipermutation level of the solution [1, 2, 10, 11, 20, 22, 23].
Let now be a derived solution such that all . Then for all . Moreover, this condition holds for each element of the Yang-Baxter group, i.e. for all . For derived solutions with all , one obtains the dual situation. Here, we consider solutions which are not-necessarily derived, but for each element in their Yang-Baxter group one has: for each
[TABLE]
These are called distributive solutions. Condition (1.2) means that each is actually an automorphism of a solution (see [12, Section 2]).
In [16] we described the involutive distributive solutions. They are always multipermutation solutions of level 2 and their (involutive) Yang-Baxter groups are always abelian [16, Theorem 7.6]. In this paper we focus on non-involutive case. The situation is now more complex.
Main Theorem.
Let be a non-degenerate distributive solution of Yang-Baxter equation and let . Then is a multipermutation solution of level at most if and only if the Yang-Baxter group of is nilpotent of class at most .
This theorem cannot be generalized for non-distributive solutions as there exist on one hand involutive solutions that are multipermutation but their Yang-Baxter groups are not nilpotent [23, Remark 7] and on the other hand there exist involutive solutions that are not multipermutation but their Yang-Baxter groups are nilpotent [23, Remark 6].
It is known (see e.g. [8, 24, 3]) that there is a one-to-one correspondence between solutions of the Yang-Baxter equation and biracks – structures which satisfy some additional conditions (2.1)–(2.5). This fact allows us to prove the Main Theorem using the language of biracks (Theorem 4.6).
In particular, the correspondence exists between derived solutions and racks [7]. For each right rack its right multiplication group is a subgroup of the automorphism group . The similar property occurs for a left rack, and the reason for that in both cases, is a one-sided (self)distributivity. Therefore, we investigate biracks with at least one (self)distributive operation.
The paper is organized as follows: in Section 2 we characterize distributive biracks. We also give examples (Examples 2.6 and 2.12) of non-involutive distributive biracks which are not derived ones. Section 3 is devoted to the quotient of distributive biracks by the relation as well as by the relation , that turns out to be congruence as well, in the distributive case (Theorem 3.4). We also show (Lemma 3.5) that the quotient birack by the congruence is always idempotent and derived. The last Section 4 contains the main result of the paper (Theorem 4.6). We prove there that a distributive birack is of multipermutation level , for , if and only if its permutation group is nilpotent of class at most .
2. Distributive biracks
As we already mentioned there is a one-to-one correspondence between solutions of the Yang-Baxter equation and algebraic structures called biracks, which naturally appear in low-dimensional topology [8, 5]. In [18] Kauffman introduced the virtual knot theory — biracks play there a similar role as racks in classical knot theory. However, still not much is known about their structure and properties.
The following equational definition of a birack was given first by Stanovský in [24] (see also [8]).
Definition 2.1**.**
A structure with four binary operations is called a birack, if the following holds for any :
[TABLE]
Example 2.2** (Lyubashenko, see [4]).**
Let be a non-empty set and let be two bijections such that . Define four binary operations: , , and . Then is a birack called permutational. If , the birack is called a projection one.
Conditions (2.1) and (2.2) mean that is a left quasigroup and is a right quasigroup. Condition (2.1) simply means that all left translations by
[TABLE]
are bijections, with . Equivalently, that for every , the equation has the unique solution in . Similarly, Condition (2.2) gives that all right translations by ; , are bijections with .
The left multiplication group of a birack is the permutation group generated by left translations, i.e. the group . Similarly, one defines the right multiplication group of as the permutation group generated by right translations, i.e. the group . The permutation group generated by all translations and is called the multiplication group of a birack.
We will say that a birack is left distributive, if for every :
[TABLE]
and it is right distributive, if for every :
[TABLE]
The birack is distributive if it is left and right distributive. Each permutational birack is distributive.
Remark 2.3**.**
A right rack is a right distributive right quasigroup. These two conditions refer to second and third Reidemeister moves [9]. Biracks generalize racks in the following way. Let be a birack with all left translations being the identity permutation, i.e. for every one has
[TABLE]
Then is a rack.
A birack is involutive if it additionally satisfies, for every :
[TABLE]
By Condition (2.8), operations and in an involutive birack are uniquely determined by operations and since . This allows to treat involutive biracks as left quasigroups satisfying additional conditions [21, Proposition 1]. In case of distributive involutive biracks one obtains the one-to-one correspondence to -reductive racks [16, Corollary 5.5].
In involutive biracks, . Moreover, by [16, Corollary 5.8] an involutive birack is left distributive if and only if it is right distributive.
Example 2.4**.**
Let be a left distributive left quasigroup (left rack). Define operations as . Then the structure is a left distributive birack. Symmetrically, starting from a right rack and defining operations as , one obtains a right distributive birack . We call such biracks left and right derived biracks, respectively. They are involutive only if they are projection ones.
Example 2.5**.**
Let be a left rack and let be a right rack. Then the product is a distributive birack with .
Example 2.6**.**
Let be a group. Defining on the set binary operations as follows: , , and , , for , we obtain the birack known as the Wada switch or Wada biquandle (see [8, Subsection 2.1(3)]).
Let . Direct calculations show that
[TABLE]
and the birack is left distributive if and only if , for all , that means , for all . Furthermore,
[TABLE]
This implies that the birack is right distributive if and only if , for all , which is equivalent to and , for all . Thus, if the birack is right distributive then it is left distributive as well.
Moreover,
[TABLE]
Hence, by (2.8) and (2.9), the birack is involutive if and only if , for all , that means if is an elementary abelian -group.
For instance, there are five groups of order . One of them is cyclic of exponent and therefore its Wada switch is not distributive. One of them is elementary abelian and its Wada switch is a projection birack. The other three groups (namely , and ) are of exponent and all their square elements fall within the centers and therefore these groups yield non-involutive distributive biracks.
Example 2.7**.**
Let be an abelian group. Then, the birack operations defined in Example 2.6 look as follows: and , , for . Clearly, such a birack is always left distributive. It is a non-involutive distributive birack if and only if is an abelian group of exponent exactly .
Lemma 2.8**.**
Let be a birack. The following are equivalent:
- (i)
* is left distributive;* 2. (ii)
* satisfies, for every ,*
[TABLE] 3. (iii)
* satisfies, for every ,*
[TABLE] 4. (iv)
Left translations by elements taken from the same orbit of the action of the group on a set are equal permutations on .
Proof.
Indeed, by (2.3) and (2.1), we have for
[TABLE]
Additionally, by (2.2), substituting of by in (2.10) we immediately obtain
[TABLE]
Similarly, substituting of by in (2.11) we have
[TABLE]
Finally, (ii) (iv) follows by the fact that for any its orbit of the action on consists exactly of elements for . ∎
Analogously, due to (2.5) and (2.2), a birack is right distributive if and only if
[TABLE]
or equivalently, right translations by elements taken from the same orbit of the action of the group on are equal permutations on .
By results of [16, Section 3] left (right) distributivity in involutive biracks is equivalent to commutativity of the left (right) multiplication group. For a non-involutive distributive birack it is not always true (see Example 2.12). But even then left and right multiplication groups commute.
Lemma 2.9**.**
Let be a distributive birack. Then,
[TABLE]
Proof.
For one has,
[TABLE]
∎
Lemmas 2.8 and 2.9 allow us to characterize distributive biracks in an alternative way.
Proposition 2.10**.**
Let be a structure with four binary operations. Then is a distributive birack if and only if the following conditions are satisfied
- (i)
* is a left rack and is a right rack,* 2. (ii)
* satisfies (2.10), (2.12) and (2.13).*
Proof.
If is a left rack then (2.3) and (2.10) are equivalent, as we showed in Lemma 2.8. Analogously, (2.5) and (2.12) are equivalent when is a right rack. Finally, when supposing (2.12) and (2.10), Conditions (2.4) and (2.13) are equivalent, as we saw in the proof of Lemma 2.9. ∎
Remark 2.11**.**
Condition (ii) in Proposition 2.10 can be formulated in the equivalent way as follows: for all
[TABLE]
Obviously, the left distributivity of means that all left translations are automorphisms of . Additionally, directly from (2.6) we obtain that the left distributivity implies, for every ,
[TABLE]
Note also that, for an arbitrary automorphism of , we have
[TABLE]
Similarly, for a right distributive birack , we have
[TABLE]
Moreover, for an arbitrary automorphism of , we have
[TABLE]
Example 2.12**.**
Let be the following structure: and
[TABLE]
By hand, or using a GAP library named ‘RiG’ [13], we can show that the automorphism group of , is the group generated by the permutations , and . We can now easily prove that this structure is a distributive birack. Indeed, all , for , are automorphims of , as well as all , for , are automorphisms of and therefore is both left and right distributive birack. The group is a non-abelian group of order having two orbits, namely and . Condition (2.10) is satisfied since and . The group is a two-element group with four orbits , , and . Condition (2.12) is satisfied since and . The group is equal to the center of and we have therefore Condition (2.13). We may also notice that this example is not a Wada biquandle (Example 2.6) since there exists no -element group of exponent .
Proposition 2.13**.**
Let be a distributive birack. Then, for each , the bijections and are automorphisms of .
Proof.
The property is the definition of left distributivity. Substituting we obtain from where we get
[TABLE]
Now
[TABLE]
and therefore is a homomorphism of . The claim for is proved analogously. ∎
By Proposition 2.13 and Conditions (2.15), (2.17) one immediately obtains that groups , , are normal subgroups of the automorphism group of a distributive birack
.
3. Multipermutational biracks
Gateva-Ivanova characterized involutive multipermutation solutions of the Yang-Baxter equation in the language of some identities satisfied by corresponding biracks, see e.g. [10, Proposition 4.7]. We will generalize her result for (non-involutive) left distributive case. Let us start with some auxiliary definitions.
Definition 3.1**.**
Let . A birack is called:
- (i)
idempotent, if for every :
[TABLE] 2. (ii)
left -reductive, if for every :
[TABLE] 3. (iii)
right -reductive, if for every :
[TABLE] 4. (iv)
left -permutational, if for every :
[TABLE] 5. (v)
right -permutational, if for every :
[TABLE]
A birack is -reductive (-permutational) if it is both left and right -reductive (-permutational).
Example 3.2**.**
A distributive birack from Example 2.6 is right -reductive because , since and .
Lemma 3.3**.**
Let be a left -permutational birack.
- (i)
If is idempotent then it is left -reductive.
- (ii)
If is left distributive and then it is left -reductive.
Proof.
(i) is evident. For (ii) we have
[TABLE]
for every . ∎
By Example 2.2 there exists left -permutational left distributive birack that is not left -reductive. It is a permutational birack with .
Let be a birack. Etingof, Schedler and Soloviev defined in [6, Section 3.2] the relation
[TABLE]
By their results, the relation is a congruence of an involutive birack, i.e. an equivalence relation on the set compatible with all four operations in a birack . For a detailed definition see [15, Definition 3.1].
In the case of non-involutive biracks, the equivalence need not be a congruence (see [15, Example 3.4]) but it is so if the birack is left distributive.
Theorem 3.4**.**
Let be a left distributive birack. Then the relation (3.6) is a congruence of .
Proof.
By (2.1), (2.14) and (2.10) the proof is straightforward. Let and . Then
[TABLE]
Lemma 3.5**.**
*Let be a left distributive birack. Then the quotient birack
is idempotent and equal to the left derived birack .*
Proof.
By the left distributivity and (2.10), for every ,
[TABLE]
Furthermore, by (2.14), , which shows that and is idempotent. ∎
Analogously to (3.6), we can define symmetrical relation
[TABLE]
and this relation is a congruence of every right distributive birack. If a birack is involutive then if and only if [6, Proposition 2.2].
Definition 3.6**.**
Let be a left distributive birack. The left derived birack is called left retract of and denoted by . One defines iterated left retraction in the following way: and , for any natural number .
The right retract and iterated right retraction are defined analogously.
Remark 3.7**.**
Let be a distributive birack and let be the join of the congruences and (the least congruence containing both of them). Then the quotient birack is the projection one.
The intersection of the two relations here defined is the relation
[TABLE]
When a birack is distributive then this equivalence is an intersection of two congruences and therefore a congruence. Nevertheless, it is a congruence even in the case of general biracks, however the proof is rather complicated and technical [15, Theorem 3.3].
Let be a birack. The retract of , denoted by , is the quotient birack . Similarly, as for the congruences and , one defines iterated retraction as and , for any natural number .
In the case of involutive biracks all three notions of retracts coincide.
Corollary 3.8**.**
Let be a distributive birack. Then is an idempotent birack.
Example 3.9**.**
Let be the distributive birack from Example 2.6. It is easy to see that, for any ,
[TABLE]
and
[TABLE]
Note that the relation is different than equality relation if and only if contains at least one element of order . It is also easy to see that is a subrelation of if and only if is an elementary abelian -group.
For instance, in the quaternion group , and are different and the relation is equal to the conjugation relation. Thus is a -element projection birack.
For an abelian group satisfying the condition , clearly the relations and coincide. In this case, the birack is a projection birack.
4. Nilpotent permutation group
A birack is of multipermutation level , if and .
This means that applying times the congruence to the subsequent quotient biracks, one obtains the one-element birack.
In [10, Proposition 4.7] Gateva-Ivanova proved that an involutive birack is of multipermutation level if and only if it is left -permutational. The very same proof works for (non-involutive) left distributive biracks. In the distributive case we have an additional equivalent condition (nilpotency of the left multiplication group). Therefore, we decided to give a different proof that uses this condition.
Let be a group. We recall the definition of lower central series of the group , for :
[TABLE]
Then is nilpotent of class , if is the smallest number for which . In particular, is nilpotent of class [math] if and only if is a trivial group. If , nilpotency of class is equivalent to the property that is nilpotent of class .
Theorem 4.1**.**
Let be a left distributive idempotent birack and let . Then the following conditions are equivalent:
- (i)
, 2. (ii)
* is left -reductive,* 3. (iii)
* is left -permutational,* 4. (iv)
* is nilpotent of class at most .*
Proof.
(ii) (iii) is Lemma 3.3.
(ii)(iv)
Let . We translate the notion of -reductivity in the language of permutations. Let and we denote this sequence by . We write, by induction, and as well as and . The equation of left -reductivity then is .
Let us write and . We prove by induction that , for . The claim is clear for and
[TABLE]
Analogously, we write and and we get . The left -reductivity is, whenever ,
[TABLE]
for all .
We now prove by induction that the group is generated by the set . The claim is clear for since .
Let . Then, by the induction hypothesis,
[TABLE]
which shows that .
Take and , for some . Consider the new sequence . Obviously, . Hence,
[TABLE]
which shows the inverse inclusion.
We are nearing the final argument. A birack is left -reductive, for , if and only if for each choice of the sequence . This is equivalent to the fact that for each or to the fact and this is equivalent to being nilpotent of class at most .
For , the group is nilpotent of class [math] if and only if it is trivial which is clearly equivalent to being -reductive, which completes the proof.
(i)(iv) It is clear that the structure of the left retract may be formally defined as the birack such that
[TABLE]
It is so since the mapping , is a well-defined isomorphism of biracks.
We define the following mapping :
[TABLE]
The mapping is onto since . And it is a homomorphism since
[TABLE]
Now we compute the kernel of the homomorphism:
[TABLE]
Hence is nilpotent of class if and only if is nilpotent of class . We finish the proof by noticing that if and only if is nilpotent of class [math]. ∎
The same theorem is not true for non-idempotent biracks. Non-idempotency of permutational birack is equivalent to the fact that . This means that but the left multiplication group is non-trivial. However, this is the only exception.
Theorem 4.2**.**
Let be a left distributive birack and let . Then the following conditions are equivalent:
- (i)
, 2. (ii)
* is left -reductive,* 3. (iii)
* is left -permutational,* 4. (iv)
* is nilpotent of class at most .*
Proof.
(ii)(iii) is Lemma 3.3. The equivalence (ii)(iv) was proved in the proof of Theorem 4.1 as the idempotency was not used in this part of the proof. The only place where the idempotency was used was actually the case of in (i)(iv). Hence we can reason again that is nilpotent of class if and only if is nilpotent of class . According to Lemma 3.5, is idempotent and therefore, according to Theorem 4.1, is nilpotent of class if and only if and . ∎
Since the operation was never used in the proof, we immediately get:
Corollary 4.3**.**
Let be a left rack. Then is -reductive if and only if is nilpotent of class at most .
Corollary 4.3 generalizes the result obtained by the authors for medial quandles (a proper subclass of idempotent left racks) [14, Theorem 5.3]. The proof given there used different methods.
Remark 4.4**.**
It is worth emphasizing that all results established for left properties (distributivity, -reductivity, -permutationality, retracts) are also true for right ones, when using their dual versions.
Lemma 4.5**.**
Let be a group and be its subgroups such that and . If both and are nilpotent of class at most , for some , then is nilpotent of class at most . On the other hand, if is nilpotent of class then or are nilpotent of class at most .
Proof.
We will prove by induction that, for each ,
[TABLE]
By assumption,
[TABLE]
hence the statement is true for .
Let . Take and . Then by the induction hypothesis, there are , , , such that and . Therefore,
[TABLE]
This means that . The other inclusion uses the same argument.
The rest of the proof is now evident. ∎
Theorem 4.6**.**
Let be a distributive birack and let . Then the following conditions are equivalent:
- (i)
, 2. (ii)
* is -reductive,* 3. (iii)
* is -permutational,* 4. (iv)
* is nilpotent of class at most .*
Proof.
Most of the claim, namely (ii)(iii)(iv), follows from Theorem 4.2, Lemmas 2.9 and 4.5. We only have to prove (i)(iv). The proof will be given by the induction on .
First, let be an idempotent birack. For such biracks, (i)(iv) is true even for . It is evident that if and only if is nilpotent of class [math].
Let . Similarly as in the proof of Theorem 4.1, the structure of the retract is formally defined as the birack such that
[TABLE]
We define the following mapping :
[TABLE]
The mapping is onto since . And it is a homomorphism since
[TABLE]
Now we compute the kernel of the homomorphism:
[TABLE]
Hence is nilpotent of class if and only if is nilpotent of class . This proves the equivalence for all idempotent distributive biracks. If is non-idempotent and the proof goes the same way since by Corollary 3.8 the retract is idempotent and in the inductive step we do not use the idempotency. ∎
For non-distributive biracks, there is no equivalence between multipermutation and nilpotency, as we have remarked already in the introduction. There is no equivalence even on a small level – in the proof of [1, Theorem 3.1], Cedó, Jespers and Okniński gave an example of an involutive -reductive birack with an abelian permutation group. This birack is non-distributive since the only involutive and distributive biracks are -reductive as shown in [16, Corollary 5.5].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] F. Cedó, E. Jespers, J. Okniński, Retractability of set theoretic solutions of the Yang-Baxter equation , Adv. Math. 224 (2010), 2472–2484.
- 2[2] F. Cedó, E. Jespers, J. Okniński, Braces and the Yang-Baxter equation , Comm. Math. Phys. 327 (2014), 101–116. Extended version ar Xiv:1205.3587.
- 3[3] P. Dehornoy, Set-theoretic solutions of the Yang-Baxter equation, RC-calculus, and Garside germs , Adv. Math. 282 (2015), 93–127.
- 4[4] V.G. Drinfeld, On some unsolved problems in quantum group theory , In: P.P. Kulish (ed.) Quantum groups, in: Lecture Notes in Math., vol. 1510, Springer-Verlag, Berlin, 1992, pp. 1–8.
- 5[5] M. Elhamdadi, S. Nelson, Quandles: An introduction to the algebra of knots , American Mathematical Society, Providence, 2015.
- 6[6] P. Etingof, T. Schedler, A. Soloviev, Set-theoretical solutions to the quantum Yang-Baxter equation , Duke Math. J. 100 (1999), 169–209.
- 7[7] P. Etingof, A. Soloviev, R. Guralnick, Indecomposable set-theoretical solutions to the quantum Yang-Baxter equation on a set with a prime number of elements , J. Algebra 242 (2001), 709–719.
- 8[8] R. Fenn, M. Jordan-Santana, L. Kauffman, Biquandles and virtual links , Topology and its Appl. 145 (2004), 157–175.
