Racks and quandles

Short description: Sets with binary operations analogous to the Reidemeister moves used on knot diagrams

In mathematics, racks and quandles are sets with binary operations satisfying axioms analogous to the Reidemeister moves used to manipulate knot diagrams.

While mainly used to obtain invariants of knots, they can be viewed as algebraic constructions in their own right. In particular, the definition of a quandle axiomatizes the properties of conjugation in a group.

History

In 1943, Mituhisa Takasaki (高崎光久) introduced an algebraic structure which he called a Kei (圭), which would later come to be known as an involutive quandle. His motivation was to find a nonassociative algebraic structure to capture the notion of a reflection in the context of finite geometry. The idea was rediscovered and generalized in an unpublished 1959 correspondence between John Conway and Gavin Wraith, who at the time were undergraduate students at the University of Cambridge. It is here that the modern definitions of quandles and of racks first appear. Wraith had become interested in these structures (which he initially dubbed sequentials) while at school. Conway renamed them wracks, partly as a pun on his colleague's name, and partly because they arise as the remnants (or 'wrack and ruin') of a group when one discards the multiplicative structure and considers only the conjugation structure. The spelling 'rack' has now become prevalent.

These constructs surfaced again in the 1980s: in a 1982 paper by David Joyce (where the term quandle, an arbitrary nonsense word, was coined), in a 1982 paper by Sergei Matveev (under the name distributive groupoids) and in a 1986 conference paper by Egbert Brieskorn (where they were called automorphic sets). A detailed overview of racks and their applications in knot theory may be found in the paper by Colin Rourke and Roger Fenn.

Racks

A rack may be defined as a set [math]\displaystyle{ \mathrm{R} }[/math] with a binary operation [math]\displaystyle{ \triangleleft }[/math] such that for every [math]\displaystyle{ a, b, c \in \mathrm{R} }[/math] the self-distributive law holds:

[math]\displaystyle{ a \triangleleft(b \triangleleft c) = (a \triangleleft b) \triangleleft(a \triangleleft c) }[/math]

and for every [math]\displaystyle{ a, b \in \mathrm{R}, }[/math] there exists a unique [math]\displaystyle{ c \in \mathrm{R} }[/math] such that

[math]\displaystyle{ a \triangleleft c = b. }[/math]

This definition, while terse and commonly used, is suboptimal for certain purposes because it contains an existential quantifier which is not really necessary. To avoid this, we may write the unique [math]\displaystyle{ c \in \mathrm{R} }[/math] such that [math]\displaystyle{ a \triangleleft c = b }[/math] as [math]\displaystyle{ b \triangleright a. }[/math] We then have

[math]\displaystyle{ a \triangleleft c = b \iff c = b \triangleright a, }[/math]

and thus

[math]\displaystyle{ a \triangleleft(b \triangleright a) = b, }[/math]

and

[math]\displaystyle{ (a \triangleleft b) \triangleright a = b. }[/math]

Using this idea, a rack may be equivalently defined as a set [math]\displaystyle{ \mathrm{R} }[/math] with two binary operations [math]\displaystyle{ \triangleleft }[/math] and [math]\displaystyle{ \triangleright }[/math] such that for all [math]\displaystyle{ a, b, c \in \mathrm{R}\text{:} }[/math]

1. [math]\displaystyle{ a \triangleleft(b \triangleleft c) = (a \triangleleft b) \triangleleft(a \triangleleft c) }[/math] (left self-distributive law)
2. [math]\displaystyle{ (c \triangleright b) \triangleright a = (c \triangleright a) \triangleright(b \triangleright a) }[/math] (right self-distributive law)
3. [math]\displaystyle{ (a \triangleleft b) \triangleright a = b }[/math]
4. [math]\displaystyle{ a \triangleleft(b \triangleright a) = b }[/math]

It is convenient to say that the element [math]\displaystyle{ a \in \mathrm{R} }[/math] is acting from the left in the expression [math]\displaystyle{ a \triangleleft b, }[/math] and acting from the right in the expression [math]\displaystyle{ b \triangleright a. }[/math] The third and fourth rack axioms then say that these left and right actions are inverses of each other. Using this, we can eliminate either one of these actions from the definition of rack. If we eliminate the right action and keep the left one, we obtain the terse definition given initially.

Many different conventions are used in the literature on racks and quandles. For example, many authors prefer to work with just the right action. Furthermore, the use of the symbols [math]\displaystyle{ \triangleleft }[/math] and [math]\displaystyle{ \triangleright }[/math] is by no means universal: many authors use exponential notation

[math]\displaystyle{ a \triangleleft b = {}^a b }[/math]

and

[math]\displaystyle{ b \triangleright a = b^a, }[/math]

while many others write

[math]\displaystyle{ b \triangleright a = b \star a. }[/math]

Yet another equivalent definition of a rack is that it is a set where each element acts on the left and right as automorphisms of the rack, with the left action being the inverse of the right one. In this definition, the fact that each element acts as automorphisms encodes the left and right self-distributivity laws, and also these laws:

[math]\displaystyle{ \begin{align} a \triangleleft(b \triangleright c) &= (a \triangleleft b) \triangleright(a\ \triangleleft c) \\ (c \triangleleft b) \triangleright a &= (c \triangleright a) \triangleleft(b \triangleright a) \end{align} }[/math]

which are consequences of the definition(s) given earlier.

Quandles

A quandle is defined as a rack, [math]\displaystyle{ \mathrm{Q}, }[/math] such that for all [math]\displaystyle{ a \in \mathrm{Q} }[/math]

[math]\displaystyle{ a \triangleleft a = a, }[/math]

or equivalently

[math]\displaystyle{ a \triangleright a = a. }[/math]

Examples and applications

Every group gives a quandle where the operations come from conjugation:

[math]\displaystyle{ \begin{align} a \triangleleft b &= a b a^{-1} \\ b \triangleright a &= a^{-1} b a \\ &= a^{-1} \triangleleft b \end{align} }[/math]

In fact, every equational law satisfied by conjugation in a group follows from the quandle axioms. So, one can think of a quandle as what is left of a group when we forget multiplication, the identity, and inverses, and only remember the operation of conjugation.

Every tame knot in three-dimensional Euclidean space has a 'fundamental quandle'. To define this, one can note that the fundamental group of the knot complement, or knot group, has a presentation (the Wirtinger presentation) in which the relations only involve conjugation. So, this presentation can also be used as a presentation of a quandle. The fundamental quandle is a very powerful invariant of knots. In particular, if two knots have isomorphic fundamental quandles then there is a homeomorphism of three-dimensional Euclidean space, which may be orientation reversing, taking one knot to the other.

Less powerful but more easily computable invariants of knots may be obtained by counting the homomorphisms from the knot quandle to a fixed quandle [math]\displaystyle{ \mathrm{Q}. }[/math] Since the Wirtinger presentation has one generator for each strand in a knot diagram, these invariants can be computed by counting ways of labelling each strand by an element of [math]\displaystyle{ \mathrm{Q}, }[/math] subject to certain constraints. More sophisticated invariants of this sort can be constructed with the help of quandle cohomology.

The Alexander quandles are also important, since they can be used to compute the Alexander polynomial of a knot. Let [math]\displaystyle{ \mathrm{A} }[/math] be a module over the ring [math]\displaystyle{ \mathbb{Z}[t, t^{-1}] }[/math] of Laurent polynomials in one variable. Then the Alexander quandle is [math]\displaystyle{ \mathrm{A} }[/math] made into a quandle with the left action given by

[math]\displaystyle{ a \triangleleft b = tb + (1 - t)a. }[/math]

Racks are a useful generalization of quandles in topology, since while quandles can represent knots on a round linear object (such as rope or a thread), racks can represent ribbons, which may be twisted as well as knotted.

A quandle [math]\displaystyle{ \mathrm{Q} }[/math] is said to be involutory if for all [math]\displaystyle{ a, b \in \mathrm{Q}, }[/math]

[math]\displaystyle{ a \triangleleft(a \triangleleft b) = b }[/math]

or equivalently,

[math]\displaystyle{ (b \triangleright a) \triangleright a = b . }[/math]

Any symmetric space gives an involutory quandle, where [math]\displaystyle{ a \triangleleft b }[/math] is the result of 'reflecting [math]\displaystyle{ b }[/math] through [math]\displaystyle{ a }[/math]'.

See also

• Biracks and biquandles
• Laver table

External links

• Knot Quandaries Quelled by Quandles - An undergraduate introduction to quandles and another knot invariants
• A Survey of Quandle Ideas by Scott Carter
• Knot Invariants Derived from Quandles and Racks by Seiichi Kamada
• Shelves, Racks, Spindles and Quandles, p. 56 of Lie 2-Algebras by Alissa Crans
• https://ncatlab.org/nlab/show/quandle