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.
The root-specialized toral quotient by group-like generators
Statement
Take a finite-type semisimple Cartan datum with standard symmetrizers , chosen weight lattice , dual lattice , and . Specialize at a primitive root of odd order , with for all , and put . In the actual specialized toral algebra, the quotient by all is the polynomial algebra on . If and , with residues in , its exact formula is
Facts & Assumptions
Given: The datum, isogeny lattice, and good odd root order above.
The actual toral basis, product and shift formulas are supplied by The unmodified integral torus has a quantum-binomial basis. In one color, writing , , , they include and .
Quantum Lucas and single-color generation hold at each , which has exact odd order (Quantum Lucas and generation of specialized divided powers).
The toral generators are the actual quantum-binomial product expressions in the integral form (The Lusztig divided-power integral form ); evaluating gives the Laurent-integral Gaussian with upper index .
Proof
Given: The data above.
Fix one color. Modulo , the first recurrence of [F1] gives : its right numerator is zero and its left scalar is nonzero. Successively for , the scalar is nonzero and the preceding term vanishes, so . In the product formula of [F1] with , , Lucas makes all terms vanish except and ; these have coefficients and , respectively. Thus , where . Induction from gives . The toral spanning statement in [F1] now shows that the full quotient by all is spanned by polynomials in the .
For each , evaluate the integral torus at and then specialize . These are well-defined integral evaluations, since a toral binomial evaluates to the Laurent-integral quantum binomial with upper index , including negative indices by [F2]. They annihilate every and send to . The coordinate image of is a finite-index subgroup of , since has finite index in the full weight lattice; hence it contains for some positive integer . A polynomial vanishing on this grid is zero: regard it as a polynomial in one variable with infinitely many grid values, then apply the same argument to each coefficient in the other finitely many variables. There is consequently no polynomial relation among the in the quotient. This proves its exact polynomial-algebra description.
Every is already a polynomial in in the quotient by step 1.1 and the toral shift spanning. Its evaluation at in step 2.1 is by [F2]. Polynomial separation from step 2.1 gives the formula in the statement, including negative . In particular in this quotient.
Depends on
Used by
Dependency tree · two levels
15 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)