Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Rationality in the admissible-module convention

Definition

In this page, a conformal vertex algebra of CFT type V is rational if every admissible V-module M=⨁n≥0M(n), as defined in Admissible module for a vertex operator algebra, is an internal direct sum M=⨁α∈ISα of irreducible admissible submodules. Each Sα is simple as a V-module in the sense of Module for an ordinary vertex algebra and carries the inherited grading Sα=⨁n≥0(Sα∩M(n)); thus the decomposition respects the specified admissible grading. The zero module is the empty direct sum. This is the admissible-module semisimplicity convention. The definition does not include a finite-number-of-simple-modules condition, C2-cofiniteness, self-contragredience, or a tensor-category conclusion; each is a separate property unless a theorem explicitly assumes or proves it.

Terminology varies across the literature. In particular, the “finite reductivity” conditions used in some tensor-category treatments include semisimplicity, finitely many irreducible modules, and finite fusion rules in their chosen module class. No equivalence between rationality and any Zhu-algebra, C2-cofiniteness, fusion, or modularity condition is part of this definition.

Depends on

Used by

Dependency tree · two levels

5 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