Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 representation and highest root

Example

Assume the Axiom of Choice. For sln(C), n2, with its diagonal Cartan h, coordinate functionals εi and upper-triangular positive system, the adjoint representation has highest vector E1n and highest weight ε1εn, which is the highest root (Adjoint representation of a Lie algebra, Height and highest root).

Facts & Assumptions

Given: The Axiom of Choice, an integer n2, g=sln(C) (Classical complex matrix Lie algebras), its diagonal Cartan h, the coordinate functionals εi(H)=Hii, the matrix units Eij, the positive system εiεj (i<j) with base αj=εjεj+1 (verified in step 1.4), and the adjoint representation of g on itself.

[A1]

The Axiom of Choice is assumed; it covers the inherited highest-weight and root-order conventions (The Axiom of Choice).

[L1]

The roots are εiεj, ij, with root spaces CEij. 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.

[L2]

The adjoint action is [H,Eij]=(HiiHjj)Eij=(εiεj)(H)Eij and [Eij,Ekl]=δjkEilδliEkj. [given]

[L3]

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).

[L4]

For n2 the Killing form of sln(C) is 2ntr(XY) and is nondegenerate (Classical simple Lie algebras and their Killing forms); hence g is semisimple by Cartan's semisimplicity criterion, as required by the highest-weight definition.

Verification

technique · direct
1.1

The vector E1n has weight ε1εn: [H,E1n]=(H11Hnn)E1n by [L2].

L2A1
1.2

E1n is killed by every positive root vector: for i<j we have [Eij,E1n]=δj1EinδinE1j, and δj1=0 because i<j with i1, while δin=0 because i<jn forces i<n; hence [Eij,E1n]=0.

L1L2
1.3

The adjoint submodule generated by E1n is all of sln. It contains H=[En1,E1n]=EnnE11; then [Enk,H] is a nonzero scalar multiple of Enk for every k<n. It also contains Ejn=[Ej1,E1n] for 1<j<n, as well as the original E1n. Finally, [Enk,Ejn]=δkjEnnEjk supplies every off-diagonal Ejk with j,k<n and every diagonal difference EnnEjj. These matrices span sln.

L2algebra
1.4

In the Euclidean model of the roots take the traceless vector v=(n1,n3,,1n): (v,εiεj)=2(ji), so it is regular and selects exactly i<j. Each positive root has the expansion εiεj=αi++αj1. The n1 vectors αj are independent: comparing successive coordinates in cj(εjεj+1)=0 gives every cj=0. If j>i+1 the root splits at i+1 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.

L1L3givenalgebra
2.1

For every positive root εiεj with i<j, one has (ε1εn)(εiεj)=(α1++αi1)+(αj++αn1), a nonnegative integral combination of simple roots. Thus ε1εn is the highest root. By steps 1.1–1.3, E1n 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 ε1εn. (Height and highest root, Highest-weight vectors and modules, step 1.1, step 1.2, step 1.3, step 1.4, L4) ∎

Depends on

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