Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 k∈C, the current action on Vk(g) from Universal affine vacuum module is restricted in the sense of Restricted affine-current module: for each v∈Vk(g) and x∈g, xmv=0 for all sufficiently large positive integers m.

Facts & Assumptions

Given: A finite-dimensional complex simple g, its normalized affine central extension, level k∈C, and a vector in its universal affine vacuum module.

[F1]

PBW basis of the universal affine vacuum module: every vector is a finite linear combination of ordered negative-mode monomials applied to 1.

[F2]

Untwisted affine central extension: [xm,y−r]=[x,y]m−r+mB(x,y)δm,rK.

[F3]

Universal affine vacuum module: K acts as k and g[t] kills the vacuum.

[F4]

Restricted affine-current module: restrictedness means every fixed vector is killed by all sufficiently large positive modes of each fixed current.

Proof

1.1F1F3givenalgebra

We prove by induction on the length of a negative-mode monomial W1 that, for fixed x∈g, xmW1=0 for all sufficiently large m. For the empty monomial this holds for every m≥0, since g[t] kills 1.

2.1F1F2F3step 1.1algebra

For the induction step write W1=y−rW′1 with r≥1. By induction choose bounds for xmW′1 and [x,y]m−rW′1. Take m larger than both bounds and larger than r. Then [F2] and [F3] give xmy−rW′1=y−rxmW′1+[x,y]m−rW′1+mkB(x,y)δm,rW′1=0. The first two terms vanish by the chosen bounds and the central term vanishes because m>r. This proves the induction step.

3.1F1F4step 2.1algebra∎

By [F1], any v 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 v. 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