Alphabeta Math
PropositionStatement: 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.

The adjoint highest weight is the highest root

Statement

Assume the Axiom of Choice. Let g be a finite-dimensional complex simple Lie algebra with Cartan subalgebra h and a fixed positive system whose highest root is θ (Height and highest root). Then the adjoint representation of g on itself (Adjoint representation of a Lie algebra) is irreducible, and its highest weight is θ.

Facts & Assumptions

Given: The Axiom of Choice, such a simple g, a Cartan subalgebra h, a fixed positive system with highest root θ, and the adjoint representation of g on itself.

[A1]

The Axiom of Choice is assumed; it enters through the root-space theory used by the cited suppliers (The Axiom of Choice).

[L1]

The adjoint map ad:ggl(g) is a representation; a subspace Wg is a subrepresentation if and only if [x,W]W for all x, that is, if and only if W is an ideal of g (Adjoint representation of a Lie algebra, Lie subalgebras, ideals, and center).

[L2]

g is simple: it is nonabelian and its only ideals are 0 and g (Simple, semisimple, and reductive Lie algebras).

[L3]

g=hαΦgα with dimgα=1; the adjoint action of Hh on gα is multiplication by α(H), and [gα,gβ]gα+β (Root-space decomposition, Root spaces of a complex semisimple Lie algebra are one-dimensional, Brackets of root spaces).

[L4]

The supplied highest root θ is positive and maximal in the root order (Height and highest root). Positive roots are nonnegative integral combinations of simple roots, so adding a positive root strictly increases this order (Simple roots form a signed integral basis).

[L5]

The derived subalgebra is an ideal; a Lie algebra is solvable when its derived series eventually vanishes (Derived series and solvable Lie algebras). The radical is its largest solvable ideal, and semisimple means that radical is zero (Semisimple Lie algebras).

Proof

technique · direct
1.1

Since g is nonabelian, its derived ideal [g,g] is nonzero. Simplicity and [L5] give [g,g]=g, so every term of the derived series equals g0. Thus g is not solvable. Its radical, being an ideal, is either zero or g; the latter would make g solvable. Hence the radical is zero and g is semisimple, licensing the semisimple root-space interfaces [L3].

L2L5algebra
1.2

By [L1] subrepresentations of the adjoint module are precisely ideals. Simplicity and nonzeroness imply this representation is irreducible.

L1L2
2.1

Apply [L3] using step 1.1. The weights of the adjoint module are the roots on their root spaces and zero on h. In particular the specified root θ has a nonzero one-dimensional weight space. Choose 0xgθ. For every positive root α, the bracket [gα,x] lies in gα+θ. Since α+θ is nonzero and strictly greater than θ in the root order, it cannot be a root by maximality, so this bracket vanishes. Therefore n+x=0 and Hx=θ(H)x for every Hh.

A1L3L4step 1.1algebra
3.1

The subrepresentation generated by the nonzero x of step 2.1 is nonzero, hence is the entire adjoint representation by step 1.2. Thus x is a highest weight vector of weight θ generating the module, exactly the definition of a highest weight module (Highest-weight vectors and modules). The proof uses the given maximal root directly and does not presume that an arbitrary irreducible module has a unique maximal weight. Simplicity excludes both the zero algebra and a one-dimensional abelian algebra; no additional choice beyond [A1] is needed to select one nonzero vector in the given root line.

A1step 1.2step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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