Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 tensor crystal B(1)⊗B(1) for sl2

Example

Let g=sl2, I={1}, with fundamental weight λ1 and simple root α1=2λ1. Let V(1) be the two-dimensional simple integrable module with highest vector v0 and crystal B(1)={v0,v1}, where v1=F1v0; the i-string is v0→1v1 with wt(v0)=λ1, wt(v1)=−λ1 and ε1(v0)=0, φ1(v0)=1, ε1(v1)=1, φ1(v1)=0 (JKK Example 5.1(a) with m=1).

Compute the tensor crystal B(1)⊗B(1) of The tensor product crystal B1⊗B2 and its two-case convention with the two-case rule of The crystal basis of a tensor product and the two-case operator rule. Writing the four vertices as vj⊗vk with j,k∈{0,1}, the rule gives

f~1(vj⊗vk)={vj+1⊗vk,1−j>k,vj⊗vk+1,1−j≤k,e~1(vj⊗vk)={vj−1⊗vk,1−j≥k,vj⊗vk−1,1−j<k.

Consequently: v0⊗v0 is the unique highest vertex of weight 2λ1 and generates the chain v0⊗v0→v1⊗v0→v1⊗v1; the remaining vertex v0⊗v1 has weight 0, is killed by e~1 and by f~1, and forms a one-element component; and ε1,φ1 of the four vertices are (0,2),(1,1),(2,0),(0,0) at (0,0),(1,0),(1,1),(0,1) respectively. Hence B(1)⊗B(1)=B(2)⊔B(0), matching the classical decomposition V(1)⊗V(1)=V(2)⊕V(0) of dimensions 4=3+1; here B(2) is the three-element 1-chain of weights 2λ1,0,−2λ1 and B(0) the one-element crystal of weight 0.

Facts & Assumptions

Given: g=sl2 with I={1}, α1=2λ1, the two-element crystal B(1)={v0,v1} with the single arrow v0→1v1, and the tensor product crystal B(1)⊗B(1) of The tensor product crystal B1⊗B2 and its two-case convention with the operators of The crystal basis of a tensor product and the two-case operator rule.

[F1]

The rank-one crystal of dimension two (Divided-power commutation and the simple Uqi(sl2) string modules, with Quantum integers, factorials, Gaussian binomials and divided powers at qi): the module L1(1) has basis v0,v1=F1v0, with K1vt=q11−2tvt, so wt(v0)=λ1, wt(v1)=−λ1; the crystal basis is {v0,v1} and the operators shift the string, giving the arrow v0→1v1 with ε1(v0)=0, φ1(v0)=1, ε1(v1)=1, φ1(v1)=0.

[F2]

The two-case tensor rule (The tensor product crystal B1⊗B2 and its two-case convention, The crystal basis of a tensor product and the two-case operator rule): f~1 acts on the first factor if and only if φ1(b1)>ε1(b2) and on the second otherwise, e~1 acts on the first factor if and only if φ1(b1)≥ε1(b2) and on the second otherwise, with value 0 when the chosen factor reaches the string end.

[F3]

The max formulas (The weight, εi and φi formulas for the tensor product crystal): ε1(b1⊗b2)=max⁡(ε1(b1),ε1(b2)−⟨h1,wt(b1)⟩) and φ1(b1⊗b2)=max⁡(φ1(b1)+⟨h1,wt(b2)⟩,φ1(b2)).

[F4]

Crystal graph conventions (The crystal graph, εi, φi and the weight function): each finite i-string has εi+φi+1 vertices, φi(b)−εi(b)=⟨hi,wt(b)⟩, and K1v0=q1v0 gives ⟨h1,wt(v0)⟩=1, ⟨h1,wt(v1)⟩=−1.

[F5]

The canonical rank-one crystals (Divided-power commutation and the simple Uqi(sl2) string modules, The Kashiwara lattices L(λ) and L(∞) and their generating sets, The Kashiwara operators e~i and f~i of an integrable module): B(2) is the three-element one-colour chain of weights 2λ1,0,−2λ1, and B(0) the one-element crystal of weight 0 killed by both operators.

Verification

technique · direct
1.1givenF1

Read off the four residues and the values ε1(v0)=0,φ1(v0)=1,ε1(v1)=1,φ1(v1)=0 from the two-element chain v0→1v1, which is the m=1 case of the rank-one crystal basis of [F1].

2.1step 1.1F2

Apply the rule [F2] vertex by vertex: f~1(v0⊗v0)=v1⊗v0 since 1>0; f~1(v1⊗v0)=v1⊗v1 since 0≤0; f~1(v1⊗v1)=0 since 0≤1 selects the second factor and f~1v1=0; f~1(v0⊗v1)=0 since 1≤1 selects the second factor and f~1v1=0. This gives the two components stated, with the highest vertices v0⊗v0 and v0⊗v1.

3.1step 2.1step 1.1F3F4

Compute ε1,φ1 by iterating the same rule and compare with the max formulas [F3], using ⟨h1,wt(v0)⟩=1 and ⟨h1,wt(v1)⟩=−1 from [F4]: at v0⊗v0, ε1=max⁡(0,0−1)=0 and φ1=max⁡(φ1(v0)+⟨h1,wt(v0)⟩,φ1(v0))=max⁡(1+1,1)=2; at v1⊗v0, ε1=max⁡(1,0−(−1))=1 and φ1=max⁡(0+1,1)=1; at v1⊗v1, ε1=max⁡(1,1−(−1))=2 and φ1=max⁡(0−1,0)=0; at v0⊗v1, ε1=max⁡(0,1−1)=0 and φ1=max⁡(1−1,0)=0.

4.1step 3.1step 2.1F4F5

Identify the components. The three-element chain has top weight 2λ1, middle weight 0, bottom weight −2λ1 and one colour; a connected crystal with a unique highest vertex of weight 2λ1 and ε1+φ1+1=3 vertices in its only string is the rank-one crystal B(2) of [F5] (the m=2 case of the same rank-one description). The remaining vertex is killed by both operators and has weight 0, so it is B(0). This identifies the two components without invoking the general uniqueness theorem, so the example is choice-free.

5.1step 4.1F1F2algebra∎

Cross-check the module decomposition directly. Put z=q1, t=v0⊗v0 and s=v0⊗v1−zv1⊗v0. The coproduct convention underlying [F2] and the rank-one action of [F1] give E1t=0, F1t=v1⊗v0+zv0⊗v1, F1(2)t=v1⊗v1, and E1s=F1s=0, K1s=s. The two weight-zero vectors F1t,s are independent because their coefficient determinant is 1+z2≠0. Hence the three-dimensional cyclic string of t and the trivial line of s sum directly to the four-dimensional tensor module; [F1] identifies them as V(2) and V(0). This gives 4=3+1, and the corresponding classical two-dimensional tensor square has the same dimensions and highest weights.

Depends on

Used by

Dependency tree · two levels

27 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