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 be a finite symmetrizable GCM, and let . Then with the diagonal action is integrable and belongs to . 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 and .
Under AC an integrable module is a direct sum of dominant highest-weight simples (Complete reducibility of integrable kac moody o modules).
The two simple highest-weight modules are integrable (Integrability criterion for simple highest weight kac moody modules).
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).
The assumed choice axiom is The Axiom of Choice.
Quotients inherit weight spaces and category- bounds (Kac moody category o).
Proof
Define . This is balanced and linear in both tensor factors. Expanding the commutator of and , the two mixed terms cancel because they act on different factors, leaving . Hence this is a Lie representation. For a fixed simple generator or , choose killing the fixed vectors under its powers, using F2. The two factor operators commute. In their st binomial power, each term kills : its first exponent is at least or its second is at least . A maximum over finitely many elementary tensors proves local nilpotence on every tensor vector.
The tensor weight decomposition is the algebraic direct sum of 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 , , with in . If , there are at most such pairs, since each coefficient of lies between and . By F3 and F5 each factor space is finite dimensional, so the finite sum of their tensor spaces is finite dimensional. Outside there are no contributions. Thus the tensor module belongs to by F5.
Steps 1.1 and 1.2 give integrability and membership. Apply F1 under the declared F4 assumption. Each copy of 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.
At the only split is , 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.
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
- Kleshchev, Lectures on Infinite Dimensional Lie Algebras (standard reference, not scraped)
- Perrin, Introduction to Kac-Moody Groups and Lie Algebras (standard reference, not scraped)