Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 projection from B(∞) to a highest weight crystal for sl2

Example

Let g=sl2 with q1=q as in Kashiwara strings in the three-dimensional sl2-module. Then Uq−=Q(q)[F1] and the Kashiwara operators on the negative half act by f~1(F1(n))=F1(n+1) and e~1(F1(n))=F1(n−1) (with F1(−1)=0), so L(∞)=A0-span{F1(n):n≥0},B(∞)={bn:=F1(n)+qL(∞):n≥0}≅Z≥0, with f~1bn=bn+1, e~1bn+1=bn, e~1b0=0, wt⁡(bn)=−nα1=−2nω, ε1(bn)=n, formal φ1(bn)=−n and actual lowering length ℓ1−(bn)=∞.

For λ=mω∈P+ (m≥0) let V(mω)=L1(m) have basis vt=F1(t)hm (0≤t≤m, hm the highest weight vector) as in Divided-power commutation and the simple Uqi(sl2) string modules(iii), and let πm=πmω:Uq−→V(mω), P↦Phm. Then:

(a) πm(bn)=0 for n>m, and πm restricts to a bijection {b0,…,bm}→∼B(mω)={v0+qL(mω),…,vm+qL(mω)};

(b) e~1πm(bn)=πm(e~1bn) for 0≤n≤m; this raising compatibility is asserted only for surviving residues. It fails at the killed residue bm+1, where the left side is 0 and the right side is the nonzero bottom residue πm(bm). Lowering compatibility holds for every bn, with both sides zero for n≥m.

(c) for m≥n the map πm:L(∞)−nα1→L(mω)mω−nα1 is an isomorphism, and {b∈B(∞)−nα1:πm(b)≠0}={bn} for m≥n; these are the large-weight instances of Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators.

Choice. The example's own rank-one computations are choice-free, but it cites the general projection lemma Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators and The crystal basis B(∞) of the negative half, whose proofs inherit the axiom of choice from the grand loop; The Axiom of Choice is therefore declared as a dependency.

Facts & Assumptions

Given: The rank-one datum of sl2, the divided powers F1(n), the module V(mω)=L1(m) with basis vt=F1(t)hm, and the projection πm.

[F1]

Uq−=Q(q)[F1] is the polynomial algebra on F1; the skew derivation satisfies e1′(F1n)=(1+q−2+⋯+q−2(n−1))F1n−1 with kernel the constants, so the divided monomials F1(n) have the single string component 1 at position n; hence L(∞)=A0-span{F1(n):n≥0} with f~1(F1(n))=F1(n+1) and e~1(F1(n))=F1(n−1) (Kashiwara's skew derivations ei′ and ei′′ on the negative half, The i-string decomposition of the negative half).

[F2]

V(mω)=L1(m) has divided basis vt=F1(t)hm with e~1vt=vt−1, f~1vt=vt+1 for the string positions and endpoint zeros, and L(mω)=A0v0⊕⋯⊕A0vm with residue basis B(mω) (Divided-power commutation and the simple Uqi(sl2) string modules, part (iii), The Kashiwara operators e~i and f~i of an integrable module, The Kashiwara lattices L(λ) and L(∞) and their generating sets).

[F3]

The projection lemma and the negative-half crystal theorem give, for general highest weights, the lattice projection, the surviving-residue bijection, the operator compatibilities on surviving residues, the residue basis of L(∞) and the infinite lowering length; their proofs inherit the axiom of choice, declared here (Projection from L(∞) to L(λ) and its compatibility with the Kashiwara operators, The crystal basis B(∞) of the negative half, The Axiom of Choice).

[F4]

Invariants of a crystal: ε1(b)=max⁡{n:e~1nb≠0}, φ1=ε1+⟨h1,wt⟩ formally on the negative half, ℓ1−=∞ (The crystal graph, εi, φi and the weight function).

Verification

technique · direct
1.1F1F4

The negative-half crystal. By [F1], the divided monomials F1(n) form a field basis of the polynomial algebra, and L(∞)=⨁n≥0A0F1(n). Reducing this free direct sum modulo q shows that the residue classes bn=F1(n)+qL(∞) (n≥0) are nonzero and linearly independent modulo q; the operators act as f~1bn=bn+1 and e~1bn+1=bn, e~1b0=0. Hence B(∞)≅Z≥0, with weights wt(bn)=−nα1=−2nω, ε1(bn)=n, formal φ1(bn)=n−2n=−n and ℓ1−(bn)=∞.

2.1F2step 1.1

The module crystal. By [F2], πm(F1(n))=vn for n≤m and 0 for n>m; so πm(bn)=0 for n>m and πm(bn)=vn+qL(mω) for 0≤n≤m. The classes v0,…,vm are a Q-basis of L(mω)/qL(mω), and the operator action on them is the string action, so the surviving residues map bijectively onto B(mω); this is (a).

3.1F2step 2.1

Raising compatibility and its failure. For 0≤n≤m one has e~1πm(bn)=e~1(vn+qL(mω))=vn−1 for n≥1 and 0 for n=0, while πm(e~1bn)=vn−1 for n≥1 and 0 for n=0; hence the two sides agree for every surviving residue. At the killed residue n=m+1, the left side is e~1πm(bm+1)=e~1⋅0=0, while the right side is πm(e~1bm+1)=πm(bm)=vm≠0 modulo q; this is the stated boundary failure. Lowering: f~1πm(bn)=vn+1 for n<m and 0 for n≥m, while πm(f~1bn)=vn+1 for n<m and 0 for n≥m, so both sides agree for every n.

4.1F2F3step 2.1

Isomorphism in fixed degree. In root degree −nα1 the free A0-module L(∞)−nα1 is the one-dimensional span of F1(n) with residue bn, and L(mω)mω−nα1 is the one-dimensional span of vn with residue vn+qL(mω) for m≥n; the map πm sends F1(n) to vn, an isomorphism on these one-dimensional free modules, and its surviving-residue set is {bn} when m≥n and empty otherwise. Together with step 3.1 this is the large-weight instance of the projection lemma.

5.1F3∎

Choice. The computations of steps 1.1 through 4.1 use only explicit monomials, divided powers and one-dimensional free modules, so they are choice-free; the axiom of choice is declared because the cited general suppliers [F3] inherit it from the grand loop.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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