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 weyl group preserves roots and root multiplicities
Statement
For every finite GCM, permutes , and . Each simple reflection is implemented on root spaces by a Lie automorphism of . For a symmetrizer , the form on the root span with is -invariant.
Facts & Assumptions
Given: A finite GCM, its simple triples and the specified Weyl action.
The reflection formula is fixed. (Simple reflections and the kac moody weyl group).
Serre vanishing holds before generation. (Serre elements vanish before Serre generation).
Root spaces form a direct weight decomposition with finite multiplicities. (Kac moody root spaces are finite dimensional).
Proof
For , F2 gives nilpotence on each ; the relations give , , , and . For any derivation, , proved by induction and Pascal addition. Hence nilpotence on generators propagates to every finite bracket word and every finite sum. The same holds for . Their pointwise finite exponentials preserve brackets by the binomial identity, with inverses obtained by negating the derivation.
Set . On the triple, the finite expansions use , , and . Substitution gives , , and . It fixes in . Writing gives .
For , . The inverse automorphism gives a bijection between these spaces. Products of implement each word in the generators of , proving root and multiplicity invariance. Only the induced weight action, not independence of the lift from a word, is required.
If is symmetric, extend bilinearly. For in the root span, and . Expanding cancels the two cross terms against , leaving . This computation allows a degenerate form.
Sources
Source comparison: Kleshchev, Lemma 3.1.2 and §3.2, pp.37–42.
Depends on
Used by
Dependency tree · two levels
9 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 — Lemma 3.1.2 and §3.2, pp.37–42 (standard reference, not scraped)