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 thatHence is invariant under and , and every has trace on . In particular implies . Characteristic zero gives .
The simultaneous weight space is nonzero and stable under , becauseOver , 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 .
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
Let be the two-dimensional affine Lie algebra with basis and bracket , and putBoth factors have zero centre, so . The line in the second factor is an ideal, making PSS. But its quotient onto the nonabelian simple algebra is not soluble. A quotient of a soluble algebra would be soluble, so is not soluble.
If is abelian and nonzero, . Otherwise choose such that is an ideal. For each writeThe coefficient is uniquely defined and linear. The Jacobi identity givesso . If , then .
If , the same equation says for all . Hence . Since is not central, its centralizer is proper. Thus in both casesNo algebraic closure or characteristic restriction was used.
Choose a basis with . The representation matrices areThe 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, andThe argument works over the stated arbitrary field, including positive characteristic.
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 , andIf 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, givingThis recursive method does not assume that a single element separates every character, which could fail over a finite field.
Writing matrices in blocks, the defining relation givesThe trace is automatically zero. The relation is linear, and if , , thenThus is closed under the commutator and is a Lie subalgebra of .
Its diagonal subalgebra isPut , . Since , the required block decomposition isThe 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 .
A reduced crystallographic root system is a finite spanning subset of a real Euclidean vector space, excluding zero, such that , each reflection preserves , and all Cartan integers are integers. A base is a vector-space basis in which each root has integer coordinates either all nonnegative or all nonpositive. The Weyl group is generated by the root reflections.
For nonparallel roots put and . Then is an integer strictly below and at least zero. ThereforeIf , the positive integers have product or , so at least one is one. If , reflection gives and hence its negative. If , reflection directly gives . This proves the positive-inner-product assertion.
To prove that an -string has no gaps, suppose consecutive occurring integer positions in had . If , apply the previous result to and to obtain the missing root at . Thus this inner product must be nonnegative. Similarly the absence of a root at forces . But the latter inner product exceeds the former by , impossible. Thus every intermediate integer position occurs.
Write the complete finite string as . Reflection maps position to , so it interchanges the two endpoints. HenceHere are the maximal endpoint distances, not arbitrary shorter distances mentioned in the existence assertion.
Use the Cartan-matrix convention . The displayed matrix is realized bywith the standard orthonormal coordinates. Closure under the two simple reflections givesThe positive roots are . Conversely the standard fact that every root is Weyl-conjugate to a simple root, or successive height reduction by simple reflections, shows these two reflection orbits exhaust the roots. This is the rank-two system , also called after exchanging the length convention. With a transposed Cartan-matrix convention, interchange which simple-root label is short; the geometric system and Weyl group are unchanged.
Rank-two root system with its chosen simple roots
. Details. The reflection in flips the second coordinate, while the reflection in swaps the two coordinates. These generate all eight signed permutation matrices in two coordinates. Thuswhere means the symmetry group of a square.
Articles by others on the same topic
There are currently no matching articles.
