C₂-Cofiniteness, Rationality, and Regularity
-cofiniteness is a finite-dimensional quotient condition, rationality is semisimplicity for admissible modules, and regularity is semisimplicity for all weak modules. They are not interchangeable definitions. For a VOA of CFT type, regularity is equivalent to rationality together with -cofiniteness; deleting rationality is invalid, as the logarithmic triplet algebras are -cofinite but nonsemisimple.
Required background. Vertex Operator Algebras: Axioms, Grading, and Locality supplies modes and gradings. Modules, Intertwining Operators, and Tensor Categories distinguishes weak, admissible, ordinary, and generalized modules. Minimal Models and Fusion Rules supplies the Ising model used below.
Helpful background. Modular Crossing and Spectral Bounds explains why finite modular data matter physically.
Three distinct finiteness conditions
Section titled “Three distinct finiteness conditions”For a VOA , define
The VOA is -cofinite if is finite-dimensional. This quotient is a commutative Poisson algebra: the products induced by and retain a finite shadow of the operator products. Cofiniteness strongly constrains spanning sets, characters, and differential equations, but says nothing by itself about splitting extensions of modules.
Fix the following conventions. “Rational” means every admissible, -gradable module is a direct sum of irreducible admissible modules. “Regular” means every weak module is a direct sum of irreducible ordinary modules. A VOA is of CFT type when for and . With these definitions, Abe, Buhl, and Dong prove:
Theorem. If is of CFT type, then is regular if and only if it is both rational and -cofinite Abe, Buhl, and Dong 2004, Theorem 4.5, pp. 3397–3398.
The forward direction includes both semisimplicity and finite spanning control. For the reverse direction, cofiniteness forces irreducible weak modules to be ordinary and supplies finite mode-spanning sets; rationality then splits admissible subquotients. The proof is not the assertion that a finite-dimensional quotient makes every module semisimple. That false step would confuse finite representation type with vanishing extension groups.
Consequences also require their own hypotheses. Under -cofiniteness, irreducible weak modules are ordinary and fusion rules are finite in the setting of the cited theorem. A finite set of irreducibles plus modularly behaved trace functions still does not automatically yield rigidity or a modular tensor category; those need the tensor-category theorems and their self-duality and semisimplicity assumptions.
The Ising quotient
Section titled “The Ising C2C_2C2 quotient”The first QFT application is the minimal model treated in Minimal Models and Fusion Rules. Let be generated by the conformal vector . Modulo , every state containing a Virasoro mode with vanishes after rewriting it as a derivative or an element . Therefore the quotient is generated by .
The vacuum singular vector at level six has a nonzero term; every other term contains either with or derivatives that vanish in the quotient. Hence its image gives . The lower classes survive, so
This explicit three-dimensional quotient proves -cofiniteness for the Ising VOA. Separately, minimal-model representation theory proves rationality. The theorem above then yields regularity. Notice that the quotient dimension happens here to equal the number of irreducible ordinary modules, but no general theorem identifies those two integers; the Zhu algebra, not the quotient, controls lowest-weight module data.
An independent check comes from the graded spanning set. Since , the quotient has representatives only at weights . Direct inspection of the vacuum module shows nonzero classes at those weights and no additional generator, confirming dimension three.
Counterexample: the triplet algebra
Section titled “Counterexample: the triplet algebra”For , the triplet VOA has central charge
Adamović and Milas prove that is -cofinite and has inequivalent irreducible modules, but is irrational; nonsplit indecomposable and logarithmic modules occur Adamović and Milas 2008, Theorems 2.1, 3.12, and Proposition 4.2, pp. 2674–2687. Thus
This is the adversarial test: any argument that infers semisimplicity merely from a finite quotient must misclassify . What survives is finite mode-spanning control and a finite irreducible set, together with logarithmic modular phenomena; what fails is decomposition of every module into simples.
The counterexample is structural rather than numerical: its indecomposable modules retain extension data that neither the quotient dimension nor the irreducible count can detect.
Exercises
Section titled “Exercises”- Explain why regularity implies rationality under the definitions above.
Solution
Every admissible module is in particular a weak module. Regularity decomposes it into irreducible ordinary modules, and ordinary modules are admissible after shifting the lowest conformal weight. Hence every admissible module is completely reducible.- Why does finite-dimensionality of not rule out an Jordan block?
Solution
The quotient constrains states of $V$ and the mode monomials needed to span modules; it does not force short exact sequences of modules to split. A generalized module may therefore have a nilpotent part of $L_0$ even when the quotient is finite-dimensional, as $\mathcal W(p)$ demonstrates.References
Section titled “References”- Abe, Toshiyuki, Geoffrey Buhl, and Chongying Dong. “Rationality, Regularity, and -Cofiniteness.” Transactions of the American Mathematical Society 356 (2004), 3391–3402. DOI.
- Adamović, Dražen, and Antun Milas. “On the Triplet Vertex Algebra .” Advances in Mathematics 217 (2008), 2664–2699. DOI. Open PDF.