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

Highest weight components in a tensor product crystal

Statement

Assume the axiom of choice (The Axiom of Choice), inherited through Uniqueness: crystal bases of integrable modules decompose into highest weight crystals. Let M1,M2 be integrable chosen P-graded type-one quantum weight modules with finite-dimensional label-weight spaces and weight sets contained in finite unions of cones, let (L1,B1),(L2,B2) be crystal bases of M1,M2, and let B1⊗B2 be the crystal of M1⊗M2 (The crystal basis of a tensor product and the two-case operator rule, Tensor products of integrable weight modules and of their crystal lattices).

(a) Highest vertices. For b=b1⊗b2∈B1⊗B2 the following are equivalent: (i) b is a highest weight element, i.e. e~ib=0 for every i∈I; (ii) εi(b1)=0 and εi(b2)≤⟨hi,wt(b1)⟩ for every i∈I; (iii) εi(b1⊗b2)=0 for every i∈I. In this case wt(b)=wt(b1)+wt(b2) is dominant.

(b) Generated components. For every highest vertex b∈B1⊗B2 of weight λ, the lowering-generated subcrystal F(b) is a connected component of B1⊗B2, is isomorphic as a crystal to the canonical B(λ)=B(λ) of The canonical crystal B(λ) is a highest weight crystal of highest weight λ, and λ∈P+.

(c) Decomposition. B1⊗B2 is the disjoint union of the subcrystals F(b) over the highest weight elements b∈B1⊗B2, each of which is a highest weight crystal in the sense of Highest weight elements, lowering-generated sets and highest weight crystals; the multiplicity of B(λ) as a component equals the multiplicity of V(λ) in the tensor product module M1⊗M2.

No choice principle beyond the inherited one is used.

Facts & Assumptions

Given: Integrable chosen P-graded type-one weight modules M1,M2 with finite-dimensional label-weight spaces and cone-bounded weight sets (Quantum weight modules, weights in P, and integrability), crystal bases (L1,B1),(L2,B2) and the tensor product crystal B1⊗B2 of The crystal basis of a tensor product and the two-case operator rule.

[F1]

The tensor ε/φ formulas (The weight, εi and φi formulas for the tensor product crystal): εi(b1⊗b2)=max⁡(εi(b1),εi(b2)−⟨hi,wt(b1)⟩), with εi,φi finite and nonnegative on every vertex.

[F2]

Crystal graph conventions (The crystal graph, εi, φi and the weight function): e~ib=0 if and only if εi(b)=0, and φi(b)=εi(b)+⟨hi,wt(b)⟩ for all b.

[F3]

The tensor rule theorem (The crystal basis of a tensor product and the two-case operator rule) and the integrability lemma (Tensor products of integrable weight modules and of their crystal lattices): (L1⊗L2,B1⊗B2) is a crystal basis of M1⊗M2, and M1⊗M2 is integrable with finite-dimensional label-weight spaces and cone-bounded weight set.

[F4]

Uniqueness and decomposition (Uniqueness: crystal bases of integrable modules decompose into highest weight crystals, under the inherited AC): any crystal basis of an integrable module M with finite-dimensional label-weight spaces and cone-bounded weight set decomposes, through an isomorphism Φ:M→⨁jV(λj), into the canonical components B(λj); each component has a unique highest weight element, of dominant weight λj, equal to the lowering-generated subcrystal of that element; and #{j:λj=λ}=[M:V(λ)].

[F5]

The canonical component (The canonical crystal B(λ) is a highest weight crystal of highest weight λ): B(λ) is a highest weight crystal of highest weight λ; every of its vertices is an iterated lowering image of its highest element, and it has no other highest weight element.

[F6]

The definition of highest weight elements, F(b) and highest weight crystals (Highest weight elements, lowering-generated sets and highest weight crystals).

[F7]

The axiom of choice (The Axiom of Choice), used only through [F4].

Proof

technique · direct
1.1F1F2given

The three highest-vertex conditions are equivalent. By [F1], e~i(b1⊗b2)≠0 if and only if εi(b1⊗b2)=max⁡(εi(b1),εi(b2)−⟨hi,wt(b1)⟩)>0, which happens exactly when εi(b1)>0 or εi(b2)>⟨hi,wt(b1)⟩; hence (i), "e~ib=0 for all i", is equivalent to (ii), and by [F2] also to (iii). If these hold, then for every i one has ⟨hi,wt(b)⟩=φi(b)−εi(b)=φi(b)≥0 because εi(b)=0 and φi(b) is a finite nonnegative integer by [F1]; hence wt(b)=wt(b1)+wt(b2) is dominant. This proves (a).

2.1step 1.1F3F4F5

Generated components are canonical. Let b∈B1⊗B2 be a highest vertex of weight λ. Apply [F4] to M=M1⊗M2 with crystal basis (L1⊗L2,B1⊗B2), whose hypotheses hold by [F3]: B1⊗B2 decomposes into components B(λj), and each component has a unique highest weight element bλj and equals F(bλj). Since b is a highest vertex, it is the highest element of its component, so that component is B(λ) with λ=wt(b); consequently F(b) is a connected component of B1⊗B2 isomorphic to B(λ), and λ∈P+ by (a) and [F4]. This proves (b).

3.1step 2.1F4F5F6F7∎

The decomposition and multiplicities. By [F4] the components of B1⊗B2 are exactly the B(λj)=Φ−1(B(λj)), indexed by the simple constituents V(λj) of M1⊗M2; by [F5] each has a unique highest weight element, namely its standard highest element, and no other highest weight elements exist in the crystal. Hence the highest weight elements of B1⊗B2 are exactly those elements, and the disjoint union of the subcrystals F(b) over them is the whole crystal, each F(b) being a highest weight crystal in the sense of [F6]. The multiplicity of B(λ) among the components equals #{j:λj=λ}=[M1⊗M2:V(λ)] by the multiplicity clause of [F4]. The axiom of choice is used only through [F4], where it is already declared; no new nonconstructive selection occurs.

Depends on

Used by

Dependency tree · two levels

31 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