06-1350/Class Notes for Tuesday October 24: Difference between revisions
No edit summary |
|||
| Line 19: | Line 19: | ||
|} |
|} |
||
(here <math>(jk)</math> denotes the transposition of <math>j</math> and <math>k</math>, <math>k_1k_2k_3k_4</math> denotes the permutation for which <math>i\mapsto k_i</math>, and the bracket is taken in the additive sense: <math>[\tau,\sigma]:=\tau\sigma-\sigma\tau)</math>. Do you have quicker explanation? |
(here <math>(jk)</math> denotes the transposition of <math>j</math> and <math>k</math>, <math>k_1k_2k_3k_4</math> denotes the permutation for which <math>i\mapsto k_i</math>, and the bracket is taken in the additive sense: <math>[\tau,\sigma]:=\tau\sigma-\sigma\tau)</math>. Do you have quicker explanation? |
||
'''Question 3.''' I suspect that in some sense, though I don't know in which sense, <math>H</math> generates the whole kernel or at least some easily definable special part of the kernel of <math>c</math> for ''all'' <math>n</math>. Can you make sense of that? |
|||
==The Lengthy Computation== |
==The Lengthy Computation== |
||
Revision as of 19:22, 23 October 2006
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||
What Cyclic Permutations Can't See
Believe or not, but the following questions are directly related to class material - specifically, to the determination of "The Envelope of The Alexander Polynomial".
Let [math]\displaystyle{ S_n }[/math] denote the permutation group on [math]\displaystyle{ n }[/math] letters and let [math]\displaystyle{ {\mathbb Q}S_n }[/math] denote its group ring. Let [math]\displaystyle{ c:{\mathbb Q}S_n\to{\mathbb Q} }[/math] be the linear functional defined via its definition on generators by [math]\displaystyle{ c(\sigma)=1 }[/math] if the permutation [math]\displaystyle{ \sigma }[/math] is cyclic, and [math]\displaystyle{ c(\sigma)=0 }[/math] otherwise. Turn [math]\displaystyle{ c }[/math] into a (symmetric!) bilinear form (also called [math]\displaystyle{ c }[/math]) on [math]\displaystyle{ {\mathbb Q}\otimes{\mathbb Q} }[/math] by setting [math]\displaystyle{ c(\tau,\sigma):=c(\tau^{-1}\sigma) }[/math].
Question 1. Determine the kernel [math]\displaystyle{ \ker c }[/math] of the bilinear form [math]\displaystyle{ c }[/math]. (Recall that the kernel of a bilinear form [math]\displaystyle{ \gamma }[/math] is [math]\displaystyle{ \{w:\forall v,\ \gamma(v,w)=0\} }[/math].
Question 2. For [math]\displaystyle{ n=4 }[/math], I know by a lengthy computation (see below) that [math]\displaystyle{ H }[/math] is in [math]\displaystyle{ \ker c }[/math], where
| [math]\displaystyle{ H = [(12),[(13),(14)]]-(14)-(23)+(13)+(24) }[/math] |
| [math]\displaystyle{ \ \ = [2134,[3214,4231]]-4231-1324+3214+1432 }[/math] |
| [math]\displaystyle{ \ \ = 2341-2413-3142+4123-4231-1324+3214+1432 }[/math] |
(here [math]\displaystyle{ (jk) }[/math] denotes the transposition of [math]\displaystyle{ j }[/math] and [math]\displaystyle{ k }[/math], [math]\displaystyle{ k_1k_2k_3k_4 }[/math] denotes the permutation for which [math]\displaystyle{ i\mapsto k_i }[/math], and the bracket is taken in the additive sense: [math]\displaystyle{ [\tau,\sigma]:=\tau\sigma-\sigma\tau) }[/math]. Do you have quicker explanation?
The Lengthy Computation
The lengthy computation involves multiplying 24 "test permutations" against a linear combination of 8 permutations and counting cycles in the resulting 192 permutations. Here's a Mathematica session that does that:
In[1]:=
|
S[n_] := (P @@@ Permutations[Range[n]]);
c[p_P] := If[
Length[p] == Length[NestWhileList[p[[#]] &, p[[1]], # > 1 &]],
1, 0
];
c[x_] := x /. p_P :> c[p];
Unprotect[NonCommutativeMultiply];
p1_P ** p2_P := p1 /. Thread[Rule[Range[Length[p2]], List @@ p2]];
p1_ ** (p2_ + p3_) := p1 ** p2 + p1 ** p3;
(p1_ + p2_) ** p3_ := p1 ** p3 + p2 ** p3;
p1_ ** (c_*p2_P) := c p1 ** p2;
(c_*p1_P) ** p2_ := c p1 ** p2;
b[a_, b_] := a ** b - b ** a;
|
In[2]:=
|
H = b[P[2, 1, 3, 4], b[P[3, 2, 1, 4], P[4, 2, 3, 1]]]
- P[1, 3, 2, 4] + P[1, 4, 3, 2] + P[3, 2, 1, 4] - P[4, 2, 3, 1]
|
Out[2]=
|
-P[1, 3, 2, 4] + P[1, 4, 3, 2] + P[2, 3, 4, 1] - P[2, 4, 1, 3] -
P[3, 1, 4, 2] + P[3, 2, 1, 4] + P[4, 1, 2, 3] - P[4, 2, 3, 1]
|
In[3]:=
|
c[# ** H] & /@ S[4]
|
Out[3]=
|
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}
|
