Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Dual Coxeter number for the normalized invariant form

Definition

For a finite-dimensional complex simple Lie algebra g as in Loop algebra of a simple Lie algebra, use the invariant form B normalized by long roots of square 2 in Residue two cocycle on a loop algebra. The local trace calculation below shows that the Casimir ΩB from Casimir operator relative to an invariant form acts in the adjoint representation as γBI for a unique positive real scalar γB. Define the dual Coxeter number by h∨=γB/2. If a compact real form k from Compact real form of a complex semisimple Lie algebra is additionally supplied, then for every Q=−B∣k-orthonormal basis (Xi) one has −∑iad⁡(Xi)2=2h∨I. This is the normalization used in the affine central term and every Sugawara denominator below; existence of a compact real form is not needed to define h∨.

Facts & Assumptions

Given: A nonzero finite-dimensional complex simple Lie algebra g and its normalized invariant form B. A compact real form is extra input only for step 3.1.

[F1]

The normalization is B=cKg for a positive real scalar c; B is nondegenerate, symmetric and invariant (Residue two cocycle on a loop algebra). The Lie algebra is nonzero (Loop algebra of a simple Lie algebra).

[F2]

For B-dual bases xi,xi, the adjoint Casimir operator is C=∑iad⁡(xi)ad⁡(xi) (Casimir operator relative to an invariant form).

[F3]

The Killing form is Kg(x,y)=tr⁡g(ad⁡(x)ad⁡(y)) (Killing form). The endomorphism trace is the sum of the diagonal entries in any finite basis (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace tr⁡(A) as the sum of the diagonal entries).

[F4]

A supplied compact real form has negative-definite restricted Killing form (Compact real form of a complex semisimple Lie algebra). A finite-dimensional positive-definite real inner-product space has an orthonormal basis by finite Gram–Schmidt (Every finite-dimensional real or complex inner product space has an orthonormal basis).

Proof

Given: The Lie algebra and normalized form above; write N=dim⁡Cg>0.

1.1F1F3choosealgebra

Fix one finite basis x1,…,xN and its B-dual basis x1,…,xN, so B(xi,xj)=δij. If Txi=∑jtjixj, then B(Txi,xi)=tii by duality. Therefore [F3] gives tr⁡(T)=∑iB(Txi,xi). All choices here are finite and B is nondegenerate by [F1].

1.2F1F2F3step 1.1algebra

For arbitrary x,y∈g, [F2], symmetry and invariance give B(Cx,y)=∑iB([xi,[xi,x]],y)=∑iB([xi,x],[y,xi])=∑iB([x,[y,xi]],xi). Indeed the first conversion uses B([a,b],c)=B(b,[c,a]) with a=xi, and the second uses the same identity with a=x, followed by symmetry. Step 1.1 identifies the final sum with tr⁡(ad⁡(x)ad⁡(y))=Kg(x,y). Thus B(Cx,y)=Kg(x,y), with no compact real form or spectral assertion.

2.1F1step 1.2algebra

By [F1], Kg(x,y)=c−1B(x,y). Step 1.2 implies B(Cx−c−1x,y)=0 for every y, so nondegeneracy yields Cx=c−1x for every x. Hence C=γBI with γB=c−1>0. The scalar is unique because g≠0. Its half h∨=γB/2 is therefore well defined and positive without a compact-form existence theorem or a choice axiom.

3.1F1F2F4step 2.1choosealgebra∎

If a compact real form k is supplied, [F1] and [F4] make Q=−B∣k positive definite. Take a finite Q-orthonormal real basis (Xi) by [F4]; it is also a complex basis of g because k is a real form. Its B-dual basis is (−Xi), since B(Xi,−Xj)=δij. Thus [F2] gives C=−∑iad⁡(Xi)2, and step 2.1 identifies this with 2h∨I. This proves the conditional compact-basis formula without constructing a compact real form or inferring its existence from its definition.

Depends on

Used by

Dependency tree · two levels

24 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