Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Simple reflections preserve weight multiplicities

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h and root system Φ, choose a positive system Φ+ with base Δ={α1,,αr} (Positive systems and simple roots), let V be a finite-dimensional representation of g, and let W be the Weyl group of Φ, acting on h by complex-linear extension of its action on E=spanRΦ (Weyl group, The roots form a reduced crystallographic Euclidean root system). Then for every simple root αi and every μh dimVμ=dimVsi(μ),si(μ)=μμ(hαi)αi, and consequently dimVwμ=dimVμ for every wW and every μh (Weight and weight space).

Facts & Assumptions

Given: The Axiom of Choice, such g,h,Φ, the chosen positive system Φ+ with simple roots Δ, a finite-dimensional representation V, and the Weyl group W acting on h.

[A1]

The Axiom of Choice is assumed; it enters through the root-space theory supplying [L1] and the abstract root-system identification [L4] (The Axiom of Choice).

[L1]

For every root α the coroot hα and suitable eαgα, fαgα form a copy of sl2 with [eα,fα]=hα; moreover α(hα)=2 and sα(μ)=μμ(hα)α is the reflection of Root reflection defined by a coroot (The root sl_2 triple, Coroot of a Lie-algebra root).

[L2]

A finite-dimensional sl2-module is a direct sum of irreducible submodules, and on each irreducible summand the operators e and f move along a finite weight string; in particular they act nilpotently (Finite-dimensional representations of sl_2).

[L3]

For μh, the weight space is Vμ={v:Hv=μ(H)v for all Hh} (Weight and weight space).

[L4]

The roots of g form a reduced crystallographic Euclidean root system on E, and its root reflections coincide with the sα of [L1] after complex-linear extension to h (The roots form a reduced crystallographic Euclidean root system, Weyl group, Root reflection defined by a coroot).

[L5]

Relative to the chosen base Δ, every element of the Weyl group is a product of the corresponding simple reflections (Positive systems and simple roots, Weyl length equals inversion number).

Proof

technique · direct
1.1

Fix a simple root α=αi and the sl2-triple (eα,fα,hα) of [L1], and write ρ for the action of g on V. By [L2], the endomorphisms E=ρ(eα) and F=ρ(fα) are nilpotent. Hence the finite sums exp(E) and exp(F) are defined and invertible, and so is Nα=exp(E)exp(F)exp(E).

A1L1L2algebra
2.1

Let Hh and put a=α(H). In the adjoint action of the root triple, the relations of [L1] give exp(adeα)H=Haeα, then exp(adfα)(Haeα)=Haeαahα, and applying exp(adeα) once more gives Hahα. Conjugation by an exponential satisfies exp(E)ρ(x)exp(E)=ρ(exp(adeα)x), with finite series here. Therefore Nαρ(H)Nα1=ρ(Hα(H)hα).

L1step 1.1algebra
3.1

Since the reflection rα(H)=Hα(H)hα is an involution, step 2.1 also gives Nα1ρ(H)Nα=ρ(rα(H)). If vVμ, then for every Hh one has ρ(H)Nαv=Nαρ(rα(H))v=μ(rα(H))Nαv=sα(μ)(H)Nαv. Thus Nα(Vμ)Vsα(μ). Applying the same argument to Nα1 gives the reverse inclusion, so Nα restricts to an isomorphism VμVsα(μ). Hence dimVμ=dimVsα(μ) for every μh.

L1L3L4step 2.1algebra
4.1

Every wW is a product of simple reflections by [L5]. Applying step 3.1 successively to those factors gives dimVwμ=dimVμ for every wW and μh.

L4L5step 3.1
5.1

The stated equalities follow from steps 3.1 and 4.1.

step 3.1step 4.1

Depends on

Used by

Dependency tree · two levels

45 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