Alphabeta Math
LemmaStatement: 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.

Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators

Statement

Let λ∈P+ and let L(λ),B(λ),L(∞),B(∞) be the lattices and bases of The Kashiwara lattices L(λ) and L(∞) and their generating sets, with πλ:Uq−→V(λ), P↦Pvλ, and Kashiwara operators e~i,f~i. Then for every α∈Q+, every i∈I and every λ∈P+:

(a) Lattice projection. πλ(L(∞)−α)=L(λ)λ−α.

(b) Operator compatibility modulo q. For every P∈L(∞)−α+αi, f~i(Pvλ)≡(f~iP)vλ mod qL(λ), and for every b∈B(∞)−α with πλ(b)≠0, e~iπλ(b)=πλ(e~ib) in L(λ)/qL(λ). Equivalently f~iπλ=πλf~i on B(∞)−α+αi, where the left-hand side is computed in V(λ).

(c) Basis projection. The map induced by πλ is a bijection {b∈B(∞)−α:πλ(b)≠0}→∼B(λ)λ−α.

(d) Large-weight form. If all λ(hj), j∈I, are sufficiently large compared with α, then πλ induces isomorphisms L(∞)−α→∼L(λ)λ−α and B(∞)−α→∼B(λ)λ−α, and the congruences of (b) for such λ are the computation used inside the grand loop to deduce the general case; the general statements (a)-(c) hold for every λ∈P+, without a largeness hypothesis.

Choice. The axiom of choice is declared via The Axiom of Choice: clause (c) is clause N(r) of The grand loop: existence of the highest weight crystal bases, whose proof applies clause J(r), and J(r) is where the AC-dependent form comparison of The negative-half bilinear form is symmetric, nondegenerate and integral is used. Clauses (a), (b) and (d) are themselves choice-free.

Facts & Assumptions

Given: A dominant integral weight λ, a simple root height α∈Q+, and the lattices, residue bases and operators of The Kashiwara lattices L(λ) and L(∞) and their generating sets.

[F1]

The grand loop proves, for every r and hence for r=ht⁡(α): clause L(r), πλ(L(∞)−α)=L(λ)λ−α; clause M(r), f~i(Pvλ)≡(f~iP)vλ mod qL(λ) for P∈L(∞)−α+αi; clause O(r), πλ(e~ib)=e~iπλ(b) for surviving b; and clause N(r), the bijection on surviving residue elements; the proof of N(r) applies J(r), which uses the negative-half form comparison; the large-weight case gives a lattice isomorphism and a residue bijection in the degree (The grand loop: existence of the highest weight crystal bases, The negative-half bilinear form is symmetric, nondegenerate and integral, The Axiom of Choice).

[F2]

The projection πλ is Q(q)-linear with πλ(1)=vλ, and on the negative half e~if~i=id; on V(λ) the operators are the string operators with ker⁡e~i=ker⁡Ei and ker⁡f~i=ker⁡Fi (The Kashiwara operators e~i and f~i of an integrable module, The i-string decomposition of the negative half).

[F3]

L(λ) and L(∞) are free A0-modules with the graded decompositions of The Kashiwara lattices L(λ) and L(∞) and their generating sets, and the residue bases B(λ),B(∞) are Q-bases of the respective crystal limits (Crystal lattices, crystal bases and their crystals).

Proof

technique · direct. Each clause is the corresponding clause of the grand loop at height $r=\operatorname{ht}(\alpha)$
1.1F1

Clause (a). Since the grand loop holds for every r, clause L(r) at r=ht⁡(α) is exactly πλ(L(∞)−α)=L(λ)λ−α.

1.2F1F2

Clause (b). Clause M(r) is the first congruence, and clause O(r) is the second equality in the crystal limit; the equivalence with f~iπλ=πλf~i on the residue classes of B(∞)−α+αi follows because both sides of the congruence are computed modulo qL(λ) and f~i preserves both lattices by their defining lowering-word construction.

1.3F1F3

Clause (c). Clause N(r) states precisely that πλ induces a bijection from the surviving elements of B(∞)−α onto B(λ)λ−α; its proof applies J(r) and therefore the AC-dependent form comparison, while nothing in (a), (b) or (d) needs it.

1.4F1

Clause (d). For large weights the grand-loop large-weight computation gives that πλ is an isomorphism on the component and a bijection on its residue bases; those congruences are used as an input inside the loop to derive the general clauses, and the present clauses (a)-(c) do not assume the largeness.

2.1F1F3∎

Choice. All congruences in (a), (b) and (d) take place between finitely generated A0-modules and use only the operators and the string decomposition, so they are choice-free; clause (c) inherits the declared axiom of choice through J(r) and the negative-half form comparison.

Depends on

Used by

Dependency tree · two levels

35 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