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 crystal basis B(∞) of the negative half

Statement

Let L(∞)⊆Uq− and B(∞)⊆L(∞)/qL(∞) be the Kashiwara lattice and generating set of The Kashiwara lattices L(λ) and L(∞) and their generating sets, with the Kashiwara operators e~i,f~i on Uq− of The i-string decomposition of the negative half(iii).

(i) (L(∞),B(∞)) is a crystal basis of Uq− in the sense of Crystal lattices, crystal bases and their crystals: L(∞) is a free A0-submodule with Uq−≅Q(q)⊗A0L(∞), stable under e~i and f~i; and B(∞) is a Q-basis of L(∞)/qL(∞) satisfying e~iB(∞)⊆B(∞)∪{0}, f~iB(∞)⊆B(∞), and f~ib=b′ if and only if b=e~ib′ for all b,b′∈B(∞).

(ii) The root-graded components are free: L(∞)=⨁ν∈Q+L(∞)−ν and each L(∞)−ν is a free A0-module of rank #B(∞)−ν=dim⁡Q(q)Uq−[−ν].

(iii) For every λ∈P+ the projection πλ(P)=Pvλ maps B(∞) onto B(λ)∪{0}, and the compatibility statements of Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators hold: πλ(L(∞)−α)=L(λ)λ−α, {b∈B(∞)−α:πλ(b)≠0}≅B(λ)λ−α, f~iπλ=πλf~i and e~iπλ(b)=πλ(e~ib) whenever πλ(b)≠0.

(iv) The root-graded crystal has finite εi on each element, formal φi=εi+⟨hi,wt⟩, and actual lowering length ℓi−=∞. Every f~i-iterate is nonzero because e~if~i=id holds on its lattice and residue. Thus it is the infinite lowering crystal of the unit, with the negative-half convention of the crystal-graph definition.

Choice. The axiom of choice is declared via The Axiom of Choice and enters only through the grand loop: the partial-inverse axiom in (i) uses clause J(r) of The grand loop: existence of the highest weight crystal bases, whose proof consumes the AC-dependent form comparison of the negative-half form. The freeness and rank statements are choice-free.

Facts & Assumptions

Given: The negative half Uq− with its root grading and operators, and the lattice L(∞) generated by the monomials f~i1⋯f~ir1.

[F1]

Structure of the lattice: L(∞)=⨁ν∈Q+L(∞)−ν is generated by the lowering monomials, each component is finitely generated and torsionfree, and it is a free A0-module by the PID supplier (The Kashiwara lattices L(λ) and L(∞) and their generating sets, Every finitely generated torsion-free module over a PID is free, The local ring A0 of rational functions regular at q=0).

[F2]

Grand loop clauses: H(r) (e~iL(∞)−α⊆L(∞)), I(r) (e~iB(∞)−α⊆B(∞)∪{0}), J(r) (if e~ib≠0 then b=f~ie~ib), K(r) (B(∞)−α is a Q-basis of L(∞)−α/qL(∞)−α), and the large-weight lattice isomorphism πλ:L(∞)−α→L(λ)λ−α for λ large (The grand loop: existence of the highest weight crystal bases).

[F3]

On the negative half e~if~i=id, f~i is injective, e~iu=0 if and only if u∈ker⁡ei′, and e~i lowers the root height by one (The i-string decomposition of the negative half).

[F4]

Projection lemma: for every α and λ one has πλ(L(∞)−α)=L(λ)λ−α, the surviving residue bijection, and the e~i- and f~i-compatibilities on surviving classes; clause (c) inherits the axiom of choice (Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators, The Axiom of Choice).

[F5]

In module crystals the raising and lowering lengths are finite. The negative-half convention of the crystal graph is: finite εi, formal φi=εi+⟨hi,wt⟩ and actual lowering length ℓi−=∞ (The crystal graph, εi, φi and the weight function).

Proof

technique · direct. Every assertion is read off from the grand loop and the projection lemma
1.1F1F2F3algebra

Freeness and scalar extension. Each component is finitely generated and torsionfree, hence free over the PID A0 by [F1]. As in the grand-loop conclusion [F2], enumerate A0 and the finite ordered word generators of each component and take the first finite tuple of their linear combinations that is a basis. These uniquely specified component bases unite to a basis of the graded direct sum without simultaneous choice. For field spanning, use the grand-loop field-spanning argument [F2]: if x=∑nFi(n)xn is homogeneous, then Fix=f~i(∑n[n+1]iFi(n)xn), and the vector in parentheses has the same root degree as x. Thus every positive-height component, being the sum of the Fi-images of preceding components, is also spanned by their f~i-images. Induction from Uq−[0]=Q(q)1 shows that the lowering words span each field component. The canonical map Q(q)⊗A0L(∞)−α→Uq−[−α] is therefore surjective. It is injective by clearing denominators: a finite tensor sum equals d−1⊗z for some 0≠d∈A0 and z∈L(∞)−α, and its image d−1z vanishes only when z=0. Taking graded direct sums gives the claimed scalar-extension isomorphism.

1.2F1F2F3

Stability and residue basis. Stability under f~i holds by construction, since a f~i-image of a lowering monomial is a lowering monomial; stability under e~i is clause H(r). Clause K(r) says that B(∞)−α is a Q-basis of L(∞)−α/qL(∞)−α, and clause I(r) gives e~iB(∞)⊆B(∞)∪{0}. For f~i, the image of a monomial is a monomial and e~if~i=id prevents it from vanishing modulo q: if f~ib∈qL(∞) then b=e~if~ib∈qL(∞), contradicting b≠0 in the crystal limit.

1.3F2F3

The partial-inverse axiom. If f~ib=b′ with b,b′∈B(∞), then applying e~i and [F3] gives b=e~if~ib=e~ib′. Conversely, if b=e~ib′≠0, then b′=f~ie~ib′ by clause J(r), so f~ib=f~ie~ib′=b′ by [F3]; hence f~ib=b′ if and only if b=e~ib′, and this is the only place where the grand-loop clause J(r), and with it the inherited axiom of choice, is used.

2.1F4F5step 1.2

The projection statements. The lattice projection, surviving-residue bijection and operator compatibilities in (iii) are [F4]. To see that zero is also attained, fix i∈I: by step 1.2 every f~in1 has nonzero negative-half residue, while lowering compatibility projects it to f~invλ. The latter is zero for sufficiently large n because the module lowering length is finite by [F5]. Thus the image is exactly B(λ)∪{0}.

2.2F1F2step 1.1

The rank formula. By [F1] and clause K(r), the free rank of L(∞)−α is #B(∞)−α, and by step 1.1 the scalar extension is Uq−[−α], so this number is also dim⁡Q(q)Uq−[−α]; this is (ii).

3.1F3F5step 1.2∎

The infinite chain. By [F3] the operator f~i is injective on Uq− and e~if~i=id, and by step 1.2 no iterate of a residue element vanishes; hence ℓi−=+∞ for every b∈B(∞), while εi(b)<∞ by the finite string structure of the negative half (the height bound). The formal φi=εi+⟨hi,wt⟩ is the convention of [F5] and is not the lowering-chain length.

Depends on

Used by

Dependency tree · two levels

44 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