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.
Mode translation descends to the affine vacuum module
Statement
For from Universal affine vacuum module, the assignment on is a Lie-algebra derivation preserving . It induces an operator on such that and .
Facts & Assumptions
Given: The normalized affine central extension, its current modes, and the induced module at level .
Untwisted affine central extension: , where is central.
Universal affine vacuum module and The affine vacuum character exists at every complex level: , acts as zero on , and acts as .
Proof
For current modes, , whereas . If the Kronecker factor is nonzero then , so its central coefficient is zero. Thus the two expressions agree. Brackets with also satisfy the derivation identity because is central and . Bilinearity proves that is a Lie derivation on all finite sums.
If , then , while and . Hence . Extend to the tensor algebra by the Leibniz rule. It preserves the ideal generated by , since its derivative is a sum of the same defining relations with or replaced by or . Therefore it descends to a derivation of .
Define . This respects the induced-module relation for : the Leibniz rule gives the same term on both sides, and the remaining term equals because and the vacuum character kills and . Thus is well-defined. Since , , and for every current mode the defining derivation action gives .
Depends on
Used by
Dependency tree · two levels
8 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
- Tomoyuki Arakawa and Anne Moreau, Arc spaces and vertex algebras, Proposition 3.1 (standard reference, not scraped)