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 and set and , using Simply-laced braid symmetries preserve the full divided-power form. Then every is positive and lies in the positive divided half. The ordered monomials , , are an actual -basis of that half. Exchanging the positive and negative halves gives the negative root basis. Both bases remain bases after every scalar specialization. Over , 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.
The braid symmetries, their inverses, divided-power formulas, and the exact normal-order identity are proved in Simply-laced braid symmetries preserve the full divided-power form.
Integral triangular decomposition holds and gives inside the generic algebra (Integral triangular decomposition and freeness of the Lusztig form).
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).
Finite root combinatorics, parabolic coset decomposition and the reduced-word theorem are available (Combinatorics of a reduced root datum, Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification, The inversion formula , the root-reflection dictionary and strong exchange). In particular the positive prefix roots of a reduced word for enumerate once. The Choice inherited through [F2]–[F3] is declared in The Axiom of Choice.
Proof
Given: These data, and write for a reduced product, well defined by [F1].
If , then is positive. Prove this by induction on . Choose a right descent of a nonidentity ; necessarily . Write with the minimal right coset representative for and in that rank-two parabolic. Both are ascents of . Since is an ascent and a descent of , its alternating reduced word has length at most . The rank-two calculations in [F1] therefore make either a simple generator or one of the two neighboring positive polynomials and . Induction makes both positive, hence also . Its divided powers belong to by [F1], so [F2] puts them in . Apply this to every prefix in the chosen reduced word.
Let be the -span of the ordered divided root monomials for the word . 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 put , , . Up to Laurent units its three root factors are . The exact identity from [F1] is It shows that the span of contains and is stable under every left divided power of and : use 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 prefix preserves equality. By [F4] the space is independent of the reduced word.
Every simple color starts some reduced word for . In that word multiplies the first root factor by the Gaussian coefficient . Hence the common space from step 2.1 is stable under every divided simple generator. It contains and lies in by step 1.1, so it equals . 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 . 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.
Repeat the block-span argument for ordinary powers over . In the relations , and 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 . 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 , by choosing a word starting , and hence equals its ordinary half. Exchanging halves completes the ordinary assertion.
Depends on
- Simply-laced braid symmetries preserve the full divided-power form
- Integral triangular decomposition and freeness of the Lusztig form
- Generic quantum Serre halves have classical PBW ranks and a nondegenerate Hopf pairing
- Combinatorics of a reduced root datum
- Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- The Axiom of Choice
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
- George Lusztig, Introduction to Quantum Groups (standard reference, not scraped)