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 crystal basis of a tensor product and the two-case operator rule
Statement
Let be integrable chosen -graded type-one quantum weight modules with crystal bases , (Crystal lattices, crystal bases and their crystals), and let be the integrable module of Tensor products of integrable weight modules and of their crystal lattices.
Then is a crystal basis of , and its crystal is the tensor product crystal of The tensor product crystal and its two-case convention: for all , and ,
with value as soon as the selected factor maps to . In particular and map into , and for all one has if and only if , so the partial-inverse axiom holds. The equality case is resolved as in the definition: acts on the second factor and on the first.
No finite dimensionality, bounded support or uniform nilpotence is assumed, and no choice principle is used.
Facts & Assumptions
Given: Integrable chosen -graded type-one quantum weight modules with crystal bases , (Crystal lattices, crystal bases and their crystals), the tensor product module of Tensor products of integrable weight modules and of their crystal lattices with its Kashiwara operators , and its -tensor lattice with residue basis .
Crystal lattice and crystal basis axioms (Crystal lattices, crystal bases and their crystals): is free over , weight-graded, generates over and is stable under ; is a -basis of with , and if and only if .
String components of a lattice vector (The -string components of a lattice vector and the single surviving component modulo ): for with admissible decomposition , every lies in ; the lattice decomposes as ; if then exactly one component is outside , with and ; and the residues of are those of , .
The rank-one tensor strings (Rank-one tensor strings and their crystal limit rule): for rank-one simples of nonnegative integral highest weights with divided bases , and their -tensor lattice, that lattice is stable under and modulo one has if and otherwise, while acts on the first factor if and on the second otherwise, with zero outside the divided-basis ranges; this is a finite, choice-free calculation independent of the grand loop.
Kashiwara operators (The Kashiwara operators and of an integrable module): on the unique admissible string decomposition, and shift the divided string positions down and up by one; they are linear, preserve the given factor lattices and commute with module homomorphisms.
Uniqueness of admissible decompositions (Uniqueness of the -string decomposition of an integrable module): every vector of an integrable weight module has exactly one finite admissible -string decomposition; on the maps are injective for and zero for , and for .
Crystal graph invariants (The crystal graph, , and the weight function): and are finite and nonnegative, , and on an existing -edge decreases by one and increases by one.
Tensor integrability lemma (Tensor products of integrable weight modules and of their crystal lattices): is an integrable chosen -graded type-one weight module for the direct sum grading ; is free and generates over , is weight-graded accordingly, and is a weight-graded -basis of (stability under the crystal operators is not assumed; it is proved here).
The tensor product crystal and the target rules (The tensor product crystal and its two-case convention).
Weight modules and integrability (Quantum weight modules, weights in , and integrability): the tensor module is a chosen -graded type-one weight module in the sense stated there, and integrability is local nilpotence of all .
Proof
Reduction to single string components. Fix and lifts with , and put . By [F2] applied to there are top components with and ; hence (expand the difference as in the bilinearity of the tensor product), and because the residue of is by [F2].
The rank-one block. The top lies in with by [F5]; the divided powers , , form the string basis of the finite-dimensional -submodule , all of them lie in by [F2], and on this string acts as the divided-power shift and as its partial inverse by [F4]. The tensor product of the inclusions is injective and -linear, and for a vector of its admissible decomposition computed inside is also admissible in , so by uniqueness [F5] it is the admissible decomposition there; hence the operators of restrict on the image to the string operators computed from .
The rank-one computation. Apply [F3] to the pair with divided bases , and their -tensor lattice , which is preserved by both string operators by [F3] and by step 1.2; modulo one has if and otherwise, while acts on the first factor if and on the second otherwise, with outside the divided-basis ranges.
Transport to the residues. Since , step 2.1 computes and modulo , and the residues of and are and ; likewise on the second factor by [F2]. Because by [F6] and , the two cases of step 2.1 are exactly and for , and or for , giving the displayed two-case rules for the residue of ; a selected factor with or equal to produces the value , consistently on both sides of the congruence.
Stability of the tensor lattice. For arbitrary use the full string decomposition of [F2]: with finitely many nonzero , and each pair spans a finite rank-one block as in step 1.2 whose -tensor lattice is preserved by both string operators by [F3]; since the inclusions commute with the operators (step 1.2), every term of the finite expansion of has its images under inside , and linearity gives and . In particular and likewise for , so the congruence of step 1.1 may be transported by the operators and the two-case rules of step 3.1 hold for the residues of arbitrary lifts, not only for .
Operator rules and residues. Combining steps 3.1 and 4.1: for all the classes and are computed by the displayed two-case rules, and they lie in because each case is the residue of an element of the form with , ; the equality case sends to the second factor, since the first case requires the strict inequality, and to the first factor, since its first case is non-strict.
Partial inverses. Suppose first and let ; then by [F6], so the -rule of step 5.1 selects the first factor at and by the factor partial inverse [F1]. Suppose next and ; then and by [F6], so the -rule selects the second factor and . The converse implication is the same computation read backwards, and at the tie both consistency conditions hold simultaneously: this is exactly why is assigned the non-strict and the strict comparison.
Conclusion. By [F7] the pair has the lattice axioms of generation over , weight grading and residue-basis properties; step 4.1 supplies operator stability and step 5.1 the operator axioms on ; step 6.1 supplies the partial-inverse axiom. Hence it is a crystal basis of whose crystal is the tensor product crystal of [F8] with the displayed rules. Every step used finite string data of two vectors and the one-factor crystal bases; no finite dimensionality, bounded support, uniform nilpotence or choice principle is assumed.
Depends on
- The tensor product crystal $B_1\otimes B_2$ and its two-case convention
- The $i$-string components of a lattice vector and the single surviving component modulo $q$
- Tensor products of integrable weight modules and of their crystal lattices
- The crystal graph, $\varepsilon_i$, $\varphi_i$ and the weight function
- Crystal lattices, crystal bases and their crystals
- The Kashiwara operators $\tilde e_i$ and $\tilde f_i$ of an integrable module
- Uniqueness of the $i$-string decomposition of an integrable module
- Rank-one tensor strings and their crystal limit rule
- Quantum weight modules, weights in $P$, and integrability
Used by
- Changing the equality case in the tensor rule breaks the partial-inverse axiom Counterexample
- The tensor crystal B(1)⊗ B(1) for sl₂ Example
- Canonical elementary crystal extraction and highest-weight survivors Lemma
- Divided-power integrality of the quasi-R action on based lattices Lemma
- Fixed-residue node cubes realize the actual Fock strings Lemma
- Full finite type-A tensor source upper charts and string leading terms Lemma
- The weight, εᵢ and φᵢ formulas for the tensor product crystal Lemma
- Highest weight components in a tensor product crystal Theorem
- Standard tableau monomials form a basis of the highest weight Fock submodule Theorem
- Tensor bars on finite products of based integrable modules Theorem
- The column monomial basis of the higher-level Fock module Theorem
Dependency tree · two levels
27 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
- Kyeonghoon Jeong, Seok-Jin Kang and Masaki Kashiwara, Crystal Bases for Quantum Generalized Kac-Moody Algebras, arXiv:math/0305390 (standard reference, not scraped)
- Masaki Kashiwara, On crystal bases of the q-analogue of universal enveloping algebras, Duke Math. J. 63 (1991), no. 2, 465-516 (standard reference, not scraped)
- Richard Borcherds, Mark Haiman, Theo Johnson-Freyd, Nicolai Reshetikhin and Vera Serganova, Berkeley Lectures on Lie Groups and Quantum Groups (book-length lecture notes, last updated 18 January 2024) (standard reference, not scraped)