Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Highest-weight vectors and modules

Definition

Assume the Axiom of Choice. Let g be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra h, a chosen positive system with nilpotent subalgebra n+ (Positive and negative nilpotent subalgebras and the Borel), and let V be a representation of g. A highest weight vector of V is a nonzero vector vVλ, for some λh, with n+v=0 (Weight and weight space); the functional λ is then called the weight of v. A highest weight module of highest weight λ is a representation V generated, as a g-module, by a highest weight vector of weight λ: the smallest subrepresentation of V containing v is V itself.

By Lie representations are U(g)-modules the action of g extends uniquely to a unital action of U(g), so the subrepresentation generated by v is exactly U(g)v; this is the content of the word "generated" above and makes the notion independent of any choice of generators. A highest weight vector v satisfies Hv=λ(H)v for all Hh by the definition of Vλ. The zero representation is not a highest weight module, since a highest weight vector is required to be nonzero.

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