Defining relation for semi-invariants of three by three matrix triples (Q1934961)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Defining relation for semi-invariants of three by three matrix triples
scientific article

    Statements

    Defining relation for semi-invariants of three by three matrix triples (English)
    0 references
    0 references
    0 references
    30 January 2013
    0 references
    Denote by \(M_n(K)\) the space of \(n\times n\) matrices over an infinite field \(K\). The direct product of two copies of the general linear group \(G_n=\mathrm{GL}_n(K)\times \mathrm{GL}_n(K)\) acts linearly on \(M_n(K)\): the group element \((g,h)\) maps \(A\in M_n(K)\) to \(gAh^{-1}\). Take the direct sum \(M_n(K)^m=M_n(K)\oplus\cdots\oplus M_n(K)\) of \(m\) copies of this representation of \(G_n\). The action of \(G_n\) induces an action of the algebra of polynomial functions \(K[M_n(K)^m]\) in the usual way. Let \(R_{n,m}(K)\) be the subalgebra of the invariants of the subgroup \(\mathrm{SL}_n(K)\times \mathrm{SL}_n(K)\) of \(G_n\). It is called the algebra of semi-invariants of \(G_n\) on \(M_n(K)^m\). The structure and minimal systems of generators of \(R_{n,m}(K)\) are known in a few cases only. Apart from the case \(n=2\) for any \(m\) and \(m=2\) for any \(n\), the only other case when a minimal system of generators of \(R_{n,m}(K)\) is explicitly known is \(n=m=3\), and this algebra is the main object to study in the paper under review. The authors find a uniform description of \(R_{3,3}(K)\) in terms of a minimal generating system and the corresponding relations, valid over any infinite base field \(K\) and also for \(K=\mathbb Z\). More specifically, \(R_{3,3}(K)\) is minimally generated as a \(K\)-algebra by \(12\) elements \(q,h,f_j,j=1,\dots,10\), satisfying the single algebraic relation \(A(g,h,f_1,\dots,f_{10})=0\), where \(A\) is an explicitly calculated polynomial with integer coefficients.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references