Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (gpt-6.1-sol)
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.

Quasi-finite-dimensional generalized module

Statement

Let W=⨁h∈RW[h] be a generalized V-module with real generalized L(0)-weights. It is quasi-finite-dimensional if for every real N the strict cutoff sum ⨁h<NW[h] is finite dimensional.

Facts & Assumptions

Given: Work over C with the formal-variable, grading, and branch conventions in the linked definitions.

[F1]

Grading-restricted generalized module: Let V be a conformal vertex algebra of CFT type and M a left V-module. Write LM(0) for the coefficient determined by YM(ω,z)=∑n∈ZLM(n)z−n−2. For h∈C, define the generalized LM(0)-eigenspace M[h]={m∈M:(LM(0)−h)Nm=0 for some integer N≥1}. The module is grading-restricted generalized if M=⨁h∈CM[h], every M[h] is finite dimensional, and the real parts of its nonzero generalized weights are bounded below. The direct sum means each vector has only finitely many generalized-weight components. This convention explicitly adds finite-dimensionality and a lower bound to the generalized-eigenspace decomposition; those conditions are not consequences of the module Jacobi identity.

Proof

1.1givenF1algebra

The generalized-weight decomposition makes each strict cutoff sum a defined subspace of W.

2.1givenF1step 1.1algebra∎

Assume the quasi-finite condition. Each W[h] is contained in the finite-dimensional cutoff sum for N=h+1, so each weight space is finite dimensional. The cutoff sum for N=0 can contain only finitely many nonzero weight spaces: vectors from distinct summands are linearly independent, so their number is at most the dimension of that cutoff. If there are negative weights, their finite nonempty set has a least element B; otherwise put B=0. Every nonzero weight is then at least B. Thus quasi-finite-dimensionality implies both finite-dimensional weight spaces and a global lower bound, and hence grading restriction in the real-weight setting of F1. The definition retains the additional requirement that every cutoff sum be finite dimensional.

Depends on

Dependency tree · 2 levels

Sources