07-1352/Class Notes for January 23: Difference between revisions
No edit summary |
No edit summary |
||
Line 6: | Line 6: | ||
===The Algebra=== |
===The Algebra=== |
||
Let <math> |
Let <math>A^0_n=\langle S_n, x, t_1,\ldots t_n\rangle</math> be the free associative (but non-commutative) algebra generated by the elements of the symmetric group <math>S_n</math> on <math>\{1,\ldots,n\}</math> and by formal variables <math>x</math> and <math>t_1\ldots t_n</math>, and let <math>A^1_n</math> be the quotient of <math>A^0_n</math> by the following "HOMFLY" relations: |
||
Let <math>A^0_n=\langle S_n, x, t_1,\ldots t_n\rangle</math> be the free associative (but non-commutative) algebra generated by the elements of the symmetric group <math>S_n</math> on <math>\{1,\ldots,n\}</math> and by formal variables <math>x</math> and <math>t_1\ldots t_n</math>, and let <math>A^1_n</math> be the quotient of <math>A^0_n</math> by the following relations: |
|||
# <math>x</math> commutes with everything else. |
# <math>x</math> commutes with everything else. |
||
# The product of permutations is as in the symmetric group <math>S_n</math>. |
# The product of permutations is as in the symmetric group <math>S_n</math>. |
||
Line 14: | Line 12: | ||
# <math>[t_i,t_j]=x\sigma_{ij}(t_j-t_i)</math>, where <math>\sigma_{ij}</math> is the transposition of <math>i</math> and <math>j</math>. |
# <math>[t_i,t_j]=x\sigma_{ij}(t_j-t_i)</math>, where <math>\sigma_{ij}</math> is the transposition of <math>i</math> and <math>j</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>. |
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^kt_1^{k_1}t_2^{k_2}\cdots t_n^{k_n}\cdot\sigma</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>. |
|||
===The Equations=== |
===The Equations=== |
||
===The Equations in Functional |
===The Equations in Functional Form=== |
||
===A Solution=== |
===A Solution=== |
Revision as of 16:01, 22 January 2007
|
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:
- commutes with everything else.
- The product of permutations is as in the symmetric group .
- If is a permutation then .
- , 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 .