Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Tensor products of integrable highest weight modules decompose

Statement

Assume AC, let A be a finite symmetrizable GCM, and let λ,μP+. Then LA(λ)CLA(μ) with the diagonal action is integrable and belongs to O. It is an algebraic direct sum of dominant highest-weight simples, each with finite multiplicity; every weight space is finite dimensional. AC is inherited only through the complete-reducibility decomposition.

Facts & Assumptions

Given: AC and the stated symmetrizable GCM and dominant weights. Put V=LA(λ) and W=LA(μ).

[F1]

Under AC an integrable O module is a direct sum of dominant highest-weight simples (Complete reducibility of integrable kac moody o modules).

[F2]

The two simple highest-weight modules are integrable (Integrability criterion for simple highest weight kac moody modules).

[F3]

Their Verma modules have finite-dimensional weight spaces, one-dimensional tops and support in the respective downward cones, and map onto the simple modules (Universal property and pbw character of kac moody verma modules).

[F4]

The assumed choice axiom is The Axiom of Choice.

[F5]

Quotients inherit weight spaces and category-O bounds (Kac moody category o).

Proof

1.1

Define x(vw)=xvw+vxw. This is balanced and linear in both tensor factors. Expanding the commutator of x1+1x and y1+1y, the two mixed terms cancel because they act on different factors, leaving [x,y]1+1[x,y]. Hence this is a Lie representation. For a fixed simple generator x=ei or fi, choose p,q1 killing the fixed vectors v,w under its powers, using F2. The two factor operators commute. In their (p+q1)st binomial power, each term kills vw: its first exponent is at least p or its second is at least q. A maximum over finitely many elementary tensors proves local nilpotence on every tensor vector.

F2given
1.2

The tensor weight decomposition is the algebraic direct sum of VηWθ grouped by η+θ: every tensor is a finite sum of weight tensors, and the component maps induced by the factor projections prove directness before grouping. For ν=λ+μβ, contributions have η=λβ1, θ=μβ2, with β1+β2=β in Q+. If β=biαi, there are at most i(bi+1) such pairs, since each coefficient of β1 lies between 0 and bi. By F3 and F5 each factor space is finite dimensional, so the finite sum of their tensor spaces is finite dimensional. Outside (λ+μ)Q+ there are no contributions. Thus the tensor module belongs to O by F5.

F3F5given
2.1

Steps 1.1 and 1.2 give integrability and O membership. Apply F1 under the declared F4 assumption. Each copy of LA(ν) in its direct sum has one nonzero top vector at weight ν by F3 and F5. In an internal direct sum these top lines are linearly independent. Their number is bounded by the finite dimension of the tensor weight space from 1.2: more than that many lines would supply a finite independent set larger than its dimension. Hence every simple has finite multiplicity. This is a finiteness assertion, not a closed tensor multiplicity formula.

F1F3F4F5step 1.1step 1.2
3.1

At β=0 the only split is (0,0), so the tensor top space is one dimensional. If a generator already kills either tensor factor, the bound in 1.1 remains valid with the corresponding exponent one. A zero factor would give the empty decomposition by the same argument, although the specified simple factors are nonzero. Zero dominant labels require no change. The nilpotence and weight-space calculations use only finite sums and finite bounds; AC is used precisely in invoking F1 for the decomposition.

F1F3F4step 1.1step 1.2step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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