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 universal affine vacuum module is restricted
Statement
For every , the current action on from Universal affine vacuum module is restricted in the sense of Restricted affine-current module: for each and , for all sufficiently large positive integers .
Facts & Assumptions
Given: A finite-dimensional complex simple , its normalized affine central extension, level , and a vector in its universal affine vacuum module.
PBW basis of the universal affine vacuum module: every vector is a finite linear combination of ordered negative-mode monomials applied to .
Universal affine vacuum module: acts as and kills the vacuum.
Restricted affine-current module: restrictedness means every fixed vector is killed by all sufficiently large positive modes of each fixed current.
Proof
We prove by induction on the length of a negative-mode monomial that, for fixed , for all sufficiently large . For the empty monomial this holds for every , since kills .
For the induction step write with . By induction choose bounds for and . Take larger than both bounds and larger than . Then [F2] and [F3] give . The first two terms vanish by the chosen bounds and the central term vanishes because . This proves the induction step.
By [F1], any is a finite linear combination of such monomials. For each summand step 2.1 supplies a bound; the maximum of these finitely many bounds works for . This is exactly the restrictedness condition in [F4], with no energy grading or unitarity assumed.
Depends on
Used by
Dependency tree · two levels
11 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, §3.1 (standard reference, not scraped)