VS, TS and TG Algebras

From Drorbn
Revision as of 22:44, 15 June 2007 by (Talk)

Jump to: navigation, search



We introduce VS-, TS- and TG-Algebras; three types of algebraic entities within which some basic equations of knot theory (related to Algebraic Knot Theory) can be written and potentially solved.

Why Bother?

  • These equations are valuable yet not well understood. My hope is to study them in many simpler spaces (i.e., in many simpler VS-, TS- and TG-Algebras) than the ones that naturally occur in knot theory, in the hope that out of many test cases an understanding will emerge.
  • In particular, one day I hope to write (or encourage the writing of) computer programs that will take a VS-, TS-, or TG-algebra "plug-in" and given it, will carry out all the necessary higher-level algebra. This will make it easier to study particular cases computationally. But for this, the notions of VS-, TS- and TG-Algebras must first be completely specified.

VS-Algebras in One Paragraph

A VS-Algebra (Vertical Strands Algebra) is an algebraic object that is endowed with the same operations as the algebras {\mathcal A}_n^{hor} of horizontal chord chord diagrams - multiplication (vertical stacking, a binary operation) and strand permutation, strand addition, strand doubling and strand deletion (all unary operations). It is local if it satisfies the same "locality in time" and "locality in space" relations that {\mathcal A}_n^{hor} satisfies [Bar-Natan_97]. In any local VS-algebra the equations for a Drinfel'd associator (i.e., the pentagon and the hexagon) can be written and potentially be solved, and solutions always lead to braid invariants. Likewise in any local VS-algebra the largely undocumented braidor equations can be written and potentially be solved, and solutions always lead to braid invariants.

TS-Algebras in One Paragraph

A TS-Algebra (Tangled Strands Algebra) is to tangles as a VS-algebra is to braids. Equally cryptically, it is to {\mathcal A}_n as a VS-algebra is to {\mathcal A}_n^{hor}. Thus a TS-algebra has the same unary operations as a VS-algebra along with a fancier collection of "products" that allow for "reversing" and "bending back" strands before they are concatenated. Thus every TS-algebra is in particular a VS-algebra, hence if it is "local" (with the same definition as for a VS-algebra), associators and braidors make sense it it. In a TS-algebra every associator or braidor satisfying some minor further symmetry conditions leads to a knot and link invariant. Furthermore, sufficiently symmetric associators lead to full-fledged Algebraic Knot Theories.

TG-Algebras in One Paragraph

A TG-Algebra (Trivalent Graph Algebra) is to knotted trivalent graphs as a TS-algebra is to tangles. Knotted trivalent graphs are equivalent to tangles, in some topological sense; indeed, given a knotted trivalent graph, pick a maximal tree and contract it until it is just a thick point. What remains, in the complement of that think point, is just a number of knotted edges with no vertices. That is, it is a tangle. It follows that a knotted trivalent graph is merely a tangle with just a bit of extra combinatorial labeling. Likewise the notions of a TG-algebra and of a TS-algebra are nearly equivalent. They differ mostly just by how certain things are labeled.

VS-Algebras in Some Detail

The basic definitions

Definition. For a natural number n let \underline{n} denote the set \{0,1,2,\ldots,n\}. Let {\mathbf{VS}} denote the category whose objects are the natural numbers and whose morphisms are given by


with the obvious composition of morphisms. For brevity we will often specify morphisms/functions by simply listing their values, omitting the value at 0 as it is anyway fixed. Thus for example, \alpha=(1,2,2), or even shorter, \alpha=(122), means \alpha:\underline{3}\to\underline{2} with \alpha(0)=0, \alpha(1)=1, \alpha(2)=2 and \alpha(3)(2) (strictly speaking, the target space of (122) can be any \underline{n} with n\geq 2).

Interpretation. The object "n" stands for "n strands". A morphism \alpha:m\to n means "for any 1\leq k\leq m, strand number k in m looks at strand number \alpha(k) in n if \alpha(k)>0, and looks nowhere if \alpha(k)=0".

Definition. A VS-algebra is a contravariant functor {\mathbf A} from the category {\mathbf{VS}} to the category of algebras over some fixed ring of scalars. We denote {\mathbf A}(n) by A_n and {\mathbf A}(\alpha) by \alpha^\star.

Interpretation. In a TS-algebra we have an algebra for any number of strands, with multiplication corresponding to "stacking two n-stranded objects (imagine braids) one on top the other". We think of an element \Psi of A_n as "n strands each of which carrying some algebraic information". If \alpha:m\to n, then \alpha^\star\Psi has m strands carrying algebraic information, and if \alpha(k)>0, strand number k in \alpha^\star\Psi "reads" its information from strand number \alpha(k) in \Psi. If \alpha(k)=0, strand number k in \alpha^\star\Psi reads its information from nowhere, so it carries some "default" information, presumably "empty".

You are probably familiar with the notation used elsewhere (in [Bar-Natan_97], for example) when dealing with associators and the pentagon and hexagon equations. Here's a quick dictionary:

Elsewhere In Words Here In Words
(1\otimes\Delta):{\mathcal A}_2\to{\mathcal A}_3 Copy the first strand untouched and double the second strand (122)^\star The first output strand reads from the first input strand, the second and third both read from the second.
s_2:{\mathcal A}_3\to{\mathcal A}_2 Delete the second strand. (13)^\star Nothing reads from the second strand, as 2 isn't in the range of (13).
\Psi\mapsto\Psi^{23} Add an empty strand on the left. (012)^\star The first strand reads from nowhere to it is empty. The second and third output strands read from the first and second input strands respectively.
\Psi\mapsto\Psi^{231} Permute the strands: Install 1 on 2, 2 on 3 and 3 on 1. (312)^\star Permute the strands: Read 1 from 3, 2 from 1 and 3 from 2.

Thus the new notation is the opposite of the old when it comes to permutations: if \sigma is a permutation, \Psi^\sigma is now (\sigma^{-1})^\star\Psi. It is a small price to pay considering the very short description (as above) that now becomes available for VS-algebras.

The VS-Algebra of legs and VS-algebras of animals

One of the most fundamental VS-Algebras is the VS-algebra {\mathbf L} of "legs", defined as follows. Set L_n to be the free associative and commutative algebra generated by "leg symbols" \{l_1,\ldots,l_n\} (think, "l_k is a leg on strand number k"). Then let

(i_1i_2\cdots i_m)^\star l_k := \sum_{\{j\colon i_j=k\}}l_j

(thus strand number j in the output looks at strand number i_j in the input, and if it sees a leg there, it takes a copy). It is a routine exercise to verify that {\mathbf L} is indeed a VS-algebra.

An "animal" is a formal symbol with a fixed number of "legs", and it is bilinear in those legs. Thus for example we may declare that the animal Y has three legs, and so "a Y animal in A_n" will be a symbol of the form Y_{k_1k_2k_3} where l_{k_1}, l_{k_2} and l_{k_3} are legs in L_n (thus 1\leq k_1,k_2,k_3\leq n), and Y animals get pulled back as the sum of all ways of pulling back their legs:

(i_1i_2\cdots i_m)^\star Y_{k_1k_2k_3} := \sum_{\{(j_1,j_2,j_3)\colon\ i_{j_1}=k_1,\ i_{j_2}=k_2, \ i_{j_3}=k_3\}}Y_{j_1j_2j_3}.
*The superscript "nl" stands for "non-local". A local version of this VS-algebra will be introduced after locality is introduced further below.

Once we choose our formal symbols for animals, we may consider the free associative (though not commutative!) algebra A^{nl}_n generated by all such animals with legs in L_n and the resulting collection of algebras and pullback operations will form a VS-algebra*.

The most standard example is the two-legged animal t_{ij} often referred to as "a chord from strand i to strand j"; this animal is also declared to be symmetric - it is declared that t_{ij}=t_{ji} for all i and j. The resulting VS-algebra is the VS-algebra {\mathcal A}^{hor,nl} of (non-local) "horizontal chords".

The pentagon and the hexagons

The Pentagon For Parenthesized Braids.jpg The Hexagons For Parenthesized Braids.jpg
The Pentagon and the Hexagons for Parenthesized Braids

The main thing I'd like to do in a VS-algebra is to write and solve the pentagon and hexagons equations. The unknowns in these equations are an invertible element R\in A_2 and an invertible element \Phi\in A_3, and the equations read:

{{Equation|Pentagon|(1230)^\star\Phi\cdot(1223)^\star\Phi\cdot(0123)^\star\Phi = (1123)^\star\Phi\cdot(1233)^\star\Phi