07-1352/Class Notes for January 23: Difference between revisions

From Drorbn
Jump to navigationJump to search
Line 13: Line 13:
Finally, declare that <math>\deg x=\deg t_i=1</math> while <math>\deg\sigma=0</math> for every <math>1\leq i\leq n</math> and every <math>\sigma\in S_n</math>, and let <math>A_n</math> be the graded completion of <math>A^1_n</math>.
Finally, declare that <math>\deg x=\deg t_i=1</math> while <math>\deg\sigma=0</math> for every <math>1\leq i\leq n</math> and every <math>\sigma\in S_n</math>, and let <math>A_n</math> be the graded completion of <math>A^1_n</math>.


We say that an element of <math>A_n</math> is "sorted" if it is written in the form <math>x^k\cdot\sigmat_1^{k_1}t_2^{k_2}\cdots t_n^{k_n}</math> where <math>\sigma</math> is a permutation and <math>k</math> and the <math>k_i</math>'s are all non-negative integer. The HOMFLY relations imply that every element of <math>A_n</math> is a linear combinations of sorted elements. Thus as a vector space, <math>A_n</math> can be identified with the ring <math>B_n</math> of power series in the variables <math>x,t_1,\ldots,t_n</math> tensored with the group ring of <math>S_n</math>. The product of <math>A_n</math> is of course very different than that of <math>B_n</math>.
We say that an element of <math>A_n</math> is "sorted" if it is written in the form <math>x^k\cdot\sigma t_1^{k_1}t_2^{k_2}\cdots t_n^{k_n}</math> where <math>\sigma</math> is a permutation and <math>k</math> and the <math>k_i</math>'s are all non-negative integer. The HOMFLY relations imply that every element of <math>A_n</math> is a linear combinations of sorted elements. Thus as a vector space, <math>A_n</math> can be identified with the ring <math>B_n</math> of power series in the variables <math>x,t_1,\ldots,t_n</math> tensored with the group ring of <math>S_n</math>. The product of <math>A_n</math> is of course very different than that of <math>B_n</math>.


'''Examples.'''
'''Examples.'''

Revision as of 19:43, 22 January 2007

In Preparation

The information below is preliminary and cannot be trusted! (v)

A HOMFLY Braidor

The Algebra

Let be the free associative (but non-commutative) algebra generated by the elements of the symmetric group on and by formal variables and , and let be the quotient of by the following "HOMFLY" relations:

  1. commutes with everything else.
  2. The product of permutations is as in the symmetric group .
  3. If is a permutation then .
  4. , where is the transposition of and .

Finally, declare that while for every and every , and let be the graded completion of .

We say that an element of is "sorted" if it is written in the form where is a permutation and and the 's are all non-negative integer. The HOMFLY relations imply that every element of is a linear combinations of sorted elements. Thus as a vector space, can be identified with the ring of power series in the variables tensored with the group ring of . The product of is of course very different than that of .

Examples.

  1. The general element of is where denotes the identity permutation and is a power series in two variables and . is commutative.
  2. The general element of is where and are power series in three variables and and are the two elements of . is not commutative and its product is non-trivial to describe.
  3. The general element of is described using power series in 4 variables. The general element of is described using n! power series in variables.

The algebra embeds in in a trivial way by regarding as a subset of in the obvious manner; thus when given an element of we are free to think of it also as an element of . There is also a non-trivial map defined as follows:

  1. .
  2. .
  3. acts on permutations by "shifting them one unit to the right", i.e., by identifying with .

The Equations

We seek to find a "braidor"; an element of satisfying:

  • (higher order terms).
  • in .

With the vector space identification of with in mind, we are seeking two power series of three variables each, whose low order behaviour is specified and which are required to satisfy 6 functional equations written in terms of 4 variables.

The Equations in Functional Form

A Solution