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.
Highest weight elements, lowering-generated sets and highest weight crystals
Definition
Let be a crystal, meaning the data attached to a crystal basis or to a tensor product of such data (The crystal graph, , and the weight function, The tensor product crystal and its two-case convention).
A vertex is a highest weight element (a highest vertex, a maximal vector) of weight if and for every . The lowering-generated set of is
the set of all nonzero iterated lowering images of ; it contains and is closed under nonzero images of every . It need not be closed under raising: at the bottom of a two-vertex rank-one string, while is the top vertex. The connected component of is the smallest subset of containing and closed under nonzero images of and for all ; by the partial-inverse axiom this is the connected component of the underlying coloured graph.
is a highest weight crystal of highest weight if has a highest weight element of weight and .
The definition deliberately separates two conditions. Always , and a highest vertex need not generate : in a tensor product a vertex with and for all is highest while is in general larger than its lowering-generated set (the companion page computes both cases). Conversely, for abstract crystals the two conditions do not determine up to isomorphism: the source literature records that not every connected crystal with a highest weight element of weight is isomorphic to . In this library crystals come from crystal bases of modules, and uniqueness for those is a theorem proved later on this page, not a consequence of this definition.
For the canonical objects, denotes the crystal of the simple highest weight module (The Kashiwara lattices and and their generating sets) and the dominant integral labels (Kac moody integral and dominant integral weights); that is a highest weight crystal of highest weight is the next theorem. The operators used throughout are those of The Kashiwara operators and of an integrable module. No choice principle is used.
Depends on
- The crystal graph, $\varepsilon_i$, $\varphi_i$ and the weight function
- The tensor product crystal $B_1\otimes B_2$ and its two-case convention
- The Kashiwara lattices $\mathcal L(\lambda)$ and $\mathcal L(\infty)$ and their generating sets
- The Kashiwara operators $\tilde e_i$ and $\tilde f_i$ of an integrable module
- Kac moody integral and dominant integral weights
Used by
Dependency tree · two levels
17 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
- Sami Assaf, Anne Dranowski and Nicolle Gonzalez, Extremal tensor products of Demazure crystals, arXiv:2210.10236 (standard reference, not scraped)
- Mark Shimozono, Crystals for Dummies (lecture notes, 28 August 2005) (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)