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

The crystal basis of a tensor product and the two-case operator rule

Statement

Let M1,M2 be integrable chosen P-graded type-one quantum weight modules with crystal bases (L1,B1), (L2,B2) (Crystal lattices, crystal bases and their crystals), and let M1⊗M2 be the integrable module of Tensor products of integrable weight modules and of their crystal lattices.

Then (L1⊗A0L2, B1⊗B2) is a crystal basis of M1⊗M2, and its crystal is the tensor product crystal B1⊗B2 of The tensor product crystal B1⊗B2 and its two-case convention: for all b1∈B1, b2∈B2 and i∈I,

f~i(b1⊗b2)={f~ib1⊗b2,φi(b1)>εi(b2),b1⊗f~ib2,φi(b1)≤εi(b2),e~i(b1⊗b2)={e~ib1⊗b2,φi(b1)≥εi(b2),b1⊗e~ib2,φi(b1)<εi(b2),

with value 0 as soon as the selected factor maps to 0. In particular e~i and f~i map B1⊗B2 into (B1⊗B2)∪{0}, and for all b,b′∈B1⊗B2 one has f~ib=b′ if and only if b=e~ib′, so the partial-inverse axiom holds. The equality case φi(b1)=εi(b2) is resolved as in the definition: f~i acts on the second factor and e~i on the first.

No finite dimensionality, bounded support or uniform nilpotence is assumed, and no choice principle is used.

Facts & Assumptions

Given: Integrable chosen P-graded type-one quantum weight modules M1,M2 with crystal bases (L1,B1), (L2,B2) (Crystal lattices, crystal bases and their crystals), the tensor product module M1⊗M2 of Tensor products of integrable weight modules and of their crystal lattices with its Kashiwara operators e~i,f~i, and its A0-tensor lattice L1⊗L2=L1⊗A0L2 with residue basis B1⊗B2.

[F1]

Crystal lattice and crystal basis axioms (Crystal lattices, crystal bases and their crystals): Lj is free over A0, weight-graded, generates Mj over Q(q) and is stable under e~i,f~i; Bj=⨆μ(Bj)μ is a Q-basis of Lj/qLj with e~iBj⊆Bj∪{0}, f~iBj⊆Bj∪{0} and f~ib=b′ if and only if b=e~ib′.

[F2]

String components of a lattice vector (The i-string components of a lattice vector and the single surviving component modulo q): for u∈Lλ with admissible decomposition u=∑nFi(n)un, every un lies in L; the lattice decomposes as L=⨁n≥0f~i n(L∩ker⁡Ei); if u+qL∈Bλ then exactly one component un0 is outside qL, with un0+qL=e~i n0(u+qL)∈B and u≡Fi(n0)un0(modqL); and the residues of e~iu,f~iu are those of Fi(n0−1)un0, Fi(n0+1)un0.

[F3]

The rank-one tensor strings (Rank-one tensor strings and their crystal limit rule): for rank-one simples of nonnegative integral highest weights a1,a2 with divided bases vj=Fi(j)v0, wk=Fi(k)w0 and their A0-tensor lattice, that lattice is stable under e~i,f~i and modulo q one has f~i(vj⊗wk)=vj+1⊗wk if a1−j>k and vj⊗wk+1 otherwise, while e~i acts on the first factor if a1−j≥k and on the second otherwise, with zero outside the divided-basis ranges; this is a finite, choice-free calculation independent of the grand loop.

[F4]

Kashiwara operators (The Kashiwara operators e~i and f~i of an integrable module): on the unique admissible string decomposition, e~i and f~i shift the divided string positions down and up by one; they are linear, preserve the given factor lattices Lj and commute with module homomorphisms.

[F5]

Uniqueness of admissible decompositions (Uniqueness of the i-string decomposition of an integrable module): every vector of an integrable weight module has exactly one finite admissible i-string decomposition; on ker⁡Ei∩Mμ the maps Fi(n) are injective for n≤⟨hi,μ⟩ and zero for n>⟨hi,μ⟩, and ker⁡Ei∩Mμ=0 for ⟨hi,μ⟩<0.

[F6]

Crystal graph invariants (The crystal graph, εi, φi and the weight function): εi(b)=max⁡{n:e~i nb≠0} and φi(b)=max⁡{n:f~i nb≠0} are finite and nonnegative, φi(b)=εi(b)+⟨hi,wt(b)⟩, and on an existing f~i-edge φi decreases by one and εi increases by one.

[F7]

Tensor integrability lemma (Tensor products of integrable weight modules and of their crystal lattices): M1⊗M2 is an integrable chosen P-graded type-one weight module for the direct sum grading (M1⊗M2)μ=⨁μ1+μ2=μ(M1)μ1⊗(M2)μ2; L1⊗L2 is free and generates M1⊗M2 over Q(q), is weight-graded accordingly, and B1⊗B2 is a weight-graded Q-basis of (L1⊗L2)/q(L1⊗L2) (stability under the crystal operators is not assumed; it is proved here).

[F8]

The tensor product crystal and the target rules (The tensor product crystal B1⊗B2 and its two-case convention).

[F9]

Weight modules and integrability (Quantum weight modules, weights in P, and integrability): the tensor module is a chosen P-graded type-one weight module in the sense stated there, and integrability is local nilpotence of all Ei,Fi.

Proof

technique · direct
1.1F2givenalgebra

Reduction to single string components. Fix b1⊗b2∈B1⊗B2 and lifts uj∈Lj with uj+qLj=bj, and put nj:=εi(bj). By [F2] applied to uj there are top components wj∈Lj∩ker⁡Ei with wj+qLj=e~i njbj∈Bj and uj≡Fi(nj)wj(modqLj); hence u1⊗u2≡h:=Fi(n1)w1⊗Fi(n2)w2(modq(L1⊗L2)) (expand the difference as in the bilinearity of the tensor product), and h+q(L1⊗L2)=b1⊗b2 because the residue of Fi(nj)wj is bj by [F2].

1.2F2F4F5F6

The rank-one block. The top wj lies in ker⁡Ei∩(Lj)μj with aj:=⟨hi,μj⟩≥0 by [F5]; the divided powers Fi(k)wj, 0≤k≤aj, form the string basis of the finite-dimensional Ui-submodule Nj:=Uiwj, all of them lie in Lj by [F2], and on this string f~i acts as the divided-power shift and e~i as its partial inverse by [F4]. The tensor product of the inclusions N1⊗N2→M1⊗M2 is injective and Ui-linear, and for a vector of N1⊗N2 its admissible decomposition computed inside N1⊗N2 is also admissible in M1⊗M2, so by uniqueness [F5] it is the admissible decomposition there; hence the operators e~i,f~i of M1⊗M2 restrict on the image to the string operators computed from N1,N2.

2.1step 1.2F3

The rank-one computation. Apply [F3] to the pair (w1,w2) with divided bases vj=Fi(j)w1, wk=Fi(k)w2 and their A0-tensor lattice Λ:=∑j,kA0 vj⊗wk⊆L1⊗L2, which is preserved by both string operators by [F3] and by step 1.2; modulo qΛ one has f~i(vn1⊗wn2)=vn1+1⊗wn2 if a1−n1>n2 and vn1⊗wn2+1 otherwise, while e~i acts on the first factor if a1−n1≥n2 and on the second otherwise, with 0 outside the divided-basis ranges.

3.1step 1.1step 2.1F2F6algebra

Transport to the residues. Since h∈Λ, step 2.1 computes f~ih and e~ih modulo qΛ⊆q(L1⊗L2), and the residues of vn1+1=Fi(n1+1)w1 and vn1=Fi(n1)w1 are f~ib1 and b1; likewise on the second factor by [F2]. Because a1−n1=φi(b1) by [F6] and n2=εi(b2), the two cases of step 2.1 are exactly φi(b1)>εi(b2) and φi(b1)≤εi(b2) for f~i, and φi(b1)≥εi(b2) or φi(b1)<εi(b2) for e~i, giving the displayed two-case rules for the residue b1⊗b2 of h; a selected factor with f~i or e~i equal to 0 produces the value 0, consistently on both sides of the congruence.

4.1step 1.2step 2.1step 3.1F2F3F7

Stability of the tensor lattice. For arbitrary uj∈Lj use the full string decomposition of [F2]: uj=∑nFi(n)wj,n with finitely many nonzero wj,n∈Lj∩ker⁡Ei, and each pair (w1,n,w2,n′) spans a finite rank-one block as in step 1.2 whose A0-tensor lattice is preserved by both string operators by [F3]; since the inclusions commute with the operators (step 1.2), every term of the finite expansion of u1⊗u2 has its images under e~i,f~i inside L1⊗L2, and linearity gives e~i(L1⊗L2)⊆L1⊗L2 and f~i(L1⊗L2)⊆L1⊗L2. In particular f~i(q(L1⊗L2))⊆q(L1⊗L2) and likewise for e~i, so the congruence u1⊗u2≡h of step 1.1 may be transported by the operators and the two-case rules of step 3.1 hold for the residues of arbitrary lifts, not only for h.

5.1step 3.1step 4.1F2F6

Operator rules and residues. Combining steps 3.1 and 4.1: for all b1∈B1,b2∈B2 the classes f~i(b1⊗b2) and e~i(b1⊗b2) are computed by the displayed two-case rules, and they lie in (B1⊗B2)∪{0} because each case is the residue of an element of the form v⊗w with v∈B1∪{0}, w∈B2∪{0}; the equality case φi(b1)=εi(b2) sends f~i to the second factor, since the first case requires the strict inequality, and e~i to the first factor, since its first case is non-strict.

6.1step 5.1F1F6

Partial inverses. Suppose first φi(b1)>εi(b2) and let b′:=f~i(b1⊗b2)=f~ib1⊗b2≠0; then φi(f~ib1)=φi(b1)−1≥εi(b2) by [F6], so the e~i-rule of step 5.1 selects the first factor at b′ and e~ib′=e~if~ib1⊗b2=b1⊗b2 by the factor partial inverse [F1]. Suppose next φi(b1)≤εi(b2) and b′:=b1⊗f~ib2≠0; then f~ib2≠0 and εi(f~ib2)=εi(b2)+1>φi(b1) by [F6], so the e~i-rule selects the second factor and e~ib′=b1⊗e~if~ib2=b1⊗b2. The converse implication is the same computation read backwards, and at the tie φi(b1)=εi(b2) both consistency conditions hold simultaneously: this is exactly why e~i is assigned the non-strict and f~i the strict comparison.

7.1step 5.1step 6.1F7F8F9given∎

Conclusion. By [F7] the pair (L1⊗L2,B1⊗B2) has the lattice axioms of generation over Q(q), weight grading and residue-basis properties; step 4.1 supplies operator stability and step 5.1 the operator axioms on B1⊗B2; step 6.1 supplies the partial-inverse axiom. Hence it is a crystal basis of M1⊗M2 whose crystal is the tensor product crystal B1⊗B2 of [F8] with the displayed rules. Every step used finite string data of two vectors and the one-factor crystal bases; no finite dimensionality, bounded support, uniform nilpotence or choice principle is assumed.

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