Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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 affine simple root alpha zero is delta minus the highest root

Statement

The finite root system of a nonzero complex simple g has a unique highest root θ: every root β satisfies θβQ+. This root is long. Normalize (θ,θ)=2 and set α0=δθ, h0=cθ. Together with the finite simple roots and coroots these are minimal realization data for the untwisted affine GCM A^=(αj(hi))0i,j. For normalized opposite root vectors, [fθt,eθt1]=h0.

Facts & Assumptions

Given: A nonzero finite-dimensional complex simple Lie algebra.

[F1]

Finite root spaces, coroots, strings and simple generation are Finite semisimple Cartan, root and string structure.

[F2]

Finite-dimensional simple modules have a unique dominant integral highest weight and support below it by Finite semisimple PBW and highest-weight construction.

[F3]

The finite simple roots form a basis, their coordinates have one sign, and the simple coroots form an integral coroot basis by Finite Weyl positive roots and simple reflections.

[F4]

The form normalization and residue mode coefficient are Residue two cocycle on a loop algebra.

[F5]

The extended Cartan, finite-root extensions and δ are Null root, central coroot, and affine level.

[F6]

The matrix axioms are Generalized cartan matrix and the minimal-realization conditions are Realization of a generalized cartan matrix.

Proof

1.1

The adjoint module is simple, since its invariant subspaces are ideals. F2 therefore gives a dominant integral highest weight θ and support in θQ+. Its weights by F1 are 0 and the roots. The top weight cannot be zero: the support contains both a root β and β, whereas neither pair can both lie in Q+ by F3. Thus θ is a positive root dominating all roots. Any other root with that property dominates θ and is dominated by it, so equals it by independence of the simple roots. Write θ=imiαi; since each αiθ, every integer mi1.

F1F2F3algebra
2.1

Every finite root can be moved to a dominant root of the same length: if β(hi)<0, replace β by siβ=ββ(hi)αi. This increases its integer height and stays in the finite root set, so iteration terminates with all pairings nonnegative. For that dominant root γ, step 1.1 gives θγ=iniαi with ni0. Dominance of θ,γ then gives (θ,θ)(γ,γ)=ini(αi,θ+γ)0. Hence θ has maximal root length and the normalization in F4 is (θ,θ)=2.

F1F2F3F4step 1.1algebra
3.1

Choose [eθ,fθ]=θ using F1. Invariance gives B(eθ,fθ)=2/(θ,θ)=1 as in F4. Thus the mode bracket gives [fθt,eθt1]=θ+c=h0. The diagonal entry α0(h0) is 2; for i>0, α0(hi)=θ(hi) and αi(h0)=αi(θ). They are nonpositive integers by dominance of θ and crystallographic integrality, and vanish simultaneously since both are positive multiples of (θ,αi). The finite entries already satisfy the GCM axioms.

F1F4F5F6step 2.1algebra
4.1

Put β0=θ and βi=αi for i>0. The matrix of step 3.1 has entries 2(βi,βj)/(βi,βi). Multiplication of row i by (βi,βi)/2 gives the symmetric Gram matrix of these +1 vectors. It is positive semidefinite of rank , since the finite simple roots are a basis. Its kernel is spanned by (1,m1,,m), all entries positive. Each proper principal Gram matrix is positive definite: any dependence would extend to a kernel vector with a zero coordinate, impossible. This is the affine, rather than finite, symmetrizable matrix associated with the highest-root extension; it defines the untwisted affine convention here.

F3step 1.1step 3.1algebra
5.1

The h0,h1,,h are independent since only h0 has a nonzero c coordinate; the α0,α1,,α are independent since only α0 is nonzero on d. Also dimh^=+2=2(+1)rankA^. Together with step 3.1 these verify every minimal-realization condition. All root selections and height iterations were finite. Rank one is included: the same formulas give (2222).

F3F5F6step 3.1step 4.1algebra

Depends on

Used by

Dependency tree · two levels

17 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