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.
Integrable weight sets and multiplicities are weyl invariant
Statement
In any integrable -module , each simple reflection gives a linear isomorphism . Products give isomorphisms for every , so preserves support and weight multiplicities. No finite-dimensionality of weight spaces is required for these isomorphisms. They transport any given basis bijectively to a basis. For arbitrary spaces, assume AC when interpreting multiplicities as cardinal sizes of bases; AC is used only to supply those bases. Finite multiplicity equality and all the displayed isomorphisms are choice-free.
Facts & Assumptions
Given: An integrable weight module, a simple index , and a weight .
Both simple generators are locally nilpotent (Integrable kac moody module).
The dual reflection formulas are and (Simple reflections and the kac moody weyl group).
Each vector is in a finite-dimensional invariant cyclic simple-root module (Integrability can be checked on simple root sl2 subalgebras).
The simple triple and Cartan commutator relations hold (Contragredient lie algebra before the maximal ideal quotient).
AC is the assumption for arbitrary choices (The Axiom of Choice).
Under AC every vector space has a basis (Every vector space has a basis).
Proof
Put , , . Define on , with each exponential evaluated on a vector by its finite power sum, justified by F1. The inverse is : for a locally nilpotent operator , the coefficient of in is , equal to for and zero otherwise. Every such multiplication on a vector is finite. Thus is a well-defined linear automorphism.
On a finite invariant cyclic module from F3, and are nilpotent matrices. For a nilpotent matrix , multiplication of the two finite exponential polynomials and the identity give ; the identity follows inductively by taking the next commutator. Apply this to the triple matrices. F4 gives conjugation by sending to , and conjugation by sending to and to . Thus successive conjugations send to , then , then . For a weight vector, its cyclic module is invariant under all of : commuting a Cartan element through a word in expresses its action as a scalar on the original weight vector plus words of the same kind. Every splits as plus . Since , F4 makes commute with and hence with . Consequently on all weight vectors and therefore on .
By F2, , so 1.2 also gives . For , . Thus . Its inverse satisfies the corresponding formula and sends that space into , proving equality and an isomorphism. Compose these maps along any finite expression . The resulting map is invertible and implements the prescribed weight action; no assertion that different expressions give identical operators is needed.
These isomorphisms preserve vanishing and nonvanishing of weight spaces, proving support invariance. If is any basis of , its image is independent because applying the inverse to a finite linear relation gives one among ; it spans because the inverse of every target vector is a finite combination of . Hence the two spaces have bases in explicit bijection. In the arbitrary-space cardinal interpretation, F5 and F6 supply ; this is the sole use of AC. Zero weight spaces have empty bases, a one-dimensional space transports its single basis vector, and the zero module has empty support. An empty Weyl word gives the identity. Zero simple labels mean a preserved weight space, without claiming acts identically there. The isomorphism and finite-dimensional conclusions used no AC.
Depends on
Used by
Dependency tree · two levels
22 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)