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.
Projection from to and its compatibility with the Kashiwara operators
Statement
Let and let be the lattices and bases of The Kashiwara lattices and and their generating sets, with , , and Kashiwara operators . Then for every , every and every :
(a) Lattice projection. .
(b) Operator compatibility modulo . For every , , and for every with , in . Equivalently on , where the left-hand side is computed in .
(c) Basis projection. The map induced by is a bijection .
(d) Large-weight form. If all , , are sufficiently large compared with , then induces isomorphisms and , and the congruences of (b) for such are the computation used inside the grand loop to deduce the general case; the general statements (a)-(c) hold for every , without a largeness hypothesis.
Choice. The axiom of choice is declared via The Axiom of Choice: clause (c) is clause N(r) of The grand loop: existence of the highest weight crystal bases, whose proof applies clause J(r), and J(r) is where the AC-dependent form comparison of The negative-half bilinear form is symmetric, nondegenerate and integral is used. Clauses (a), (b) and (d) are themselves choice-free.
Facts & Assumptions
Given: A dominant integral weight , a simple root height , and the lattices, residue bases and operators of The Kashiwara lattices and and their generating sets.
The grand loop proves, for every and hence for : clause L(r), ; clause M(r), for ; clause O(r), for surviving ; and clause N(r), the bijection on surviving residue elements; the proof of N(r) applies J(r), which uses the negative-half form comparison; the large-weight case gives a lattice isomorphism and a residue bijection in the degree (The grand loop: existence of the highest weight crystal bases, The negative-half bilinear form is symmetric, nondegenerate and integral, The Axiom of Choice).
The projection is -linear with , and on the negative half ; on the operators are the string operators with and (The Kashiwara operators and of an integrable module, The -string decomposition of the negative half).
and are free -modules with the graded decompositions of The Kashiwara lattices and and their generating sets, and the residue bases are -bases of the respective crystal limits (Crystal lattices, crystal bases and their crystals).
Proof
Clause (a). Since the grand loop holds for every , clause L(r) at is exactly .
Clause (b). Clause M(r) is the first congruence, and clause O(r) is the second equality in the crystal limit; the equivalence with on the residue classes of follows because both sides of the congruence are computed modulo and preserves both lattices by their defining lowering-word construction.
Clause (c). Clause N(r) states precisely that induces a bijection from the surviving elements of onto ; its proof applies J(r) and therefore the AC-dependent form comparison, while nothing in (a), (b) or (d) needs it.
Clause (d). For large weights the grand-loop large-weight computation gives that is an isomorphism on the component and a bijection on its residue bases; those congruences are used as an input inside the loop to derive the general clauses, and the present clauses (a)-(c) do not assume the largeness.
Choice. All congruences in (a), (b) and (d) take place between finitely generated -modules and use only the operators and the string decomposition, so they are choice-free; clause (c) inherits the declared axiom of choice through J(r) and the negative-half form comparison.
Depends on
- The Axiom of Choice
- Crystal lattices, crystal bases and their crystals
- The Kashiwara operators $\tilde e_i$ and $\tilde f_i$ of an integrable module
- The Kashiwara lattices $\mathcal L(\lambda)$ and $\mathcal L(\infty)$ and their generating sets
- The grand loop: existence of the highest weight crystal bases
- The $i$-string decomposition of the negative half
- The negative-half bilinear form is symmetric, nondegenerate and integral
Used by
- The integral residue lattices L_A(∞) and L_A(λ) Definition
- The projection from B(∞) to a highest weight crystal for sl₂ Example
- Canonical elementary crystal extraction and highest-weight survivors 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 based quotient: projection of the lower global basis to a highest weight module Theorem
- The crystal basis B(∞) of the negative half Theorem
- The highest weight and negative half integral crystal triples are balanced Theorem
Dependency tree · two levels
35 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)