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 the negative half
Statement
Let and be the Kashiwara lattice and generating set of The Kashiwara lattices and and their generating sets, with the Kashiwara operators on of The -string decomposition of the negative half(iii).
(i) is a crystal basis of in the sense of Crystal lattices, crystal bases and their crystals: is a free -submodule with , stable under and ; and is a -basis of satisfying , , and if and only if for all .
(ii) The root-graded components are free: and each is a free -module of rank .
(iii) For every the projection maps onto , and the compatibility statements of Projection from to and its compatibility with the Kashiwara operators hold: , , and whenever .
(iv) The root-graded crystal has finite on each element, formal , and actual lowering length . Every -iterate is nonzero because holds on its lattice and residue. Thus it is the infinite lowering crystal of the unit, with the negative-half convention of the crystal-graph definition.
Choice. The axiom of choice is declared via The Axiom of Choice and enters only through the grand loop: the partial-inverse axiom in (i) uses clause J(r) of The grand loop: existence of the highest weight crystal bases, whose proof consumes the AC-dependent form comparison of the negative-half form. The freeness and rank statements are choice-free.
Facts & Assumptions
Given: The negative half with its root grading and operators, and the lattice generated by the monomials .
Structure of the lattice: is generated by the lowering monomials, each component is finitely generated and torsionfree, and it is a free -module by the PID supplier (The Kashiwara lattices and and their generating sets, Every finitely generated torsion-free module over a PID is free, The local ring of rational functions regular at ).
Grand loop clauses: H(r) (), I(r) (), J(r) (if then ), K(r) ( is a -basis of ), and the large-weight lattice isomorphism for large (The grand loop: existence of the highest weight crystal bases).
On the negative half , is injective, if and only if , and lowers the root height by one (The -string decomposition of the negative half).
Projection lemma: for every and one has , the surviving residue bijection, and the - and -compatibilities on surviving classes; clause (c) inherits the axiom of choice (Projection from to and its compatibility with the Kashiwara operators, The Axiom of Choice).
In module crystals the raising and lowering lengths are finite. The negative-half convention of the crystal graph is: finite , formal and actual lowering length (The crystal graph, , and the weight function).
Proof
Freeness and scalar extension. Each component is finitely generated and torsionfree, hence free over the PID by [F1]. As in the grand-loop conclusion [F2], enumerate and the finite ordered word generators of each component and take the first finite tuple of their linear combinations that is a basis. These uniquely specified component bases unite to a basis of the graded direct sum without simultaneous choice. For field spanning, use the grand-loop field-spanning argument [F2]: if is homogeneous, then , and the vector in parentheses has the same root degree as . Thus every positive-height component, being the sum of the -images of preceding components, is also spanned by their -images. Induction from shows that the lowering words span each field component. The canonical map is therefore surjective. It is injective by clearing denominators: a finite tensor sum equals for some and , and its image vanishes only when . Taking graded direct sums gives the claimed scalar-extension isomorphism.
Stability and residue basis. Stability under holds by construction, since a -image of a lowering monomial is a lowering monomial; stability under is clause H(r). Clause K(r) says that is a -basis of , and clause I(r) gives . For , the image of a monomial is a monomial and prevents it from vanishing modulo : if then , contradicting in the crystal limit.
The partial-inverse axiom. If with , then applying and [F3] gives . Conversely, if , then by clause J(r), so by [F3]; hence if and only if , and this is the only place where the grand-loop clause J(r), and with it the inherited axiom of choice, is used.
The projection statements. The lattice projection, surviving-residue bijection and operator compatibilities in (iii) are [F4]. To see that zero is also attained, fix : by step 1.2 every has nonzero negative-half residue, while lowering compatibility projects it to . The latter is zero for sufficiently large because the module lowering length is finite by [F5]. Thus the image is exactly .
The rank formula. By [F1] and clause K(r), the free rank of is , and by step 1.1 the scalar extension is , so this number is also ; this is (ii).
The infinite chain. By [F3] the operator is injective on and , and by step 1.2 no iterate of a residue element vanishes; hence for every , while by the finite string structure of the negative half (the height bound). The formal is the convention of [F5] and is not the lowering-chain length.
Depends on
- The Axiom of Choice
- Every finitely generated torsion-free module over a PID is free
- The crystal graph, $\varepsilon_i$, $\varphi_i$ and the weight function
- Crystal lattices, crystal bases and their crystals
- The Kashiwara lattices $\mathcal L(\lambda)$ and $\mathcal L(\infty)$ and their generating sets
- The local ring $A_0$ of rational functions regular at $q=0$
- Projection from $\mathcal L(\infty)$ to $\mathcal L(\lambda)$ and its compatibility with the Kashiwara operators
- The grand loop: existence of the highest weight crystal bases
- The $i$-string decomposition of the negative half
Used by
- The projection from B(∞) to a highest weight crystal for sl₂ Example
- Canonical elementary crystal extraction and highest-weight survivors Lemma
- Integral residues of the negative half: freeness, the crystal basis and the form characterization Lemma
- Integrality of the string decomposition and the divided-power string ideals Lemma
- The string-ideal triples are balanced: the induction step (Kashiwara 7.4.1 / JKK 10.4) Lemma
- The highest weight and negative half integral crystal triples are balanced Theorem
Dependency tree · two levels
44 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)