The first cohomology, derivations and the reductivity of a (meromorphic open-string) vertex algebra
Bibliographic record
Abstract
We give a criterion for the complete reducibility of modules satisfying a composability condition for a meromorphic open-string vertex algebra $V$ using the first cohomology of the algebra. For a $V$-bimodule $M$, let $\hat{H}^{1}_{\infty}(V, M)$ be the first cohomology of $V$ with the coefficients in $M$. Let $\hat{Z}^{1}_{\infty}(V, M)$ be the subspace of $\hat{H}^{1}_{\infty}(V, M)$ canonically isomorphic to the space of derivations obtained from the zero mode of the right vertex operators of weight $1$ elements such that the difference between the skew-symmetric opposite action of the left action and the right action on these elements are Laurent polynomials in the variable. If $\hat{H}^{1}_{\infty}(V, M)= \hat{Z}^{1}_{\infty}(V, M)$ for every $\Z$-graded $V$-bimodule $M$, then every left $V$-module satisfying a composability condition is completely reducible. In particular, since a lower-bounded $\Z$-graded vertex algebra $V$ is a special meromorphic open-string vertex algebra and left $V$-modules are in fact what has been called generalized $V$-modules with lower-bounded weights (or lower-bounded generalized $V$-modules), this result provides a cohomological criterion for the complete reducibility of lower-bounded generalized modules for such a vertex algebra. We conjecture that the converse of the main theorem above is also true. We also prove that when a grading-restricted vertex algebra $V$ contains a subalgebra satisfying some familiar conditions, the composability condition for grading-restricted generalized $V$-modules always holds and we need $\hat{H}^{1}_{\infty}(V, M)= \hat{Z}^{1}_{\infty}(V, M)$ only for every $\Z$-graded $V$-bimodule $M$ generated by a grading-restricted subspace in our complete reducibility theorem.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".