R-Matrix Invariants: Difference between revisions
No edit summary |
No edit summary |
||
Line 5: | Line 5: | ||
{{Startup Note}} |
{{Startup Note}} |
||
<!--$$?REngine$$--> |
<!--$$?REngine$$--> |
||
<!--Robot Land, no human edits to "END"--> |
|||
{{HelpAndAbout| |
|||
n = 1 | |
|||
n1 = 2 | |
|||
in = <nowiki>REngine</nowiki> | |
|||
out= <nowiki>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.</nowiki> | |
|||
about= <nowiki>REngine was written by Siddarth Sankaran at the University of Toronto, in the summer of 2005</nowiki>}} |
|||
<!--END--> |
<!--END--> |
||
Line 34: | Line 41: | ||
rb = Inverse[r]; |
rb = Inverse[r]; |
||
Print["R = ",MatrixForm[r]," , Rbar = ", MatrixForm[rb]]$$--> |
Print["R = ",MatrixForm[r]," , Rbar = ", MatrixForm[rb]]$$--> |
||
<!--Robot Land, no human edits to "END"--> |
|||
{{In| |
|||
n = 3 | |
|||
in = <nowiki>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]; |
|||
Print["R = ",MatrixForm[r]," , Rbar = ", MatrixForm[rb]]</nowiki>}} |
|||
<!--END--> |
<!--END--> |
Revision as of 16:47, 7 September 2005
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 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 row and column .
For an oriented knot or link , REngine returns the product , which is computed as follows:
- 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. - Label the edges in between events in the Morse link presentation of .
- Associate each event with one of the matrices as shown, with the indices given by the labelling:
- 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 .
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. First, we need to specify the R matrices:
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];
Print["R = ",MatrixForm[r]," , Rbar = ", MatrixForm[rb]]
|