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.

Every finite-dimensional irreducible module has a highest-weight vector

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h and a chosen positive system, and let V≠0 be a finite-dimensional irreducible representation of g (Irreducible, completely reducible, and faithful representations). Then V contains a highest weight vector for the chosen positive roots (Highest-weight vectors and modules); consequently V is a highest weight module for some highest weight λ.

Facts & Assumptions

Given: The Axiom of Choice, such g,h, a chosen positive system, and a nonzero finite-dimensional irreducible module V.

[A1]

The Axiom of Choice is assumed; among the facts used below, it enters through the weight decomposition [L1] (The Axiom of Choice). The algebraic shift property [L2] has no choice hypothesis.

[L1]

V=⨁μVμ is a direct sum over its finitely many weights, and each weight space is finite dimensional (Finite-dimensional modules decompose into weight spaces).

[L2]

If x∈gα and w∈Vμ, then x⋅w∈Vμ+α, with 0 allowed (Root vectors shift weights).

[L3]

The root order ≤ is a partial order on the weights, and a positive root α satisfies α∈Q+∖{0}, so λ+α>λ for every weight λ (Root order on weights, Simple roots form a signed integral basis).

[L4]

n+ is the sum of the root spaces gα with α∈Φ+ (Positive and negative nilpotent subalgebras and the Borel).

Proof

technique · direct
1.1A1L1

By [L1] the set P(V) of weights of V is finite and nonempty, because V≠0 has a nonzero weight space.

2.1L3step 1.1

P(V) has a maximal element: enumerating P(V)={λ1,…,λN} and starting from λ1, replace the current element by a strictly larger element of P(V) whenever one exists; the resulting chain is strictly increasing in the partial order [L3] and therefore has at most N terms, so the procedure stops at a weight λ above which no weight of V lies.

3.1L1step 2.1

Choose 0≠v∈Vλ, which is possible because λ is a weight by step 2.1.

4.1L2L3L4step 2.1step 3.1

Let α∈Φ+ and x∈gα. If x⋅v≠0, then x⋅v∈Vλ+α by [L2], so λ+α would be a weight of V strictly above λ by [L3], contradicting the maximality of λ from step 2.1. Hence x⋅v=0 for every x in every positive root space, and therefore n+⋅v=0 by [L4].

5.1step 4.1

By step 4.1 the vector v is a highest weight vector of weight λ (Highest-weight vectors and modules); since V is irreducible and nonzero, the subrepresentation generated by v is all of V, so V is a highest weight module of highest weight λ.

6.1step 5.1∎

The existence of a highest weight vector in V is proved.

Depends on

Used by

Dependency tree · two levels

27 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