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 unmodified integral torus has a quantum-binomial basis
Statement
Let be a finite symmetrizable Cartan datum (Symmetrizable Cartan data for quantum groups), put (The Laurent polynomial ring as the principal localisation of Z[t] at t), let , and let be the -subalgebra of generated by the and the toral quantum binomials (The Lusztig divided-power integral form ).
(a) One simple torus. Fix and write , , for . Then for all , and , where is the Gaussian binomial of Quantum integers, factorials, Gaussian binomials and divided powers at ; all coefficients lie in . Moreover the -subalgebra of generated by and all equals the -span of , and that set is an -basis.
(b) Full torus. Fix a -basis of , let be the finite set of coordinates occurring in the finitely many vectors , and let be the corresponding coordinate direct summand. For every coset of in choose the representative whose -component has minimal sum of coordinate absolute values, ties broken lexicographically, and whose complementary component is the coset's common complementary component. Then the sum over the chosen representatives, so the displayed elements form an -basis of .
Both statements are proved directly on the unmodified generators over the non-PID ring : no integral PBW or canonical-basis input, no inference from torsion-freeness to freeness, and no modified- result is used.
Facts & Assumptions
Given: The Cartan datum with finitely many indices, the Laurent ring , the subgroup , and the toral binomials for , , .
is a subring of containing and for all : the Gaussian binomials are Laurent polynomials in with integer coefficients (The Laurent polynomial ring as the principal localisation of Z[t] at t, The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality (iv)), and (Quantum integers, factorials, Gaussian binomials and divided powers at ).
Each is a Laurent polynomial in with coefficients in , all commute with one another and with every , , , and (The Lusztig divided-power integral form , Divided-power multiplication, toral binomials and the reordering identity (ii)).
as algebras, with and ; the for in a -basis of are algebraically independent, and is commutative (Triangular decomposition of a quantized enveloping algebra (ii)).
The simple coroots are linearly independent over in , and all ; hence and each has finite support in the fixed basis of , so the set of coordinates occurring in the is finite and (Symmetrizable Cartan data for quantum groups, Free abelian group on a set).
For every nonzero integer , : after replacing by , equality would make a root of . Thus for (Quantum integers, factorials, Gaussian binomials and divided powers at ).
Verification
The simple torus and its evaluation. Fix and write , , . By [F2], , a Laurent polynomial in whose support is contained in : indeed each factor equals , so , a -combination of for , and the two extreme coefficients (of and of ) are nonzero by [F5]. Evaluating at for an integer gives with , which equals the Gaussian binomial when , and equals when (the factor has numerator ); accordingly we use the convention for or . Finally, if a Laurent polynomial in with coefficients in vanishes at for infinitely many , it is zero: after multiplying by a power of it becomes a polynomial whose infinitely many pairwise distinct roots force all coefficients to vanish (the are distinct because is transcendental by [F5]).
The Gaussian Vandermonde. For an indeterminate and put and , so that with one has in the notation of [F1]. We first record the weighted-subset model: if for , then . Indeed both sides equal for and for or ; splitting the subsets according to whether lies in gives the recurrence for the right-hand side, and the same recurrence holds for the left-hand side because , using . Splitting a subset with into , , and , the inversion count splits as , because a crossing inversion with , can always be realized, while pairs with , are never inversions; hence for ,
The shift and stability identities. Put . Since for , factoring the first common factors reduces the shift to , proving . The product definition also gives . Rearranging yields ; multiplying by yields . Every coefficient is in .
Normalization to the symmetric Gaussian binomials. By the identification of Quantum integers, factorials, Gaussian binomials and divided powers at , for . First multiply step 1.2 by and use the factorial identity . Then multiply by and substitute in each term, the powers of on the right-hand side combine to as a direct expansion shows; in the resulting identity both sides are zero when or (then for every , so the factor vanishes), and the identity therefore holds for all under the convention of step 1.1.
The product identity. With notation as in step 1.1, we claim for all . Both sides lie in : the left side by [F2], the right side because the coefficients are in and is a Laurent polynomial in [F2]. Evaluating at and using step 1.1, the left side becomes and the right side becomes , and these agree for every by step 2.1. By the evaluation principle of step 1.1 the two Laurent polynomials coincide, proving the identity; its coefficients lie in by [F1].
Spanning and the simple-torus basis. Let . First, for all , : for , multiply the second identity of step 1.3(b) by to get , which reduces and lies in by induction on from the base ; for use the first identity of step 1.3(b) directly; for , multiply it by to get , again reducing . Second, all by induction on (the case gives ): for the shift identity of step 1.3 (with unit coefficient ) iterates upward from , and for its other solution iterates downward from . Third, is an -subalgebra: expands by step 3.1 into the terms , which lie in by the first part. Since contains and every , it contains the generated subalgebra; conversely is a product of the generators and , so equals the -subalgebra generated by and all , which is the simple-torus part of . Fourth, is -independent: if a finite combination with coefficients is zero and not all coefficients vanish, let ; the exponent of occurs only in (each has support in by step 1.1, and with can reach exponent only for ), and its coefficient of is the nonzero extreme coefficient of , so ; then the exponent occurs only in ( has support in with for ), forcing ; descending on gives all coefficients zero. Hence is an -basis of , as claimed in (a).
The full torus. By [F3], with basis-like multiplication ; by [F4], is free of rank and the are algebraically independent. Let be the -subalgebra of generated by the and all ; since and the generators with distinct lie in distinct tensor factors, step 4.1 applied in each factor gives with the displayed products forming an -basis. In , the direct sum running over the chosen representatives (whose existence and explicitness: the -components of a fixed coset form a coset of in the finitely generated free group , and the elements of minimal coordinate absolute-value sum are finitely many by boundedness of the coordinates, so the lexicographic tie-break is a finite comparison; the complementary component is determined by the coset because by [F4]), every product of generators of lies in because and the -products lie in ; conversely and (each is a product of generators). Hence , and the union of times the -basis of over the representatives is an -basis of , proving (b). The construction uses only finitely many explicit coordinate comparisons per coset and no choice function on an infinite family; no integral PBW basis, canonical basis or modified-algebra input is used, and no freeness is inferred from torsion-freeness over the non-PID ring .
Depends on
- Free abelian group on a set
- The Lusztig divided-power integral form $U_A$
- Quantum integers, factorials, Gaussian binomials and divided powers at $q_i$
- Symmetrizable Cartan data for quantum groups
- The Laurent polynomial ring as the principal localisation of Z[t] at t
- 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
- Triangular decomposition of a quantized enveloping algebra
Used by
Dependency tree · two levels
32 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
- Math 263C Quantum Groups (Stanford, 2022), lecture slides 'Lusztig's quantum group. Tilting modules. The Fusion Category in Action' (standard reference, not scraped)
- George Lusztig, Introduction to Quantum Groups (Progress in Mathematics 110, Birkhauser, 1993; second printing 1994; author-hosted scan) (standard reference, not scraped)
- Kyeonghoon Jeong, Seok-Jin Kang and Masaki Kashiwara, Crystal Bases for Quantum Generalized Kac-Moody Algebras, arXiv:math/0305390 (standard reference, not scraped)