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 1942, 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 R {\displaystyle \mathrm {R} } with a binary operation ◃ {\displaystyle \triangleleft } such that for every a , b , c ∈ R {\displaystyle a,b,c\in \mathrm {R} } the self-distributive law holds:
a ◃ ( b ◃ c ) = ( a ◃ b ) ◃ ( a ◃ c ) {\displaystyle a\triangleleft (b\triangleleft c)=(a\triangleleft b)\triangleleft (a\triangleleft c)}
and for every a , b ∈ R {\displaystyle a,b\in \mathrm {R} } , there exists a unique c ∈ R {\displaystyle c\in \mathrm {R} } such that
a ◃ c = b . {\displaystyle a\triangleleft c=b.}
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 c ∈ R {\displaystyle c\in \mathrm {R} } such that a ◃ c = b {\displaystyle a\triangleleft c=b} as b ▹ a {\displaystyle b\triangleright a} . We then have
a ◃ c = b ⟺ c = b ▹ a , {\displaystyle a\triangleleft c=b\iff c=b\triangleright a,}
and thus
a ◃ ( b ▹ a ) = b , {\displaystyle a\triangleleft (b\triangleright a)=b,}
and
( a ◃ b ) ▹ a = b . {\displaystyle (a\triangleleft b)\triangleright a=b.}
Using this idea, a rack may be equivalently defined as a set R {\displaystyle \mathrm {R} } with two binary operations ◃ {\displaystyle \triangleleft } and ▹ {\displaystyle \triangleright } such that for all a , b , c ∈ R {\displaystyle a,b,c\in \mathrm {R} } :
a ◃ ( b ◃ c ) = ( a ◃ b ) ◃ ( a ◃ c ) {\displaystyle a\triangleleft (b\triangleleft c)=(a\triangleleft b)\triangleleft (a\triangleleft c)} (left self-distributive law)
( c ▹ b ) ▹ a = ( c ▹ a ) ▹ ( b ▹ a ) {\displaystyle (c\triangleright b)\triangleright a=(c\triangleright a)\triangleright (b\triangleright a)} (right self-distributive law)
( a ◃ b ) ▹ a = b {\displaystyle (a\triangleleft b)\triangleright a=b}
a ◃ ( b ▹ a ) = b {\displaystyle a\triangleleft (b\triangleright a)=b}
… excerpt ends here. Continue reading the full article.
