The first cohomology, derivations and the reductivity of a (meromorphic open-string) vertex algebra

preprint2020arXivOpen access

Abstract

We give a criterion for the complete reducibility of modules satisfying a composability condition for a meromorphic open-string vertex algebra VV using the first cohomology of the algebra. For a VV-bimodule MM, let H^∞1(V,M)\hat{H}^{1}_{\infty}(V, M) be the first cohomology of VV with the coefficients in MM. Let Z^∞1(V,M)\hat{Z}^{1}_{\infty}(V, M) be the subspace of H^∞1(V,M)\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 11 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 H^∞1(V,M)=Z^∞1(V,M)\hat{H}^{1}_{\infty}(V, M)= \hat{Z}^{1}_{\infty}(V, M) for every Z\Z-graded VV-bimodule MM, then every left VV-module satisfying a composability condition is completely reducible. In particular, since a lower-bounded Z\Z-graded vertex algebra VV is a special meromorphic open-string vertex algebra and left VV-modules are in fact what has been called generalized VV-modules with lower-bounded weights (or lower-bounded generalized VV-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 VV contains a subalgebra satisfying some familiar conditions, the composability condition for grading-restricted generalized VV-modules always holds and we need H^∞1(V,M)=Z^∞1(V,M)\hat{H}^{1}_{\infty}(V, M)= \hat{Z}^{1}_{\infty}(V, M) only for every Z\Z-graded VV-bimodule MM generated by a grading-restricted subspace in our complete reducibility theorem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.