Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Finite Serre word forms descend and have classical PBW rank bounds

Statement

Work in ZF. Let I be finite and nonempty and a=(aij) a symmetric generalized Cartan matrix. Also allow I=∅ by taking each half to be the coefficient field and its integral subalgebra to be A. Set A=Z[t,t−1], k=Q(t) and S=k⟨fi:i∈I⟩/(sij:i≠j), where, for m=1−aij, sij=∑r=0m(−1)r(mr)tfim−rfjfir. Identify S with the actual negative Drinfeld–Jimbo half by the choice-free crossed-double lemma, and let UA− be its actual divided-power subalgebra. There exists a unique homogeneous bilinear form Bt with Bt(1,1)=1 and Bt(fix,y)=Bt(x,Diy),Di(fjy)=δijy+t−aijfjDi(y),Di(1)=0. It is symmetric. For ordinary words u=fi1⋯fih and v=fj1⋯fjh its value is Bt(u,v)=∑π: jπ(b)=ibt−∑b<c, π(b)>π(c)aibic, where the sum is over matching permutations. In particular ordinary-word values lie in A, and values on UA− lie in the localization of A obtained by inverting the symmetric quantum factorials.

For any α∈NI, including α=0, enumerate the finite set Wα of ordinary words of that degree, and let Gα(t) be their Gram matrix in the displayed formula. At every real c>0, rank⁡Q(c)Gα(c)≤rank⁡kGα(t)≤dim⁡kS[α]≤pα, where pα is the classical PBW rank: the dimension of the classical Serre enveloping-algebra component. No nondegeneracy or freeness of the divided-power lattice is asserted or used.

Facts & Assumptions

Given: The finite symmetric Cartan matrix, its generic Serre quotient, its actual divided-power subalgebra and the finite ordinary words in each root degree.

[F1]

Quantum factorials are nonzero rational functions; the symmetric Gaussian coefficients are Laurent polynomials, satisfy (mr)t[m−r]t=(mr+1)t[r+1]t, and obey ∑r=0m(−1)r(mr)tt±(m−1)r=0 for m≥1 (Quantum integers, factorials, Gaussian binomials and divided powers at qi, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality). The cross identity is direct factorial cancellation. The positive-exponent alternating identity is the Gauss product at z=−1; substituting t−1 and using [n]t−1=[n]t gives the negative-exponent identity.

[F2]

The abstract separate Serre half embeds as the actual negative half, without any choice principle (The generic quantum halves form a Drinfeld–Jimbo crossed double). Its divided-power subalgebra consists exactly of finite A-linear combinations of products of fin/[n]t! (The Lusztig divided-power integral form UA).

[F3]

PBW for a supplied ordered finite or countable Lie basis is proved by terminating adjacent-inversion reduction and Jacobi. In a finite-word graded Lie presentation an ordered homogeneous basis can be obtained by retaining the first independent bracket words, without AC (PBW for countably presented Kac Moody Lie algebras). The proof works over Q verbatim: its reductions use only field arithmetic and Jacobi.

[F4]

For the classical complex Kac–Moody algebra, its negative half is the Lie algebra on the negative simple generators with exactly the separate negative Serre relations (Serre presentation of a kac moody algebra). Thus the classical PBW rank here means the same dim⁡CU(n−)[−α] as in the existing generic-rank theorem.

Proof

1.1givenF1constructalgebra

If I=∅, only degree zero occurs; both forms and Gram matrices are (1) and p0=1, so every assertion holds directly. Otherwise supply an order on the finite set I. On the free algebra T=k⟨fi⟩ define Di by the stated recursion. For homogeneous x,y, direct induction on word length gives Di(xy)=Di(x)y+t−(αi,deg⁡x)xDi(y), where (αi,αj)=aij. The recursion also gives Di(fin)=t−(n−1)[n]tfin−1. These are finite sums, and Di lowers height by one.

2.1F1step 1.1algebra

Every Dℓ kills each Serre polynomial already in T. Put a=aij and m=1−a. If ℓ∉{i,j} this is immediate. For ℓ=j, its value is t−amfim∑r(−1)r(mr)ttar=0, since a=−(m−1) and [F1] applies. For ℓ=i, the coefficient of fim−1−rfjfir, 0≤r<m, is (−1)rt−(m−r−1)(mr)t[m−r]t+(−1)r+1t−2(m−r−1)−a−r(mr+1)t[r+1]t=0: the two exponents agree because a=1−m, and the remaining factors agree by [F1]. This calculation includes a=0,m=1.

3.1step 1.1step 2.1algebra

Let J be the two-sided Serre ideal in T. Applying the twisted product rule to a homogeneous contextual relation usijv shows Dℓ(usijv)∈J: differentiating the middle factor gives zero, and differentiating either outside factor leaves the Serre factor. Homogeneous contextual relations span J, so DℓJ⊆J. Thus each Di descends to S, with augmentation ϵ:S→k killing positive height.

4.1step 1.1step 3.1constructalgebra

For a free word u=fi1⋯fih and y∈S define b(u,y)=ϵ(Dih⋯Di1y), where Di1 acts first. Extend linearly in u. This is well-defined in its second argument by step 3.1. Repeated deletion of letters in a representative word v gives exactly the matching-permutation formula in the Statement: the first deletion at position π(1) crosses the preceding remaining letters, and these are precisely the inversion pairs involving the first matched letter; continue inductively. Unequal root degrees give zero.

4.2givenF1step 3.1constructalgebra

Fix α=∑iniαi. The words Wα are a finite ordered list of length N=(∑ini)!/∏ini!. Construct the finite N-row matrix Rα(t) whose columns are all contextual Serre polynomials usijv of degree α, expanded in Wα. This is a finite list: i,j have finitely many possibilities and both context lengths are bounded by ht⁡α. Include all possible context words of the required complementary degrees. The image of this matrix over k is exactly J[α], since every homogeneous ideal element is a finite sum of such contexts. Consequently dim⁡kS[α]=N−rank⁡kRα(t).

5.1step 4.1F2algebra

The bijection π↦π−1 preserves the exponent after interchanging u,v, since a is symmetric. Consequently b(u,[v])=b(v,[u]) for free words and hence for free polynomials. If P∈J, then b(u,[P])=0 for every u; symmetry implies b(P,[u])=0 for every u. Thus b factors in its first argument too, defining the asserted symmetric bilinear form on S. Its definition gives the adjunction and vacuum value. Conversely these adjunctions and homogeneity evaluate any first word by successive deletion, proving uniqueness. Identification [F2] makes this a form on the actual generic half, rather than a form on an unrelated free word space.

5.2F1step 4.2algebra

All entries of Rα(t) lie in A. At t=1, [n]t evaluates to n and each Gaussian coefficient evaluates to the ordinary binomial coefficient, by its polynomial identity or factorial quotient. Hence Rα(1) is exactly the contextual classical Serre matrix. Every nonzero minor of Rα(1) comes from a Laurent-polynomial minor nonzero at 1, and that minor is therefore nonzero over k. Thus rank⁡kRα(t)≥rank⁡QRα(1) and dim⁡kS[α]≤N−rank⁡QRα(1). This is an upper bound; no equality of generic and classical ranks is needed.

6.1F1F2step 5.1algebra

The finite permutation expression has Laurent-polynomial values. Every divided-power product is an ordinary word divided by a finite product of quantum factorials. Bilinearity and [F2] therefore give the asserted localization bound on Bt(UA−,UA−). This uses the actual integral lattice's defining inclusion in the actual half, not a claim that a torsion-free module over A is free.

6.2F3F4step 5.2algebraconstruct

The final rational classical quotient is U(nQ−): define nQ− as the rational Lie algebra on the finite generators fi modulo (ad⁡fi)1−aijfj=0. A linear map from these generators into the commutator Lie algebra of an associative algebra factors through nQ− exactly when its images satisfy the ordinary associative Serre sums, since expanding the iterated commutator gives ∑r(−1)r(mr)fim−rfjfir. Therefore the enveloping algebra and the associative classical Serre quotient have the same universal property, giving mutually inverse generator maps. Enumerate finite homogeneous bracket words, degree by degree, retaining each first independent image to obtain an ordered homogeneous Lie basis. Each root degree has finitely many bracket words and hence finite dimension. PBW [F3] identifies the degree-α component dimension with the number pα of ordered basis monomials of that degree. Extending the finite rational matrix Rα(1) to C preserves its rank: each nonzero rational minor stays nonzero, and each zero minor stays zero. Thus the rational and complex associative quotient dimensions agree. Over C, [F4] identifies the Lie Serre half with the actual classical Kac–Moody negative half; the enveloping universal property just proved identifies its enveloping algebra with the complex associative Serre quotient. Consequently pα is exactly the classical PBW rank of the original target, rather than the rank of a newly chosen different Lie algebra. At α=0 there is one empty word, no contextual relation, G0=(1) and p0=1.

7.1step 5.1step 5.2step 6.2algebra∎

By step 5.1, Gα(t) is the pullback of a bilinear form on the dim⁡kS[α]-dimensional quotient, so its rank is at most that dimension. At c>0 the Laurent entries evaluate. If a specialized minor of Gα(c) is nonzero over Q(c), its Laurent-polynomial minor is nonzero in k. Thus rank⁡Q(c)Gα(c)≤rank⁡kGα(t). Combine this with steps 5.2 and 6.2 to obtain the full chain. All bases and matrix ranks needed here are furnished by finite pivot scans or the explicit bracket-word enumeration. The recursion defines the form in all degrees at once; there is no family of arbitrary choices.

Depends on

Used by

Dependency tree · two levels

22 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