Biracks and biquandles explained

In mathematics, biquandles and biracks are sets with binary operations that generalize quandles and racks. Biquandles take, in the theory of virtual knots, the place that quandles occupy in the theory of classical knots. Biracks and racks have the same relation, while a biquandle is a birack which satisfies some additional conditions.

Definitions

Biquandles and biracks have two binary operations on a set

X written a ^{b} and a _{b} . These satisfy the following three axioms:

1.

(a ^{b)} ^{c _{b}} = {a ^{c}} ^{b ^{c}}

2.

{a _{b}} ^{c _{b}} = {a _{c}} ^{b ^{c}}

3.

{a ^{c _{b}} _{b}} = {a ^{c}} _{b ^{c}}

These identities appeared in 1992 in reference [FRS] where the object was called a species.

The superscript and subscript notation is useful here because it dispenses with the need for brackets. For example,if we write

a*b for a _{b} and a n{**}b for a ^{b} then thethree axioms above become

1.

(a n{**}b) n{**}(c*b)=(a n{**}c) n{**}(b n{**}c)

2.

(a*b)*(c*b) = (a*c)*(b n{**}c)

3.

(a*b) n{**}(c*b)=(a n{**}c)*(b n{**}c)

If in addition the two operations are invertible, that is given

a, b in the set X there are unique x, y in the set X such that x ^{b=a} and y _{b=a} then the set X together with the two operations define a birack.

For example, if

X , with the operation a ^{b} , is a rack then it is a birack if we define the other operation to be the identity, a _{b=a} .

For a birack the function

S:X ^{2} → X ^{2} can be defined byS(a,b ^{b).} _{a) = (b,a}

Then

1.

S is a bijection

2.

S _{1S} _{2S} _{1=S} _{2S} _{1S} _{2}

In the second condition,

S _{1} and S _{2} are defined by S _{1(a,b,c)=(S(a,b),c)} and S _{2(a,b,c)=(a,S(b,c))} . This condition is sometimes known as the set-theoretic Yang-Baxter equation.

To see that 1. is true note that

S' defined byS'(b,a ^{b) = (a,b} _{a)}

is the inverse to

S

To see that 2. is true let us follow the progress of the triple

(c,b _{c,a} ^{bc ^{b}} ) under S _{1S} _{2S} _{1} . So(c,b _{c,a} ^{bc ^{b}} ) \to (b,c ^{b,a} _{bc ^{b}} ) \to (b,a ^{ba _{b}} _{b,c} ) \to (a, b ^{a,} c ^{ba _{b}} ).

On the other hand,

(c,b _{c,a} ^{bc ^{b}} ) = (c, b _{c,} a _{cb _{c}} ) . Its progress under S _{2S} _{1S} _{2} is(c, b _{c,} a _{cb _{c}} ) \to (c, a _{c,} {b ^{a _{c}} _{c}} ) \to (a, c ^{a,} {b ^{a _{c}} _{c}} ) = (a, c ^{a,} {b ^{a}} _{c ^{a}} ) \to (a, b _{a,} c _{ab _{a}} ) = (a, b ^{a,} c ^{ba _{b}} ).

Any

S satisfying 1. 2. is said to be a switch (precursor of biquandles and biracks).

Examples of switches are the identity, the twist

T(a,b) = (b,a) and S(a,b) = (b,a ^{b)} where a ^{b} is the operation of a rack.

A switch will define a birack if the operations are invertible. Note that the identity switch does not do this.

Biquandles

A biquandle is a birack which satisfies some additional structure, as described by Nelson and Rische.^[1] The axioms of a biquandle are "minimal" in the sense that they are the weakest restrictions that can be placed on the two binary operations while making the biquandle of a virtual knot invariant under Reidemeister moves.

Further reading

• Fenn . Roger. Jordan-Santana . Mercedes. Kauffman . Louis . Louis Kauffman. Biquandles and Virtual Links. Topology and its Applications. 145. 1–3. 2004. 157–175. 10.1016/j.topol.2004.06.008 . free.
• Book: Fenn . Roger. Rourke . Colin . Colin Rourke. Sanderson . Brian. An Introduction to Species and the Rack Space. Topics in Knot Theory. 1993. Springer. NATO ASI Series. 399. 33–55. 10.1007/978-94-011-1695-4_4.
• Kauffman . Louis H.. Virtual Knot Theory. European Journal of Combinatorics. 20. 7. 1999. 663–690. 10.1006/eujc.1999.0314 . free.

Notes and References

1. Nelson . Sam. Rische . Jacquelyn L.. On bilinear biquandles. Colloquium Mathematicum. 112. 2. 2008. 279–289. 10.4064/cm112-2-5 . free. 0708.1951.