R-Matrix Invariants: Difference between revisions

From Knot Atlas
Jump to navigationJump to search
No edit summary
No edit summary
Line 65: Line 65:
t</nowiki>}}
t</nowiki>}}
<!--END-->
<!--END-->

===See also===
See also [[QuantumGroups`]], a Mathematica package by Scott Morrison, now included in KnotTheory`, which computes arbitrary quantum knot invariants. (For now, it only uses braid representations, not morse link representations.)

Revision as of 18:07, 28 May 2007


KnotTheory` can compute knot and link invariants associated with matrix solutions of the Yang-Baxter equation, using the program REngine:

(For In[1] see Setup)

In[1]:= ?REngine
REngine[K, Rp, Rn, Mcupl, Mcupr, Mcapl Mcapr] returns the invariant associated with the given R-matrices (Rp for positive crossings, Rn for negative crossings) and oriented creation and annihilation M matrices, of the oriented knot or link K. See the Manual for details of convention. Note that REngine does not verify that the given matrices actually define an invariant, use TestRMatrix[..] for this purpose.
In[2]:= REngine::about
REngine was written by Siddarth Sankaran at the University of Toronto, in the summer of 2005

In more detail, let be a free module of finite rank over a commutative ring, and let be invertible. Further, let there be invertible endomorphisms ; these correspond to McupL, McupR, McapL, and McapR respectively. Fixing a basis of V, we can regard all of these endomorphisms as matrices.

The following notation is useful: for , refers to the element of R in row and column .

For an oriented knot or link , REngine returns the product , which is computed as follows:

  1. Find a Morse link presentation of such that it is composed only of crossings of the X[k, Over/Under, Down, Down] variety; this is accomplished by adding caps and cups where necessary.
  2. Label the edges in between events in the Morse link presentation of .
  3. Associate each event with one of the matrices as shown, with the indices given by the labelling:
    • X[k, Over, Down, Down]:Positive crossing (positive crossing)
    • X[k, Under,Down, Down]:Negative crossing (negative crossing)
    • Cup[k, k+1]: Cup right
    • Cup[k, k-1]: Cup left
    • Cap[k, k+1]: Cap right
    • Cap[k, k-1]: Cap left Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle \Rightarrow {M^\leftarrow}_{ab}}
  4. Define as the result of taking the product of the matrices associated with the elements of K, and summing over repeated indices; each sum runs from 1 to .


A trefoil knot

As an example, let K be the trefoil as shown, with the chosen axis upwards, and the strands going down through all the crossings. Then

where the summation is carried out on all the indices a through i, each ranging from 1 to n.


Determining that is actually an invariant is simply a matter of checking the equality of the outcomes of Reidemeister moves in various configurations and orientations, as well as a few 'topological' moves. Note that REngine does not perform any checks, while the utility TestRMatrix performs the tests required to determine regular isotopy.


Let's use the REngine to find the Jones polynomial of the trefoil. The R and M matrices for the Jones polynomial, in the indeterminate t, are as follows:

Putting these definitions into Mathematica, we run the REngine on the trefoil. Note that the Jones polynomial is usually normalized so that the polynomial of the unknot 0_1 is 1, hence the term on the denominator.

In[3]:= r={{Sqrt[t], 0, 0, 0},{0, 0, t, 0},{0,t, Sqrt[t] - t^(3/2), 0}, {0,0,0,Sqrt[t]}}; rb = Inverse[r]; mcupl=mcapl=mcupr=mcapr={{0, t^(-1/4)},{t^(1/4), 0}};
In[4]:= jones = REngine[Knot[3,1], r, rb, mcupl, mcapl, mcupr, mcapr] / REngine[Knot[0,1], r, rb, mcupl, mcapr, mcupr, mcapr] //Apart
Out[4]= -4 -3 1 -t + t + - t

See also

See also QuantumGroups`, a Mathematica package by Scott Morrison, now included in KnotTheory`, which computes arbitrary quantum knot invariants. (For now, it only uses braid representations, not morse link representations.)