Alphabeta Math
Pipeline-generated
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.

Kac Moody Algebras from Generalized Cartan Matrices

1 · Prerequisites

2 · Summary

Starting from a finite generalized Cartan matrix, this page constructs the minimal Cartan space, the universal contragredient algebra and its largest Cartan-disjoint quotient. The local PBW and tensor-module arguments supply the infinite-dimensional algebraic foundations. Serre vanishing precedes Weyl symmetry; the invariant form, restricted Casimir and relation module then prove Serre generation for symmetrizable matrices.

The conventions are complex scalars, coroot-indexed rows αj(hi)=aij, and a positive diagonal symmetrizer D with DA symmetric. The Cartan retains its complementary directions when A is singular. The final results give real-root triples, the full finite/affine/indefinite trichotomy, and finite-type semisimplicity by root-height descent and a lattice bound. The companion calculations include explicit finite, affine and indefinite models.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Generalized cartan matrix

Definition

A generalized Cartan matrix (GCM) is an integer matrix A=(aij)i,jI, where I={1,,n} and n1, such that aii=2, aij0 for ij, and aij=0    aji=0. It is indecomposable if there is no partition I=JK into nonempty sets with all entries between J and K zero.

Sources

Source comparison: Kleshchev, §1.2, p.10.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Symmetrizable generalized cartan matrix

Definition

A GCM A is symmetrizable if there is a diagonal matrix D=diag(d1,,dn) with real di>0 such that B=DA is symmetric, equivalently diaij=djaji for all i,j. We fix one such D when using a form.

The convention for GCM is Generalized cartan matrix. One may take the di positive rational, or positive integer after scaling. Indeed, in each connected component of the nonzero-entry graph, fix its least index v and replace di by di/dv. Along an edge ij, dj/di=aij/aji is positive rational. A finite path from v to i therefore gives rational di/dv; its value is independent of the path because the original real symmetrizer supplies the same ratio. Multiplication by the finite product of denominators gives integers. Isolated vertices are assigned 1. Kleshchev writes A=diag(εi)B; our convention has di=εi1.

Sources

Source comparison: Kleshchev, §2.1, pp.26–27.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Realization of a generalized cartan matrix

Definition

A minimal realization of a GCM A of rank r is a complex vector space h with indexed linearly independent families h1,,hnh and α1,,αnh such that αj(hi)=aij and dimh=2nr. An isomorphism T of realizations satisfies T(hi)=hi and αjT=αj for every index.

The matrix convention is Generalized cartan matrix. Existence and uniqueness up to isomorphism are supplied by Minimal realizations exist and are unique up to isomorphism . Uniqueness of the isomorphism is not asserted.

Sources

Source comparison: Kleshchev, Definition 1.2.2 and Proposition 1.2.4, pp.10–12.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Minimal realizations exist and are unique up to isomorphism

Statement

Every finite GCM has a minimal complex realization. Any two are isomorphic preserving all indexed roots and coroots. The dimension 2nrankA is the smallest possible dimension with both families independent.

Facts & Assumptions

Given: A GCM of size n, rank r, and the row convention αj(hi)=aij.

[F1]

The indexed roots and coroots must each be independent. (Realization of a generalized cartan matrix).

Proof

1.1

Let V=Cn have basis vi, and define p0:VCn by p0(vi)=(ai1,,ain). Choose a complement C of imp0 by finite elimination. On H=VC put p(v,c)=p0(v)+c, hi=(vi,0) and αj=prjp. The map p is onto, so its coordinate functionals are independent; the hi are independent and have the prescribed evaluations. Moreover dimH=n+(nr).

givenF1
2.1

In any realization with independent roots, p:HCn, h(αj(h))j, is onto. Its restriction to V=span(hi) has rank r, so dim(H/V)nr. This proves the lower bound. At equality, kerpV, because dimkerp=nr=dimker(pV).

F1step 1.1
3.1

For two minimal realizations choose the same complement C of the common row image in Cn. Lift a basis of C to each H using surjectivity of p. The resulting linear sections s:CH give H=Vs(C): an intersection vector has image both in C and in the row image, hence zero; injectivity of p on s(C) then kills it. Dimensions give spanning. The map hihi, s(c)s(c) is invertible and commutes with p, so preserves every αj. All selections are finite Gaussian elimination.

step 1.1step 2.1F1

Sources

Source comparison: Kleshchev, Proposition 1.2.4, pp.11–12; independent row-image construction replaces a principal-minor assumption.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Kac Moody root lattice height and positive cone

Definition

For a realization as in Realization of a generalized cartan matrix, set Q=i=1nZαi and Q+=i=1nZ0αi. Define ht(ikiαi)=iki. For λ,μh write μλ if λμQ+.

Independence of the simple roots makes coordinates unique. Thus Q+(Q+)={0}, which proves antisymmetry of the order; closure under addition proves transitivity, and 0Q+ proves reflexivity. Positive roots will belong to Q+{0}, not all of Q+.

Sources

Source comparison: Kleshchev, end of §1.2, pp.12–13.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

PBW for countably presented Kac Moody Lie algebras

Statement

Let L be a complex Lie algebra with a supplied finite or countable ordered basis (xi). The products xi1xim with i1im, including 1 for m=0, form a basis of U(L). Consequently LU(L) is injective. For the finite-word graded algebras here, compatible homogeneous bases of subalgebras and quotients can be obtained without AC.

Facts & Assumptions

Given: A supplied ordered basis and finite expansions of brackets in that basis.

[F1]

The enveloping quotient imposes the bracket relations. (The universal enveloping algebra as a tensor quotient).

Proof

1.1

Replace an adjacent inversion xjxi, j>i, by xixj+[xj,xi], expanding the bracket into basis vectors. On each term order the measure lexicographically by word length and number of inversions. The switched term decreases inversions; every bracket term decreases length. Each replacement has finitely many terms. The finitely branching reduction tree has finite depth: otherwise recursively selecting its first child with arbitrarily deep descendants gives an infinite descending sequence of measures. Thus reduction terminates in ordered words.

F1given
2.1

Two reductions on disjoint pairs commute, including their lower-length terms. The only overlapping pair is zyx with z>y>x. Reducing the length-three terms in the two orders gives respectively xyz+[y,x]z+y[z,x]+[z,y]x and xyz+x[z,y]+[z,x]y+z[y,x]. Their difference is [[y,x],z]+[y,[z,x]]+[[z,y],x] after reducing length-two commutators. This is zero by Jacobi. Those length-two reductions are already unambiguous by induction on length, and this reasoning also holds inside a fixed word context.

step 1.1given
3.1

Induct on the reduction measure to compare any two first reductions: the disjoint case joins exactly, and the overlap difference has zero normal form by step 2.1; all subsequent comparisons involve smaller measures. Linearity then gives a unique normal form N for every finite polynomial. For any words u,v, N(u(xjxixixj[xj,xi])v)=0; the relations with the other order follow by antisymmetry and those with equal indices are zero. Hence N kills the two-sided defining ideal. Conversely each reduction changes a polynomial by an element of that ideal. The ordered-word inclusion and N are inverse maps after taking the quotient. In particular distinct length-one basis vectors remain independent.

F1step 1.1step 2.1
4.1

Fix one homogeneous component V. Its spanning finite bracket words inherit a finite or countable enumeration; retaining each first word outside the span of its predecessors gives an ordered basis b0,b1, of V. For a specified subspace WV, put Er=span(b0,,br) and Wr=WEr. These finite-dimensional spaces exhaust W, and dimWrdimWr1 is zero or one. Starting with the empty basis, do nothing when the dimension is unchanged. When it rises at r, finite row reduction gives the unique vrWr whose br-coefficient is 1 and whose coefficients in the previous pivot columns are zero; append vr. Indeed, existence comes from normalizing any element of WrWr1 and eliminating its old pivots, while two such vectors differ by an element of Wr1 with every pivot coefficient zero and hence are equal. Induction now shows that the vectors obtained through stage r form a basis of Wr, so their union is a basis of W. Extend it to a basis of V by scanning the br and retaining the first vectors outside the span already obtained; the images of the added vectors form a quotient basis of V/W. Applying this fixed construction to the supplied countable list of degrees gives compatible homogeneous bases without a family of choices. The same finite-coordinate exhaustion handles a countably spanned ungraded algebra. No basis for an arbitrary unbased vector space is asserted.

step 3.1given

Sources

Source comparison: Kleshchev, local PBW reduction supporting §1.3 and §9.3 (the finite-dimensional PBW theorem is not imported).

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Free Lie construction for finite Kac Moody generators

Statement

For a finite-dimensional complex space V with specified basis, the quotient F(V) of formal bracket words by bilinearity, antisymmetry and Jacobi is the free Lie algebra on V. Its natural map into T(V) is injective, with image the Lie subalgebra generated by V, and U(F(V))T(V).

Facts & Assumptions

Given: A finite basis of V and the formal bracket-word quotient F(V).

[F1]

PBW injects a countably based Lie algebra into its enveloping algebra. (PBW for countably presented Kac Moody Lie algebras).

[F2]

Maps out of the tensor quotient are determined by maps on generators respecting the bracket relations. (The universal enveloping algebra as a tensor quotient).

Proof

1.1

Evaluate a formal bracket recursively under any linear map VL. Bilinearity, antisymmetry and Jacobi vanish on evaluation because they hold in L. Thus evaluation factors uniquely through a Lie homomorphism F(V)L. The quotient itself has an antisymmetric bilinear bracket satisfying Jacobi by its defining relations. Bracket words form a countable spanning list, so first independent words supply a basis.

given
2.1

The linear inclusion VU(F(V)) gives an associative map T(V)U(F(V)). Conversely step 1.1 applied to the commutator Lie algebra of T(V) gives F(V)T(V), hence an associative map U(F(V))T(V) by the tensor-quotient relations. Both composites fix V. The algebra T(V) is generated by V; U(F(V)) is also generated by V because each bracket word is an associative commutator polynomial. Therefore the composites are identities.

F2step 1.1
3.1

PBW for the basis selected in step 1.1 injects F(V) into U(F(V)). Composing with the isomorphism of step 2.1 proves injectivity into T(V). Every element of its image is a linear combination of bracket words, and every such word is in the image, proving the image description.

F1step 1.1step 2.1

Sources

Source comparison: Kleshchev, §1.3, Theorem 1.3.3(ii), pp.14–16; explicit universal-property construction.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Contragredient lie algebra before the maximal ideal quotient

Definition

Fix a minimal realization of A using Minimal realizations exist and are unique up to isomorphism. The universal contragredient algebra g~(A) is the free Lie algebra on a basis of h and symbols ei,fi, modulo [h,h]=0, [h,ei]=αi(h)ei, [h,fi]=αi(h)fi and [ei,fj]=δijhi, for all h,hh.

The free algebra is constructed in Free Lie construction for finite Kac Moody generators. Any linear map on h and images of the symbols satisfying these relations extend uniquely to a Lie homomorphism from this quotient. Give h,ei,fi degrees 0,αi,αi in Kac Moody root lattice height and positive cone; all relations are homogeneous. Write n~+ and n~ for the subalgebras generated by the ei and fi. Their freeness and injectivity of the Cartan map are justified in Contragredient algebra has a triangular decomposition , not imposed as additional relations.

Sources

Source comparison: Kleshchev, Definition 1.3.1, p.13.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Contragredient algebra has a triangular decomposition

Statement

The Cartan map is injective and g~=n~hn~+. Each half is free on its indicated generators. This is a Q-graded weight decomposition with zero part h and all other degrees in ±(Q+{0}).

Facts & Assumptions

Given: The contragredient relations and a minimal realization.

[F1]

The presentation and its homogeneous degrees are fixed. (Contragredient lie algebra before the maximal ideal quotient).

[F2]

The free Lie algebra embeds as bracket words in the tensor algebra. (Free Lie construction for finite Kac Moody generators).

Proof

1.1

On T(Cn) with letters vj, let Fj be left concatenation and let Hh multiply a word of degree β by (λβ)(h), for any fixed λh. Define Ei1=0 and Ei(vja)=vjEi(a)+δijHhi(a). Thus [Ei,Fj]=δijHhi directly, the Hh commute, and [Hh,Fj]=αj(h)Fj. Every term of Ei(a) has weight equal to the weight of a plus αi, by induction on word length (the extra term occurs only when i=j). Hence [Hh,Ei]=αi(h)Ei. All defining relations hold and give a representation for each λ.

F1given
2.1

A negative bracket word acts by left multiplication by the same tensor commutator word. Its value on 1 is that word. The composite of the free negative Lie algebra with this evaluation is the injection of F2, so its map into n~ is injective as well as surjective. Also Hh1=λ(h) for every λ, so a Cartan element killed by the presentation must be zero. The assignment eifi, fiei, hh preserves each relation: for example [fi,ej]=δijhi. Its square is the identity. It proves freeness of the positive half too.

F1F2step 1.1
3.1

Jacobi gives [fi,[ej,u]]=δij[hi,u]+[ej,[fi,u]]. Induction on the length of the positive word u therefore gives [fi,n~+]h+n~+. The analogous inclusion holds with signs reversed. The span S=n~+h+n~+ is consequently stable under brackets with every generator, so iterated brackets span only S and S=g~.

F1step 2.1
4.1

If u+h+u+=0, evaluation on 1 in step 1.1 gives u(1)+λ(h)1=0. The first term has positive tensor length, so both terms vanish. Varying λ kills h, and F2 kills u. Then u+=0 as well. Homogeneity of the defining ideal gives a direct grading; Jacobi gives [h,x]=β(h)x in degree β. Independence of the αi identifies distinct degrees with distinct weights. Thus the displayed grading has exactly the asserted signs and zero part.

F1F2step 1.1step 2.1step 3.1

Sources

Source comparison: Kleshchev, Theorem 1.3.3, pp.13–16; full tensor-module argument.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The sum of triangularly disjoint graded ideals is disjoint from h

Statement

Every ideal J of g~(A) is Q-graded. The sum r of all ideals with Jh=0 also has zero intersection with h, is the unique largest such ideal, and decomposes as r=rr+, where r±=rn~± are separate ideals.

Facts & Assumptions

Given: The triangular decomposition and an arbitrary ideal J.

[F1]

Distinct Q-degrees are distinct Cartan weights, and the zero space is the Cartan. (Contragredient algebra has a triangular decomposition).

Proof

1.1

Write xJ as βSxβ with finite support. Choose hh for which the distinct numbers β(h) are pairwise different. Such an h exists: the product of the finitely many nonzero linear polynomials βγ is nonzero over the infinite field C, and a nonzero polynomial cannot vanish at all complex tuples (induct on the number of variables). Applying γβ(adhγ(h))/(β(h)γ(h)) to x extracts xβ and keeps it in J. Thus J is graded.

F1given
2.1

If Jh=0, every vector of J has zero degree-zero component by step 1.1. The algebraic sum of all these ideals consists of finite sums of their vectors, so it also has zero degree-zero component. It is an ideal because bracketing distributes over a finite sum, and it contains every such ideal. This proves existence, maximality and uniqueness of r.

F1step 1.1
3.1

Cartan and positive generators preserve r+. Bracketing a degree β>0 vector with fi gives degree βαi. If this degree is zero, the result vanishes by step 2.1; if it has mixed signs it vanishes by F1; it cannot be strictly negative unless β were zero or a forbidden fractional multiple of αi. The remaining degree is positive. Hence r+ is stable under all generators and is an ideal. The sign-changing involution proves the negative assertion. The direct sum follows from F1.

F1step 2.1

Sources

Source comparison: Kleshchev, Lemma 1.3.2 and Theorem 1.3.3(v), pp.13–16.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Kac moody algebra associated to a gcm

Definition

The Kac–Moody algebra of A is g(A)=g~(A)/r, using the largest Cartan-disjoint ideal constructed in The sum of triangularly disjoint graded ideals is disjoint from h. We retain the names h,ei,fi for their images and put n±=n~±/r±.

The Cartan embeds because rh=0. The sign-changing involution preserves r by its defining largest-ideal property, and descends. Every nonzero ideal of g(A) meets h nontrivially: otherwise its inverse image would be a larger Cartan-disjoint ideal in g~. This does not assert simplicity for singular or decomposable matrices.

Sources

Source comparison: Kleshchev, Definition 1.4.1, p.16.

PropositionStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-10Open item page →

Kac moody root spaces are finite dimensional

Statement

Let Δ={βQ{0}:gβ0}. Then g=hβΔgβ, every root has one sign, and dimgβnhtβ. The only roots on the line Cαi are ±αi, and their spaces are Cei and Cfi.

Facts & Assumptions

Given: The maximal Cartan-disjoint quotient for a finite GCM.

[F1]

The quotient is by the split graded ideal and the Cartan embeds. (Kac moody algebra associated to a gcm).

[F2]

The two free halves and Cartan give the full grading. (Contragredient algebra has a triangular decomposition).

Proof

1.1

Quotient each homogeneous component of F2 by its intersection with r. The split graded ideal has no zero component, so the resulting zero part is h and all remaining parts have strictly positive or strictly negative degree. Every element still has finite support.

F1F2
2.1

Every bracket of length m is a linear combination of right-nested brackets of length m: apply [[u,v],w]=[u,[v,w]][v,[u,w]] repeatedly to reduce the left bracket length. There are nm choices of letters for such a bracket. Thus the total height-m subspace of either half, and hence each of its degree quotients, has dimension at most nm.

F2step 1.1
3.1

Independence of the roots makes a lattice point on Cαi an integer multiple of αi. A bracket word at positive degree kαi uses only ei; all words of length k>1 vanish since [ei,ei]=0. Degree αi is spanned by ei and is nonzero since [ei,fi]=hi0. The negative statement follows in the same way. If β>0 is not αi and its simple reflection is a root, some coefficient at ji is positive and remains unchanged by the reflection; the one-sign property forces the reflected root to stay positive.

F1F2step 1.1step 2.1

Sources

Source comparison: Kleshchev, Theorem 1.3.3(iv), §1.4, pp.14–19.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The opposite simple centralizer in a Kac Moody half vanishes

Statement

If xn+ satisfies [fi,x]=0 for every i, then x=0. Likewise xn with [ei,x]=0 for every i is zero.

Facts & Assumptions

Given: A finite GCM and its maximal Cartan-disjoint quotient.

[F1]

Every nonzero ideal meets the Cartan. (Kac moody algebra associated to a gcm).

[F2]

Weights have one sign and distinct root coordinates. (Kac moody root spaces are finite dimensional).

Proof

1.1

Decompose x into finitely many weights. For fixed i, the brackets of its distinct components with fi have distinct weights, so each bracket is zero. It suffices to treat a homogeneous x of positive degree β. Let J be the span of x and all iterated adei applied to x. Every such vector has degree β+γ with γQ+, so Jn+.

F2given
2.1

The space J is stable under all ei by construction and under h by its homogeneous spanning vectors. Induct on the number of positive adjoints to prove stability under fi. The base is [fi,x]=0. For y already treated, [fi,[ej,y]]=δij[hi,y]+[ej,[fi,y]] lies in J. Thus J is an ideal, and Jh=0 by its positive degrees. F1 forces J=0, hence x=0. The sign-changing involution interchanges the two conclusions.

F1F2step 1.1

Sources

Source comparison: Kleshchev, Perrin Lemma 4.2.8, p.36; maximal-ideal argument as in Kleshchev §1.4.

Additional source: Perrin, section 4.2, at the numbered locators above.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Serre elements vanish before Serre generation

Statement

For every finite GCM and ij, the maximal-ideal quotient satisfies (adei)1aijej=0 and (adfi)1aijfj=0. This asserts vanishing, without yet asserting generation of the defining ideal.

Facts & Assumptions

Given: The standard simple generators in g(A), and i≠j.

[F1]

A negative vector killed by all opposite simple generators is zero. (The opposite simple centralizer in a Kac Moody half vanishes).

[F2]

The algebra g(A) is the quotient of g~(A) by the largest Cartan-disjoint ideal and retains the generator names h,ei,fi. (Kac moody algebra associated to a gcm).

[F3]

Before the quotient, the generators satisfy [h,h]=0, [h,ei]=αi(h)ei, [h,fi]=αi(h)fi, and [ei,fj]=δijhi. (Contragredient lie algebra before the maximal ideal quotient).

Proof

1.1

The relations of F3 descend through the quotient of F2. For operators E,F,H with [E,F]=H and [H,F]=2F, the identity [E,Fm]=mFm1(Hm+1) follows from [E,Fm+1]=[E,Fm]F+FmH and HF=F(H2), starting at m=1. Take the adjoint operators of ei,fi,hi. On v=fj, Ev=0 and Hv=aijv. For m=1aij, the identity gives EFmv=m(aijm+1)Fm1v=0.

F2F3given
2.1

For k{i,j}, adek commutes with adfi and kills fj, so kills Fmv. For k=j, it commutes with F and sends fj to hj, so sends Fmv to Fmhj. Now Fhj=ajifi and F2hj=0. If m2 this vanishes; if m=1, aij=0 and the symmetric-zero axiom gives aji=0. Thus all ek kill the negative Serre vector.

F2F3givenstep 1.1
3.1

F1 kills this vector in n. The sign-changing involution descending in F2 proves the positive relation with the same exponent. At no point has an ideal been asserted to be generated by these vectors.

F1F2step 1.1step 2.1

Sources

Source comparison: Kleshchev, §1.4 Serre vanishing and Lemma 3.1.1; Perrin Propositions 4.2.6–4.2.7, pp.35–37.

Additional source: Perrin, section 4.2, at the numbered locators above.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Simple reflections and the kac moody weyl group

Definition

For a minimal realization, put si(λ)=λλ(hi)αi on h. The Weyl group is W=s1,,snGL(h). Its dual action is si(h)=hαi(h)hi.

By Realization of a generalized cartan matrix, αi(hi)=2. Hence (siλ)(hi)=λ(hi) and si2λ=λ. Furthermore siαj=αjaijαi, so si preserves the lattice in Kac Moody root lattice height and positive cone. The two actions are dual since λ(sih)=(siλ)(h). This definition requires neither a finite group nor a Coxeter presentation.

Sources

Source comparison: Kleshchev, §3.2, pp.39–42.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The weyl group preserves roots and root multiplicities

Statement

For every finite GCM, W permutes Δ, and dimgwβ=dimgβ. Each simple reflection is implemented on root spaces by a Lie automorphism of g. For a symmetrizer D, the form on the root span with (αi,αj)=diaij is W-invariant.

Facts & Assumptions

Given: A finite GCM, its simple triples and the specified Weyl action.

[F1]

The reflection formula is fixed. (Simple reflections and the kac moody weyl group).

[F2]

Serre vanishing holds before generation. (Serre elements vanish before Serre generation).

[F3]

Root spaces form a direct weight decomposition with finite multiplicities. (Kac moody root spaces are finite dimensional).

Proof

1.1

For D=adei, F2 gives nilpotence on each ej; the relations give Dfj=δijhi, D2fi=2ei, D3fi=0, and D2h=0. For any derivation, Dm[x,y]=k=0m(mk)[Dkx,Dmky], proved by induction and Pascal addition. Hence nilpotence on generators propagates to every finite bracket word and every finite sum. The same holds for adfi. Their pointwise finite exponentials preserve brackets by the binomial identity, with inverses obtained by negating the derivation.

F2given
2.1

Set Ti=exp(adfi)exp(adei)exp(adfi). On the triple, the finite expansions use exp(adfi)ei=eihifi, exp(adfi)hi=hi+2fi, and exp(adei)fi=fihiei. Substitution gives Tiei=fi, Tifi=ei, and Tihi=hi. It fixes kerαi in h. Writing h=(hαi(h)hi/2)+αi(h)hi/2 gives Tih=hαi(h)hi.

F1step 1.1
3.1

For xgβ, [h,Tix]=Ti[Ti1h,x]=β(sih)Tix=(siβ)(h)Tix. The inverse automorphism gives a bijection between these spaces. Products of Ti implement each word in the generators of W, proving root and multiplicity invariance. Only the induced weight action, not independence of the lift from a word, is required.

F1F3step 2.1
4.1

If DA is symmetric, extend (αi,αj)=diaij bilinearly. For λ in the root span, (αi,λ)=diλ(hi) and (αi,αi)=2di. Expanding (λλ(hi)αi,μμ(hi)αi) cancels the two cross terms against 2diλ(hi)μ(hi), leaving (λ,μ). This computation allows a degenerate form.

F1given

Sources

Source comparison: Kleshchev, Lemma 3.1.2 and §3.2, pp.37–42.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Invariant bilinear form for a symmetrizable kac moody algebra

Statement

Let A be symmetrizable with D=diag(di)>0 and DA symmetric. Fix a complement h to H=span(hi) in the minimal Cartan. There is a unique symmetric invariant nondegenerate bilinear form on g(A) whose Cartan restriction satisfies (hi,h)=αi(h)/di and (h,h)=0. It satisfies (ei,fj)=δij/di and (gα,gβ)=0 if α+β0. Opposite root spaces pair perfectly. For ν(h)=(h,), one has (αi,αj)=diaij on h and [x,y]=(x,y)ν1(α) for xgα, ygα.

Facts & Assumptions

Given: A finite symmetrizable GCM, positive d_i and a finite Cartan complement.

[F1]

Symmetry means d_i a_ij=d_j a_ji. (Symmetrizable generalized cartan matrix).

[F2]

The grading has finite root spaces and simple one-dimensional spaces. (Kac moody root spaces are finite dimensional).

[F3]

A positive vector commuting with every f_i is zero; a negative vector commuting with every e_i is zero. (The opposite simple centralizer in a Kac Moody half vanishes).

Proof

1.1

The prescribed Cartan form is symmetric on H: αi(hj)/di=aji/di=aij/dj. Thus it defines a symmetric form on Hh. Put p(h)=(αi(h))i. Independence makes p onto; pH has rank r, so both kerp and ker(pH) have dimension nr and are equal. A vector annihilating the full Cartan form pairs to zero with all hi, hence lies in kerpH. Write it cihi. Pairing with arbitrary h gives (ci/di)αi(h)=0, whence all ci=0. This proves Cartan nondegeneracy, even when A is singular.

F1given
2.1

Use the principal height grading g=mgm. At heights 0,±1, set (ei,fj)=δij/di and all unequal-total-height pairs to zero. Invariance with a Cartan element reduces to (h,[ei,fj])=δijαi(h)/di=([h,ei],fj); all other possible nonzero triples at this stage are permutations of this equality. Suppose pairings up to height N1 are defined and invariant whenever all relevant degrees have absolute value at most N1. For xgN and y=a[ua,va]gN, with ua,va of strictly negative smaller heights, prescribe (x,y)=a([x,ua],va) and extend symmetrically. Both arguments on the right have smaller absolute heights. Such bracket expressions exist since each half is generated in height one.

F2step 1.1
3.1

To check independence, write x=b[wb,zb] with positive smaller heights. For a single term on each side, the induction hypothesis, symmetry and Jacobi give ([[w,z],u],v)=([w,u],[z,v])([z,u],[w,v])=(w,[u,[z,v]][v,[z,u]])=(w,[z,[u,v]]). All inner mixed brackets have smaller absolute heights; each use of invariance therefore belongs to the induction hypothesis. Summing shows the proposed value equals b(wb,[zb,y]), which depends only on y for a fixed expression of x. It was defined using actual x, so it is independent of both expressions. This argument also shows the value is zero when either sum of bracket expressions is zero.

step 2.1
4.1

Invariance for total height different from zero is automatic from orthogonality. If one of the three absolute heights is N and the others are smaller, the equality follows from the definition when the extreme-height entry is first or last. For a middle entry y=[u,v], expand ([x,[u,v]],z)=([v,x],[u,z])+([x,u],[v,z])=(x,[v,[z,u]]+[u,[v,z]])=(x,[[u,v],z]) using the smaller-height invariance and Jacobi. If two heights are N, the third is zero. For hh, y=[u,v] of height N and z of height N, the same calculation gives ([h,[u,v]],z)=([h,u],[v,z])([h,v],[u,z])=(h,[u,[v,z]][v,[u,z]])=(h,[[u,v],z]). Symmetry and antisymmetry give all permutations, including a middle Cartan entry. Thus the induction extends full invariance at height N.

step 2.1step 3.1
5.1

For homogeneous root weights, invariance implies 0=([h,x],y)+(x,[h,y])=(α+β)(h)(x,y); hence unequal opposite weights pair to zero. Let R be the radical. Invariance makes it an ideal, and step 1.1 gives Rh=0. If R were nonzero, finite weight interpolation would give a nonzero homogeneous vector in it; take one of minimal positive absolute height. For a positive weight use the positive clause of F3; for a negative weight use its negative clause. Every opposite simple bracket is in R of lower height, or in its zero Cartan intersection, so is zero. F3 then kills that vector, a contradiction. Hence the form is nondegenerate. Together with weight orthogonality and finite dimensions from F2 this proves perfect opposite-root pairings.

F2F3step 1.1step 4.1
6.1

The Cartan map obeys ν(hi)=αi/di, so ν1(αi)=dihi and (αi,αj)=diaij. For opposite vectors, ([x,y],h)=(x,[y,h])=α(h)(x,y) for every h. The bracket lies in the Cartan by F2; step 1.1 identifies it as (x,y)ν1(α). Any invariant extension of the prescribed Cartan form has the height-one values of step 2.1, weight orthogonality, and the recursion of that step. Induction therefore proves uniqueness.

F2step 1.1step 2.1step 4.1step 5.1

Sources

Source comparison: Kleshchev, Lemma 2.2.1 and Theorem 2.2.3, pp.28–32; complete height induction and zero-height invariance.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Kac moody category o

Definition

A g(A)-module is a weight module if V=μhVμ, where Vμ={v:hv=μ(h)v for every hh}. The category O consists of weight modules with finite-dimensional weight spaces and support in a finite union j=1s(λjQ+). Morphisms are g-linear maps. No finite generation or finite length is included in this convention.

Here Q+ and its order are from Kac Moody root lattice height and positive cone, and root spaces are those of Kac moody root spaces are finite dimensional. For fixed μ, the weights above μ in each cone have the form μ+kiαi with 0kimi when λjμ=miαiQ+. Thus only finitely many occur. In particular every vV is killed by all but finitely many positive root spaces, since it has finite weight support. A submodule is a sum of its weight intersections: on each vector finite Lagrange interpolation in one Cartan operator separates its distinct weights. The quotient therefore also decomposes into the quotient weight spaces. Both inherit the finite bounds and finite cone support. The zero module is allowed with s=0.

Sources

Source comparison: Kleshchev, §9.1, pp.116–118.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-10Open item page →

Kac moody verma module

Definition

For λh let b=hn+ and let Cλ be the one-dimensional b-module with hv=λ(h)v and n+v=0. Define MA(λ)=U(g)U(b)Cλ. Define M~(λ) in the same way for g~ and its positive Borel.

The tensor quotient is The universal enveloping algebra as a tensor quotient. Order a homogeneous negative basis, then a Cartan basis, then a positive basis. PBW for countably presented Kac Moody Lie algebras makes multiplication U(n)U(b)U(g) a vector-space isomorphism and a right U(b)-module isomorphism. Tensoring gives MA(λ)U(n), with 11 corresponding to 1. The same reasoning gives M~(λ)U(n~). Thus the top space has dimension one, and all other weights are λβ for βQ+{0}. At a fixed height there are finitely many monomials: only finitely many root degrees and basis elements of height at most that height can occur, with bounded exponents. Hence MA(λ) belongs to Kac moody category o. The module M~(λ) has the same finite-weight-space and downward-cone properties as a g~-module; no factorization of its action through g(A) is asserted. Mapping u1uv gives the unique module map to any module with a specified highest vector v of weight λ, because the tensor relations hold for that vector.

Sources

Source comparison: Kleshchev, §9.1, pp.116–117; local countable PBW verification.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Generalized casimir on restricted kac moody modules

Definition

Assume A is symmetrizable and fix the invariant form and ν:hh of Invariant bilinear form for a symmetrizable kac moody algebra. A module V is restricted if, for every vV, gαv=0 for all but finitely many positive roots α. Fix ρh with ρ(hi)=1. For dual Cartan bases (ua),(ua) and opposite-root dual bases (xα,s),(yα,s), with x positive and y negative, define on V the operator Ω=2ν1(ρ)+auaua+2α>0,syα,sxα,s.

Products mean successive actions, as in The universal enveloping algebra as a tensor quotient. Root spaces are finite-dimensional by Kac moody root spaces are finite dimensional, and restrictedness makes the last sum finite on each vector. The tensor syα,sxα,s is independent of the dual bases: it corresponds to the identity map of gα under its perfect pairing with gα. The Cartan tensor has the same property. Thus Ω is well-defined as an operator; it is not asserted to be an infinite element of U(g). Independence of hi permits extension of their prescribed ρ-values over a finite basis, and (ρ,αi)=di=(αi,αi)/2.

Sources

Source comparison: Kleshchev, Definition 2.3.3 and equations (2.18)–(2.20), pp.33–34.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Generalized kac moody casimir is central and scalar on highest weight modules

Statement

On every restricted module for a symmetrizable g(A), Ω commutes with the action of g. If v is a highest vector of weight λ, then Ωv=(λ+2ρ,λ)v. If v generates the module, Ω is this scalar on the whole module.

Facts & Assumptions

Given: The restricted operator Omega, its dual bases and chosen rho.

[F1]

The operator and its sums are pointwise finite. (Generalized casimir on restricted kac moody modules).

[F2]

Invariance and perfect opposite-root pairings identify commutators. (Invariant bilinear form for a symmetrizable kac moody algebra).

Proof

1.1

For zgβα, the tensors syα,s[z,xα,s] and t[yβ,t,z]xβ,t agree. Pair with arbitrary abgαgβ: their values are respectively (a,[b,z]) and ([z,a],b), equal by invariance. Perfect finite-dimensional pairings imply the tensor equality. This also covers a missing root space by interpreting the corresponding maps as zero.

F2
2.1

Write S=α>0,syα,sxα,s and ti=ν1(αi)=dihi. In [S,ei], the term yα[xα,ei] cancels the term [yβ,ei]xβ with β=α+αi by step 1.1. The only unmatched degree is αi, where the dual pair is ei,difi, giving [S,ei]=tiei. Terms of mixed root sign vanish, and 2αi is absent. For [S,fi] the same identity with z=fi pairs yβ[xβ,fi] with [yα,fi]xα for β=α+αi; the unmatched simple term is difi[ei,fi]=fiti. Thus [S,fi]=fiti. All cancellations are finite on a fixed vector: root spaces kill that vector, its images under ei,fi, and all but finitely many shifted degrees.

F1F2step 1.1
3.1

Let C=auaua. Expanding with [h,x]=β(h)x gives [C,x]=x(2ν1(β)+(β,β)) for xgβ. Also [2ν1(ρ),x]=2(ρ,β)x. For ei, these finite terms total ei(2ti+4di), while 2[S,ei]=2tiei=2eiti4diei. For fi they total 2fiti, canceled by 2[S,fi]=2fiti. Every summand has weight zero, so [Ω,h]=0. Since these elements generate g, the commutator identity with a product or bracket proves centrality on the entire algebra action.

F1F2step 2.1
4.1

On a highest vector all positive factors xα,s vanish. The Cartan terms give aλ(ua)λ(ua)=(λ,λ) and 2λ(ν1ρ)=2(ρ,λ). This proves the displayed scalar on v. By step 3.1, Ω(uv)=uΩv for every finite enveloping word u, so the scalar holds on the generated module.

F1step 3.1

Sources

Source comparison: Kleshchev, Lemma 2.3.1, Theorem 2.3.5 and Corollary 2.3.6, pp.32–36.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Bounded above kac moody weight modules are generated by primitive vectors

Statement

A nonzero weight vector vV is primitive if its class is a nonzero highest vector in V/N for some submodule N. Every VO is spanned by U(n) applied to its primitive vectors. For a nonzero weight vector, failure of primitivity is equivalent to vU(n)U0(n+)v, where U0 denotes the augmentation ideal.

Facts & Assumptions

Given: A module in O and a nonzero weight vector v of weight mu.

[F1]

Above a fixed weight only finitely many support weights occur. (Kac moody category o).

[F2]

PBW orders the negative, Cartan and positive factors. (Kac moody verma module).

[F3]

Ordered monomials span the enveloping algebra. (PBW for countably presented Kac Moody Lie algebras).

Proof

1.1

Let N=U(g)n+v. Every submodule killing the image of n+v contains N. Hence a nonzero highest image of v exists exactly when vN (use the quotient by N itself for sufficiency). PBW writes N=U(n)U(h)U(n+)n+v. Positive words have definite weights on v, so their Cartan factors act as scalars; and U(n+)n+=U0(n+). Therefore N=U(n)U0(n+)v. This proves both implications of the criterion.

F2F3given
2.1

For a support weight μ put d(μ)={ηsuppV:ημ}, a positive finite integer by F1. If η>μ is in the support, its upper set is a proper subset of this set, since it excludes μ, so d(η)<d(μ). Induct on this integer. A primitive vVμ already lies in the desired span. Otherwise step 1.1 expresses it as a finite sum of negative words applied to vectors zv with z a nonempty positive homogeneous word. Each nonzero zv has weight strictly above μ, so is in the required span by induction. Applying further negative words keeps it there. At d(μ)=1, the positive words all kill v, so step 1.1 says v is primitive. Zero vectors and finite sums of weight vectors finish the assertion.

F1step 1.1

Sources

Source comparison: Kleshchev, Lemma 9.1.3 and preceding primitive-vector definition, pp.117–118.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Enveloping quotient kernels and augmentation intersections

Statement

For countably based complex Lie algebras with supplied compatible bases, a surjection θ:LL/R with ideal kernel R induces kerU(θ)=RU(L). For any subalgebra RL with such a compatible basis, RRU0(L)=[R,R]. Here U0(L) is the kernel of the augmentation U(L)C. These hypotheses hold for the homogeneous subalgebras used in this page by finite-degree elimination.

Facts & Assumptions

Given: The indicated bases; R is an ideal for the first claim and only a subalgebra for the second.

[F1]

PBW gives the compatible ordered monomial bases. (PBW for countably presented Kac Moody Lie algebras).

[F2]

The tensor quotient realizes Lie homomorphisms as associative homomorphisms. (The universal enveloping algebra as a tensor quotient).

Proof

1.1

If R is an ideal, RU(L) is two-sided: xr=rx+[x,r] with [x,r]R lets every left generator pass it. It is killed by U(θ). The class of x in U(L)/RU(L) depends only on x+R, giving a Lie map L/RU(L)/RU(L). F2 extends it to an associative inverse of the map U(L)/RU(L)U(L/R): both composites fix all Lie generators. This proves the kernel equality.

F2given
1.2

For the subalgebra R, order its basis before a complement and let W span the nonempty ordered complement monomials. Multiplication and F1 identify U(L)=U(R)(U(R)W) as left U(R)-modules. Augmentation then gives U0(L)=U0(R)(U(R)W). Nonempty words yield RU(R)=U0(R) and RU0(R)=U0(R)2: in a product of two nonempty words the first letter lies in R, and the remaining word is nonempty, and conversely. Left multiplication by R therefore yields RU0(L)=U0(R)2(U0(R)W).

F1F2given
2.1

For any algebra K with these bases, [K,K]KU0(K)2 because [x,y]=xyyx. Mapping to U(K/[K,K]) sends U0(K)2 into the square of its augmentation ideal. This enveloping algebra is the polynomial algebra on a basis of the abelian quotient by F1: ordered words commute and have independent monomials. Its degree-one subspace has zero intersection with the ideal of polynomials of degree at least two. Thus an element of KU0(K)2 maps to zero in K/[K,K], proving equality.

F1F2step 1.1
3.1

The subspace R lies in the first summand of step 1.2. Intersecting gives RRU0(L)=RU0(R)2=[R,R] by step 2.1. This calculation retains commutators that can have PBW length one; it makes no false assertion that the augmentation square has only ordered monomials of length at least two. In the homogeneous applications, finite-degree echelon bases of F1 supply all compatible bases used above.

F1step 2.1step 1.2

Sources

Source comparison: Kleshchev, Lemmas 9.3.1–9.3.3, pp.122–124; corrected left U(R)-module proof for Lemma 9.3.3.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Kac moody relation module embeds in verma modules and obeys the casimir constraint

Statement

For symmetrizable A, the adjoint relation module r/[r,r] embeds as a g-module in iMA(αi). Each r± is generated as an ideal of n~± by its homogeneous spaces of degrees ±α, where αQ+({0}Π) and (α,α)=2(ρ,α).

Facts & Assumptions

Given: The maximal ideal r=r−⊕r+ and the standard form with rho(h_i)=1.

[F1]

The quotient kernel and augmentation intersection are known. (Enveloping quotient kernels and augmentation intersections).

[F2]

Objects of O are generated under the negative algebra by primitive vectors. (Bounded above kac moody weight modules are generated by primitive vectors).

[F3]

The Casimir acts on a highest module by the highest-weight scalar. (Generalized kac moody casimir is central and scalar on highest weight modules).

[F4]

The universal negative half is free. (Contragredient algebra has a triangular decomposition).

[F5]

Both Verma modules have PBW freeness and the highest-vector universal property. (Kac moody verma module).

Proof

1.1

Put T=U(n~), the free associative algebra on the fi by F4 and its free-Lie construction. In M~(0)=Tv~, the augmentation subspace T0v~ is a submodule: its quotient is the trivial one-dimensional module. The vectors fiv~ are highest of weight αi, because ejfiv~=δijhiv~=0. The last-letter decomposition T0=iTfi and F5 therefore identify this submodule with iM~(αi), not merely a quotient.

F4F5given
2.1

Let V=U(g)U(g~)(T0v~). Associativity of balanced tensor products (the maps a(b1)ab1 and its reverse) and F5 identify V=iMA(αi). Define (a)=1av~ for ar. For xg~, xv~T0v~, since the quotient in step 1.1 is trivial. Therefore ([x,a])=1xav~1axv~=π(x)av~π(a)xv~=π(x)(a). In particular commutators in r are killed. The two ideals r+ and r commute because their bracket lies in their zero intersection. Hence the source modulo its self-commutator carries the adjoint g-action, and factors through a module map on it.

F5step 1.1
3.1

Write a=iuifi using its unique associative last-letter coefficients. The degree-one part of r is zero, since the simple fi survive, so all uiT0. In the PBW identifications, (a)=(π(ui)vαi)i. By F5, this is zero exactly when each π(ui)=0. F1 gives uirT, so arT0, and F1 then gives arrT0=[r,r]. The reverse kernel inclusion was proved in step 2.1. Thus the module map is injective. These are associative coefficients, not adjoint coefficients.

F1F5step 1.1step 2.1
4.1

Each summand MA(αi) has Casimir scalar (αi,αi)2(ρ,αi)=2di2di=0 by F3. Hence Ω=0 on the embedded relation module and each of its subquotients; the pointwise formula respects submodules. The relation module belongs to O, being a submodule of a finite sum of the Verma modules of F5. A primitive vector of weight α has a nonzero highest image in a quotient. F3 applied to that image gives 0=(α,α)2(ρ,α). Its degree is neither zero nor simple, as r has neither component. F2 proves generation of the abelianized relation module by these degrees.

F2F3F5step 3.1
5.1

Let K be the ideal of n~ generated by all the indicated full homogeneous spaces of r. Step 4.1 says r=K+[r,r]. If the positively regraded Lie algebra L=r/K were nonzero, choose its least positive height m. Every nonzero bracket in L has height at least 2m, so Lm cannot lie in [L,L]. This contradicts L=[L,L]. Thus K=r. The sign-changing involution gives the positive assertion with the identical equation on α.

step 4.1

Sources

Source comparison: Kleshchev, Proposition 9.3.4, pp.124–125; corrected associative last-letter coefficients and augmentation proof.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The serre quotient has weyl symmetry and no residual kac moody kernel

Statement

For symmetrizable A, let g be the quotient of g~ by the ideal generated by both families of Serre elements. The natural surjection gg(A) has zero kernel. Before this identification, finite adjoint exponentials on g implement simple reflections and preserve the root multiplicities of its kernel.

Facts & Assumptions

Given: The Serre quotient and its Q-grading, before identifying it with g(A).

[F1]

The relation ideals have homogeneous generators satisfying the Casimir constraint. (Kac moody relation module embeds in verma modules and obeys the casimir constraint).

[F2]

The Serre elements vanish in g(A). (Serre elements vanish before Serre generation).

[F3]

The simple reflection is lambda minus its coroot coordinate times alpha_i. (Simple reflections and the kac moody weyl group).

[F4]

The root form obeys the symmetrizer convention. (Invariant bilinear form for a symmetrizable kac moody algebra).

Proof

1.1

F2 puts the Serre ideal S inside r, yielding the surjection and kernel r=r/S. Thus the Cartan embeds in g; its other weights have one sign because it is a homogeneous quotient of g~. Pure multiples of a simple root are absent beyond ±αi, since each free half has that property. The simple components map injectively to g, so the kernel has no simple or zero weights.

F2given
2.1

On g, D=adei is nilpotent on every ej by the defining Serre relations, on fj by Dfj=δijhi, D2fi=2ei, D3fi=0, and on h by D2h=0. The binomial identity Dm[x,y]=k(mk)[Dkx,Dmky] proves local nilpotence on all bracket words. The same calculation holds for adfi and in g. The finite exponentials and their negative-exponent inverses preserve brackets. Their product Ti=exp(adfi)exp(adei)exp(adfi) sends (ei,hi,fi) to (fi,hi,ei) and fixes kerαi in the Cartan, by the three-term simple-triple expansions. Thus Tih=hαi(h)hi, and [h,Tix]=(siβ)(h)Tix for x of weight β. The quotient map commutes with these finite polynomials, so Ti and its inverse preserve the kernel.

F2F3step 1.1
2.2

If the positive kernel is nonzero, let α=kiαi have the smallest height among its nonzero weights. By F1 every element of rα+ is a finite sum of iterated positive adjoints of constrained homogeneous generators. A generator of smaller height maps to zero in the positive kernel by minimality, as do all of its adjoints. Any surviving term at degree α must therefore be a generator in degree α itself. Consequently (α,α)=2(ρ,α)=2ikidi>0.

F1F4step 1.1
3.1

For every i, step 2.1 produces a nonzero kernel vector at siα. Since α is not simple, it has a positive coefficient at some index other than i; otherwise it would be a forbidden pure multiple. That coefficient is unchanged by si, so the one-sign property forces siα>0. Minimality gives ht(siα)=ht(α)α(hi)ht(α), hence α(hi)0. F4 now gives (α,α)=ikidiα(hi)0, contradicting step 2.2. The positive kernel vanishes. The sign-changing involution preserves S and r and interchanges signs, so the negative kernel also vanishes. There is no zero kernel component by step 1.1.

F3F4step 1.1step 2.1step 2.2

Sources

Source comparison: Kleshchev, Theorem 9.3.5, pp.125–126; direct Serre-quotient exponential construction from §3.2.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Serre presentation of a kac moody algebra

Statement

For a finite symmetrizable GCM over C, r± is the ideal of the free half n~± generated by (adei)1aijej or (adfi)1aijfj, respectively, for ij. Hence g(A) has exactly the Cartan relations and both Serre families as a presentation. Its halves have the corresponding separate Serre presentations, and multiplication gives the vector-space isomorphism U(n)U(h)U(n+)U(g).

Facts & Assumptions

Given: The symmetrizable Serre quotient and its vanishing residual kernel.

[F1]

The quotient by both Serre families is g(A). (The serre quotient has weyl symmetry and no residual kac moody kernel).

[F2]

PBW applies to the homogeneous bases. (PBW for countably presented Kac Moody Lie algebras).

Proof

1.1

Let S+ be the ideal in the free positive half generated by the positive Serre vectors. The adjoint rank-one calculation gives [fk,sij]=0 for each such generator already in g~: its coefficient for k=i is (1aij)(aij(1aij)+1)=0, and for k=j the only exponent-one boundary uses aji=0. For other k it is zero by the mixed simple relations. Cartan brackets scale each homogeneous generator. Jacobi then proves by induction on positive adjoints that S+ is stable under all negative simple generators; hence it is an ideal of the whole universal algebra contained in its positive half. The same holds for S. Therefore the ideal generated in the whole algebra by both families is exactly S+S.

F1given
2.1

F1 identifies that whole ideal with r. Intersect its direct sum in step 1.1 with each free half to obtain S±=r±. Quotienting the original triangular direct sum therefore gives the stated separate half presentations and the full Cartan–Serre presentation. Order the resulting homogeneous bases negative, Cartan, positive. F2 identifies the tensor product of their three ordered monomial bases bijectively with the ordered basis of U(g), proving the multiplication isomorphism.

F1F2step 1.1

Sources

Source comparison: Kleshchev, Theorem 9.3.5, pp.125–126; half-ideal and PBW consequences.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Real and imaginary kac moody roots

Definition

For the root system of g(A), define Δre=WΠ, where Π={α1,,αn}. Define Δim=ΔΔre. These are the real and imaginary roots. Each inherits its positive or negative sign from ΔQ+(Q+).

By The weyl group preserves roots and root multiplicities, WΠ consists of roots. The two classes partition Δ and exclude zero. The labels denote orbit membership; they do not define roots by the sign of a squared length, and make sense without a symmetrizer.

Sources

Source comparison: Kleshchev, §5.1, pp.68–69, and §5.3, pp.73–74.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Real root spaces are one dimensional sl2 roots

Statement

Every real root α has a one-dimensional root space and an sl2 triple (eα,hα,fα) in degrees α,0,α. The only roots on Cα are ±α. The coroot hα is independent of the transporting Weyl word and simple root when normalized by α(hα)=2.

Facts & Assumptions

Given: A real root alpha=w alpha_i and the proved root-transporting automorphisms.

[F1]

Real roots are the Weyl orbits of the simple roots. (Real and imaginary kac moody roots).

[F2]

Simple reflections lift to Lie automorphisms and preserve multiplicities. (The weyl group preserves roots and root multiplicities).

[F3]

Simple root spaces and their multiples are known. (Kac moody root spaces are finite dimensional).

Proof

1.1

Choose a finite word for w and multiply the automorphisms of F2 to get T. Applying T to [ei,fi]=hi, [hi,ei]=2ei, and [hi,fi]=2fi gives a triple eα=Tei, hα=Thi, fα=Tfi with those same brackets. Each vector is nonzero; they lie in three distinct weight spaces α,0,α, hence are independent. Mapping the standard three matrix generators of sl2 to them is a bracket-preserving linear bijection.

F1F2F3
2.1

F2 and F3 give gα=Tgαi=Ceα and the analogous negative equality. If cα were another root, T1 would send its nonzero space to degree cαi, so F3 forces c=1 or c=1. The bracket line [gα,gα] is therefore the nonzero line Chα, independent of T. Evaluation by α is nonzero on this line since α(hα)=2 from step 1.1. There is exactly one element of this line with that evaluation, proving independence of the normalized coroot.

F2F3step 1.1

Sources

Source comparison: Kleshchev, §5.1, pp.68–69, with §3.2 transport.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Strict linear alternative for GCM trichotomy

Statement

For a finite list v1,,vmRn, there exists x with vix>0 for every i if and only if itivi=0, ti0, implies all ti=0. Consequently, if a real m×n matrix C satisfies u0 and Ctu0u=0, then there is v>0 with Cv<0. Coordinatewise strict inequalities on an empty coordinate list are vacuous.

Facts & Assumptions

Given: Finite real row vectors, with the ordinary Euclidean dot product.

Proof

1.1

If every vix>0, then 0=(itivi)x=iti(vix) with ti0 forces each ti=0. If m=0, take x=0 and both conditions hold vacuously. If n=0<m, every row is zero, so neither condition holds. Thus the reverse direction need only consider m,n1.

given
2.1

Assume there is no nonzero nonnegative relation. The coefficient simplex E={tRm:ti0,iti=1} is nonempty, closed and bounded. The polynomial function titivi2 is continuous, so F1 supplies a minimizer t. Put x=itivi. This vector is nonzero by the hypothesis. For each convex combination y=isivi, the coefficients (1t)t+ts remain in E for 0t1. Minimality gives 02t(x,yx)+t2yx2. For t>0, divide by t; if (x,yx)<0, sufficiently small positive t contradicts the inequality. Therefore xyx2>0, in particular xvi>0. This proves the reverse implication without a separate compact-image assumption.

F1givenstep 1.1
3.1

Apply the equivalence to the rows of C together with the coordinate rows of the identity matrix. A nonnegative relation has the form Ctλ+μ=0 with λ0, μ0. The matrix hypothesis forces λ=0, and hence μ=0. The separating vector v thus satisfies Cv>0 and v>0. If either matrix dimension is zero the same empty-coordinate interpretation applies; for n=0<m the matrix hypothesis is false.

step 1.1step 2.1

Sources

Source comparison: Kleshchev, Lemma 4.1.4 and Proposition 4.1.5, pp.51–52; minimum taken directly on the coefficient simplex.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Finite affine indefinite trichotomy for indecomposable gcms

Statement

For an indecomposable GCM A, exactly one of the following clauses holds and defines its type (inequalities are coordinatewise over R):

  • Finite: detA0, some u>0 has Au>0, and Ax0 implies x>0 or x=0.
  • Affine: corankA=1, some u>0 has Au=0, and Ax0 implies Ax=0. Equivalently KA={x:Ax0}=kerA=Ru; its positive null ray is unique.
  • Indefinite: some u>0 has Au<0, and x0, Ax0 imply x=0.

Each type is equivalently characterized by its displayed positive-vector condition alone. The matrices A and At have the same type. Finite and affine GCMs are symmetrizable. If B=DA is a symmetric positive-diagonal symmetrization, finite type is equivalent to B being positive definite, affine type to B being positive semidefinite of corank one, and indefinite type to B taking both positive and negative quadratic values. For a decomposable matrix, “finite type” means every indecomposable block is finite type.

Facts & Assumptions

Given: An indecomposable GCM of size n≥1.

[F1]

Off-diagonal entries are nonpositive integers with a symmetric zero pattern, and indecomposability forbids a block partition. (Generalized cartan matrix).

[F2]

The symmetrizer convention is DA symmetric. (Symmetrizable generalized cartan matrix).

[F3]

If a real matrix C satisfies u0 and Ctu0u=0, then the strict matrix alternative provides v>0 with Cv<0. (Strict linear alternative for GCM trichotomy).

Proof

1.1

The graph joining i,j when aij<0 is connected: its connected components give a forbidden block partition otherwise, and a block partition disconnects it. If x0 and Ax0, then at a zero coordinate i, (Ax)i=jiaijxj0. Equality forces every neighbor to have zero coordinate. Propagating along finite paths proves x=0 or x>0.

F1given
2.1

Suppose KA contains a nonzero nonnegative vector u, so u>0 by step 1.1. If KA is not contained in {0}{x>0}, take vKA with some negative coordinate (a nonnegative exception is excluded by step 1.1). Along the segment from v to u there is a point z=tu+(1t)v0 with at least one zero coordinate and 0<t<1. Step 1.1 gives z=0, whence v is a negative multiple of u and 0=tAu+(1t)Av forces Au=Av=0. For any wKA, if w has a negative coordinate repeat with u,w; if w>0 repeat with w,v. In either case wRu. Thus KA=kerA=Ru. Otherwise KA{0}{x>0}; then a nonzero kernel vector would put both it and its negative in this cone, impossible. So A is invertible, and A11KA{0} is strictly positive with image 1>0. These are precisely the affine and finite clauses.

F1step 1.1
3.1

If A has either clause of step 2.1, no v>0 can have Av<0: otherwise vKA has negative coordinates and a nonzero image, contradicting either description of KA. Contraposition of F3 with C=A gives a nonzero u0 with Atu0. Apply step 2.1 to At. Its rank equals that of A by Gaussian elimination, so its clause is finite when A is invertible and affine when A has corank one. Repeating with the transpose proves both transpose implications. If KA{x0}={0}, the transpose has the same property: otherwise step 2.1 and the just-proved transpose implication contradict it. F3 with C=A now supplies v>0, Av<0. This gives the indefinite clause and its transpose invariance.

F3step 2.1
4.1

The three clauses are disjoint by their cone and rank conditions and exhaustive by steps 2.1–3.1. A positive vector with strictly positive image excludes affine and indefinite by their cone conditions. A positive null vector excludes finite by invertibility and indefinite by its cone condition. A positive vector with negative image puts its negative in KA with strictly positive image, excluding both finite and affine. Thus the three positive-vector conditions are each sufficient as well as necessary. The affine null ray and corank follow from step 2.1.

step 2.1step 3.1
5.1

For later use, every connected proper principal submatrix of an affine A is finite type: restrict a positive null vector u to a connected index subset J. Then AJuJ=AJ,JcuJc0 and is nonzero, since connectivity of the full graph gives an edge across the partition. Step 4.1 excludes indefinite type for AJ, and its affine cone condition excludes a nonzero nonnegative image, so it is finite. For finite A, restricting a positive vector with positive image gives AJuJ>0, since the omitted off-diagonal contribution is nonpositive. Hence each connected principal submatrix is finite in that case too.

F1step 1.1step 4.1
6.1

Assume A is finite or affine. If its graph has a cycle, take a shortest simple cycle of length k3. It has no chord. Its principal matrix C has diagonal 2 and paired edges ri,si around the cycle with positive integers ri,si. It is finite or affine by step 5.1, or by the assumption if it is the whole graph. Choose w>0 with Cw0 by step 4.1. In M=diag(wi1)Cdiag(wi) each row sum is nonnegative. Its paired edge magnitudes ri,si have product risi1. Since (risi)20, their sum is at least 2. Summing all row sums gives 02ki(ri+si)0. Equality forces every risi=1, hence ri=si=1. This cycle matrix has null vector 1>0, so is affine by step 4.1; step 5.1 forbids it being a proper principal submatrix. Thus A=C is symmetric.

F1step 4.1step 5.1
7.1

If the connected graph has no simple cycle, it is a tree: two different simple paths would produce a simple cycle. Fix its least vertex with d=1 and propagate dj=diaij/aji>0 along its unique paths. Every edge then satisfies diaij=djaji; nonedges have both sides zero, and diagonal equalities are automatic. Thus DA is symmetric by F2. Together with step 6.1 this proves finite/affine symmetrizability, including the singleton tree.

F1F2step 1.1step 6.1
8.1

For any symmetric B=DA and any u>0, expansion gives xtDAx=idi(Au)ixi2/ui+i<j(diaij)uiuj(xi/uixj/uj)2. Indeed the second sum has cross coefficient 2diaijxixj and diagonal coefficient ji(diaij)uj/ui; adding the first sum leaves diagonal 2di. In finite type choose Au>0, so the first sum is strictly positive for x0. In affine type choose Au=0; the second sum is nonnegative and vanishes exactly when all ratios xi/ui agree along edges, hence everywhere by connectivity. Its kernel is exactly Ru. In indefinite type a positive u with Au<0 gives utDAu<0, whereas every coordinate vector has value 2di>0. The mutually exclusive quadratic behaviors and the already-exhaustive trichotomy prove all reverse implications as well.

F1F2step 1.1step 4.1step 7.1

Sources

Source comparison: Kleshchev, Definition 4.1.1, Lemmas 4.1.6–4.1.7, Theorem 4.1.12, Lemma 4.1.13, Lemma 4.2.2 and Theorem 4.2.3, pp.50–60; direct quadratic expansion replaces spectral theory.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Finite-type Kac–Moody roots descend to simple roots

Statement

For a finite-type GCM (all indecomposable blocks finite), every root is Weyl-conjugate to a simple root. There are finitely many roots, every root space is one-dimensional, and dimg(A)=n+Δ<.

Facts & Assumptions

Given: A finite-type GCM with its finite nonempty simple-root family.

[F1]

Finite blocks have positive definite symmetrizations and are invertible. (Finite affine indefinite trichotomy for indecomposable gcms).

[F2]
[F3]

Weyl reflection preserves roots, multiplicities and the symmetrized form. (The weyl group preserves roots and root multiplicities).

[F4]

Roots have one sign and no higher pure simple multiples. (Kac moody root spaces are finite dimensional).

[F5]

Real root spaces have dimension one. (Real root spaces are one dimensional sl2 roots).

Proof

1.1

Choose a positive symmetrizer on each finite block and combine them into D. F1 makes DA blockwise positive definite and therefore positive definite on the full real root span. For a positive root β=miαi, F2 gives 0<(β,β)=imidiβ(hi). Thus some i with mi>0 has the positive integer β(hi)>0.

F1F2given
2.1

If β is not simple, F4 implies there is some ji with mj>0. F3 makes siβ=ββ(hi)αi a root; its unchanged coefficient at j is positive, so F4 forces this root to be positive. Its height has strictly decreased by the positive integer β(hi). Induction on positive height therefore reaches a simple root. Negative roots reduce to this case by sign, and siαi=αi handles the final sign.

F3F4step 1.1
3.1

Put C=maxi2di. By step 2.1 and form invariance, every root has squared length in {2di}i, hence at most C. The positive definite matrix gives a real dual basis vi to the αi under this form by finite elimination. For v0, the nonnegative quadratic (xtv,xtv) at t=(x,v)/(v,v) gives (x,v)2(x,x)(v,v). If β=miαi, then mi2=(β,vi)2C(vi,vi). Each integer coordinate therefore belongs to a fixed finite interval. There are only finitely many such tuples, proving Δ<.

F2F3step 1.1step 2.1
4.1

Every root is real by step 2.1, so F5 gives dimension one. Each finite block is invertible by F1; hence rankA=n and the minimal Cartan has dimension n. Summing the root decomposition of F4 gives dimg=n+Δ, finite by step 3.1.

F1F4F5step 2.1step 3.1

Sources

Source comparison: Kleshchev, Proposition 4.3.2, pp.63–64; local height descent and explicit dual-basis lattice bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-10Open item page →

Nonsingular indecomposable Kac–Moody algebras are simple

Statement

If A is an indecomposable GCM with detA0, then g(A) is nonabelian and has no nonzero proper Lie ideal. Thus every indecomposable finite-type component is simple. Here an ideal J is a linear subspace with [g,J]J, and “simple” includes nonabelianity.

Facts & Assumptions

Given: An indecomposable nonsingular GCM and a nonzero ideal J of g(A).

[F1]

Every nonzero ideal meets the Cartan. (Kac moody algebra associated to a gcm).

[F2]

Simple vectors and their brackets are nonzero. (Kac moody root spaces are finite dimensional).

[F3]

The minimal Cartan dimension is 2n−rank A. (Minimal realizations exist and are unique up to isomorphism).

[F4]

Indecomposability excludes a nontrivial block partition. (Generalized cartan matrix).

Proof

1.1

By F1 choose 0hJh. F3 and nonsingularity give dimh=n, so the n independent simple roots form a basis of h. Some αi(h)0. The ideal property applied to [h,ei]=αi(h)ei gives eiJ, then [ei,fi]=hi gives hiJ, and [hi,fi]=2fi gives fiJ.

F1F3given
2.1

The finite graph with edges aij0 is connected by F4: otherwise its path components supply a zero block partition, using the symmetric zero condition. For an edge from an index already obtained in step 1.1, [hi,ej]=aijej gives ejJ, and the same two brackets give hj,fjJ. Induction along finite paths reaches every index. The independent hi span the n-dimensional Cartan, so every defining generator lies in J, and J=g. Finally [ei,fi]=hi0 by F2 and Cartan injectivity; hence the algebra is nonabelian.

F2F3F4step 1.1

Sources

Source comparison: Kleshchev, Proposition 1.4.8(i), pp.19–20; direct ideal propagation.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Finite type kac moody algebras recover the dg semisimple algebras

Statement

For a finite-type GCM A over C, g(A) is finite-dimensional and is a direct sum of nonabelian simple Lie algebras, one for each indecomposable component (thus semisimple). Its simple-root/coroot matrix is A, with rows indexing coroots. Intrinsically it is the universal Lie algebra on its minimal Cartan and Chevalley generators subject to the Cartan relations and both Serre families. No external Dynkin classification or separately constructed finite-type model is assumed.

Facts & Assumptions

Given: A finite-type GCM, possibly decomposable.

[F1]

The full Cartan–Serre presentation and separate half presentations hold. (Serre presentation of a kac moody algebra).

[F2]

Each finite block is invertible and symmetrizable. (Finite affine indefinite trichotomy for indecomposable gcms).

[F3]

Finite-type algebras are finite-dimensional with all roots real. (Finite-type Kac–Moody roots descend to simple roots).

[F4]

Each nonsingular indecomposable component is nonabelian simple. (Nonsingular indecomposable Kac–Moody algebras are simple).

Proof

1.1

Let I1,,Is be the connected components of the nonzero-entry graph, giving diagonal blocks Ak. By F2 each is symmetrizable and invertible, so A is too and its Cartan is precisely the span of the hi. F3 proves finite dimension for A and for each block. F4 makes each g(Ak) nonabelian simple.

F2F3F4given
2.1

For indices in different components, the positive and negative Serre exponents are one, so F1 gives [ei,ej]=[fi,fj]=0. The mixed relations give [ei,fj]=0, and the Cartan pairings give zero brackets of each component Cartan with generators of another. The Cartans commute. Jacobi then makes the whole subalgebras generated by different components commute. Map every generator of g(A) to its component generator in kg(Ak); all relations of F1 hold there. Conversely the component generator maps satisfy their own presentations and their images commute, giving a homomorphism from the direct sum back to g(A). Both composites fix every generator, so both are identities.

F1step 1.1
3.1

The direct sum in step 2.1 consists of the simple algebras from step 1.1, proving the stated meaning of semisimple. Its root decomposition is the original one, with positive roots in the nonnegative span of the independent simple roots and with simple root spaces nonzero; F3 identifies all roots by Weyl descent. The relation αj(hi)=aij fixes the row/coroot convention. Finally F1 says precisely that every assignment of these generators in a complex Lie algebra satisfying these relations extends uniquely to a homomorphism; this is the intrinsic universal presentation claimed.

F1F3step 1.1step 2.1

Sources

Source comparison: Kleshchev, Propositions 1.4.3, 1.4.8(i), 4.3.2, pp.17–20 and 63–64; local inverse generator maps.

5 · Examples, counterexamples and false statements

None yet.

Sources