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.

The Kashiwara lattices L(λ) and L(∞) and their generating sets

Definition

Let λ∈P+ and let L(λ) be the simple integrable highest weight module with highest weight vector vλ (The integrable quantum highest weight module exists and is unique); in this page we write V(λ):=L(λ), following the notation of the crystal sources. Let Uq− be the negative half with its Kashiwara operators e~i,f~i (The i-string decomposition of the negative half), and let A0 be the crystal limiting ring (The local ring A0 of rational functions regular at q=0).

Define L(λ) to be the A0-submodule of V(λ) generated by all vectors f~i1⋯f~irvλ (r≥0, i1,…,ir∈I), where for r=0 the vector is vλ; and L(∞) to be the A0-submodule of Uq− generated by all f~i1⋯f~ir1 (r≥0), where 1 is the unit of Uq−. Here f~i on V(λ) are the module Kashiwara operators and f~i on Uq− are the negative-half operators. Define B(λ):={f~i1⋯f~irvλ+qL(λ):r≥0}∖{0}⊆L(λ)/qL(λ), B(∞):={f~i1⋯f~ir1+qL(∞):r≥0}∖{0}⊆L(∞)/qL(∞).

Then, with πλ:Uq−→V(λ), πλ(P)=Pvλ:

(a) L(λ)=⨁μ∈PL(λ)μ with L(λ)μ=L(λ)∩V(λ)μ, and L(∞)=⨁ν∈Q+L(∞)−ν with L(∞)−ν=L(∞)∩Uq−[−ν]; correspondingly B(λ)=⨆μB(λ)μ and B(∞)=⨆νB(∞)−ν.

(b) f~iL(λ)⊆L(λ) and f~iL(∞)⊆L(∞).

(c) (Recursive spanning.) For α∈Q+∖{0}, L(λ)λ−α=∑i∈If~iL(λ)λ−α+αi,B(λ)λ−α=(⋃i∈If~iB(λ)λ−α+αi)∖{0}, and the same formulas with L(∞),B(∞). Each L(λ)λ−α and each L(∞)−α is generated over A0 by finitely many monomials of total length at most ht⁡(α), hence is a finitely generated A0-module.

No basis property, scalar-extension spanning or crystal-lattice property of L(λ) or L(∞) is asserted here; these are conclusions of the grand loop. The script letters avoid the collision with the simple module L(λ). No choice principle is used. Each fixed component is torsionfree inside a field vector space and generated by finitely many words of its fixed height, so it is free over the DVR A0; its full field-span is proved later. The field map πλ is surjective, but exact equality on Kashiwara monomial generators is not asserted.

Facts & Assumptions

Given: λ∈P+, the simple integrable highest weight module V(λ)=L(λ) with highest vector vλ, the negative half Uq−, the A0-spans L(λ),L(∞) generated by the f~-words, and the residue sets B(λ),B(∞).

[F1]

f~i on V(λ) and on Uq− is Q(q)-linear, preserves the lattice L(λ), respectively L(∞), once (b) is known, and lowers the weight, respectively the root degree, by αi; on Uq− it is injective with e~if~i=id (The Kashiwara operators e~i and f~i of an integrable module, The i-string decomposition of the negative half).

[F2]

V(λ)=⨁μ∈PV(λ)μ and Uq−=⨁ν∈Q+Uq−[−ν] are direct sums of weight, respectively root, spaces (Quantum weight modules, weights in P, and integrability, The i-string decomposition of the negative half).

[F3]

Every word f~i1⋯f~irvλ is homogeneous of weight λ−αi1−⋯−αir, and every word f~i1⋯f~ir1 is homogeneous of root degree −αi1−⋯−αir (Kac moody integral and dominant integral weights, [F1], [F2]).

[F5]

V(λ) is universal among integrable cyclic highest weight modules of highest weight λ: every such module receives a unique map of Uq(g)-modules sending its highest vector to a prescribed highest vector, and πλ:Uq−→V(λ), P↦Pvλ, is a surjective Q(q)-linear map sending 1 to vλ (The integrable quantum highest weight module exists and is unique).

Verification

technique · direct. Homogeneity gives the graded decompositions, prepending a color gives the recursive spanning and stability, and finite generation plus torsionfreeness gives freeness of the components
1.1F2F3given

Grading (a). Each generator f~i1⋯f~irvλ is homogeneous of weight λ−αi1−⋯−αir, and each generator of L(∞) is homogeneous of root degree −αi1−⋯−αir, by [F3]. Taking A0-linear combinations and using [F2], every element of L(λ) lies in ⨁μV(λ)μ with only finitely many nonzero components, and its weight components lie in L(λ); hence L(λ)=⨁μL(λ)μ with L(λ)μ=L(λ)∩V(λ)μ, and similarly L(∞)=⨁νL(∞)−ν. The residue sets decompose accordingly by their definition.

1.2F1given

Stability (b). A generator is carried by f~i to the generator with the color i prepended; since f~i is Q(q)-linear, it commutes with A0-coefficients, so f~iL(λ)⊆L(λ) and f~iL(∞)⊆L(∞).

2.1F1step 1.1step 1.2given

Recursive spanning (c). Let α∈Q+∖{0} and let w be a word of total degree α; writing w=f~i1w′ exhibits the class of w as f~i1 of the class of the shorter word w′, which is a generator of degree α−αi1. This gives ⊆; the reverse inclusion holds because f~i preserves L by step 1.2 and lowers the degree by αi. For the residue sets, a word class that is nonzero remains nonzero when shortened (if w′∈qL then w=f~i1w′∈qL), and the displayed union minus zero therefore equals B(λ)λ−α; the same argument applies to B(∞).

3.1F4step 2.1algebra

Finite generation and freeness. Iterating (c) from degree α down to degree 0 expresses every L(λ)λ−α as the sum of the images of A0vλ under the words of length exactly ht⁡(α); there are finitely many such words because I is finite, and for α=0 the component is A0vλ. Hence each component is finitely generated over A0 by monomials of length at most ht⁡(α). It is torsionfree because it is contained in the Q(q)-vector space V(λ), respectively Uq−, so [F4] makes it a free A0-module.

4.1F5step 3.1

Choice and the field map. The words are indexed by finite sequences in the finite set I, so no choice is needed to name the generators. The map πλ is surjective by [F5], because Uq− generates V(λ) over Uq(g) from vλ; no equality between πλ and the lattice projections, and no spanning over A0 of the field-spanning property, is asserted here.

5.1givenstep 3.1∎

No crystal-lattice claim yet. The statements proved above are the graded decompositions, stability, recursive spanning, finite generation and freeness of the components; whether B(λ) and B(∞) are crystal bases, and whether L(λ)⊗A0Q(q)→V(λ) is an isomorphism, is not asserted and is deferred to the grand loop.

Depends on

Used by

Dependency tree · two levels

37 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