Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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 basic form is the Killing form divided by twice the dual Coxeter number

Statement

Let g be a finite-dimensional complex simple Lie algebra with Killing form BKill. Choose a Cartan subalgebra h and a positive root system Φ+ with highest root θ, and put ρ:=12∑α∈Φ+α. For each λ∈h∗ let Hλ,Kill∈h be the unique vector satisfying BKill(Hλ,Kill,H)=λ(H) for every H∈h, and define the induced form on h∗ by (λ,μ)Kill:=BKill(Hλ,Kill,Hμ,Kill). This extends the supplied convention BKill(Hα,Kill,H)=α(H) for roots α. Set c:=2/(θ,θ)Kill and B0:=BKill/c. For each λ∈h∗, let Hλ,0∈h satisfy B0(Hλ,0,H)=λ(H) for every H∈h, and put (λ,μ)0:=B0(Hλ,0,Hμ,0). Then (θ,θ)0=2. Define the coroot θ∨:=2Hθ,0/(θ,θ)0=Hθ,0 and the dual Coxeter number h∨:=1+ρ(θ∨). Then

BKill=2h∨B0.

Facts & Assumptions

Given: A finite-dimensional complex simple Lie algebra, its Killing form, a chosen Cartan and positive root system, highest root θ, Weyl vector ρ, and the normalized form B0 specified in the Statement.

[F1]

The Killing form of a semisimple Lie algebra: BKill(x,y)=tr⁡(ad⁡xad⁡y).

[F2]

Finite semisimple Cartan, root and string structure: root spaces are one-dimensional, the Killing form is nondegenerate on the Cartan, and for each root α the vector Hα,Kill is characterized by BKill(Hα,Kill,H)=α(H). The adjoint representation has highest weight θ, and the root system has the stated finite Euclidean structure.

[F3]

The quadratic Casimir element: for Killing-dual bases, CKill=∑axaxa in U(g).

[F4]

The Weyl vector rho for a chosen positive system: ρ=12∑α∈Φ+α.

[F5]

The quadratic Casimir eigenvalue on a highest-weight module is (λ,λ+2ρ): on a cyclic highest-weight module of weight λ, the Killing-form Casimir acts by (λ,λ+2ρ)Kill.

Proof

technique · compute the adjoint Casimir eigenvalue twice, first by the trace definition of the Killing form and then by the highest-weight formula
1.1F1F2F3F5givenalgebra

The adjoint module is irreducible because any invariant subspace of g is an ideal and g is simple. A highest-root vector generates this nonzero module, so [F5] with λ=θ says the Casimir [F3] acts on g by a scalar λad=(θ,θ+2ρ)Kill. On the other hand, for any Killing-dual bases (xa),(xa), its adjoint action is ∑aad⁡xaad⁡xa; its trace is ∑aBKill(xa,xa)=dim⁡g by [F1]. Since the action is scalar on the nonzero space g, this trace gives λad=1.

2.1F2F4step 1.1algebra

Since B0=BKill/c, the defining equations give Hλ,0=cHλ,Kill for every λ∈h∗, and hence (λ,μ)0=c(λ,μ)Kill. The choice of c gives (θ,θ)0=2. By definition, θ∨=Hθ,0, and (ρ,θ)0=B0(Hρ,0,Hθ,0)=ρ(Hθ,0)=ρ(θ∨)=h∨−1. Therefore λad=(θ,θ+2ρ)Kill=c−1(2+2(h∨−1))=2h∨/c.

3.1step 1.1step 2.1algebra∎

Equating the two expressions for λad from steps 1.1 and 2.1 gives 1=2h∨/c, hence c=2h∨. Substitution into B0=BKill/c proves the asserted form identity.

Depends on

Dependency tree · 2 levels

Sources