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.
Standard and dual representations of sl_n
Example
Assume the Axiom of Choice. Let , (Classical complex matrix Lie algebras), let be the diagonal traceless matrices, let be the coordinate functionals , and let the positive system be the roots with , with base (Root systems of the classical complex Lie algebras). Then the standard module with its natural action is irreducible of highest weight , and its dual is irreducible of highest weight (Fundamental weights).
Facts & Assumptions
Given: The Axiom of Choice, such , its diagonal Cartan , the matrix units , the coordinate functionals , the positive system with simple roots , the Killing form (Killing form), the standard module with basis , and its dual with dual basis .
The Axiom of Choice is assumed; among the facts used below, it enters through the highest-weight classification in [L4]. The explicit classical root calculation [L1] has no choice hypothesis (The Axiom of Choice).
The roots of with respect to are the functionals , , with root spaces ; each is one-dimensional and the root set is a reduced crystallographic Euclidean root system of type (Root systems of the classical complex Lie algebras).
For the coroot is : on diagonal traceless one has , so and the normalisation gives (Coroot of a Lie-algebra root).
The fundamental weights are the functionals dual to the simple coroots: , and the simple coroots form a basis of (Fundamental weights, The roots form a reduced crystallographic Euclidean root system).
A nonzero weight vector killed by all positive root vectors is a highest-weight vector of the module it generates; every finite-dimensional irreducible module has a unique highest weight (Highest-weight vectors and modules, Weight and weight space, Highest-weight classification).
For , the Killing form of is the nondegenerate form (Classical simple Lie algebras and their Killing forms); hence this finite-dimensional characteristic-zero Lie algebra is semisimple by Cartan's semisimplicity criterion. This supplies the semisimplicity hypothesis of [L2]--[L4].
Verification
The action on is and ; hence the weights of are , each with one-dimensional weight space, and is killed by every positive root vector with , since forces .
is irreducible: if and , then for every . Choose one such (possible since ); applying to the resulting gives . All matrix units used are off-diagonal and belong to . Hence every basis vector belongs to the submodule generated by , which equals .
For the dual module the action is , so the weights of are on the dual basis vectors ; the vector is killed by every positive root vector: because gives .
By [L2] and [L3], for every , and the simple coroots span ; hence , so is irreducible with highest weight by steps 1.1, 1.2 and [L4].
is irreducible: if is a submodule, then its annihilator is a submodule: for and , . Its dimension is , hence by step 1.2 and .
Finally for every , so by [L3]; hence is irreducible of highest weight by steps 1.3, 2.2 and [L4].
Depends on
- Classical simple Lie algebras and their Killing forms
- Cartan's semisimplicity criterion
- Root systems of the classical complex Lie algebras
- The roots form a reduced crystallographic Euclidean root system
- Classical complex matrix Lie algebras
- Fundamental weights
- Coroot of a Lie-algebra root
- Highest-weight vectors and modules
- Weight and weight space
- Irreducible, completely reducible, and faithful representations
- Highest-weight classification
- Killing form
- The Axiom of Choice
Used by
Dependency tree · two levels
59 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)