For fixed , set . The homomorphism property gives and . Its initial derivative is . The one-parameter subgroup uniqueness theorem gives
For the Adjoint representation, . Thus
The differential is a real linear map of Lie algebras; the bracket identity follows by differentiating the compatibility of conjugation with .
For a Matrix Lie group, consists of derivatives of differentiable curves in with , viewed inside as a real vector space. At the identity, multiplying two such curves adds their derivatives, and reparametrizing a curve multiplies its derivative by any real scalar. Thus is a real vector subspace.
If and , conjugating a curve with derivative proves . Let have and . Differentiating the curve inside the finite-dimensional, hence closed, vector subspace gives
The matrix commutator is real bilinear, antisymmetric, and satisfies the Jacobi identity by associativity of matrix multiplication. This proves that is a real Lie algebra.
The exponential-map theorem for a linear Lie group says whenever . Applying it to every real multiple of gives for every real . Conversely that curve has derivative at zero, so . Hence
The full-cycle formula says that precisely the nonhook shapes have zero value on a 6-cycle. These are .
Use the standard two-row permutation-character rule . A transposition has four fixed points, so . It fixes two-subsets, giving . It fixes three-subsets, giving .
Conjugating a partition tensors its character with the sign character. Hence the values on a transposition for the conjugate shapes are and . The shape is self-conjugate, so its character equals its own sign twist and is zero on every odd permutation. The complete candidate table is therefore:
ShapeValue on a transposition
Thus the unique answer is
Irreducible character orthogonality gives . Under the proposed vanishing condition, only the identity contributes, so
But is an integer dimension and is not a square. Thus no such partition exists.
There is more than one solution: the trivial representation has character everywhere and the sign representation has character everywhere. Thus
In fact they are the only ones. The full-cycle formula in the preceding discussion forces any candidate to be a hook . For , the standard character is the number of fixed points minus one, so it vanishes on cycle type ; its sign twist does too. For , the hook representation is the exterior square of the standard representation and has character . At cycle type both standard-character values are one, so this character is zero. Its sign twist also vanishes there. Only remain.
Writing matrices in blocks, the defining relation gives
The trace is automatically zero. The relation is linear, and if , , then
Thus is closed under the commutator and is a Lie subalgebra of .
Its diagonal subalgebra is
Put , . Since , the required block decomposition is
The four lines have respective characters , , , . They are distinct and nonzero because . The two-dimensional summand has two trivial composition factors. These five submodules therefore have exactly the factor-grouping properties of part (b). Their dimensions sum to , the dimension obtained from four free entries in and one each in the skew-symmetric blocks .
The flag makes every composition factor one-dimensional, described by a character . The Jordan–Hölder theorem for modules for finite-length modules says that the multiset of simple composition factors is independent of the chosen composition series.
Here is a construction valid over every . For , every generalized eigenspace of is an -submodule. Indeed is nilpotent on , say of exponent , and
If is killed by , take . Terms with vanish by adjoint nilpotence, and all other terms kill . This proves invariance of the generalized eigenspace.
The flag also makes the characteristic polynomial of every split over . Whenever two composition characters differ, choose an on which they differ and split the module into the distinct generalized eigenspaces of . Repeat within each summand until all its composition factors have the same character. Every nontrivial split lowers dimensions, so the process terminates. Finally combine summands carrying the same character. Jordan–Hölder ensures that the resulting distinct blocks have distinct factor types, giving
This recursive method does not assume that a single element separates every character, which could fail over a finite field.
Choose a basis with . The representation matrices are
The one-dimensional modules have characters . If they coincide, these modules are isomorphic and the first alternative holds.
Otherwise choose with , where . Replacing by makes the upper-right entry of zero. The representation identity on commutators now gives, for every ,
Iteration yields . Nilpotence of implies for sufficiently large , by its lower central series. Since , it follows that for all . The new line is therefore a submodule, and
The argument works over the stated arbitrary field, including positive characteristic.
Let be the quotient map. A full flag of ideals in lifts by inverse images to a flag from to , with dimensions increasing by one. Prepending supplies the required full flag in . Thus supersolubility lifts across a one-dimensional ideal.
Over , a nonzero soluble has a one-dimensional ideal: apply part (a) to its adjoint image acting on . A common eigenvector spans an adjoint-invariant line, which is an ideal. The quotient is soluble and has smaller dimension, so induction and the lifting result give a full flag of ideals. Therefore a soluble complex Lie algebra is supersoluble.
Conversely this implication needs no field restriction. If has a full flag, its first nonzero ideal is one-dimensional and abelian, and has a full flag. By induction is soluble, so some term of the derived series of lies in ; its next derived term is zero. Hence
We prove Lie's theorem in the required form by induction on . If , any nonzero vector works. Otherwise solvability gives , so choose a codimension-one ideal and . By induction there are and a linear functional with for all .
Let . Choose the cyclic basis up to its first linear dependence. The commutator identity , with , proves inductively that
Hence is invariant under and , and every has trace on . In particular implies . Characteristic zero gives .
The simultaneous weight space is nonzero and stable under , because
Over , the restriction of to this nonzero finite-dimensional space has an eigenvector. That vector is an eigenvector of both and every , hence of every element 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:
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 .
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 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 .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact