Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

On m-tuples of nilpotent 2×2 matrices over an arbitrary field

    https://doi.org/10.1142/S0218196724500504Cited by:0 (Source: Crossref)

    Abstract

    The algebra of GLn-invariants of m-tuples of n×n matrices with respect to the action by simultaneous conjugation is a classical topic in case of infinite base field. On the other hand, in case of a finite field generators of polynomial invariants are not known even for a pair of 2×2 matrices. Working over an arbitrary field we classified all GL2-orbits on m-tuples of 2×2 nilpotent matrices for all m>0. As a consequence, we obtained a minimal separating set for the algebra of GL2-invariant polynomial functions of m-tuples of 2×2 nilpotent matrices. We also described the least possible number of elements of a separating set for an algebra of invariant polynomial functions over a finite field.

    1. Introduction

    1.1. Algebras of invariants

    All vector spaces, algebras, and modules are over an arbitrary (possibly finite) field 𝔽 of arbitrary characteristic p0 unless otherwise stated. By an algebra we always mean an associative algebra with unity.

    Consider an n-dimensional vector space V over the field 𝔽 with a fixed basis v1,,vn. The coordinate ring 𝔽[V]=𝔽[x1,,xn] of V is isomorphic to the symmetric algebra S(V) over the dual space V, where x1,,xn is the basis for V. Let G be a subgroup of GL(V)GLn(𝔽). The algebra 𝔽[V] becomes a G-module with

    (gf)(v)=f(g1v)(1)
    for all fV and vV. The algebra of polynomial invariants is defined as follows:
    𝔽[V]G={f𝔽[V]|gf=ffor allgG}.

    The algebra of polynomial functions 𝒪(V)=𝔽[¯x1,,¯xn], where ¯xi:vvi for v=(v1,,vn)V with respect to the fixed basis of V. The algebra 𝒪(V) becomes a G-module by formula (1) for all f𝒪(V) and vV. The algebra of invariant polynomial functions is defined as follows:

    𝒪(V)G={f𝒪(V)|gf=ffor allgG}={f𝒪(V)|f(gv)=f(v)for allgG,vV}.
    Obviously, 𝒪(V)𝔽[V]Ker (Ψ) for the homomorphism of algebras Ψ:𝔽[V]𝒪(V) defined by xi¯xi. In case 𝔽 is infinite we have that Ker (Ψ)=0 and 𝔽[V]G=𝒪(V)G. If 𝔽=𝔽q is a finite field, then the ideal Ker (Ψ) is generated by xqixi for all 1in. Using Ψ we can consider any element f𝔽[V] as the map V𝔽. Namely, we write f(v) for Ψ(f)(v), where vV. For any infinite extension 𝔽𝕂 we denote V𝕂=V𝔽𝕂. Therefore,
    𝔽[V]G={f𝔽[V]|f(gv)=f(v)for allgG,vV𝕂}{f𝔽[V]|f(gv)=f(v)for allgG,vV}.

    Assume that WV is a G-invariant subset of V. The algebra of polynomial functions 𝒪(W) on W is generated by functions y1,,yn:W𝔽, where yi is the restriction of ¯xi:V𝔽 to W. The algebra 𝒪(W) becomes a G-module by formula (1) for all f𝒪(W) and vW. Denote by I(W) the ideal of all f𝒪(W) that are zeros over W. Then we have 𝒪(W)𝒪(V)I(W) and yi=¯xi+I(W). The algebra 𝒪(W)G of invariant polynomial functions on W is defined in the same way as 𝒪(V)G. The degree of f𝒪(W) is defined as the minimal degree of a polynomial h𝔽[V] with f=Ψ(h)+I(W).

    1.2. Separating invariants

    In 2002, Derksen and Kemper [6] (see [7] for the second edition) introduced the notion of separating invariants as a weaker concept than generating invariants. Given a subset S of 𝒪(W)G, we say that elements u,v of W are separated by S if exists an invariant fS with f(u)f(v). If u,vW are separated by 𝒪(W)G, then we simply say that they are separated. A subset S𝒪(W)G of the invariant ring is called separating if for any v,w from W that are separated we have that they are separated by S. A separating subset for 𝔽[V]G is defined in the same manner. We say that a separating set is minimal if it is minimal w.r.t. inclusion. Obviously, any generating set is also separating. Denote by βsep(𝒪(W)G) the minimal integer βsep such that the set of all invariant polynomial functions of degree less than or equal to βsep is separating for 𝒪(W)G. Minimal separating sets for different actions were constructed in [5, 16, 17, 27, 28, 33, 34, 37].

    Separating invariants for 𝔽[V]G in case of a finite field 𝔽=𝔽q with q elements were studied by Kemper, Lopatin and Reimers in [28]. Namely, it was shown that the minimal number of separating invariants for 𝔽[V]G is γ(q,κ)=logq(κ), where κ stands for the number of G-orbits in V, and an explicit construction of a minimal separating set of γ(q,κ) invariants of degree at most |G|n(q1) was given. Moreover, a minimal separating set of γ(q,κ) invariants of degree n(q1) in the non-modular case was constructed as well as in the case when G consists entirely of monomial matrices.

    1.3. Matrix invariants

    For n>1 and m1, the direct sum Mmn of m copies of the space of n×n matrices over 𝔽 is a GLn-module with respect to the diagonal action by conjugation: gA̲=(gA1g1,,gAdg1) for gGLn and A̲=(A1,,Ad) from Mmn. Given a matrix A, denote by Aij the (i,j)th entry of A. Any element of the coordinate ring

    𝔽[Mmn]GLn=𝔽[xij(k)|1i,jn,1km]
    of Mmn can be considered as the polynomial function xij(k):Mmn𝔽, which sends (A1,,Am) to (Ak)ij. The algebra of invariant polynomial functions 𝒪(Mmn)GLn is defined as in Sec. 1.1.

    Sibirskii [38], Procesi [35] and Donkin [18] established that the algebra of invariant polynomial functions 𝒪(Mmn)GLn is generated by σt(Xk1Xkr) in case 𝔽 is infinite, where Xk stands for the n×n generic matrix (xij(k))1i,jn and σt stands for the tth coefficient of the characteristic polynomial, i.e., det(λEA)=nt=0(1)tλntσt(A) for any n×n matrix A over a commutative ring. In particular, σ0(A)=1, σ1(A)=tr(A) and σn(A)=det(A).

    For a monomial c𝔽[Mmn] denote by degc its degree and by mdegcm its multidegree, where stands for the set of non-negative integers. Namely, mdegc=(t1,,td), where tk is the total degree of the monomial c in xij(k), 1i,jn, and degc=t1++tm.

    In case of an infinite field of arbitrary characteristic the following minimal separating set for 𝒪(Mm2)GL2 was given by Kaygorodov, Lopatin and Popov [27]:

    tr(X2k),1km;tr(Xk1Xkr),r{1,2,3},1k1krm.(2)
    Note that set (2) generates the algebra 𝒪(Mm2)GL2 if and only if the characteristic of 𝔽 is different from two or m3 (see [11, 36]). A minimal generating set for 𝒪(Mm3)GL3 was given by Lopatin in [29, 30, 31] in the case of an arbitrary infinite field. Over a field of characteristic zero a minimal generating set for 𝒪(M2n)GLn was established by Drensky and Sadikova [19] in case n=4 (see also [40]) and by Đoković [8] in case n=5 (see also [9]). Some upper bounds on degrees of generating and separating invarints for 𝒪(Mmn)GLn were given by Derksen and Makam in [13, 14]. A minimal separating set for the algebra of matrix semi-invariants 𝒪(Mm2)SL2×SL2 was explicitly described by Domokos [16] over an arbitrary algebraically closed field. Note that a minimal generating set for 𝒪(Mm2)SL2×SL2 was given by Lopatin [32] over an arbitrary infinite field (see also [17]). Elmer [20, 21] obtained lower bounds on the least possible number of elements for separating sets for 𝒪(Mm2)GL2 and 𝒪(Mm2)SL2×SL2 in case 𝔽=. More results on separating invariants of matrices can be found in [39].

    1.4. Nilpotent matrices

    Denote by 𝒩n the set of all n×n nilpotent matrices, i.e., AMn belongs to 𝒩n if and only if σ1(A)=σ2(A)==σn(A)=0, or equivalently, An=0.

    Over a finite field, the number of GLn-orbits on 𝒩mn was studied by Hua [24]. The variety of pairs of commuting nilpotent matrices has extensively been studied over the past 40 years (see [1, 2, 3, 4, 25, 26] for more details).

    The algebra of polynomial functions 𝒪(𝒩mn) of 𝒩mnMmn is generated by yij(k) for 1i,jn and 1km, where yij(k):𝒩mn𝔽 sends (A1,,Am) to (Ak)ij. As in Sec. 1.1 we have 𝒪(𝒩mn)=𝒪(Mmn)I(𝒩mn). The algebra 𝒪(𝒩mn)GLn of invariant polynomial functions on nilpotent matrices is defined in the same way as 𝒪(Mmn)GLn. Note that σt(Yk1Ykr) lies in 𝒪(𝒩mn)GLn, where Yk=(yij(k))1i,jn stands for the generic nilpotent n×n matrix. Obviously, σt(Ysk)=0 for all 1tn, s>0 and Ynk=0. It is easy to see that in case of an algebraically closed field of zero characteristic the algebra 𝒪(𝒩mn)GLn is generated by tr(Yi1Yir) (for example, see [5]), but in general case generators for 𝒪(𝒩mn)GLn are not known for n,m2. Moreover, over a finite field 𝔽 generators for algebras 𝒪(Mmn)GLn and 𝔽[Mmn]GLn are not known as well.

    Working over an algebraically closed field of zero characteristic Cavalcante and Lopatin in [5] showed that the set

    S2,m={tr(YiYj),1i<jm;tr(YiYjYk),1i<j<km}
    is a minimal generating set and a minimal separating set for the algebra 𝒪(𝒩m2)GL2 for m>0. Minimal generating sets and minimal separating sets for the algebras 𝒪(𝒩23)GL3 and 𝒪(𝒩33)GL3 were also obtained in [5] in case p=0.

    1.5. Results

    For 𝔽=𝔽q in Sec. 2 we extend the results from [28] given in Sec. 1.2 to the algebra 𝒪(W)G of G-invariant polynomial functions on a G-invariant subset WV (see Theorem 2.1). Note that a separating set for 𝒪(W)G separates all G-orbits on W in case 𝔽 is finite (for example, it follows from the proof of Theorem 2.1).

    In Sec. 3, working over an arbitrary field, we explicitly describe a minimal set of representatives of all GL2-orbits on 𝒩m2 in Theorem 3.4. As a consequence, in case of 𝔽=𝔽q we explicitly calculate the number of orbits in Corollary 3.5 as well as the least possible number of elements for a separating set for 𝒪(𝒩22)GL2. We formulate Conjecture 3.7 about the number of GLn-orbits on 𝒩mn.

    To formulate results about separating sets, introduce some notations. For an arbitrary field 𝔽 denote

    S(2)2,m={tr(YiYj),1i<jm}.

    Now assume that 𝔽 is finite. For all 1i,jn and α𝔽× define ζ(Yi) and ηα(Yi,Yj) from 𝒪(𝒩m2)GL2 as follows:

    ζ(A)={0ifA0,1ifA=0,(3)
    ηα(A,B)={0ifαAB,1ifαA=B,(4)
    where A,B𝒩2. The presentations of ζ(Yi) and ηα(Yi,Yj) as polynomials in {yij(k)} are explicitly given in Sec. 4. In Theorem 4.5, we establish that the set
    H(2)2,m=S(2)2,m{ζ(Yi),1im;ηα(Yi,Yj),1i<jm,α𝔽{0,1}}
    is a minimal separating set for 𝒪(𝒩m2)GL2 in case char𝔽=2 and the set
    H2,m=S2,m{ζ(Yi),1im;ηα(Yi,Yj),1i<jm,α𝔽{0,1}}
    is a minimal separating set for 𝒪(𝒩m2)GL2 in case char𝔽>2.

    In Theorem 5.4, we describe a minimal separating set in case of an infinite field. Note that over an infinite field the functions ζ(Yi) and ηα(Yi,Yj) do not belong to 𝒪(𝒩m2). Some corollaries are given in Sec. 6.

    1.6. Notations

    If for A̲,B̲Mmn there exists gGLn such that gA̲=B̲, then we write A̲B̲ and say that A̲, B̲ are similar. We say that A̲ has no zeros if Ai is non-zero for all i. Denote by wz(A̲) the result of elimination of all zero matrices from A̲. As an example, for A̲=(0,B,0,C,D) with non-zero B,C,DMn, we have wz(A̲)=(B,C,D). For a permutation σ𝒮m, we write A̲σ for (Aσ(1),,Aσ(m)).

    Denote by E the identity matrix and by Eij the matrix such that the (i,j)th entry is equal to one and the rest of entries are zeros. Denote by 𝔽× the set of all non-zero elements of 𝔽. For short, we write 0̲ for (0,,0)Mmn. Given AMn and r0, we write A(r) for (A,,Ar)Mrn.

    2. Minimal Separating Invariants for 𝒪(W)G over a Finite Field

    In this section, we assume that 𝔽=𝔽q, WV is a G-invariant subset of V, and dimV=n. Denote γ=γ(q,κ)=logq(κ), where κ stands for the number of G-orbits on W. For any vector w=(w1,,wn)W consider the following polynomial function from 𝒪(W):

    fw=(1)nα𝔽{w1}(y1α)α𝔽{wn}(ynα).
    Note that fw(w)=(1)n(α𝔽α)n=1 and for each vW we have
    fw(v)={1,v=w,0,otherwise.
    We present W as a union of G-orbits: W=U1Uκ. For every 1jκ define
    fj=uUjfu.(5)
    Then for each vW, we have
    fj(v)={1vUj,0otherwise.(6)
    Therefore, f1,,fκ belong to 𝒪(W)G and they form a separating set for 𝒪(W)G. By the definition of γ we have that qγ1<κqγ. Thus, there exist κ pairwise different vectors in 𝔽γ, which we may put together in a matrix (αij) over 𝔽 of size (γ×κ).

    Theorem 2.1.

    (1)

    Every separating set for 𝒪(W)G contains at least γ(q,κ) elements.

    (2)

    Let (αij)𝔽γ×κ be a matrix whose columns are pairwise different and define

    hi=αi1f1++αiκfκ(1iγ).
    Then {h1,,hγ} is a minimal separating set for 𝒪(W)G consisting of (non-homogeneous) elements of degree less than or equal to n(q1).

    Proof. Consider some representatives of G-orbits on W: u1U1,,uκUκ.

    (1) Assume that {l1,,lr} is a separating set for 𝒪(W)G. Then the column vectors

    (l1(uj)lr(uj))with1jκ
    are pairwise different. Hence, κqr and γr follows from the definition of γ.

    (2) Applying formula (6), we obtain that

    (h1(uj)hγ(uj))=(α1jαγj)for all1jκ.
    By the conditions of the theorem, these column vectors are pairwise different, hence {h1,,hγ} is a separating set. The minimality follows from part 1. □

    3. Classification of GL2-orbits on 𝒩m2

    In this section we assume that 𝔽 is an arbitrary field.

    Lemma 3.1. If A̲𝒩22 has no zeros, then A̲(E12,αE12) or A̲(E12,αE21) for some non-zero α𝔽.

    Proof. For each field 𝔽 we have that A1E12. Therefore, without loss of generality, we can assume that A1=E12. Denote A2=(a1a2a3a1) for some a1,a2,a3𝔽 and assume that g=(g1g20g1) lies in GL2. Then we have that gA1=A1 and

    gA2=(h1h2a3h1),
    for h1=a1+g2g1a3 and h2=(a2g212a1g1g2a3g22)g21.

    Assume that a30. Then we take g1=1 and g2=a1a3 to obtain that h1=0. Since gA2 is nilpotent, we obtain h2=0 and gA2=a3E21.

    Assume that a3=0. Since A2 is nilpotent, we obtain A2=a2E12. □

    For β,γ,δ of 𝔽 denote

    D(β,γ,δ)=(βγδβ).

    Remark 3.2. Assume that A̲,A̲𝒩32 satisfy A1=A1=E12, A2=αE21, and A2=αE21 for some α,α𝔽×. Assume that tij:=tr(AiAj)tr(AiAj)=0 for all 1i<j3 and t123:=tr(A1A2A3)tr(A1A2A3)=0. Then A̲=A̲.

    Proof. Denote A3=D(β,γ,δ) and A3=D(β,γ,δ) for some β,γ,δ,β,γ,δ from 𝔽. Since t12=0, we have α=α. Consequently applying the equalities t13=0, t23=0, t123=0, we obtain that δ=δ, αγ=αγ, αβ=αβ. □

    Lemma 3.3. If A̲𝒩m2 has no zeros, then A̲ is similar to one and only one of the following elements:

    (a)

    (E12,α2E12,,αmE12), where α2,,αm𝔽×;

    (b)

    (E12,α2E12,,αrE12,αr+1E21,D1,,Ds), where 1rm1, s=mr1, α2,,αr+1𝔽×, Di𝒩2 is non-zero for every i.

    Proof. In case m=1, we have A1E12 and the required is proven.

    Assume m2. By Lemma 3.1 either (A1,A2)(E12,α2E12) or (A1,A2)(E12,α2E21) for some α2𝔽×. In the first case we have A1=A2α2 and applying Lemma 3.1 to the pair (A1,A3) we can see that either (A1,A2,A3)(E12,α2E12,α3E12) or (A1,A2,A3)(E12,α2E12,α3E21) for some α3𝔽×. Repeating this procedure, we finally obtain that either case (a) or (b) holds.

    To prove uniqueness, consider some A̲,A̲𝒩m2 of type (a) or (b) and satisfying the condition A̲A̲. Note that A̲ has type (a) if and only if for every 2im exists αi𝔽× such that A1=Aiαi. Since this property of A̲ is not changed by the action of GL2, then we have one of the following two cases.

    (1) Both A̲ and A̲ have type (a), i.e.,

    A̲=(E12,α2E12,,αmE12)andA̲=(E12,α2E12,,αmE12),
    where α2,,αm,α2,,αm𝔽×. Consider gGL2 such that gA̲=A̲. Since gAi=Ai for all i, we obtain that gE12=E12 and αi=αi for 2im. Therefore, A̲=A̲.

    (2) A̲ and A̲ have both type (b), i.e.,

    A̲=(E12,α2E12,,αrE12,αr+1E21,D1,,Ds),A̲=(E12,α2E12,,αrE12,αr+1E21,D1,,Ds),
    where r,r1, s,s0, α2,,αr+1,α2,,αr+1𝔽×, Di,Di𝒩2 is non-zero for every i. By the definition of similarity we have that tij:=tr(AiAj)tr(AiAj)=0 and tijk:=tr(AiAjAk)tr(AiAjAk)=0 for all 1i,j,km. Since
    min{2vm|tr(Av1Av)0}=r+1,min{2vm|tr(Av1Av)0}=r+1,
    we obtain that r=r and s=s. Consider 1is. Applying Remark 3.2 to the pair of triples (A1,Ar+1,Ar+i+1) and (A1,Ar+1,Ar+i+1), we obtain that αr+1=αr+1 and Ar+i+1=Ar+i+1. In case r2 we use tj,r+1=0 to obtain that αj=αj for all 2jr. Therefore, A̲=A̲. □

    Lemma 3.3 implies the following description of GL2-orbits on 𝒩m2.

    Theorem 3.4. Each GL2-orbit on 𝒩m2 contains one and only one element of the following types:

    (0)

    (0,,0);

    (1)

    (α1E12,,αmE12), where

    at least one element from the list α1,,αm𝔽 is non-zero,

    αv=1 for v=min{1im|αi0};

    (2)

    (α1E12,,αrE12,αr+1E21,D1,,Ds), where

    1rm1, s=mr1,

    at least one element from the set {α1,,αr} is non-zero and αr+1𝔽×,

    αv=1 for v=min{1ir|αi0},

    Di𝒩2 for every 1is.

    For every integer k denote

    Sk(q)={qk+qk1++1=qk+11q1,ifk0,0,ifk<0.

    Corollary 3.5. Assume 𝔽=𝔽q and m1. Then

    (a)

    the number of GL2-orbits on 𝒩m2 is equal to

    κ=1+(qm1)(qm1+q)q21;

    (b)

    κ has the following presentation as a polynomial in q with non-negative integer coefficients:

    κ=κ(q)={1+Sm1(q)+(qm11)Sm22(q2)ifmis even,1+Sm1(q)+(qm1)Sm32(q2)ifmis odd,

    (c)

    the least possible number of elements for a separating set for 𝒪(𝒩m2)GL2 is

    γ={1ifm=1,3ifm=q=2,2m2otherwise. 

    Proof. (a) Denote by κ0(m), κ1(m), κ2(m), respectively, the number of GL2-orbits on 𝒩m2 of type (0), (1), (2), respectively (see Theorem 3.4). Then κ0(m)=1, κ1(m)=Sm1(q), and

    κ2(m)=m1r=1κ1(r)(q1)|𝒩2|mr1=m1r=1(qr1)q2m2r2,
    since we apply the equality |𝒩n|=qn(n1), which was proven by Fine and Herstein [22]. Hence,
    κ2(m)=q2m2(m1r=0qrm1r=0q2r)=q2m2(Sm1(q1)Sm1(q2)),
    and we obtain
    κ2(m)=(qm1)(qm11)q21.
    Therefore,
    κ=κ0(m)+κ1(m)+κ2(m)=1+Sm1(q)+(qm1)(qm11)q21,(7)
    and the claim of part (a) easily follows.

    (b) If m=1, then κ=2 and part (b) holds. Assume m2. Considering the case of even m and the case of odd m, applying formula (7), we prove the claim of part (b).

    (c) By Theorem 2.1, the least possible number of elements for a separating set for 𝒪(𝒩m2)GL2 is γ=logq(κ).

    If m=1, then κ=2 and γ=1.

    If m=q=2, then κ=5 and γ=3.

    Assume m2 and m,q are not simultaneously equal to 2. By part (a), the claim that γ=2m2 is equivalent to inequalities

    q2m3<1+(qm1)(qm1+q)q21q2m2.
    The left inequality follows from:
    q2m3<(qm1)(qm1+q)q21.
    The right inequality is equivalent to
    (q2mq2m1q2m2qm+1)+(qm1q2)+q+10.(8)

    In case m=2 and q3, inequality (8) is equivalent to q2(q22q2)+2q+10, which holds since q22q20 for q3.

    In case m3 we have q2m=q2m2q2q2m2q+q2m2+q2m2q2m1+q2m2+qm+1, since q2q+2 for q2; inequality (8) follows. □

    Corollary 3.5 implies the following remark:

    Remark 3.6. Assume 𝔽=𝔽q. Then

    for m=1 we have κ=2;

    for m=2 we have κ=2q+1;

    for m=3 we have κ=q3+q2+q+1;

    for m=4 we have κ=q5+2q3+q+1;

    for m=5 we have κ=q7+q5+q4+q3+q+1.

    Corollary 3.5 implies that the following conjecture holds for n=2 and m1.

    Conjecture 3.7. Assume 𝔽=𝔽q. If we fix n2 and m1, then the number of GLn-orbits on 𝒩mn is a polynomial in q with integer coefficients.

    It was proven by Hua [24] that the number of GLn-orbits on 𝒩mn is a polynomial in q with rational coefficients. Hua also conjectured that the number of absolutely indecomposable GLn-orbits on 𝒩mn is a polynomial in q with non-negative integer coefficients (see [24, Conjecture 4.1]). This conjecture was shown to be true for m=2 and 1n6.

    4. Separating set for 𝒪(𝒩m2)GL2

    If 𝔽=𝔽q and A=(a1a2a3a4) lies in 𝒩2, then we have that ζ(A)=aq11aq12aq13+1, since a21=a2a3. In particular,

    ζ(Yi)=y11(i)q1y12(i)q1y21(i)q1+1.(9)
    Similarly, we can see that
    ηα(Yi,Yj)=u,v{1,2}((αyuv(i)yuv(j))q11).(10)

    Remark 4.1. Let H be one of the following sets: S2,m, S(2)2,m, H2,m, H(2)2,m. Assume that A̲,B̲𝒩m2 are not separated by H. Then

    (a)

    for any σ𝒮m we have that A̲σ,B̲σ are not separated by H;

    (b)

    for any A̲,B̲𝒩mn with A̲A̲ and B̲B̲ we have that A̲,B̲ are not separated by H.

    Proof. Consider some A1,A2,A3 from 𝒩2. It is easy to see that ηα(A1,A2)=ηα1(A2,A1) for all α𝔽×. Moreover, the Cayley–Hamilton theorem implies that

    tr(A1A2A3)=tr(A1A3A2).(11)
    Thus, part (a) is proven. Part (b) is trivial. □

    Lemma 4.2. Assume that A̲,B̲𝒩m2 are not separated by S2,m. Then there exists a permutation σ𝒮m such that one of the next cases holds:

    (a)

    A̲σ(0(k+l),α1E12,,αr+sE12),B̲σ(0(k),β1E12,,βlE12,0(r),βl+1E12,,βl+sE12),
    where k,l,r,s0,k+l+r+s=m, α1,,αr+s,β1,,βl+s𝔽×; moreover, α1=1 in case A̲0̲ and β1=1 in case B̲0̲;

    (b)

    A̲σ(0(k),E12,α2E12,,αrE12,αr+1E21,D1,,Ds) and B̲A̲, where r1, k,s0, k+r+s+1=m, α2,,αr+1𝔽×, and Di𝒩2 is non-zero for every i.

    Proof. We use Remark 4.1 without reference to it. Applying Lemma 3.3 to A̲ together with 𝒮m-action on A̲ we can see that one of the next two cases holds.

    (1) A̲σ(0(k),α1E12,,αrE12), where k,r0, k+r=m, and α1,,αr𝔽× with α1=1 in case A̲0̲. Applying Lemma 3.3 to B̲σ together with 𝒮m-action on (A̲σ,B̲σ) we can see that one of the next two cases holds:

    (1a)

    there is τ𝒮m such that (A̲τ,B̲τ) satisfies case (a) maybe without condition that β1=1 in case B̲0̲. In the latter case we act by (β11001)GL2 on B̲τ to obtain case (a).

    (1b)

    A̲σ is the same as above and B̲σC̲, where for some i<j we have Ci=E12 and Cj=αE21 for α𝔽×. In this case, we have tr(Aσ(i)Aσ(j))=tr(CiCj); hence, α=0, a contradiction.

    (2) A̲σ(0(k),α1E12,,αrE12,αr+1E21,D1,,Ds), where r1, k,s0, α1=1, α2,,αr+1𝔽×, and Di𝒩2 is non-zero for every i. Applying Lemma 3.3 to B̲σ we can see that one of the next two cases holds:

    (2a)

    wz(B̲σ)(β1E12,,βlE12) for some l0 and β1,,βl𝔽×, where β1=1 in case B̲0̲. Then BiBj=0 for all 1i,jm. On the other hand, tr(Aσ(k+r)Aσ(k+r+1))=αrαr+1 is non-zero; a contradiction.

    (2b)

    wz(B̲σ)(β1E12,,βrE12,βr+1E21,D1,,Ds), where r1, s0, β1=1, β2,,βr+1𝔽×, Di𝒩2 is non-zero for every 1is. Therefore,

    B̲σ(,βrE12,0,,0,βr+1E21,),îĵ
    where βrE12 and βr+1E21, respectively, stands in position i and j, respectively, for some 1i<jm. Since
    min{1vm|1u<vsuch thattr(Aσ(u)Aσ(v))0}=k+r+1,min{1vm|1u<vsuch thattr(Bσ(u)Bσ(v))0}=j,
    the conditions of the lemma imply that j=k+r+1. For 1uk+r, we have
    tr(Bσ(u)Bσ(k+r+1))=tr(Aσ(u)Aσ(k+r+1))={αukαr+1ifu>k,0ifuk.(12)
    Therefore, B̲σ(0(k),β1E12,,βrE12,βr+1E21,D1,,Ds), where some of the matrices D1,,Ds𝒩2 can be zero. In particular, r=r. Since α1=β1=1, equality (12) implies that αr+1=βr+1; therefore, αi=βi for all 2ir. Applying Remark 3.2 to the pair of triples (Aσ(k+r),Aσ(k+r+1),Aσ(k+r+1+u)) and (Bσ(k+r),Bσ(k+r+1),Bσ(k+r+1+u)), where 1us, we obtain that Du=Du. Therefore, A̲σB̲σ and case (b) of the formulation of this lemma holds.

     □

    Remark 4.3. For A̲𝒩22, we have

    η1(A1,A2)={1α𝔽{0,1}ηα(A1,A2)ifA10,A20,tr(A1A2)=0,1ifA1=A2=0,0ifA10,A2=0orA1=0,A20,0iftr(A1A2)0.

    Proof. Since ηα(A1,A2) and tr(A1A2) are constants on the GL2-orbits on 𝒩22, by Lemma 3.1 we can assume that on A̲ lies in the following list: (0,0), (0,E12), (E12,0), (E12,γE12), (E12,γE21), where γ𝔽×. The required follows from case by case consideration. □

    Lemma 4.4. Assume that char𝔽=2 and A̲,B̲𝒩32 are not separated by S(2)3={tr(Y1Y2),tr(Y1Y3),tr(Y2Y3)}. Then tr(A1A2A3)=tr(B1B2B3).

    Proof. If Ai=Bj=0 for some 1i,j3, then tr(A1A2A3)=tr(B1B2B3)=0. Therefore, without loss of generality, we can assume that Ai is non-zero for all i.

    (1) Assume that Bj=0 for some j. By formula (11), without loss of generality, we can assume that B1=0. Applying Lemma 3.3 to A̲, we obtain that one of the following cases holds:

    (a)A̲(E12,α2E12,α3E12),(b)A̲(E12,α2E21,D),(c)A̲(E12,α2E12,α3E21),
    where α2,α3𝔽× and D𝒩2 is non-zero. In cases (a) and (c), we have tr(A1A2A3)=0 and the required holds. In case (b), we have α2=tr(A1A2)=tr(B1B2)=0; a contradiction.

    (2) Assume that Bj is non-zero for all j. Applying Lemma 3.3 to A̲, we obtain that one of the above cases (a), (b), (c) holds for A̲. Applying Lemma 3.3 to B̲, we obtain that one of the following cases holds:

    (a’)B̲(E12,β2E12,β3E12),(b’)B̲(E12,β2E21,D),(c’)B̲(E12,β2E12,β3E21),
    where β2,β3𝔽× and D𝒩2 is non-zero. Since tr(A1A2)=tr(B1B2) and tr(A1A3)=tr(B1B3), we have one of the following three cases:

    Cases (a) and (a’) hold. Then tr(A1A2A3)=tr(B1B2B3)=0.

    Cases (b) and (b’) hold. Since tr(A1A2)=tr(B1B2), we obtain that α2=β2. Denote D=D(a1,a2,a3) and D=D(b1,b2,b3). The equalities tr(A1A3)=tr(B1B3) and tr(A2A3)=tr(B2B3), respectively, imply that a3=b3 and a2=b2, respectively. It follows from equalities det(D)=det(D)=0 that a1=b1, since char𝔽=2. Therefore, A̲B̲ and the required follows.

    Cases (c) and (c’) hold. Then tr(A1A2A3)=tr(B1B2B3)=0.

     □

    Theorem 4.5. Assume that 𝔽=𝔽q is finite. Then

    H(2)2,m, in case char𝔽=2;

    H2,m, in case char𝔽>2;

    is a minimal separating set for the algebra of invariant polynomial functions on nilpotent matrices 𝒪(𝒩m2)GL2 for all m>0.

    Proof. Denote by H the set H(2)2,m or H2,m, respectively, in case char𝔽=2 or char𝔽>2, respectively. Assume that A̲,B̲𝒩m2 are not separated by H. To prove that H is separating it is enough to show that A̲B̲. By Remarks 4.1, 4.3 and Lemma 4.4, we obtain in both cases that A̲,B̲ are not separated by

    H2,m=H2,m{ηα(Yi,Yj),1i,jm,α𝔽×}.

    Applying Lemma 4.2 together with the fact Ai=0 if and only if Bi=0 (1im), we obtain that one of the next two cases holds:

    A̲σ(0(k),E12,αk+2E12,,αmE12), B̲σ(0(k),E12,βk+2E12,,βmE12), where σ𝒮m, 0k<m, αk+2,,αm,βk+2,,βm𝔽×;

    A̲B̲.

    Assume that the first case holds. Since for every k+2im and every α𝔽× we have

    Aσ(k+1)αAσ(i)=0if and only ifBσ(k+1)αBσ(i)=0,
    then αi=βi. Therefore, A̲σB̲σ and H is separating.

    Claims 1–4 (see below) show that H is a minimal separating set for all m>0.

    Claim 1. The set H2,1{ζ(Y1)}=  is not separating for 𝒪(𝒩2)GL2 .

    To prove this claim it is enough to consider A̲=(0) and B̲=(E12).

    Claim 2. Given β𝔽{0,1} , the set H2,2{ηβ(Y1,Y2)}  is not separating for 𝒪(𝒩22)GL2 .

    To prove this claim consider A̲=(E12,E12) and B̲=(E12,βE12) from 𝒩22. Then tr(A1A2)=tr(B1B2)=0 and ηα(A1,A2)=ηα(B1,B2)=0 for all α𝔽{0,1,β}, but ηβ(A1,A2)ηβ(B1,B2).

    Claim 3. The set H2,2{tr(Y1Y2)}  is not separating for 𝒪(𝒩22)GL2 .

    To prove this claim consider A̲=(E12,E12) and B̲=(E12,E21) from 𝒩22. Then ηα(A1,A2)=ηα(B1,B2)=0 for all α𝔽{0,1}, but tr(A1A2)tr(B1B2).

    Claim 4. Let m=3  and char𝔽2 . Then H2,3{tr(Y1Y2Y3)}  is not separating for 𝒪(𝒩32)GL2 .

    To prove this claim we consider A̲=(E12,E21,A3)  and B̲=(E12,E21,B3)  from 𝒩32 , where

    A3=(1111)andB3=(1111).
    Thus, ηα(Ai,Aj)=ηα(Bi,Bj)=0 for all 1i<j3 and α𝔽{0,1}. Moreover, tr(A1A2)=tr(B1B2)=1, tr(A1A3)=tr(B1B3)=1, tr(A2A3)=tr(B2B3)=1. On the other hand, tr(A1A2A3)=1 and tr(B1B2B3)=1 are different. □

    5. The Case of Infinite Field

    In this section we assume that 𝔽 is infinite. We say that a G-invariant subset WV is a G-invariant cone if the conditions wW and α𝔽× imply that αwW.

    Remark 5.1. If WV is a G-invariant cone, then the algebra 𝒪(W)G has -grading by degrees.

    Note that 𝒩mn is a multi-cone, i.e., if A̲𝒩mn and α1,,αm𝔽×, then (α1A1,,αmAm)𝒩mn. Thus, the following extension of Remark 5.1 to the case of multidegree holds.

    Remark 5.2. The algebra 𝒪(𝒩mn)GLn has m-grading by multidegrees, where the multidegree of f𝒪(𝒩mn)𝔽[Mmn]I(𝒩mn) is defined as the minimal multidegree (with respect to some fixed lexicographical order) of a polynomial h𝔽[Mmn] with f=h+I(𝒩mn).

    Lemma 5.3. If f𝒪(𝒩m2)GL2 is m-homogeneous and f𝔽, then f(α1E12,,αmE12)=0 for all α1,,αm𝔽.

    Proof. Denote the multidegree of f by δ̲=(δ1,,δm), where δ!++δm>0. Then

    f=βy12(1)δ1y12(m)δm+hΩβhh,
    for some β,βh𝔽, where Ω is the set of all monomials in {yij(k)|i,j{1,2},1km} different from y12(1)d1y12(m)dm for all d1,,dm0.

    For g=(γ001)GL2 with γ𝔽×, we have

    β=f(E12,,E12)=f(g(E12,,E12))=f(γE12,,γE12)=βγδ1++δm
    for all γ𝔽×. Hence, β=0, since 𝔽 is infinite. Therefore, f(α1E12,,αmE12)=β=0. □

    Theorem 5.4. Assume that 𝔽 is infinite. Then

    S(2)2,m, in case char𝔽=2;

    S2,m, in case char𝔽>2;

    is a minimal separating set for the algebra of invariant polynomial functions on nilpotent matrices 𝒪(𝒩m2)GL2 for all m>0.

    Proof. Denote by S the set S(2)2,m or S2,m, respectively, in case char𝔽=2 or char𝔽>2, respectively. Assume that A̲,B̲𝒩m2 are not separated by S and f𝒪(𝒩m2)GL2. To prove that S is separating we have to show that f(A̲)=f(B̲). By Remark 5.2, without loss of generality, we can assume that f is m-homogeneous of multidegree δ̲. Moreover, without loss of generality, we can assume that f(A̲)0. By Lemmas 4.2 and 4.4, one of the next two cases holds:

    A̲σ(0(k+l),α1E12,,αr+sE12),B̲σ(0(k),β1E12,,βlE12,0(r),βl+1E12,,βl+sE12),
    where σ𝒮m, k,l,r,s0, α1,,αr+s,β1,,βl+s𝔽×; moreover, α1=1 in case A̲0 and β1=1 in case B̲0;

    A̲B̲.

    In the second case, we have f(A̲)=f(B̲). Assume that the first case holds.

    Define fσ1 as the result of substitutions yij(t)yij(σ1(t)) in f for all 1tm, 1i,j2. Then fσ1𝒪(𝒩m2)GL2 and fσ1(C̲σ)=f(C̲) for all C̲𝒩m2. Therefore, to prove that f(A̲)=f(B̲) it is enough to show that fσ1(A̲σ)=fσ1(B̲σ). Note that A̲σ, B̲σ are not separated by S by Remark 4.1. Therefore, without loss of generality, we can assume that σ𝒮m is the trivial permutation.

    If δi0 for some 1ik+l, then f(A̲)=0; a contradiction. Otherwise, δ1==δk+l=0. Hence, f is a polynomial in {yij(k+l+1),,yij(m)|i,j{1,2}}. Therefore, f(E(k+l)12,α1E12,,αr+sE12)=f(A̲) is non-zero; a contradiction to Lemma 5.3. Thus, S is separating.

    Taking A̲,B̲ from Claims 3, 4 from the proof of Theorem 4.5 we obtain that S is a minimal separating set for all m>0. □

    6. Corollaries

    As in Sec. 1.1, assume that V is an n-dimensional vector space over 𝔽, G is a subgroup of GL(V), and WV is a G-invariant subset of V. We say that an m0-tuple j̲m0 is m-admissible if 1j1<<jm0m. For any m-admissible j̲m0 and f𝒪(Wm0)G we define the invariant polynomial function f(j̲)𝒪(Wm)G as the result of the following substitution of variables in f:

    y1,iyj1,i,,ym0,iyjm0,i(for all1in).
    Given a set S𝒪(Wm0)G, we define its expansion S[m]𝒪(Wm)G by
    S[m]={f(j̲)|fSandj̲m0ism-admissible}.(13)

    Remark 6.1 (Cf. [10, Remark 1.3]). Assume that S1 and S2 are separating sets for 𝒪(Vm0)G and assume that m>m0. Then S[m]1 is separating for 𝒪(Vm)G if and only if S[m]2 is separating for 𝒪(Vm)G.

    Denote by σsep(𝒪(W),G) the minimal number m0 such that the expansion of some separating set S for 𝒪(Wm0)G produces a separating set for 𝒪(Wm)G for all mm0. It immediately follows from the main result of [33] that σsep(𝒪(V),𝒮n)n2+1 over an arbitrary field 𝔽, where 𝒮n acts on V by the permutation of the coordinates. Moreover, σsep(𝒪(V),𝒮n)log2(n)+1 in case 𝔽=𝔽2 (see [28, Corollary 4.12]).

    Corollary 6.2. Assume that 𝔽=𝔽q is finite and m2. Then

    βsep(𝒪(𝒩m2)GL2)2, in case q=2;

    βsep(𝒪(𝒩m2)GL2)4(q1), in case q>2.

    Proof. See Theorem 4.5 and formulas (9) and (10). □

    Corollary 6.3. Assume that 𝔽 is infinite and m2. Then

    βsep(𝒪(𝒩m2)GL2)2, in case char𝔽=2 or m=2;

    βsep(𝒪(𝒩m2)GL2)3, in case char𝔽2 and m>2.

    Proof. See Theorem 5.4. □

    Corollary 6.4. Assume that 𝔽 is an arbitrary field. Then

    σsep(𝒪(𝒩2),GL2)={2ifchar𝔽=2,3ifchar𝔽2.

    Proof. The upper bound on σsep(𝒪(𝒩2),GL2) follows from Theorems 4.5 and  5.4. To obtain the lower bound on σsep(𝒪(𝒩2),GL2) we consider A̲,B̲ from Claims 3 and 4 of the proof of Theorem 4.5. □

    Corollary 6.5. Assume that 𝔽=𝔽q. Then a minimal separating set

    H(2)2,m, in case char𝔽=2;

    H2,m, in case char𝔽>2;

    for 𝒪(𝒩m2)GL2 contains the least possible number of elements for a separating set for 𝒪(𝒩m2)GL2 if and only if m=1 or m=q=2.

    Proof. The set from the formulation of corollary is a minimal separating set for 𝒪(𝒩m2)GL2 by Theorem 4.5. We have

    |H(2)2,m|=m+(m2)(q1)and|H2,m|=|H(2)2,m|+(m3),
    where the binomial coefficient (mk) is zero in case m<k.

    Assume m=1. Then Corollary 3.5 implies that γ=|H(2)2,m|=|H2,m|=1; i.e., the required is proven.

    Assume m=q=2. Then char𝔽=2 and Corollary 3.5 implies that γ=|H(2)2,m|=3; i.e., the required is proven.

    Assume m=2 and q3. Then Corollary 3.5 implies that γ=2, but |H2,m|=|H(2)2,m|=q+1>γ.

    Assume m3. Then Corollary 3.5 implies that γ=2m2, but |H2,m|>|H(2)2,m|=m+(m2)(q1)>γ, since (m2)m. □

    Example 6.6. Assume 𝔽=𝔽2 and m=2. By Theorem 3.4, each GL2-orbit on 𝒩22 contains one and only one element from the following set:

    (0,0),(E12,0),(E12,E12),(0,E12),(E12,E12).
    Corollary 6.5 implies that the set
    H(2)2,2={tr(Y1Y2),ζ(Y1),ζ(Y2)}
    is a separating set for 𝒪(𝒩22)GL2 containing the least possible number of elements.

    Acknowledgment

    The work was supported by FAPESP 2018/23690-6.

    ORCID

    Artem Lopatin  https://orcid.org/0000-0003-2495-6050