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 crystal graph of the quantum symmetric square of the standard A2-module

Example

Use the type A2 datum with q1=q2=q, α1=2ω1−ω2, α2=−ω1+2ω2. Let W have standard basis e1,e2,e3 of labels ω1, ω2−ω1, −ω2, with E1e2=e1, F1e1=e2, E2e3=e2, F2e2=e3 and all other positive and negative actions zero. Use ΔE=E⊗K−1+1⊗E, ΔF=F⊗1+K⊗F. The quantum symmetric square is the highest submodule V=Uq(e1⊗e1)⊂W⊗W, isomorphic to V(2ω1), with six divided-normalized basis vectors v11=e1⊗e1,v12=e2⊗e1+q e1⊗e2,v22=e2⊗e2, v13=e3⊗e1+q e1⊗e3,v23=e3⊗e2+q e2⊗e3,v33=e3⊗e3. Their respective labels are (2,0),(0,1),(−2,2),(1,−1),(−1,0),(0,−2) in the ω-basis. Their spans specialize to the ordinary symmetric square at q=1.

The color-1 divided strings are v11→v12→v22, v13→v23 and {v33}; the color-2 strings are v12→v13, v22→v23→v33 and {v11}. The A0-span of the six vectors is the recursively generated crystal lattice and their residue classes form its crystal basis, with precisely these six lowering edges. Their (ε1,φ1,ε2,φ2) are respectively (0,2,0,0), (1,1,0,1), (2,0,0,2), (0,1,1,0), (1,0,1,1), (0,0,2,0). All twelve ε-φ equalities φi(b)=εi(b)+⟨hi,wt(b)⟩ hold. No choice principle is used.

Facts & Assumptions

Given: The A2 Cartan datum with I={1,2}, aij=2 for i=j and −1 otherwise, d1=d2=1, q1=q2=q, fundamental labels ω1,ω2 with ⟨hi,ωj⟩=δij, and the tensor product W⊗W with the stated coproduct.

[F1]

The Drinfeld–Jimbo algebra of the datum has generators Ei,Fi,Kh with the relations KhEiKh−1=q⟨αi,h⟩Ei, KhFiKh−1=q−⟨αi,h⟩Fi and EiFj−FjEi=δij(Ki−Ki−1)/(q−q−1), together with the Serre relations (The Drinfeld-Jimbo quantized enveloping algebra by generators and relations, Symmetrizable Cartan data for quantum groups).

[F2]

The coproduct is an algebra map with ΔEi=Ei⊗Ki−1+1⊗Ei and ΔFi=Fi⊗1+Ki⊗Fi, so tensor products of modules are modules (The Drinfeld–Jimbo formulas define a Hopf algebra).

[F3]

Every integrable cyclic highest weight module with nonzero highest vector of label 2ω1 receives a surjective map from the simple module V(2ω1), determined by that vector (The integrable quantum highest weight module exists and is unique).

[F4]

Kashiwara operators are defined through the string decomposition; on a 2-step string with first step coefficient 1 and second step coefficient [2], the operator f~i moves one position with coefficient 1 and e~i is its inverse on the string; at the endpoints it acts by 0 (The Kashiwara operators e~i and f~i of an integrable module, Uniqueness of the i-string decomposition of an integrable module, Divided-power commutation and the simple Uqi(sl2) string modules, part (iii)).

[F5]

For an integrable type-1 module with a crystal lattice L and residue basis B, εi(b)=max⁡{n:e~inb≠0}, φi(b)=max⁡{n:f~inb≠0} and φi=εi+⟨hi,wt⟩ (The crystal graph, εi, φi and the weight function, Crystal lattices, crystal bases and their crystals, The Kashiwara lattices L(λ) and L(∞) and their generating sets).

Verification

technique · direct
1.1F1F2algebra

W is a module. The assignments of the statement satisfy the defining relations of [F1] on the three basis vectors: the toral actions are the stated labels; [E1,F1] equals e1↦e1, e2↦−e2, e3↦0, which is (K1−K1−1)/(q−q−1); [E2,F2] equals e1↦0, e2↦e2, e3↦−e3, which is (K2−K2−1)/(q−q−1); the mixed commutators [E1,F2], [E2,F1] vanish on all three basis vectors; and the Serre relations hold because Ei2=Fi2=0 for i=1,2 and every word with three or more factors from {E1,E2} (or from {F1,F2}) kills every basis vector.

1.2F2algebra

Action table. Computing ΔEi,ΔFi on the six displayed vectors gives F1v11=v12, F1v12=[2]v22, F1v13=v23, F2v12=v13, F2v22=v23, F2v23=[2]v33 and E1v12=[2]v11, E1v22=v12, E1v23=v13, E2v13=v12, E2v23=[2]v22, E2v33=v23, with all other positive and negative actions on the six vectors zero; for instance ΔF1(v13)=F1e3⊗e1+K1e3⊗F1e1+qF1e1⊗e3+qK1e1⊗F1e3=v23 and ΔE2(v23)=E2e3⊗K2−1e2+qE2e2⊗K2−1e3+q e2⊗E2e3=(q−1+q)v22. Diagonal toral actions are the six labels of the statement.

2.1F2F3step 1.2

Cyclicity and dimension. The table gives v12=F1v11, v22=F1(2)v11, v13=F2v12, v23=F1v13=F2v22 and v33=F2(2)v22, so all six vectors lie in the cyclic submodule of v11. Their distinct labels and nonzero tensor coordinates make them independent, and their span is stable under all generators by step 1.2. Hence this span equals the cyclic submodule and has dimension six. It is integrable, since each Ei,Fi is nilpotent on the displayed finite strings, and v11 is highest of label 2ω1. Universality [F3] gives a surjection V(2ω1)→V sending its top to v11; its kernel is zero by simplicity. Thus V≅V(2ω1) and this computation establishes its dimension without a Weyl-dimension prerequisite.

3.1F4F5step 1.2step 2.1

The divided strings and the lattice. In the table of step 1.2 the first Fi-step of each color-i string has coefficient 1 and the second has coefficient [2]; normalizing by [1]!=1 and [2]!=[2] gives the divided strings of the statement, so by [F4] the Kashiwara operators act with coefficient 1 along them: f~1v11=v12, f~1v12=v22, f~1v13=v23, f~2v12=v13, f~2v22=v23, f~2v23=v33, and the corresponding inverse e~i-actions, with all endpoints 0. Distinct labels give linear independence, so the A0-span L of the six vectors is their free direct sum; it is stable under both operators and generated by the lowering words from v11, so it is the recursively generated crystal lattice, and its residue classes form a Q-basis of L/qL by the crystal-limit isomorphism.

4.1step 3.1

Edges and partial inverses. The only nonzero arrows of the residue basis are the six listed: two color-1 edges on the first and one on the second of the chains v11→v12→v22 and v13→v23, and the color-2 edges v12→v13 and v22→v23→v33, exactly as in the statement; every arrow is the inverse of the corresponding e~i-step by step 3.1, so the partial-inverse axiom holds and no further edges occur.

5.1F5step 3.1step 4.1∎

The invariants. Reading the string positions from step 4.1 gives the table (ε1,φ1,ε2,φ2): (0,2,0,0) at v11, (1,1,0,1) at v12, (2,0,0,2) at v22, (0,1,1,0) at v13, (1,0,1,1) at v23 and (0,0,2,0) at v33. Comparing with the six labels of the statement, the twelve equalities φi=εi+⟨hi,wt⟩ are the identities 2=0+2, 0=0+0; 1=1+0, 1=0+1; 0=2−2, 2=0+2; 1=0+1, 0=1−1; 0=1−1, 1=1+0; 0=0+0, 0=2−2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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