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.
Full divided powers force root-of-unity weight reflection symmetry
Statement
For of The full toral-weight Lusztig module category, for every simple reflection . Consequently its formal weight character is Weyl invariant. If a nonzero weight vector is killed by every for , then and for every . These assertions concern the full divided-power action, including powers whose index is at least .
Facts & Assumptions
Given: The full toral-weight module and odd .
The integral reordering and multiplication identities of Divided-power multiplication, toral binomials and the reordering identity apply after specialization, including to arbitrary divided powers. On a rank-one highest vector of coroot label they give for , and zero for ; the multiplication coefficient for is .
Symmetric Gaussians are Laurent polynomials with the Pascal identities (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality). The generic rank-one strings of Divided-power commutation and the simple string modules have the divided basis with precisely the action in [F1]; their free -span can therefore be specialized.
Proof
Fix one root color, and first work in a single coset. Take a finite-dimensional simple graded module for the rank-one algebra, and choose a nonzero vector at its highest integer coroot label . It is killed by every positive divided power. Reordering shows that the cyclic module is spanned by the distinct weight vectors , , and simplicity makes this the whole module. If , put . The negative-binomial identity gives . To see this is nonzero for arbitrarily large , write , , and use with . Every block of length equals , because has odd order ; the residual block has degree . The coefficient of is therefore : the sign from is raised to the even power . It is nonzero. But finite support makes for large , contradicting . Hence .
For this simple cyclic module the span of , , is stable. Positive divided powers landing at index have coefficient , since the upper index is then a nonnegative integer smaller than ; all other terms remain in that span. Negative divided powers increase the index and toral operators act diagonally. This is a proper submodule, as it avoids the top weight, so it is zero. The module is thus a quotient of the specialized free rank-one string with basis and the actions in [F1]. On the diagonal bilinear form , for , is contravariant for and fixes the torus. Indeed the required identity is , valid as a Laurent-polynomial identity before specialization. Its radical is consequently stable. Every surviving weight line of the quotient by this radical can be raised to using , since its coefficient is nonzero; the quotient is simple. Every proper graded submodule of lies in the radical, since it cannot contain and the same raising test applies. Therefore the original simple module is this quotient. Its surviving indices are exactly those with , a set invariant under by Gaussian symmetry. Its character is reflected about coroot label zero.
Every finite-dimensional graded rank-one module has a composition series in the graded module category: choose proper graded submodules of largest dimension and continue, so the process terminates. Its simple quotients have the symmetric characters proved in steps 1.1 and 2.1; character additivity proves symmetry for the original module. Coset by coset, the reflection sends to , so this is precisely -invariance of . Applying this for each color gives Weyl invariance.
Now let be any nonzero rank-one highest vector, without simplicity. Its finite cyclic module is spanned by and has support at , . By step 3.1 this support is invariant under negation, forcing . Its span of indices is a submodule by the calculation in step 2.1, and all its coroot labels are strictly negative. Applying step 3.1 to this finite submodule forces it to be zero. Thus every higher divided power with vanishes. This proves the stated highest-vector assertion for every color.
Depends on
- The full toral-weight Lusztig module category
- Divided-power multiplication, toral binomials and the $E_i^{(a)}F_i^{(b)}$ reordering identity
- The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality
- Divided-power commutation and the simple $U_{q_i}(\mathfrak{sl}_2)$ string modules
Used by
Dependency tree · two levels
14 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)