|
|
(5 intermediate revisions by one user not shown) |
Line 1: |
Line 1: |
| {{07-1352/Navigation}} | | {{07-1352/Navigation}} |
− | {{in Preparation}}
| |
| | | |
− | ==A HOMFLY Braidor== | + | ==A Second Look== |
| | | |
− | ===The Algebra===
| + | We'll take a second look at [[06-1350/Class Notes for Tuesday October 24]]. |
| | | |
− | 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:
| + | ==A Numerology Problem== |
− | # <math>x</math> commutes with everything else.
| + | |
− | # The product of permutations is as in the symmetric group <math>S_n</math>.
| + | |
− | # If <math>\sigma</math> is a permutation then <math>t_i\sigma=\sigma t_{\sigma i}</math>.
| + | |
− | # <math>[t_i,t_j]=x\sigma_{ij}(t_i-t_j)</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>.
| + | |
| | | |
− | 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>. | + | We briefly mentioned a numerology problem from {{Dror}}'s [[paperlet]] [[The HOMFLY Braidor Algebra]]. More about it will come later. |
− | | + | |
− | '''Examples.'''
| + | |
− | # The general element of <math>A_1</math> is <math>(1)f(x,t_1)</math> where <math>(1)</math> denotes the identity permutation and <math>f(x,t_1)</math> is a power series in two variables <math>x</math> and <math>t_1</math>. <math>A_1</math> is commutative.
| + | |
− | # The general element of <math>A_2</math> is <math>(12)f(x,t_1,t_2)+(21)g(x,t_1,t_2)</math> where <math>f</math> and <math>g</math> are power series in three variables and <math>(12)</math> and <math>(21)</math> are the two elements of <math>S_2</math>. <math>A_2</math> is not commutative and its product is non-trivial to describe.
| + | |
− | # The general element of <math>A_3</math> is described using <math>3!=6</math> power series in 4 variables. The general element of <math>A_n</math> is described using n! power series in <math>n+1</math> variables.
| + | |
− | | + | |
− | The algebra <math>A_n</math> embeds in <math>A_{n+1}</math> in a trivial way by regarding <math>\{1,\ldots,n\}</math> as a subset of <math>\{1,\ldots,n+1\}</math> in the obvious manner; thus when given an element of <math>A_n</math> we are free to think of it also as an element of <math>A_{n+1}</math>. There is also a non-trivial map <math>\Delta:A_n\to A_{n+1}</math> defined as follows:
| + | |
− | # <math>\Delta(x)=x</math>.
| + | |
− | # <math>\Delta(t_i)=t_{i+1}+x\sigma_{1,i+1}</math>.
| + | |
− | # <math>\Delta</math> acts on permutations by "shifting them one unit to the right", i.e., by identifying <math>\{1,\ldots,n\}</math> with <math>\{2,\ldots,n+1\}\subset\{1,\ldots,n+1\}</math>.
| + | |
− | | + | |
− | ===The Equations===
| + | |
− | | + | |
− | We seek to find a "braidor"; an element <math>B</math> of <math>A_2</math> satisfying:
| + | |
− | * <math>B=(21)+x(12)+</math>(higher order terms).
| + | |
− | * <math>B(\Delta B)B=(\Delta B)B(\Delta B)</math> in <math>A_3</math>.
| + | |
− | | + | |
− | With the vector space identification of <math>A_n</math> with <math>B_n</math> 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===
| + | |
− | | + | |
− | ===Computer Games===
| + | |
− | | + | |
− | A pathetic mathematica program to play with these objects is [http://katlas.math.toronto.edu/svn/06-1350/ComputingTheJonesPolynomial.nb here].
| + | |