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 representation and highest root
Example
Assume the Axiom of Choice. For , , with its diagonal Cartan , coordinate functionals and upper-triangular positive system, the adjoint representation has highest vector and highest weight , which is the highest root (Adjoint representation of a Lie algebra, Height and highest root).
Facts & Assumptions
Given: The Axiom of Choice, an integer , (Classical complex matrix Lie algebras), its diagonal Cartan , the coordinate functionals , the matrix units , the positive system with base (verified in step 1.4), and the adjoint representation of on itself.
The Axiom of Choice is assumed; it covers the inherited highest-weight and root-order conventions (The Axiom of Choice).
The roots are , , with root spaces . This root and root-space description is supplied by Root systems of the classical complex Lie algebras; the positive system is the choice in the Given, verified below.
The adjoint action is and . [given]
A positive system is specified by a regular vector, and its simple roots are its positive roots not expressible as a sum of two positive roots (Positive systems and simple roots).
For the Killing form of is and is nondegenerate (Classical simple Lie algebras and their Killing forms); hence is semisimple by Cartan's semisimplicity criterion, as required by the highest-weight definition.
Verification
The vector has weight : by [L2].
is killed by every positive root vector: for we have , and because with , while because forces ; hence .
The adjoint submodule generated by is all of . It contains ; then is a nonzero scalar multiple of for every . It also contains for , as well as the original . Finally, supplies every off-diagonal with and every diagonal difference . These matrices span .
In the Euclidean model of the roots take the traceless vector : , so it is regular and selects exactly . Each positive root has the expansion . The vectors are independent: comparing successive coordinates in gives every . If the root splits at into two positive roots; an adjacent root cannot so split because the two nonempty interval expansions would have to sum to its single coefficient one. Thus these adjacent differences are exactly the simple roots.
For every positive root with , one has a nonnegative integral combination of simple roots. Thus is the highest root. By steps 1.1–1.3, has that weight, is killed by all positive root spaces, and generates the adjoint module, so it is a highest weight vector and the adjoint module has highest weight . (Height and highest root, Highest-weight vectors and modules, step 1.1, step 1.2, step 1.3, step 1.4, L4) ∎
Depends on
- Positive systems and simple roots
- Classical simple Lie algebras and their Killing forms
- Cartan's semisimplicity criterion
- Root systems of the classical complex Lie algebras
- Classical complex matrix Lie algebras
- Adjoint representation of a Lie algebra
- Height and highest root
- Highest-weight vectors and modules
- The Axiom of Choice
Used by
Dependency tree · two levels
28 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
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)