A Hilbert theorem for vertex algebras (Q707912)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Hilbert theorem for vertex algebras
scientific article

    Statements

    A Hilbert theorem for vertex algebras (English)
    0 references
    0 references
    8 October 2010
    0 references
    Let \(\mathcal{A}\) be a simple vertex algebra and \(G\) its compact group of automorphisms. It is a known fact that \(G\) and the invariant subalgebra \(\mathcal{A}^G\) behave like a dual reductive pair. There are various results concerning the structure of \(\mathcal{A}^G\) -- often this invariant vertex algebra is a current algebra, \(bc-\)system, \(\beta \gamma-\)system, or a tensor product of such algebras. Also, \(\mathcal{A}^G\) tends to be strongly finitely generated as a vertex algebra, but for \(\mathrm{gr}(\mathcal{A}^G)\), regarded as a sort of ''classical limit'' of \(\mathcal{A}^G\), generally an infinite number of generators and relations is needed. The author focuses on invariant subalgebras of the \(\beta \gamma-\)system \(\mathcal{S}(V)\) associated to \(V = \mathbb{C}^n\). The action of \(\mathrm{GL}_n\) on \(\mathcal{S}(V)\) by automorphisms is induced from the standard action of \(\mathrm{GL}_n\) on \(V\), and one may consider \(\mathcal{S}(V)^G\) for any reductive subgroup \(G\) of \(\mathrm{GL}_n\). It was shown by Kac and Radul that \(\mathcal{S}(V)^{\mathrm{GL}_n}\) is isomorphic to the vertex algebra \(\mathcal{W}_{1+\infty,-n}\) with central charge \(-n\) and a minimal, strong generating set of \(n^2+2n\) generators. Using both tools from classical invariant theory and the structure and representation theory of \(\mathcal{W}_{1+\infty,-n}\), the author shows that for every reductive subgroup \(G\) of \(\mathrm{GL}_n\), the vertex algebra \(\mathcal{S}(V)^G\) is strongly finitely generated. These methods are then extended to the case of invariant subalgebras of \(bc-\)systems and \(bc \beta \gamma-\)systems.
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers