Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Crystal lattices, crystal bases and their crystals

Definition

Let A0 be the local ring of The local ring A0 of rational functions regular at q=0 and let M be an integrable weight module with its Kashiwara operators e~i,f~i (The Kashiwara operators e~i and f~i of an integrable module, Quantum weight modules, weights in P, and integrability).

A crystal lattice of M is a free A0-submodule L⊆M such that

(i) L generates M over Q(q), i.e. the canonical map Q(q)⊗A0L→M is an isomorphism;

(ii) L=⨁μ∈PLμ with Lμ:=L∩Mμ, and each Lμ is again a free A0-module;

(iii) e~iL⊆L and f~iL⊆L for all i∈I.

Because A0 is a principal ideal domain, each graded piece Lμ has a well-defined rank rank⁡A0Lμ, and (ii) says that rank⁡A0L is the sum of the ranks of the Lμ.

A crystal basis of M is a pair (L,B) consisting of a crystal lattice L and a Q-basis B of the crystal limit L/qL≅Q⊗A0L (The local ring A0 of rational functions regular at q=0) such that

(iv) B=⨆μ∈PBμ, where Bμ:=B∩(Lμ/qLμ);

(v) e~iB⊆B∪{0} and f~iB⊆B∪{0} for all i∈I;

(vi) for all b,b′∈B and all i: f~ib=b′ if and only if b=e~ib′; here e~i,f~i denote the operators induced on L/qL.

The crystal graph of (L,B) is the coloured directed graph with vertex set B and an arrow b→ib′ whenever f~ib=b′ (by (vi) this is equivalent to b=e~ib′). The crystal of M is this graph, together with the weight function b↦μ for b∈Bμ. For every μ∈P one has dim⁡Q(q)Mμ=rank⁡A0Lμ=#Bμ.

A crystal basis of the negative half Uq− is defined by the same data with Uq− in place of M: a free A0-submodule L⊆Uq− with Uq−≅Q(q)⊗A0L and e~iL,f~iL⊆L (The i-string decomposition of the negative half), together with a Q-basis B of L/qL satisfying (v) and (vi) for the operators on the negative half. Here the root grading replaces the weight grading, and the lattice and residue basis are required to respect that root grading. In the negative half, e~if~i=id implies f~iB⊆B; this refinement is specific to its infinite strings. No choice principle is used in these definitions.

Facts & Assumptions

Given: The local ring A0=Q[q](q) with residue field Q, an integrable chosen P-graded type-1 module M with Kashiwara operators, and a crystal lattice L⊆M with L=⨁μLμ as in (ii).

[F1]

e~i,f~i are Q(q)-linear endomorphisms of M shifting the label weight by +αi and −αi; on a string they move Fi(n)un to Fi(n−1)un or Fi(n+1)un, with the top of an e~i-string and the bottom of an f~i-string mapped to 0 (The Kashiwara operators e~i and f~i of an integrable module).

[F2]

M=⨁μ∈PMμ with the toral action and gradings of Quantum weight modules, weights in P, and integrability.

[F3]

For a free A0-module N the canonical map Q⊗A0N→N/qN is an isomorphism, and Q⊗A0N is a Q-vector space of dimension equal to the rank of N; Q(q)⊗A0N has dimension equal to the rank of N over Q(q) (The local ring A0 of rational functions regular at q=0).

[F4]

On the negative half, e~if~i=id⁡Uq−, and the operators shift the root degree by ∓αi (The i-string decomposition of the negative half, part (iii)).

Verification

technique · direct. The induced operators, the rank and residue counts and the negative-half refinement are read off the axioms using the crystal-limit isomorphism
1.1F1F3given

Induced operators. By (iii) the operators preserve L and commute with multiplication by A0, so they descend to Q-linear endomorphisms of L/qL, which is canonically Q⊗A0L by [F3]; by [F1] they shift the label weight by ±αi, so they map Lμ/qLμ to Lμ+αi/qLμ+αi and to Lμ−αi/qLμ−αi, and axiom (v) says that they map B into B∪{0}.

1.2F2F3givenalgebra

Rank decomposition. Since L=⨁μLμ with every Lμ free by (ii), rank⁡A0L=∑μrank⁡A0Lμ, and applying Q(q)⊗A0− gives Q(q)⊗A0L=⨁μQ(q)⊗A0Lμ with each summand of dimension rank⁡A0Lμ by [F3]. The isomorphism of (i) is weight graded, because Lμ⊆Mμ and the target is the direct sum of the Mμ; hence dim⁡Q(q)Mμ=rank⁡A0Lμ for every μ.

2.1F3step 1.2givenalgebra

Residue counts. The crystal limit isomorphism of [F3] is compatible with the grading, and L/qL=⨁μLμ/qLμ; by (iv) each Bμ is contained in Lμ/qLμ and B=⨆μBμ is a Q-basis of L/qL, so Bμ is a Q-basis of Lμ/qLμ. Hence #Bμ=dim⁡QLμ/qLμ=rank⁡A0Lμ=dim⁡Q(q)Mμ, which is the displayed equality, and the weight function of the crystal is well defined by (iv).

2.2givenstep 1.1

The graph and the partial-inverse property. By (vi) the arrow relation b→ib′ is symmetric under exchanging e~i and f~i, so the crystal graph has no ambiguity: an arrow exists exactly when f~ib=b′, equivalently b=e~ib′. In a finite-dimensional piece a string may end at a bottom, where f~ib=0; by (v) this is allowed and no vertex is added.

2.3F4step 1.1

The negative half. For Uq− the same discussion applies with the root grading in place of the weight grading. By [F4] the induced endomorphisms of L/qL satisfy e~ˉif~ˉi=id, so f~ˉi is injective and no element of B is mapped to 0 by f~i; with (v) this gives f~iB⊆B, the infinite-string refinement.

3.1given∎

Choice. The definitions select no bases, no complements and no representatives; the lattice, its grading and the residue basis are given data, and all statements above are computations with them, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

26 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