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.
Exterior powers and fundamental weights of sl_n
Example
Assume the Axiom of Choice. Let with its diagonal Cartan , coordinate functionals and upper-triangular positive system as in Standard and dual representations of sl_n. For every with the exterior power is an irreducible module of highest weight (Fundamental weights).
Facts & Assumptions
Given: The Axiom of Choice, such , the standard module with basis , and with basis the wedges for increasing index sets .
The Axiom of Choice is assumed; it enters through the root-space and highest-weight theory used below (The Axiom of Choice).
The weights of the standard module are , , and for , because the simple coroots are and (Standard and dual representations of sl_n, Fundamental weights).
The wedge is a weight vector of weight , these weights are pairwise distinct for distinct index sets , and , the sum being zero when the replacement produces a repeated index (Weight and weight space, Root systems of the classical complex Lie algebras).
For a finite set of pairwise distinct weights and one of them, an element of acts as the projection onto the corresponding weight component, since is the polynomial algebra on (Poincaré–Birkhoff–Witt theorem).
A nonzero submodule of an irreducible module is the whole module (Irreducible, completely reducible, and faithful representations, Highest-weight vectors and modules).
Verification
The vector has weight by [L1] and [L2], and it is killed by every positive root vector with : if then gives and the replacement repeats an index, while if then is not a factor at all; either way by [L2].
From any basis wedge one reaches by positive root vectors: let be the smallest positive integer not in , so , and choose with , which exists since has elements; then with a nonvanishing basis wedge whose index sum is strictly smaller, and repeating finitely many times reaches .
From one reaches every basis wedge by negative root vectors: for and the operator replaces the factor by without repeated indices (as ), giving with ; successive replacements of this kind produce every increasing index set.
is irreducible: if is a submodule, then by [L3] some basis wedge lies in , so by step 2.1 the highest vector lies in , and by step 2.2 every basis wedge lies in ; hence by [L4].
By step 1.1 the vector is a highest weight vector of weight , and by step 3.1 the module is irreducible; hence has highest weight , as asserted.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 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)