VasCalc Documentation - User's Guide

This page documents the ChordsMod4T component of the VasCalc project. This page is also under construction.

Overview

This package provides a Mathematica interface to work with the space generated by chord diagrams on a fixed skeleton of lines and circles, modulo the 4-T relation. See Dror Bar-Natan's Survey of Finite Type Invariants for further details.

Requirements

The software requirements of this package are Mathematica 4.1 and Java 1.4 (or greater, in both cases). However, note that default installations of Mathematica 4.1 and up include a Java runtime binary, and require no further configuration for this package to work.

While there are no specific hardware requirements, the computations involved are rather resource-intensive. Users of low-end machines will see a smaller range of parameters for which the computation is practicable. We'll have an expected performance profile once work on this package is done.

Installation

If you have an up-to-date copy of the repository, skip ahead. If not, download ChordsMod4T.tar.gz and extract it to a directory of your choice.

You must also ensure that there is a directory named "CM4TData" under the installation directory, creating it if neccessary. This is for save/load functionality to work properly.

Usage

Initialization

In a Mathematica session, load the definitions by typing:

In[1]:=

<</path_to_install_folder/CDinterface.m

where "path_to_install_folder" is either the "trunk" folder of the repository, or the folder in which the above archive, if downloaded, was unpacked.

You must also issue the following command, to inform Mathematica of the location of the required Java objects:

In[2]:=

SetVasCalcPath["/path_to_install_folder"];

These steps must be followed at the start of each Mathematica session you wish to use this package.

Representing Chord Diagrams

Our convention for representing a chord diagram in Mathematica is through a CD object containing Line and Circle expressions as per the skeleton. To construct such a representation,

• Number the chords on the diagram.
• For each line on the skeleton, put within the brackets of its Line expression the numbers of the chords that have their endpoints on that line, starting from the bottom and working up. For each circle, do the same, but one can choose an arbitrary starting point and count around. If there are no chords on a given line or circle, leave the brackets empty, as in Line[].

Naturally, there are many representations for a given diagram. This package also allows for formal linear combinations of CD objects.

Computing chord diagram spaces modulo 4T and FI relations

The 4T relation: The dotted lines indicated regions that are identical in all diagrams.

The object CDSpace[l,m,n] represents the rational vector space generated by chord diagrams with n chords on a skeleton with l lines and m circles, modulo the 4-T relation. The first time a space is encountered in a session, a check is made to see if there is data for the required space on disc (under the path_to_install_folder/CM4TData directory). If no such entry exists, the space is computed, and by default the results are saved on disc for future use - this computation may be substantial, depending on the values of the parameters. One can prevent the saving of data by using the command CDSpace[l,m,n, WriteToDisc -> False] .

One can obtain the dimension of a chord diagram space, as follows:

In[3]:=	GetDimension[CDSpace[1,1,3]]
Out[3]=	19

One can also obtain a basis for a chord diagram space (modulo 4T), expressed as a list of chord diagrams:

In[4]:=

GetCDBasis[ CDSpace[1,1,3] ]

Out[4]=

{CD[Line[1, 1], Circle[2, 2, 3, 3]], CD[Line[1, 1], Circle[2, 3, 2, 3]], CD[Line[1], Circle[1, 2, 3, 2, 3]], CD[Line[1], Circle[1, 2, 3, 3, 2]], CD[Line[], Circle[1, 1, 2, 3, 3, 2]], CD[Line[1, 2, 1, 2], Circle[3, 3]], CD[Line[], Circle[1, 2, 1, 3, 2, 3]], CD[Line[1, 2], Circle[1, 3, 3, 2]], CD[Line[1, 2, 2, 1], Circle[3, 3]], CD[Line[1, 2, 2], Circle[1, 3, 3]], CD[Line[], Circle[1, 2, 3, 1, 2, 3]], CD[Line[1, 2, 3], Circle[1, 3, 2]], CD[Line[1, 2, 3, 2, 1, 3], Circle[]], CD[Line[1, 2, 3, 2], Circle[1, 3]], CD[Line[1, 2, 3, 3], Circle[1, 2]], CD[Line[1, 2, 3, 2, 3, 1], Circle[]], CD[Line[1, 2, 3, 2, 3], Circle[1]], CD[Line[1, 2, 3, 3, 2, 1], Circle[]], CD[Line[1, 2, 3, 3, 2], Circle[1]]}

In addition, one can work with chord diagram spaces modulo the 4T and framing independence (FI) relations, using the command CDrSpace[l,m,n,opts] - the "r" stands for "further reduced". The above commands work in a similar fashion for these spaces.

Using ASeries objects

Because operations on chord diagrams (such as multiplication and reduction) can often be resource-intensive, it is desirable to work with representations in Java as much as possible. The ASeries object is meant to facilitate this. To create one, use the command ASeries[CDcombo, l, m], where CDcombo is a linear combination of chord diagrams (represented by CD's, and possibly a constant term), all of which are on a fixed skeleton of l lines and m circles, and may have a different number of chords. It is important to note that an ASeries carries with it the notion of an order, defined implicitly by the maximum number of chords to appear in a diagram in CDcombo; the result of any and all computations are only given up to the lowest order appearing therein. (Soon to come: option to explicitly specify order).

There are several operations one can perform on an ASeries object. Addition and multiplication is achieved using the + and . operators respectively. Also, ASeries objects can be inverted (up to the highest order), provided they are of the form (1 + higher order terms) .

Additionally, the following unary operations are available:

• AddStrand[ASeries, n] adds an empty strand to all the diagrams in the given ASeries after the n'th position.
• DoubleStrand[ASeries, n] doubles the n'th strand in all the diagrams in the given ASeries.
• ReverseStrand[ASeries, n] reverses the n'th strand in all the diagrams in the given ASeries.
• ConnectStrand[ASeries, i, j] is the linear extension of the operation that for each diagram, appends the j'th strand to the end of the i'th one.
• PermuteStrand[ASeries, perm] applies the permutation perm to the strands of the chord diagrams in the given ASeries. The permutation is to be represented as a list of cycles.
• Reduce[ASeries] returns another ASeries equivalent to the first modulo the 4T relation. This operation may take some time if the relevant chord diagram spaces need to be computed.
• ReduceFI[ASeries] returns another ASeries equivalent to the first modulo the 4T relation, and the FI relations. As before, this operation may take some time if the relevant chord diagram spaces need to be computed.

All these operations will be put to use in the next section.

Finally, to convert an ASeries back to a human-readable form, use the command: CD[ AS ], where AS is the object to be converted.

Special Form of ASeries

When calculating the invariant of a knot or a braid, we multiply the invariant of the different "events" in the knot's presentation. In the case where this event is a crossing, one must keep in mind that two strands have been permuted. For this reason one must apply PermuteStrand[] in order to get the correct answer. This causes the resulting expressions to be rather inelegant. For this reason we have devised a new form of ASeries[] that keeps track of the permutation of the strands so one does not need to manually permute them when multiplying.

This format only applies when there are no circles in our ASeries, as in the case of knots and braids. One can then define an ASeries using the format: ASeries[Permutation_list, CV_list]. Here, Permutation is a list of integers from $1$ to </math>n</math>, where $n$ is the number of lines in the diagram. CV is a list containing Chord vectors of increasing degree.

Checking the pentagon and hexagon relations

For paranthesized braids, the pentagon and hexagon equations are given by

The Pentagon and the Hexagons for Parenthesized Braids

.

Algebraically, these relations can be written as

[Pentagon]

$\Phi ^{123}\cdot (1\otimes \Delta \otimes 1)(\Phi )\cdot \Phi ^{234}=(\Delta \otimes 1\otimes 1)(\Phi )\cdot (1\otimes 1\otimes \Delta )(\Phi )$     in     $A_{4}$,

[Hexagons]

$(\Delta \otimes 1)(R^{\pm 1})=\Phi ^{123}\cdot (R^{\pm 1})^{23}\cdot (\Phi ^{-1})^{132}\cdot (R^{\pm 1})^{13}\cdot \Phi ^{312}$     in     $A_{3}$.

where $A_{n}$ is the algebra of chord diagrams on $n$ strands modulo the 4-T relations.

Let us check that a proposed pair $\{R,\Phi \}$ satisfy these equations, up to the third order. After running through the initialization above, we introduce our candidates as ASeries objects:

In[3]:=	Phi = ASeries[ 1 + (1/24)*CD[Line[1], Line[2], Line[1, 2]] - (1/24)*CD[Line[2], Line[1], Line[1, 2]], 3,0]
Out[3]=	ASeries[3, 0, {«JavaObject[vectorSpace.Coefficient]», «JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]»}]

In[4]:=	R = ASeries[ 1 + (1/2)CD[Line[1], Line[1]] + (1/8)CD[Line[1, 2], Line[1, 2]] + (1/48)CD[Line[1, 2, 3], Line[1, 2, 3]], 2,0]
Out[4]=	ASeries[2, 0,«JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]», «JavaObject[ChordVector]», «JavaObject[ChordVector]»}]

First, we'll check the pentagon equation. Writing the difference of the two sides for $\Phi$,

In[5]:=	(AddStrand[Phi,0].DoubleStrand[Phi,2].AddStrand[Phi,3]) - (DoubleStrand[Phi,1].DoubleStrand[Phi,3])
Out[5]=	ASeries[4, 0, {«JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]», «JavaObject[ChordVector]»}]

Now we reduce the result modulo the 4T relations, and convert back to CD notation:

In[6]:=	CD[Reduce[%]]
Out[6]=	0

Thus our candidate $\Phi$ solves the pentagon equation.

Let's also test one of the hexagon equations:

In[7]:=	(DoubleStrand[R, 1]) - Phi.AddStrand[R, 0].PermuteStrand[ Phi^(-1) , {{2, 3}}].AddStrand[R, 1].PermuteStrand[Phi, {{1, 3, 2}}]
Out[7]=	ASeries[3, 0, {«JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]», «JavaObject[ChordVector]»}]

Reducing the result, we see that our choices of $R$ and $\Phi$ yield a solution to the first hexagon equation.

In[8]:=	CD[Reduce[%]]
Out[8]=	0

The second hexagon equation can be verified in a similar fashion, and the result is the same.

Braid Invariants

To come: definition of Z[B[n]], demonstration of Reidemeister moves. For now, reidemeister.nb.

(Unframed) Knot Invariants

To compute $Z(K)$ for a knot, we need to extend the definition of $Z$ to include "caps" and "cups". In addition, framing independence forces us to introduce the FI relation - hence all the formulae in this section take place in the "further reduced" space of chord diagrams. We proceed using the $Z_{\infty }$ correction term in [1]. To begin, let us choose a pair $(R,\Phi )$ which solve the pentagon and hexagon equations to fourth degree:

In[9]:=

Phi = ASeries[1 + CD[Line[1], Line[2], Line[1, 2]]/24 - (7*CD[Line[1], Line[2, 3, 4], Line[1, 2, 3, 4]])/5760 - CD[Line[2], Line[1], Line[1, 2]]/24 + (7*CD[Line[2], Line[1, 3, 4], Line[1, 2, 3, 4]])/1920 - (7*CD[Line[3], Line[1, 2, 4], Line[1, 2, 3, 4]])/1920 + (7*CD[Line[4], Line[1, 2, 3], Line[1, 2, 3, 4]])/5760 + (7*CD[Line[1, 2], Line[3, 4], Line[1, 2, 3, 4]])/5760 - CD[Line[1, 3], Line[2, 4], Line[1, 2, 3, 4]]/640 - CD[Line[1, 4], Line[2, 3], Line[1, 2, 3, 4]]/1152 - CD[Line[2, 3], Line[1, 4], Line[1, 2, 3, 4]]/1152 + (19*CD[Line[2, 4], Line[1, 3], Line[1, 2, 3, 4]])/5760 - (7*CD[Line[3, 4], Line[1, 2], Line[1, 2, 3, 4]])/5760 - CD[Line[1, 2, 3], Line[4], Line[1, 2, 3, 4]]/1440 + CD[Line[1, 2, 4], Line[3], Line[1, 2, 3, 4]]/480 - CD[Line[1, 3, 4], Line[2], Line[1, 2, 3, 4]]/480 + CD[Line[2, 3, 4], Line[1], Line[1, 2, 3, 4]]/1440, 3,0];

In[10]:=

R = ASeries[1 + CD[Line[1], Line[1]]/2 + CD[Line[1, 2], Line[1, 2]]/8 + CD[Line[1, 2, 3], Line[1, 2, 3]]/48 + CD[Line[1, 2, 3, 4], Line[1, 2, 3, 4]]/384, 2, 0];

The definition of $Z_{\infty }$ involves going up the third strand, down the second, and up the first strand of $\Phi$:

In[11]:=	Zinf = ConnectStrand[ConnectStrand[ReverseStrand[Phi, 2], 3, 2], 2, 1]
Out[11]=	ASeries[1, 0, {«JavaObject[vectorSpace.Coefficient]», «JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]», «JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]»}]

The invariant of the unknot $Z(O)$ is given by closing $Z_{\infty }$ to a circle (the first line below), and taking the inverse:

In[12]:=	ZinfInverseCircle = ASeries[CD[(Zinf)^(-1)] /. Line -> Circle, 0 , 1]
Out[12]=	ASeries[0, 1, {«JavaObject[vectorSpace.Coefficient]», «JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]», «JavaObject[vectorSpace.Coefficient]», «JavaObject[ChordVector]»}]

In[13]:=	CD[ReduceFI[ZinfInverseCircle]]
Out[13]=	1 - CD[Circle[1, 2, 1, 2]]/24 - CD[Circle[1, 2, 3, 1, 4, 2, 3, 4]]/360 + CD[Circle[1, 2, 3, 1, 4, 3, 2, 4]]/720 + (7*CD[Circle[1, 2, 3, 4, 1, 2, 3, 4]])/5760

Performance Issues

We are currently working to improve the performance of this program. For larger computations, it would likely help to increase the maximum heap size available to Java. To do this, type the following into Mathematica before loading the CDinterface.m definitions (step 1 above):

In[1]:=

Needs["JLink`"];

In[2]:=

InstallJava[CommandLine -> "/path_to_java_runtime/java -Xmx128M"]

This allows Java to use up to 128 megabytes of memory; you may change the number "128" in the parameter "-Xmx128M" to suit your needs. Note that the first line needs to be entered exactly as shown - the funny apostrophe is located next to the "1" key on many keyboards.

References

• [1] D. Bar-Natan, Non-Associative Tangles. Geometric Topology (proceedings of the Georgia International Topology Conference, W. H. Kazez ed.), 139-183, Amer. Math. Soc. and International Press, Providence, 1997.