Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 canonical crystal B(λ) is a highest weight crystal of highest weight λ

Statement

Let λ∈P+ and let B(λ)=B(λ) be the crystal of V(λ)=L(λ) from The Kashiwara lattices L(λ) and L(∞) and their generating sets, which is a crystal basis by The grand loop: existence of the highest weight crystal bases. Then B(λ) is a highest weight crystal of highest weight λ in the sense of Highest weight elements, lowering-generated sets and highest weight crystals:

(i) bλ:=vλ+qL(λ) is a highest weight element of weight λ: wt(bλ)=λ and e~ibλ=0 for every i∈I;

(ii) B(λ)=F(bλ): every b∈B(λ) is an iterated lowering image b=f~i1⋯f~irvλ;

(iii) bλ is the only highest weight element of B(λ): B(λ)λ={bλ}, and for every μ≠λ and every nonzero homogeneous u∈L(λ)μ/qL(λ)μ there is i∈I with e~iu≠0.

No choice principle is used.

Facts & Assumptions

Given: A dominant integral label λ∈P+ (Kac moody integral and dominant integral weights), the simple integrable highest weight module V(λ)=L(λ) with highest vector vλ (The integrable quantum highest weight module exists and is unique), its lattice L(λ) and basis B(λ) (The Kashiwara lattices L(λ) and L(∞) and their generating sets), and the residue bλ=vλ+qL(λ).

[F1]

Crystal basis of V(λ) (The grand loop: existence of the highest weight crystal bases, The Kashiwara lattices L(λ) and L(∞) and their generating sets): (L(λ),B(λ)) is a crystal basis of V(λ); L(λ)μ is a free A0-module for every μ, and since L(λ) is generated over A0 by the lowering words applied to vλ and no nonempty word has weight λ, L(λ)λ=A0vλ is free of rank 1 generated by vλ≠0; dim⁡Q(q)V(λ)μ=#B(λ)μ.

[F2]

The lattice and basis of highest weight λ (The Kashiwara lattices L(λ) and L(∞) and their generating sets): L(λ) is generated over A0 by the lowering words f~i1⋯f~irvλ and B(λ)={f~i1⋯f~irvλ+qL(λ)}∖{0}; moreover for α∈Q+∖{0} one has B(λ)λ−α=(⋃i∈If~iB(λ)λ−α+αi)∖{0} and f~iL(λ)⊆L(λ).

[F3]

Crystal-lattice axioms (Crystal lattices, crystal bases and their crystals): B(λ)=⨆μB(λ)μ is a Q-basis of L(λ)/qL(λ) with B(λ)μ⊆L(λ)μ/qL(λ)μ, the operators satisfy e~if~i=id on existing edges and f~ie~i=id, in the form f~ib=b′  ⟺  b=e~ib′.

[F4]

Crystal graph conventions (The crystal graph, εi, φi and the weight function): e~i maps a vertex of weight μ with e~ib≠0 to a vertex of weight μ+αi; εi(b)=max⁡{n:e~i nb≠0} is finite, and e~i nb≠0 exactly for 0≤n≤εi(b).

[F5]

Structure of V(λ) (The integrable quantum highest weight module exists and is unique, Quantum Verma modules M(λ), highest weight vectors, and the simple highest weight quotient L(λ)): V(λ) has label-weight support contained in λ−Q+ and finite-dimensional label-weight spaces; it is generated by vλ under Uq(g), and its weight λ space is one-dimensional, spanned by the image of vλ, because V(λ) is the simple graded quotient of the Verma module M(λ)=Uq(g)vλ whose highest line M(λ)λ=Q(q)vλ maps onto it.

[F6]

Weight modules and integrability (Quantum weight modules, weights in P, and integrability) and the Kashiwara operators (The Kashiwara operators e~i and f~i of an integrable module) supply the weight grading and the string structure on which [F2]-[F4] operate.

[F7]

The definition of a highest weight element and of F(b) (Highest weight elements, lowering-generated sets and highest weight crystals).

Proof

technique · direct
1.1F1F3F4F5

The top residue. By [F1], L(λ)λ is free of rank one with generator vλ, so its residue space L(λ)λ/qL(λ)λ is one dimensional and B(λ)λ={bλ} by [F3]; in particular wt(bλ)=λ. If e~ibλ≠0 for some i, then by [F4] it is an element of B(λ)λ+αi and is the residue of a nonzero homogeneous vector of V(λ) of weight λ+αi; but wt(V(λ))⊆λ−Q+ by [F5], a contradiction since λ+αi∉λ−Q+. Hence e~ibλ=0 for all i, and bλ is a highest weight element of weight λ, proving (i).

2.1step 1.1F2F3F6F7

Lowering-word generation. Clause (c) of [F2] states B(λ)λ−α=(⋃i∈If~iB(λ)λ−α+αi)∖{0} for α∈Q+∖{0}. Induction on the height ht⁡(α) proves that every b∈B(λ)λ−α is an iterated lowering image f~i1⋯f~irvλ of bλ=vλ+qL(λ): for α=0 this is step 1.1, and for α≠0 the formula exhibits b=f~ib′ with b′∈B(λ)λ−α+αi of strictly smaller height, to which the induction hypothesis applies. Hence B(λ)=F(bλ), proving (ii).

3.1step 2.1F1F3

Killing by all e~i. Let μ≠λ and let u∈L(λ)μ/qL(λ)μ be nonzero with e~iu=0 for every i. Since B(λ)μ is a Q-basis of this space by [F3] and [F1] shows it is finite (it has dim⁡Q(q)V(λ)μ elements), u=∑b∈B(λ)μabb is a finite sum with coefficients ab∈Q. Fix i: the nonzero elements among e~ib, b∈B(λ)μ, lie in B(λ)μ+αi and are pairwise distinct by the partial-inverse axiom [F3], hence linearly independent in the Q-vector space L(λ)μ+αi/qL(λ)μ+αi; the relation 0=e~iu=∑b:e~ib≠0ab e~ib therefore forces ab=0 for every b with e~ib≠0. This holds for every i∈I. Now let b∈B(λ)μ; by step 2.1 b is a lowering word of positive length from bλ (since μ≠λ), so b=f~ib′ for the last letter i, and then e~ib=b′≠0 by [F3]; hence every b occurs among the terms with e~ib≠0 for some i, so all ab=0 and u=0, a contradiction. This proves (iii).

4.1step 3.1step 2.1F7given∎

Conclusion. Steps 1.1, 2.1 and 3.1 establish (i), (ii) and (iii), so B(λ) has a highest weight element bλ of weight λ and B(λ)=F(bλ): it is a highest weight crystal of highest weight λ in the sense of [F7]. All arguments used finite sums and the fixed basis B(λ); no choice principle was used.

Depends on

Used by

Dependency tree · two levels

36 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