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.
An explicit logarithmic conformal Heisenberg module
Example
For the rank-one Heisenberg conformal VOA, take with , , , and . The positive modes are and negative modes are . Its fields are the normal-ordered divided derivatives in the A-page construction, not constant dual-number fields. It is an admissible, grading-restricted logarithmic module, and on its lowest generalized weight space
Facts & Assumptions
Given: The concrete zero-mode matrix and oscillator action above.
The Heisenberg Jordan Fock family is grading-restricted; it is logarithmic exactly when λ is nonzero proves the full conformal-VOA module construction, module Jacobi, truncation, admissibility and generalized weight spaces, with at .
Logarithmic generalized module requires grading restriction and a nontrivial Jordan chain for .
Verification
In the ordered basis , has matrix and square zero. Thus , giving the two displayed matrices by [F1]. In particular and . These are an actual length-two conformal Jordan chain, not just a nonsemisimple action of an unrelated algebra element.
On a weighted-degree- monomial , and . The generalized weights are exactly , with finite spaces and lower bound , by [F1]. Therefore the module meets every grading restriction and is logarithmic by [F2]. Formally on this pair, exponentiating the nilpotent part terminates and gives ; this explains the terminology while the module fields themselves remain the ordinary Laurent fields already proved in [F1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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 (standard reference, not scraped)