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.

Uniqueness: crystal bases of integrable modules decompose into highest weight crystals

Statement

Assume the axiom of choice (The Axiom of Choice). Let M be a chosen P-graded type-one quantum weight module that is integrable, has finite-dimensional label-weight spaces and weight set contained in a finite union of cones λ−Q+ (Quantum weight modules, weights in P, and integrability), and let (L,B) be a crystal basis of M (Crystal lattices, crystal bases and their crystals).

(i) Splitting along the top isotypic part. Let λ be a maximal weight of M, put N0:=Uq(g)Mλ and let N1 be the sum of the remaining simple constituents, so that M=N0⊕N1 and N0≅V(λ)⊕m with m=dim⁡Mλ. Then L=(L∩N0)⊕(L∩N1), B=(B∩(L∩N0)/q(L∩N0))⊔(B∩(L∩N1)/q(L∩N1)), and both pairs are crystal bases of N0 and N1.

(ii) Uniqueness. There is a locally weight-finite indexed family (λj)j∈J in P+ and an isomorphism of Uq(g)-modules Φ:M→ ∼ ⨁j∈JV(λj) with Φ(L)=⨁jL(λj) and Φ inducing a bijection B→⨆jB(λj) of crystals. The multiset {λj:j∈J} is the multiset of highest weights of the simple integrable constituents of M: the number of j with λj=λ equals the multiplicity [M:V(λ)].

(iii) Components. Through Φ the connected components of the crystal B are exactly the canonical highest weight crystals B(λj); each component has a unique highest weight element b, of dominant weight λ, and equals the lowering-generated subcrystal F(b) of Highest weight elements, lowering-generated sets and highest weight crystals. In particular the crystal graph of any crystal basis of M is determined up to isomorphism by M, and no other highest weight elements occur.

Choice. The axiom of choice is declared in The Axiom of Choice and used to obtain the decomposition of M into simple integrable highest weight modules from Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules, which selects a maximal independent family of simple submodules simultaneously. It also permits simultaneous choices of lifts of the finite residue bases in the possibly infinite family of top spaces. After those choices, each lattice and crystal argument is finite and choice-free. No incompatible-axiom branch is used, and no global Z[q,q−1]-freeness is assumed. The index set J need not be finite in affine or indefinite type; local weight finiteness means only finitely many summands contribute to any fixed label-weight space.

Facts & Assumptions

Given: The axiom of choice (The Axiom of Choice); a chosen P-graded type-one integrable quantum weight module M with finite-dimensional label-weight spaces and wt(M) in a finite union of cones λ−Q+ (Quantum weight modules, weights in P, and integrability); a crystal basis (L,B) of M (Crystal lattices, crystal bases and their crystals). For a dominant label λ∈P+ (Kac moody integral and dominant integral weights) write V(λ)=L(λ) for the simple integrable highest weight module (The integrable quantum highest weight module exists and is unique) and (L(λ),B(λ)) for its lattice and basis (The Kashiwara lattices L(λ) and L(∞) and their generating sets).

[F1]

Semisimplicity (Integrable bounded-above quantum modules with finite-dimensional weight spaces are direct sums of simple highest weight modules, under AC): M is isomorphic to an algebraic direct sum of simple integrable highest weight modules L(λ), every nonzero submodule of M contains a maximal vector v with Uq(g)v≅L(λ), and M is the direct sum of the submodules generated by the vectors of any maximal independent family of simple submodules; AC is used exactly to select a maximal independent family of simple submodules simultaneously, and restricted to a module generated by one finite-dimensional Uq≥0-submodule the decomposition is finite and choice-free.

[F2]

Canonicity of cyclic highest weight modules (The integrable quantum highest weight module exists and is unique, Quantum Verma modules M(λ), highest weight vectors, and the simple highest weight quotient L(λ)): every nonzero integrable cyclic highest weight module of weight λ∈P+ is isomorphic to L(λ), which is universal among them, has support λ−Q+ and finite-dimensional label-weight spaces, and has one-dimensional λ-weight space spanned by the image of the Verma highest vector (it is the simple graded quotient of M(λ)=Uq(g)vλ, whose highest line is Q(q)vλ).

[F3]

Crystal lattice and basis (Crystal lattices, crystal bases and their crystals): L=⨁μLμ with Lμ=L∩Mμ is a free A0-module generating M over Q(q) and stable under e~i,f~i; B=⨆μBμ is a Q-basis of L/qL with dim⁡Q(q)Mμ=rank⁡A0Lμ=#Bμ, operators preserve B∪{0} and satisfy f~ib=b′  ⟺  b=e~ib′.

[F4]

The lattice and basis of V(λ) (The grand loop: existence of the highest weight crystal bases, with The Kashiwara lattices L(λ) and L(∞) and their generating sets): (L(λ),B(λ)) is a crystal basis of V(λ); L(λ)λ is free of rank one generated by vλ; dim⁡Q(q)V(λ)μ=#B(λ)μ; and every b∈B(λ) is an iterated lowering image of bλ (also The canonical crystal B(λ) is a highest weight crystal of highest weight λ).

[F5]

The highest weight crystal B(λ) (The canonical crystal B(λ) is a highest weight crystal of highest weight λ): bλ=vλ+qL(λ) is the unique highest weight element of B(λ), of dominant weight λ, and for every μ≠λ every nonzero homogeneous class of L(λ)μ/qL(λ)μ is moved by some e~i.

[F6]

Crystal graph conventions (The crystal graph, εi, φi and the weight function) and the Kashiwara operators (The Kashiwara operators e~i and f~i of an integrable module): e~i shifts weight by +αi on vertices, εi(b)=max⁡{n:e~i nb≠0}, and the operators act as shifts on the finite module strings.

[F7]

The highest weight element and lowering-generated set (Highest weight elements, lowering-generated sets and highest weight crystals).

Proof

technique · direct
1.1F1F2F6algebra

Step A: the top isotypic decomposition. By [F1] write M as a direct sum of simple integrable highest weight modules; let λ be a maximal weight of M and let N0:=Uq(g)Mλ be the sum of the summands isomorphic to V(λ), and N1 the sum of the remaining ones. Each nonzero w∈Mλ generates a nonzero integrable cyclic highest weight module of weight λ, isomorphic to V(λ) by [F2]; the sum of these cyclic submodules is N0, and since Mλ has dimension m and each copy of V(λ) contributes a one-dimensional λ-weight space, N0≅V(λ)⊕m with m=dim⁡Mλ, while M=N0⊕N1 by [F1]. A simple constituent V(ν) of N1 with λ∈ν−Q+ would satisfy ν≥λ, and maximality of λ in wt(M) gives ν=λ, a contradiction; hence N1 has no weight λ.

2.1step 1.1F2F3F4F5

Step B: descent for V(λ)⊕m. Since Mλ=N0λ has dimension m=#Bλ by [F3], choose one lift in Lλ of each element of the finite basis Bλ. Their reduction modulo qLλ is a basis, so their determinant in any A0-basis of the free module Lλ is a unit of A0 and they form an A0-basis of Lλ. Each lift generates a copy of V(λ) by [F2], these m cyclic submodules are linearly independent and their sum has λ-weight space of dimension m, so they sum directly to N0; fixing the identification N0≅V(λ)⊕m that sends the chosen lift to the standard top generator vλ(j) of the j-th copy, one has Φ0(Lλ)=⨁jL(λ)λ(j) and Bλ corresponds to the m standard top residues bλ(j). Claim: if u∈V(λ)μ⊕m with μ≠λ and e~iu∈L(λ)⊕m for all i∈I, then u∈L(λ)⊕m. Indeed, since L(λ) generates V(λ) over Q(q), some qnu lies in L(λ)⊕m; take the minimal such n≥0. If n>0, then b:=qnu+qL(λ)⊕m≠0 is homogeneous of weight μ and e~i(qnu)=qne~iu∈qnL(λ)⊕m⊆qL(λ)⊕m for all i, so b is killed by every e~i; writing b=∑jb(j) componentwise, each b(j) is a class in L(λ)μ/qL(λ)μ killed by every e~i, so b(j)=0 for all j by [F5] (note μ≠λ), and b=0, a contradiction. Hence n=0 and u∈L(λ)⊕m.

3.1step 2.1F3F4F6algebra

Step C: L∩N0=L(λ)⊕m. Use the identification of step 2.1 and put L0:=L∩N0. It is weight-graded and stable under both Kashiwara operators, since these commute with the inclusion of the graded submodule N0. Its top part equals the standard top lattice. Every standard lattice generator is a lowering word applied to a top lift, hence lies in L0; therefore L(λ)⊕m⊆L0, and L0 generates N0 over the field by [F4]. For the reverse inclusion, induct on ht⁡(λ−μ). The top parts agree; at a lower weight every e~iu, u∈(L0)μ, belongs to the standard lattice by the induction hypothesis. The descent criterion of step 2.1 then places u in that lattice. Weights outside λ−Q+ have zero N0-space. Thus L0=L(λ)⊕m.

4.1step 1.1step 3.1F3F6algebra

Step D: the splitting of L. Put N1 as in step 1.1 and let u∈Lμ; write u=u0+u1 with uj∈Nj. Prove uj∈L∩Nj by induction on ht⁡(λ−μ). At μ=λ one has u1=0 because N1 has no weight λ by step 1.1, and u0=u∈L∩N0. For μ≠λ, each e~iu∈Lμ+αi splits by the induction hypothesis into its N0- and N1-parts, and since the operators preserve the Uq(g)-submodules Nj, the N0-part of e~iu is e~iu0; the induction hypothesis gives e~iu0∈L∩N0=L(λ)⊕m for all i, and step 2.1 gives u0∈L(λ)⊕m⊆L; then u1=u−u0∈L∩N1. Weights outside λ−Q+ have N0-component zero, so the induction starts there. Hence L=(L∩N0)⊕(L∩N1), and both summands are free A0-modules generating N0,N1 respectively (their Q(q)-spans are N0,N1 because Q(q)⊗L=M=N0⊕N1 and the splitting is compatible); both are stable and weight-graded, so they are crystal lattices.

5.1step 2.1step 4.1F3F4F5F6

Step E: the residue basis splits. Put L1:=L∩N1 and B0:=B∩(L0/qL0). The standard basis S:=⨆jB(λ)(j) lies in B0, because each standard vertex is a lowering word from a top residue in Bλ. Since S spans L0/qL0 and B is linearly independent, B0=S. To show that each remaining vertex lies in L1/qL1, use the splitting of step 4.1 and induct on ht⁡(λ−μ). Outside λ−Q+ the L0-component is zero; at μ=λ every vertex is in B0. At a lower weight write b=c0+c1, with cj∈Lj/qLj. If c0≠0, [F5] supplies an i with e~ic0≠0. Then e~ib is a nonzero basis vertex; its nonzero L0-component and the induction hypothesis place it in B0. Partial inversion gives b=f~ie~ib∈B0. Hence every b∈B∖B0 has c0=0. The direct-sum decomposition and the basis property of B now imply that B1:=B∖B0 is a basis of L1/qL1. Operators preserve both summands and B∪{0}, so both pairs are crystal bases.

6.1step 3.1step 4.1step 5.1F1F3algebra

Step G: locally finite iteration. Fix upper bounds λa with wt(M)⊆⋃a=1s(λa−Q+) and define D(ν):=max⁡{ht⁡(λa−ν):λa−ν∈Q+}. Each level D(ν)=n is finite, since it is contained in the finite union of root-height-n slices of those cones. If τ>ν, every cone containing τ contains ν, and D(τ)≤D(ν)−ht⁡(τ−ν)<D(ν). Thus, in increasing order of D, the highest weights of the simple constituents in [F1] are maximal among the remaining weights and may be peeled using steps 3.1-5.1. For a fixed weight μ, only finitely many constituent tops ν≥μ occur: in each cone the nonnegative root coefficients of ν−μ and λa−ν sum to those of λa−μ. Each such top has finite multiplicity, bounded by dim⁡Mν. Consequently finitely many peelings exhaust every fixed weight space. The module decomposition of [F1] is algebraic, so every vector has finite constituent support; the compatible lattice and residue splittings therefore give Φ(L)=⨁j∈JL(λj) and a crystal bijection B→⨆jB(λj) under an isomorphism Φ:M→⨁jV(λj). The family is locally weight-finite and has exactly the constituent multiplicities of [F1]. AC permits the simultaneous top lifts used in these identifications. This proves (i) and (ii) without requiring J finite.

7.1step 6.1F4F5F7

Step H: components. Under Φ the connected components of B are exactly the B(λj): each B(λj) is connected because by [F4] every vertex is a lowering word from bλj, and distinct copies share no vertices, so the partition into copies is the partition into connected components. Each B(λj) has highest weight element bλj of dominant weight λj and equals F(bλj) by [F5], and it has no other highest weight element by the uniqueness clause of [F5]; hence the highest weight elements of B are exactly the bλj, each generating its own component, and the crystal graph of B is determined up to isomorphism by M. This proves (iii).

8.1step 6.1step 7.1F1given∎

Choice audit. The axiom of choice of The Axiom of Choice is used exactly as recorded: once, through [F1], to obtain the decomposition of M into simple integrable highest weight modules and to select bases of the finite-dimensional maximal-vector spaces simultaneously, and for the simultaneous selection of lifts of the finite residue bases in the (possibly infinite) family of top spaces in steps 2.1 and 6.1. Every subsequent lattice and crystal argument is a finite induction on a fixed weight interval and involves no further selection; no incompatible-axiom branch and no global Z[q,q−1]-freeness is used.

Depends on

Used by

Dependency tree · two levels

40 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