Alphabeta Math
TheoremStatement: 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.

Integral convex root PBW bases in finite simply-laced type

Statement

Assume the inherited Axiom of Choice. In finite simply-laced type choose a reduced word w0=si1⋯siN and set βt=si1⋯sit−1αit and Xβt=Si1⋯Sit−1(Eit), using Simply-laced braid symmetries preserve the full divided-power form. Then every Xβt is positive and Xβt(r)=Xβtr/[r]q! lies in the positive divided half. The ordered monomials Xβ1(a1)⋯XβN(aN), at≥0, are an actual Z[q,q−1]-basis of that half. Exchanging the positive and negative halves gives the negative root basis. Both bases remain bases after every scalar specialization. Over A[(q−q−1)−1], the corresponding ordinary root monomials span the ordinary-generator halves. The assertion includes every reduced convex word, rather than one unnamed PBW ordering.

Facts & Assumptions

Given: The finite ADE root datum, the longest element and a reduced word.

[F1]

The braid symmetries, their inverses, divided-power formulas, and the exact A2 normal-order identity are proved in Simply-laced braid symmetries preserve the full divided-power form.

[F2]

Integral triangular decomposition holds and gives UA∩U+=UA+ inside the generic algebra (Integral triangular decomposition and freeness of the Lusztig form).

[F3]

Each generic half weight component has its classical PBW rank, namely the number of Kostant partitions in finite type (Generic quantum Serre halves have classical PBW ranks and a nondegenerate Hopf pairing).

Proof

Given: These data, and write Sw for a reduced product, well defined by [F1].

1.1F1F2F4induction

If ℓ(wsi)=ℓ(w)+1, then Sw(Ei) is positive. Prove this by induction on ℓ(w). Choose a right descent j of a nonidentity w; necessarily j≠i. Write w=w′v with w′ the minimal right coset representative for {i,j} and v in that rank-two parabolic. Both i,j are ascents of w′. Since i is an ascent and j a descent of v, its alternating reduced word has length at most mij−1. The rank-two calculations in [F1] therefore make Sv(Ei) either a simple generator or one of the two neighboring positive polynomials EjEi−qEiEj and EiEj−qEjEi. Induction makes both Sw′(Ei),Sw′(Ej) positive, hence also Sw(Ei). Its divided powers belong to UA by [F1], so [F2] puts them in UA+. Apply this to every prefix in the chosen reduced word.

2.1F1F4step 1.1algebra

Let Mi be the A-span of the ordered divided root monomials for the word i. A braid move changes only its local root block; later factors agree by the braid relation. For commuting colors the block spans agree by commutation. For A2 put x=Ei, z=Ej, y=xz−q−1zx. Up to Laurent units its three root factors are x,y,z. The exact identity from [F1] is z(c)x(a)=∑r=0min⁡(a,c)(−1)rq(a−r)(c−r)+rx(a−r)y(r)z(c−r). It shows that the span of x(a)y(b)z(c) contains 1 and is stable under every left divided power of x and z: use zy=q−1yz and divided multiplication after the displayed formula. Thus it is the entire divided rank-two half. The reversed block has the same property, so both integral block spans agree. Applying their common preceding S prefix preserves equality. By [F4] the space Mi is independent of the reduced word.

3.1F1F2F3step 2.1algebra

Every simple color i starts some reduced word for w0. In that word Ei(r) multiplies the first root factor by the Gaussian coefficient [r+a1r]q∈A. Hence the common space from step 2.1 is stable under every divided simple generator. It contains 1 and lies in UA+ by step 1.1, so it equals UA+. In any fixed weight ν, the ordered root monomials number the Kostant partitions of ν, exactly the generic dimension in [F3]. Since they span, they are linearly independent over the generic field and therefore over A. They form an integral basis, not just a torsion-free spanning set. The half exchange gives the negative result. Base change of these actual free bases retains the bases at every scalar parameter.

4.1F1F2step 1.1step 2.1algebra∎

Repeat the block-span argument for ordinary powers over A[(q−q−1)−1]. In A2 the relations zx=qxz−qy, xy=qyx and yz=qzy reorder ordinary words with coefficients in this ring and no divided factorial. Thus the ordinary block span is the entire ordinary rank-two algebra, and the common-span argument applies. A positive root vector belongs to the ordinary half: it lies in the ordinary full form by [F1], and projecting an ordinary mixed normal-order expansion onto negative degree zero and toral exponent zero maps each normal-ordered word into the ordinary positive half and fixes a pure positive element. Mixed reordering uses only the inverted q−q−1. This justifies the positivity-intersection step for the ordinary form without assuming its integral PBW theorem. Its common root-monomial span is stable under all ordinary Ei, by choosing a word starting i, and hence equals its ordinary half. Exchanging halves completes the ordinary assertion.

Depends on

Used by

Dependency tree · two levels

62 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