The Young diagram is . The hook length of a box is
counting the box itself, the boxes to its right in the same row, and the boxes below it in the same column. The hook-length formula is
The first implication in the equivalence is immediate: if every hook length is odd, no hook can have length two.
Assume no hook has length two. The last row has length one, since otherwise its penultimate box has hook length two. If two adjacent row lengths are equal, take the last two rows in the maximal block of that length; the last box in the upper of those two rows has hook length two. Thus all row lengths are distinct. If a gap were at least two, the penultimate box in row would again have hook length two, since there would be no boxes below it. Therefore every successive gap equals one and the final part equals one, proving (2) implies (3).
The final condition makes . Its column lengths are the same staircase, so
which is odd. This proves (3) implies (1) and completes the equivalence. Such a partition exists exactly at the triangular numbers
The hook formula gives , since its denominator is odd. Thus divides . Conversely implies . The product is an integer, so its valuation is zero and all its hooks are odd. By the equivalence is a staircase; its size uniquely determines its length, so .
For the character assertion, every removable rim hook has length equal to some hook length of the diagram. Here is a direct justification. If a border strip occupies rows through , connectedness and absence of a two-by-two block make adjacent strips of boxes overlap in exactly one column. Hence for , so its size is . The column has height , giving exactly . Therefore every removable rim hook of the staircase has odd length.
A fixed-point-free permutation of power-of-two order has only even cycles. Apply the Murnaghan–Nakayama rule starting with any cycle. It would require removal of a rim hook of that even length, but none exists. The sum is empty, so
Finally suppose has distinct parts and is not . It cannot be another staircase of the same size. Thus some gap between successive rows is at least two, or the last row has length at least two; in either case a horizontal rim domino is removable. No vertical rim domino is removable, since that would require two equal adjacent row lengths. Murnaghan-Nakayama on a transposition consequently gives a nonempty sum
all signs being positive and all tableau counts positive. Thus the character is nonzero at every transposition, proving the requested existence.
For a tableau , let be its column stabilizer and its polytabloid. The Specht module is the span of all such polytabloids inside the tabloid permutation module.
A tabloid with second row of size is determined by that subset, so . The two-row hook formula gives
At this proves
By Maschke's theorem, characteristic-zero permutation modules are completely reducible, so their Specht submodules are summands. The nonzero sum of all three-subset tabloids is fixed by every permutation; its span is a copy of the trivial module .
A permutation sends to , to and to . Relabeling the summation indices gives
Linearity therefore proves both maps are module homomorphisms. The map denoted in the second displayed source formula is .
For the standard tableau with second row , the first entries in the top row are , so its nontrivial columns are and . Hence
In the coefficient of is one: among those four pairs only is contained in , since . Thus the image is nonzero. Its restriction to the characteristic-zero simple module has zero kernel, giving the requested isomorphic submodule.
For , choose the standard tableau with lower entry two and top-left entry one. Its polytabloid is . Each three-subset containing occurs twice in , once for each choice of its other two entries as the intermediate . Consequently the coefficient of in is two. This is nonzero in characteristic zero. Simplicity again makes the restriction injective, giving a copy of .
The four constructed submodules have the distinct shapes , , and , so they are pairwise nonisomorphic irreducible characteristic-zero modules. Complete reducibility therefore makes their sum direct. The given decomposition of and the dimension identity in (a) show their dimensions sum to . Their direct sum is consequently the whole module:
Use the standard invariant tabloid bilinear form, with the tabloid basis orthonormal. Each permutation acts by an orthogonal matrix, so . Inversion permutes and preserves its signs. Therefore
The James submodule theorem states that for any submodule , either or . Use the allowed fact . The coefficient of in is one, so the displayed adjoint identity gives . If is not orthogonal to , some and some tableau have . Hence , and its permutation translates span . This proves the theorem.
Let . Every proper submodule of lies in by the theorem. If the restricted form is nonzero, is proper, hence is the unique maximal submodule and
In the stronger nondegenerate case specified in the question, , so itself is simple. The nonzero-form version also covers the possibly degenerate case needed in the final calculation.
For shape , identify with with basis . Its Specht module is the augmentation subspace , spanned freely by , . Its Gram matrix is , with diagonal entries two and off-diagonal entries one. Equivalently, in is the span of . This vector belongs to exactly when . Thus the restricted radical has dimension one if and zero otherwise, giving
For this quotient is nonzero and simple by the theorem. In the small exceptional case , the canonical radical quotient is zero, as the same dimension formula states; it is then not a nonzero simple module. This qualification distinguishes the numerical formula from the nonzero-form hypothesis.

Articles by others on the same topic (0)

There are currently no matching articles.