How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite semisimple PBW and highest-weight construction
Statement
For a finite-dimensional complex Lie algebra , its universal enveloping algebra is , where is the algebra of finite linear combinations of finite tensor words, including the empty word , and the denominator is the two-sided ideal generated by the displayed relations. For any ordered finite basis , the monomials form a vector-space basis of .
Now let be finite-dimensional complex semisimple with a Cartan and positive system as in the preceding root-structure lemma. Set and . For let be the one-dimensional -module on which acts by and by zero, and define . It is generated by , with and , and is universal for these relations. Its negative-root ordered monomials on form a basis; its support is , each weight space is finite-dimensional and the top space has dimension one. It has a unique simple quotient .
For every dominant integral , is finite-dimensional, its support is contained in , its top weight has multiplicity one, and all its weight multiplicities are -invariant. Every nonzero finite-dimensional simple -module is exactly one such up to isomorphism, with a unique dominant integral highest weight. These assertions include the zero algebra and use no AC.
Facts & Assumptions
Given: The Lie/representation conventions of Finite semisimple Lie algebras and the symmetric adjoint action, and the displayed finite tensor-word constructions. A weight- vector satisfies for every ; a highest vector is nonzero and also annihilated by .
The finite root decomposition, simple triples, positive/negative root bases, nilpotence of root adjoint operators and root/weight lattices come from Finite semisimple Cartan, root and string structure.
Finite rank-one representations have the explicit complete decomposition into , with diagonalizable and the stated raising/lowering coefficients, by Finite Lie triangularization and rank-one complete reducibility.
Every lattice weight has a dominant Weyl representative by Finite Weyl closed chambers and stabilizers, and each dominant ideal is finite by Weyl orbit sums form a basis of finite Weyl invariants.
Proof
In a tensor word replace an adjacent pair with by , expanding the bracket in the given finite basis. Order words first by length and then by the number of inverted pairs of indices. Each resulting word is smaller: swapping the adjacent inversion reduces its inversion number, and bracket terms have shorter length. Consequently recursive reduction terminates in a finite linear combination of ordered words. Here the recursion is finite because below any fixed length there are only finitely many basis words.
We verify uniqueness of the reduction by induction in the order from step 1.1. Two reductions at disjoint adjacent pairs commute after expansion. Two overlapping reducible pairs can only occur in with strictly descending basis indices . Reducing its left pair and continuing the three-letter swaps yields ; reducing its right pair yields . Their difference reduces, using the length-two relation and bilinearity, to by Jacobi. In any surrounding word these comparison terms have smaller length than the original, so the induction hypothesis applies to all their further reductions. Thus any two first reductions have the same final value, and induction proves a unique linear normal-form map on all words. The normal form of each contextual relation is zero, since one of its two-letter orders is the permitted reduction; equality or reversed indices follow from antisymmetry. By linearity this holds for arbitrary linear , so the entire defining ideal is killed. Conversely each reduction changes an element by that ideal. Ordered words are fixed by normal form, so their images are independent as well as spanning in the quotient. This proves PBW without importing a rewriting or symmetric-group presentation theorem. Evaluation of tensor words also proves the universal property: every representation of extends uniquely to a unital -action.
F1 makes and subalgebras, since brackets add root weights. Order a basis of with negative roots first, Cartan second and positive roots last. Step 2.1 identifies multiplication as a vector-space isomorphism and a right -module isomorphism: both sides have exactly the corresponding ordered monomial basis, and right multiplication is respected by associativity. The one-dimensional action is well-defined because brackets in lie in and is abelian. Tensoring the displayed right-module decomposition gives the negative-root monomial basis of . Evaluation for any vector satisfying the highest relations proves the universal property and generation. Commuting through a negative monomial shows its weight is . The positive roots are finite and have positive integer heights, so fixing that sum bounds every by its total height and gives a finite-dimensional weight space. All of occurs by monomials in the simple negative roots; height zero permits only the empty monomial.
In any weight module where are locally nilpotent, each weight vector generates a finite-dimensional module for that rank-one triple. Indeed PBW from step 2.1 applied to its three-dimensional algebra puts all acting words in the order . There are only finitely many nonzero ; each is an -eigenvector, so varying only rescales it; for each of these finitely many vectors only finitely many powers are nonzero. Thus their span is finite-dimensional and invariant. If is an integer, F2 shows that is injective on weight- vectors in each such finite rank-one module: on every containing weight , lowering steps reaches weight with no zero coefficient. Therefore it is injective on the entire joint space and maps it into . For , use instead. Applying the same argument at gives the reverse injection; for finite weight spaces their dimensions are equal. Since simple reflections generate , multiplicities are -invariant.
Every submodule of this weight module is a sum of its weight spaces. For an element with finitely many weight components choose separating them and apply finite interpolation polynomials in to extract each component in the submodule. Such an exists by avoiding finitely many proper linear hyperplanes, for example using a polynomial curve in a basis and avoiding its finitely many scalar zeros. A proper submodule cannot contain the top vector, which generates . The sum of all proper submodules is still missing the top component, hence is proper, and contains every proper submodule. Thus is simple and is the unique simple quotient. Quotients retain the weight decomposition, finite weight spaces and one-dimensional top by these same projections. Two simple highest modules with highest weights can be isomorphic only if both and belong to , since each is a quotient of its Verma module. Independence of the simple roots then gives .
Suppose is dominant integral and put . In , the identity follows by induction from the rank-one brackets. Hence is killed by . It is killed by every , , because by the root signs, and therefore by by simple generation. Its generated submodule has support below by the universal property in step 3.1. The finite sum of these submodules consequently misses the top weight and is proper. The nonzero quotient has for every , and maps onto by step 4.1.
Both and act locally nilpotently on . For , its powers shift a weight by ; if this leaves , so gives zero. For , F1 says is nilpotent on the finite-dimensional . Its derivation on is locally nilpotent: on a fixed product of finitely many generators, the iterated product rule vanishes when one factor must have been differentiated beyond its finite bound, and the same holds for a finite sum. In the finite binomial identity then vanishes for sufficiently large , by the bound for and the top-vector relation from step 5.1. Every vector of is of this form or a finite sum, proving the assertion. It descends to .
Apply step 3.2 to using step 6.1. Its weights lie in . Every support weight has a dominant Weyl representative by F3, which stays in the support by multiplicity invariance and hence is at most . F3 makes these dominant points finite in number, and is finite. Thus the entire support is finite. Step 4.1 makes each weight space finite-dimensional, so is finite-dimensional. This establishes existence before using any finite-dimensional highest-weight classification.
Conversely let be a nonzero finite-dimensional simple -module. F2 diagonalizes each with integral eigenvalues. They commute and span , so successive eigenspace decomposition gives a finite set of joint weights in . Choose a weight maximizing a real linear functional which is positive on every simple root, and choose a nonzero vector there. Every kills , since otherwise it raises that functional, and therefore . For each rank-one triple, F2 shows a nonzero -eigenvector in has a nonnegative integral eigenvalue: in its direct sum of it is a sum of highest vectors with that same highest weight. Thus its joint weight is dominant integral. Simplicity makes generate , and steps 3.1–4.1 give with unique . For the zero algebra the root lists and basis are empty, , and every finite-dimensional simple module is one-dimensional with trivial action. All bases, reductions and projections were finite; the sums of all proper submodules are set-defined without selections, so no AC is used.
Depends on
Used by
Dependency tree · two levels
13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Pavel Etingof, Lie Groups and Lie Algebras, §§13,25; local finite PBW and integrable-quotient proof (standard reference, not scraped)