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.
Omitting the central term breaks the affine GCM bracket
Statement refuted
The normalized untwisted affine realization is unchanged if its residue central term is deleted from the loop bracket while retaining .
Facts & Assumptions
Given: The fixed nonzero central generator and normalized highest-root vectors.
The bracket without a central term is Loop algebra of a simple Lie algebra.
The required affine coroot and bracket are The affine simple root alpha zero is delta minus the highest root.
These assignments realize the full GCM algebra by Loop and affine GCM presentations are isomorphic.
Counterexample
Take and . F1 gives . If we adjoin as an independent central vector but leave this bracket unchanged, it still has zero coordinate. F2 instead requires , whose coordinate is one. These vectors differ by the nonzero .
Thus the required mixed relation fails and F3's realization cannot persist. In the unextended loop algebra there is not even a vector for this independent central coordinate. Sending to zero does produce a quotient representation of the derived affine algebra, but it cannot be the claimed faithful full realization. For finite the same discrepancy is versus , already with degrees and form value one. This explicit witness refutes the assertion without any choice assumption.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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
- Kleshchev, Lectures on Infinite Dimensional Lie Algebras, equations (7.3)-(7.5) (standard reference, not scraped)
- Perrin, Introduction to Kac-Moody Groups and Lie Algebras, Theorem 12.2.15 (standard reference, not scraped)