Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 vacuum character exists at every complex level

Statement

Let g be finite-dimensional complex simple, let Lg‾ be the central extension of Untwisted affine central extension, write K=c for its central basis vector, and let k∈C. The subspace p=g[t]⊕CK is a Lie subalgebra, and the assignment g[t]∋x⊗tn↦0, K↦k defines a one-dimensional representation Ck of p.

Facts & Assumptions

Given: The finite-dimensional complex simple Lie algebra, its normalized form, the loop central extension, and k∈C.

[F1]

Untwisted affine central extension: [xm,yn]=[x,y]m+n+mδm,−nB(x,y)K, and K is central.

Proof

1.1F1algebra

For m,n≥0, the loop term [x,y]m+n belongs to g[t]. The central term in [F1] can be nonzero only if m+n=0, which for nonnegative m,n forces m=n=0 and hence its coefficient m is zero. Thus g[t] is closed under brackets in the central extension, and K commutes with it. Bilinearity extends this to all finite sums in p.

2.1step 1.1F1algebra∎

The proposed scalar action sends every bracket in g[t] to zero, agrees with the zero bracket between K and g[t], and sends [K,K]=0 to zero. Hence it is a Lie-algebra representation on the one-dimensional space Ck; the scalar k is unrestricted.

Depends on

Used by

Dependency tree · two levels

5 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