For the cycle-sum identity for Young–Jucys–Murphy elements, let be the sum of all -cycles on . Multiplying such a cycle by inserts immediately after in that cycle, with our composition convention. Every -cycle has a unique predecessor of , so deleting recovers a unique term of . Since , induction gives
For the empty product is the identity, also the unique one-cycle.
For the product assertion in a non-hook shape, , so cell is present. Its Content of a Young-diagram cell is zero and its label is at least four. Since , that factor in the product vanishes. Therefore
A hook partition has cell contents
In a standard Young tableau, the unique zero-content cell is and contains . The other eigenvalues are precisely the remaining contents, in whatever order the tableau supplies. Their product is independent of that order:
The scalar is nonzero over the complex numbers. For the single row or single column, one of the factorials is ; the formula still gives or , respectively.
The Gelfand–Tsetlin basis spans , and the scalar computed on its vectors depends only on the shape. Thus
for every . The product is the sum of the permutations in the conjugacy class of an -cycle. Taking traces therefore gives equal to the displayed scalar times .
For a hook partition, a standard Young tableau is uniquely determined by the choice of its entries below the top cell, selected from . The column and the remaining row are then forced to increase. Hence , and cancellation of the factorials yields
This uses the central character value of a conjugacy-class sum and tableau counting, without a character rule for removing rim hooks.

Articles by others on the same topic (0)

There are currently no matching articles.