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.

Standard and dual representations of sl_n

Example

Assume the Axiom of Choice. Let n2, g=sln(C)={AMn(C):trA=0} (Classical complex matrix Lie algebras), let h be the diagonal traceless matrices, let ε1,,εnh be the coordinate functionals εi(H)=Hii, and let the positive system be the roots εiεj with i<j, with base αj=εjεj+1 (Root systems of the classical complex Lie algebras). Then the standard module Cn with its natural action is irreducible of highest weight ω1=ε1, and its dual is irreducible of highest weight ωn1=εn (Fundamental weights).

Facts & Assumptions

Given: The Axiom of Choice, such g, its diagonal Cartan h, the matrix units Eij, the coordinate functionals εi, the positive system {εiεj:i<j} with simple roots αj=εjεj+1, the Killing form B (Killing form), the standard module V=Cn with basis e1,,en, and its dual V with dual basis e1,,en.

[A1]

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

[L1]

The roots of g with respect to h are the functionals εiεj, ij, with root spaces CEij; each is one-dimensional and the root set is a reduced crystallographic Euclidean root system of type An1 (Root systems of the classical complex Lie algebras).

[L2]

For α=εiεj the coroot is hα=EiiEjj: on diagonal traceless X=diag(x1,,xn) one has B(X,X)=tr(adX2)=ij(xixj)2=2ntr(X2), so B(EiiEjj,H)=2ntr((EiiEjj)H)=2n(HiiHjj) and the normalisation hα=2Hα/α(Hα) gives hα=EiiEjj (Coroot of a Lie-algebra root).

[L3]

The fundamental weights are the functionals dual to the simple coroots: ωk(hαj)=δkj, and the simple coroots form a basis of h (Fundamental weights, The roots form a reduced crystallographic Euclidean root system).

[L4]

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

[L5]

For n2, the Killing form of sln(C) is the nondegenerate form B(X,Y)=2ntr(XY) (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

technique · direct
1.1

The action on V is Hei=Hiiei and Eijel=δjlei; hence the weights of V are ε1,,εn, each with one-dimensional weight space, and e1 is killed by every positive root vector Eij with i<j, since j>i1 forces j1.

L1L5given
1.2

V is irreducible: if 0v=iviei and vl0, then Eilv=vlei for every il. Choose one such i (possible since n2); applying Eli to the resulting ei gives el. All matrix units used are off-diagonal and belong to sln. Hence every basis vector belongs to the submodule generated by v, which equals V.

given
1.3

For the dual module the action is (Xφ)(v)=φ(Xv), so the weights of V are ε1,,εn on the dual basis vectors ei; the vector en is killed by every positive root vector: (Eijen)(v)=en(Eijv)=en(vjei)=vjδin=0 because i<jn gives in.

given
2.1

By [L2] and [L3], ε1(hαj)=ε1(EjjEj+1,j+1)=δ1j=ω1(hαj) for every j, and the simple coroots span h; hence ε1=ω1, so V is irreducible with highest weight ω1 by steps 1.1, 1.2 and [L4].

A1L2L3L4step 1.1step 1.2
2.2

V is irreducible: if 0WV is a submodule, then its annihilator WV is a submodule: for vW and φW, φ(Xv)=(Xφ)(v)=0. Its dimension is dimW=ndimW<n, hence W=0 by step 1.2 and W=V.

givenstep 1.2
3.1

Finally εn(hαj)=(EjjEj+1,j+1)nn=δj,n1=ωn1(hαj) for every j, so εn=ωn1 by [L3]; hence V is irreducible of highest weight ωn1 by steps 1.3, 2.2 and [L4].

A1L2L3L4step 1.3step 2.2

Depends on

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