Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 a, its universal enveloping algebra is U(a)=T(a)/(xyyx[x,y]), where T is the algebra of finite linear combinations of finite tensor words, including the empty word 1, and the denominator is the two-sided ideal generated by the displayed relations. For any ordered finite basis x1,,xn, the monomials x1a1xnan form a vector-space basis of U(a).

Now let g be finite-dimensional complex semisimple with a Cartan and positive system as in the preceding root-structure lemma. Set n±=αΦ±gα and b=hn+. For λh let Cλ be the one-dimensional b-module on which h acts by λ and n+ by zero, and define M(λ)=U(g)U(b)Cλ. It is generated by vλ=11, with hvλ=λ(h)vλ and n+vλ=0, and is universal for these relations. Its negative-root ordered monomials on vλ form a basis; its support is λQ+, each weight space is finite-dimensional and the top space has dimension one. It has a unique simple quotient L(λ).

For every dominant integral λ, L(λ) is finite-dimensional, its support is contained in λQ+, its top weight has multiplicity one, and all its weight multiplicities are W-invariant. Every nonzero finite-dimensional simple g-module is exactly one such L(λ) 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 hv=μ(h)v for every hh; a highest vector is nonzero and also annihilated by n+.

[F1]

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.

[F2]

Finite rank-one representations have the explicit complete decomposition into Vm, with h diagonalizable and the stated raising/lowering coefficients, by Finite Lie triangularization and rank-one complete reducibility.

[F3]

Every lattice weight has a dominant Weyl representative by Finite Weyl closed chambers and stabilizers, and each dominant ideal {μ dominant:μλ} is finite by Weyl orbit sums form a basis of finite Weyl invariants.

Proof

1.1

In a tensor word replace an adjacent pair xjxi with j>i by xixj+[xj,xi], 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.

givenalgebra
2.1

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 zyx with strictly descending basis indices z>y>x. Reducing its left pair and continuing the three-letter swaps yields xyz+[y,x]z+y[z,x]+[z,y]x; reducing its right pair yields xyz+x[z,y]+[z,x]y+z[y,x]. Their difference reduces, using the length-two relation and bilinearity, to [[y,x],z]+[y,[z,x]]+[[z,y],x]=0 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 u(xjxixixj[xj,xi])v 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 x,y, 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 a extends uniquely to a unital U(a)-action.

step 1.1givenalgebra
3.1

F1 makes n± and b subalgebras, since brackets add root weights. Order a basis of g with negative roots first, Cartan second and positive roots last. Step 2.1 identifies multiplication U(n)U(b)U(g) as a vector-space isomorphism and a right U(b)-module isomorphism: both sides have exactly the corresponding ordered monomial basis, and right multiplication is respected by associativity. The one-dimensional action Cλ is well-defined because brackets in b lie in n+ and h is abelian. Tensoring the displayed right-module decomposition gives the negative-root monomial basis of M(λ). Evaluation u1uv for any vector satisfying the highest relations proves the universal property and generation. Commuting h through a negative monomial shows its weight is λα>0aαα. The positive roots are finite and have positive integer heights, so fixing that sum bounds every aα by its total height and gives a finite-dimensional weight space. All of Q+ occurs by monomials in the simple negative roots; height zero permits only the empty monomial.

step 2.1F1givenalgebra
3.2

In any weight module where ei,fi are locally nilpotent, each weight vector v 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 fiahibeic. There are only finitely many nonzero eicv; each is an hi-eigenvector, so varying b only rescales it; for each of these finitely many vectors only finitely many powers fia are nonzero. Thus their span is finite-dimensional and invariant. If μ(hi)=m0 is an integer, F2 shows that fim is injective on weight-m vectors in each such finite rank-one module: on every Vn containing weight m, lowering m steps reaches weight m with no zero coefficient. Therefore it is injective on the entire joint space Vμ and maps it into Vsiμ. For m0, use eim instead. Applying the same argument at siμ gives the reverse injection; for finite weight spaces their dimensions are equal. Since simple reflections generate W, multiplicities are W-invariant.

step 2.1F1F2algebra
4.1

Every submodule of this weight module is a sum of its weight spaces. For an element with finitely many weight components choose hh separating them and apply finite interpolation polynomials in h to extract each component in the submodule. Such an h 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 M(λ). The sum J of all proper submodules is still missing the top component, hence is proper, and contains every proper submodule. Thus L(λ)=M(λ)/J 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 Q+, since each is a quotient of its Verma module. Independence of the simple roots then gives λ=μ.

step 3.1F1algebra
5.1

Suppose λ is dominant integral and put mi=λ(hi)Z0. In M(λ), the identity eifikvλ=k(mik+1)fik1vλ follows by induction from the rank-one brackets. Hence fimi+1vλ is killed by ei. It is killed by every ej, ji, because [ej,fi]=0 by the root signs, and therefore by n+ by simple generation. Its generated submodule has support below λ(mi+1)αi by the universal property in step 3.1. The finite sum N of these submodules consequently misses the top weight and is proper. The nonzero quotient Q=M(λ)/N has fimi+1vλ=0 for every i, and maps onto L(λ) by step 4.1.

step 3.1step 4.1F1F2givenalgebra
6.1

Both ei and fi act locally nilpotently on Q. For ei, its powers shift a weight λnjαj by kαi; if k>ni this leaves λQ+, so gives zero. For fi, F1 says adfi is nilpotent on the finite-dimensional g. Its derivation on U(g) 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 Q the finite binomial identity fiNuvλ=j=0N(Nj)(adfi)j(u)fiNjvλ then vanishes for sufficiently large N, by the bound for u and the top-vector relation from step 5.1. Every vector of Q is of this form or a finite sum, proving the assertion. It descends to L(λ).

step 3.1step 5.1F1algebra
7.1

Apply step 3.2 to L(λ) using step 6.1. Its weights lie in λQ+P. 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 W is finite. Thus the entire support is finite. Step 4.1 makes each weight space finite-dimensional, so L(λ) is finite-dimensional. This establishes existence before using any finite-dimensional highest-weight classification.

step 4.1step 6.1step 3.2F1F3algebra
8.1

Conversely let V be a nonzero finite-dimensional simple g-module. F2 diagonalizes each hi with integral eigenvalues. They commute and span h, so successive eigenspace decomposition gives a finite set of joint weights in P. Choose a weight maximizing a real linear functional which is positive on every simple root, and choose a nonzero vector v there. Every ei kills v, since otherwise it raises that functional, and therefore n+v=0. For each rank-one triple, F2 shows a nonzero hi-eigenvector in kerei has a nonnegative integral eigenvalue: in its direct sum of Vm it is a sum of highest vectors with that same highest weight. Thus its joint weight λ is dominant integral. Simplicity makes v generate V, and steps 3.1–4.1 give VL(λ) with unique λ. For the zero algebra the root lists and basis are empty, U=M(0)=L(0)=C, 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.

step 3.1step 4.1step 7.1F1F2givenalgebra

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