This paper characterizes the polynomial identities of matrix algebras with transpose involution under certain gradings over infinite fields, extending previous results beyond complex numbers.
Contribution
It provides a basis for graded polynomial identities of matrices with transpose involution over infinite fields with arbitrary characteristic, generalizing prior complex-field results.
Findings
01
Established a basis for graded polynomial identities
02
Extended results to arbitrary characteristic fields
03
Generalized previous complex-specific findings
Abstract
Let F be an infinite field, and let Mn(F) be the algebra of n×n matrices over F. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we find a basis for the graded polynomial identities of Mn(F) with the transpose involution. Our results generalize for infinite fields of arbitrary characteristic previous results in the literature which were obtained for the field of complex numbers and for a particular class of elementary G-gradings.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Graded Polynomial Identities for Matrices with the Transpose Involution over an Infinite Field
Lu s Felipe Gon alves Fonseca
Instituto de Ci ncias Exatas e Tecnl gicas
Universidade Federal de Vi osa
Florestal, MG, Brazil
Thiago Castilho de Mello
Instituto de Ciência e Tecnologia
Universidade Federal de São Paulo
São José dos Campos, SP, Brazil
[email protected]@unifesp.brsupported by Fapesp grant No. 2014/10352-4, Fapesp grant No.2014/09310-5, and CNPq grant No. 461820/2014-5.
Abstract
Let F be an infinite field, and let Mn(F) be the algebra of n×n matrices
over F. Suppose that this algebra is equipped with an elementary grading whose neutral
component coincides with the main diagonal. In this paper, we find a basis for the graded polynomial identities of Mn(F) with the transpose involution. Our results generalize for infinite fields of arbitrary characteristic previous results in the literature which were obtained for the field of complex numbers and for a particular class of elementary G-gradings.
1 Introduction
Let F be a field and A be an F-algebra. A polynomial identity
of the algebra A is a polynomial in noncommuting variables which
vanishes under any substitution of these variables by elements of
A.
One of the first important results about polynomial identities in
algebras is the Amitsur-Levitzki Theorem which proves that the
standard polynomial of degree 2n is a polynomial identity for
Mn(F). Specht [16] raised the question whether the
T-ideal of all polynomial identities of a given algebra is finitely
generated as a T-ideal. This problem was answered by Kemer
[13] using the characteristic zero some decades latter.
Although Kemer proved that there always exists a finite basis for
the identities of a given algebra in characteristic zero, it is very
difficult problem to find any such basis. The explicit polynomial
identities for concrete algebras are known in very few cases. For
instance, for Mn(C) such a basis is known only if n=1
or 2. In light of this, mathematicians started to work with
‘weaker’ polynomial identities such as identities with
trace, identities with involution and graded identities. It is worth mentioning that the graded identities were also used by Kemer in the solution of the Specht problem.
Subsequent to the pioneering work of Di-Vincenzo [6]
about graded identities, many authors described the graded
identities of Mn(F) and other different important algebras in
different contexts [1], [2],
[3], [7], [17],
[8], [4] and [18].
Also, identities with involution for Mn(F) have been studied by
some authors [12].
Recently Haile and Natapov [11] exhibited a basis for the
graded identities with involution of Mn(C), endowed with
the transpose involution and with a crossed-product grading. This
grading is an elementary grading of Mn(F) by a group
G={g1,…,gn} induced by the n-tuple (g1,…,gn).
The authors used the graph theory as in [10].
In this paper we generalize the results of Haile and Natapov for a broader class of
gradings and for infinite fields of arbitrary characteristic. The main tool here is the use of generic matrices,
and we use ideas similar to those in [1],
[2], [4], [7], and
[8].
2 Preliminaries
We denote by F an infinite field of arbitrary characteristic. All vector spaces and algebras
are over F. We denote the algebra of n×n matrices over F
by Mn(F) and a group with the unity e by G.
If A is an algebra and G is a group, a G-grading on A is a
decomposition of A as a direct sum of subspaces A=⊕g∈GAg, indexed by elements of the group G, which satisfy
AgAh⊆Agh, for any g,h∈G. If a∈Ag−{0}, for some g∈G, we say that a is homogeneous of degree
g and we denote deg(a)=g. The support of the grading, is the
subset of G, Supp(A)={g∈G;Ag={0}}.
If 1≤i,j≤n, we denote by eij the matrix with 1 on the position
(i,j), and and 0 elsewhere. We call them elementary matrices, or matrix units.
Now let (g1,…,gn)∈Gn be an n-tuple of elements of
G. For each g∈G, let Rg⊆Mn(F) be the subspace
generated by the elementary matrices eij for i and j
satisfying gi−1gj=g. Then Mn(F)=⊕g∈GRg is
a G-grading on Mn(F) called elementary grading defined by
(g1,…,gn).
We recall a known result from [5], which characterizes elementary gradings on Mn(F).
Theorem 2.1**.**
If G is any group, a G-grading of Mn(F) is elementary if and only if all matrix units eij are homogeneous.
An involution on an algebra A is an antiautomorphism of the
order two, that is, a linear map ∗:A⟶A satisfying
(ab)∗=b∗a∗ and (a∗)∗=a, for all a,b∈A. A classic
example of involution on Mn(F) is the transpose map.
A G-graded algebra A=⨁g∈GAg with involution
∗ is called a degree-inverting involution algebra if
(Ag)∗=Ag−1 for all g∈G. In this case, we say that ∗ is a degree-inverting involution on A. In this paper, if A is a degree-inverting involution algebra, we say it is a
(G,∗)-algebra. A typical example of a (G,∗)-algebra is
Mn(F) endowed with an elementary grading and with the transpose
involution. The degree-inverting involutions on Mn(F) have been
described by the authors in [9].
Remark 2.2**.**
When dealing with identities with involution on algebras over fields of characteristic different from 2, one usually consider the decomposition A=A+⊕A−, where A+={a∈A∣a∗=a} (symmetric component) and A−={a∈A∣a∗=−a} (skew-symmetric component) and set in the free algebra, the set of symmetric and skew-symmetric variables. Note that one cannot use this approach in the present case, since the symmetric and skew-symmetric components are no longer homogeneous. In order to deal with our case, we need to consider a free algebra where the grading and the involution behave in the same way as in the algebra we want to study its identities.
2.1 The free (G,∗)-algebra and (G,∗)-identities
To describe the identities of Mn(F) as a (G,∗)-algebra, we
define what we call the free (G,∗)-algebra.
For each g∈G, we define two countable sets Xg={xk,g;k∈N} and Xg∗={xk,g∗;k∈N}. Then, let X=∪g∈GXg
and X∗=∪g∈GXg∗. Consider the free associative algebra F⟨X∪X∗⟩, which is freely generated by X∪X∗. Of course, it is an algebra with an involution defined in a natural way. Now, we define a G-grading on this free algebra to make it a (G,∗)-algebra. Let deg(1)=e, and for each k∈N and g∈G, let deg(xk,g)=g and deg(xk,g∗)=g−1. If m=xi1,g1ε1⋯xil,glεl is a monomial in F⟨X∪X∗⟩, where εi is ∗ or nothing, we define deg(m)=deg(xi1,g1ε1)⋯deg(xil,glεl).
If we define
[TABLE]
we obtain that F⟨X∪X∗⟩=⨁g∈G(F⟨X∪X∗⟩)g is a G-grading on the algebra F⟨X∪X∗⟩, which makes it a (G,∗)-algebra. We denote such algebra by F⟨X∣(G,∗)⟩ and call it the free (G,∗)-algebra. The elements of F⟨X∣(G,∗)⟩ are called (G,∗)-polynomials.
If A and B are G-graded algebras with involution, we say that a homomorphism ϕ:A⟶B is a homomorphism of graded algebras with involutions, if ϕ(Ag)⊂Bg, for all g∈G and ϕ(x∗)=ϕ(x)∗, for all x∈A.
The algebra F⟨X∣(G,∗)⟩ satisfies a universal property: for any (G,∗)-algebra A and for any map φ:X⟶A such that for all g∈G, φ(Xg)⊆Ag, there exists a unique homomorphism of graded algebras with involution ϕ:F⟨X∣(G,∗)⟩⟶A, such that for all x∈X, ϕ(x)=φ(x).
Let A be (G,∗)-algebra. A polynomial f∈F⟨X∣(G,∗)⟩ is called a (G,∗)-polynomial identity of A if f∈Ker(ϕ) for any homomorphism of graded algebra with involution ϕ:F⟨X∣(G,∗)⟩→A. Equivalently, f vanishes under any admissible substitution of variables by the elements of A with the condition that if xk,g is substituted by a∈Ag, then xk,g∗ is substituted by a∗.
We observe that if A is a (G,∗)-algebra, then it is a graded
algebra, and if f is a graded polynomial identity of A, then it is also a (G,∗)-identity of A. In particular Proposition 4.1 of [7] also holds for (G,∗)-algebras.
Proposition 2.3**.**
Let G be a group and let g=(g1,…,gn)∈Gn be an n-tuple of elements from G. Suppose Mn(F)
is endowed with elementary grading induced by g. The
following assertions are equivalent
The neutral component of Mn(F) coincides with the main
diagonal.
2. 2.
x1,ex2,e−x2,ex1,e* is a graded identity of
Mn(F).*
3. 3.
The elements of g are pairwise distinct.
A (two-sided) ideal I⊂F⟨X∣(G,∗)⟩ is
called a TG∗-ideal if I is closed under all (G,∗)-endomorphism of F⟨X∣(G,∗)⟩. We denote the set of all (G,∗)-identities of A by
TG∗(A). Let S⊂F⟨X∣(G,∗)⟩. We
denote the intersection of all TG∗-ideals containing S by ⟨S⟩TG∗. Notice that TG∗(A) and ⟨S⟩TG∗ are TG∗-ideals of F⟨X∣(G,∗)⟩. We say that S⊂F⟨X∣(G,∗)⟩ is a basis for the (G,∗)-identities of A if TG∗(A)=⟨S⟩TG∗.
Proposition 2.4**.**
Let G be a group and let Mn(F) be endowed with the elementary grading induced by
an n-tuple (g1,…,gn) of pairwise distinct elements from G,
and with the transpose involution. The following polynomials are
(G,∗)-identities for Mn(F)
[TABLE]
For more details about identities 1 and 4, see [3, Lemma
4.1]. Identity 2 follows from Proposition
2.3. Also, [11, Remark 2 of Theorem 8] shows
that identity 4 follows from identity 2.
When dealing with ordinary polynomials, it is well known that each
T-ideal is generated by its multi-homogeneous polynomials. In the
case of (G,∗)-polynomials, we need to slight modify this concept.
Definition 2.5**.**
Let f=f(x1,g1,…,xn,gn,x1,g1∗,…,xn,gn∗)∈F⟨X∣(G,∗)⟩. Write f as
[TABLE]
where λl∈F−{0} and ml are monomials in F⟨X∣(G,∗)⟩.
The polynomial f is called strongly multi-homogeneous if for each t∈{1,…,m},
degxt,gtmi+degxt,gt∗mi=degxt,gtmj+degxt,gt∗mj for all i,j∈{1,…,k}. Here, the symbol degxmi
denotes the number of times the variable x appears in the monomial mi.
Following the classic Vandermonde argument, we can prove that if I
is a (G,∗)-ideal, then I is generated by its strongly
multi-homogeneous polynomials.
3 The ∗-graded identities of Mn(F)
We start this section with the following theorem of [11], which we aim to generalize for infinite fields and for a broader class of gradings by adding the identities xg=0 for g∈Supp(Mn(F)). We observe that in [11] the authors used the graph theory to prove this result.
Let G={g1,…,gn} be a group of order n. The ideal of (G,∗)-identities of Mn(C) endowed with the elementary grading induced by (g1,…,gn) and with the transpose involution is generated as a TG∗-ideal by the following elements
xi,exj,e−xj,exi,e**
2. 2.
xi,e−xi,e∗**
From now on, we consider Mn(F) endowed with elementary grading
induced by the n-tuple g=(g1,…,gn)∈Gn of pairwise distinct elements of G, and we denote G0=Supp(Mn(F)).
Let g∈G. We define
[TABLE]
and
[TABLE]
Notice that ∣D(g)∣=∣Im(g)∣, D(g−1)=Im(g) and D(g)=∅ if and only if g∈/G0. In that case, if i∈D(g), there exists a unique j∈{1,…,n} such that
gig=gj. If we define j=g(i), we obtain a bijective
map
[TABLE]
Observe that for each i∈{1,…,n}, we have
eig(i)∈(Mn(F))g and for each g in support
of Mn(F), g−1=(g)−1.
Lemma 3.2**.**
Let g,h∈G. If there exists i∈D(g)∩D(h) such that
[TABLE]
then g=h.
Proof.
Let i∈D(g^)∩D(h^). If
j=g^(i)=h^(i), then gig=gj=gih. We can conclude
that g=h.
∎
Let Ω={yi,g(i)k∣g∈G,i∈D(g),k∈N} be a set of commuting variables and F[Ω] be
the algebra of commuting polynomials in Ω. We denote the set
of all matrices over F[Ω] by Mn(Ω). As in the case
of matrices over F, if g=(g1,…,gn) is an
n-tuple of elements of G, then Mn(Ω) is endowed with
an elementary G-grading induced by g.
Definition 3.3**.**
For each g∈G0 and j∈N, the elements of Mn(Ω),
[TABLE]
and
[TABLE]
are called generic (G,∗)-matrices. The subalgebra of Mn(Ω) generated by {Aj,g,Aj,g∗∣g∈G0,j∈N} is called the algebra of generic (G,∗)-matrices and we denote it by Gen.
Lemma 3.4**.**
Let g,h∈G0. If yi,kj∈Ω is an entry of the matrices Aj,g and Aj,h, then g=h.
Proof.
If yi,kj is an entry of Aj,g and of Aj,g then k=g(i) and k=h(i). Now Lemma 3.2 implies that g=h.
∎
Using classical arguments, we can prove the following proposition.
Proposition 3.5**.**
The relatively free algebra F⟨X∣(G,∗)⟩/TG∗(Mn(F)) is isomorphic to
Gen. Furthermore, TG∗(Mn(F))=TG∗(Gen).
We now define the following maps, which by an abuse of notation will be also denoted by ∗
[TABLE]
Given h1ε1,h2ε2,…,hrεr∈G0, where hi∈G and εi is ∗ or nothing, we consider the composition ν=hrεr⋯h1ε1 of the corresponding functions. This may not be well defined, and we will prove in Lemma 3.7 that in this case the monomial x1,h1ε1⋯xr,hrεr is a graded identity for Mn(F).
Otherwise, its domain Dν=Dhrεr⋯h1ε1 is the set of i∈{1,…,n} for which the image hrεr(…(h1ε1(i))…) is well defined.
Lemma 3.6**.**
Let g,h∈G, then D(hg)⊆D(gh). Moreover, if i∈D(hg), then hg(i)=gh(i).
Proof.
If D(hg)=∅, the result is
obvious. Suppose D(hg)=∅. If i∈D(hg), let k=g(i) and
j=h(k). Then, gk=gig and gj=gkh, and we obtain
gj=gi(gh), that is, gh(i)=j.
∎
Lemma 3.7**.**
Let h1ε1,h2ε2,…,hrεr∈G0.
If Dhrεr⋯h1ε1=∅ then
Ai1,h1ε1Ai2,h2ε2⋯Air,hrεr=0.
Moreover, if the set Dhrεr⋯h1ε1 is nonempty then the i-th line
of the matrix Ai1,h1ε1Ai2,h2ε2⋯Air,hrεr is nonzero if and
only if i∈Dhrεr⋯h1ε1.
In this case, if j=hrεr⋯h1ε1(i),
the only nonzero entry in the i-th line is a monomial of Ω in the j-th column.
Proof.
The proof is by induction on the length r of the product. The
result for r=1 follows directly from Definition 3.3.
Hence, we consider r>1 and assume the result for products of
length r−1. Let us consider the first case
Dhrεr⋯h1ε1=∅.
In this case
Dhr−1εr−1⋯h1ε1=∅
and we denote
ν=hr−1εr−1⋯h1ε1.
The induction hypothesis implies that there exists monomials mi,
where i∈Dhr−1εr−1⋯h1ε1,
such that
[TABLE]
Note that eiν(i)ejhrεr(j)=0
for some j if and only if i∈Dhrεr⋯h1ε1.
In this case, the product equals eihrεr(j). Hence, we obtain
[TABLE]
and the result follows.
Now, assume that
Dhrεr⋯h1εr=∅.
If
Dhr−1εr−1⋯h1ε1=∅
then by the induction hypothesis
Ai1,h1ε1Ai2,h2ε2⋯Air−1,hr−1εr−1=0 and the result holds.
Moreover, if
Dhr−1εr−1⋯h1ε1=∅
then we may write the product
Ai1,h1ε1Ai2,h2ε2⋯Air,hrεr as in (5). Since
Dhrεr⋯h1εr=∅,
every product eiν(i)ejhrεr(j)
equals zero and therefore
Ai1,h1ε1Ai2,h2ε2⋯Air,hrεr=0.
∎
Definition 3.8**.**
Suppose h=(h1ϵ1,…,hmϵm)∈Gm such that Dhmεm⋯h1εr=∅.
For each k∈Dhmεm⋯h1εr, we denote by
sk(h)=(s1k,…,smk,sm+1k) the following sequence,
inductively by setting:
(1) s1k=k
(2) srk=hr−1εr−1(sr−1k), for r∈{2,…,m+1}.
We denote by
tk(h)=(t1k,…,tmk) the sequence defined by
[TABLE]
Lemma 3.9**.**
Let h1ε1,…,hmεm∈G such that Dhmεm⋯h1ε1=∅. Then
where ωkm=(ys1k,t1k1)ε1⋯(ysmk,tmkm)εm. Furthermore, each matrix in the product (A1,h1ε1,…,Am,hmεm) contributes with exactly one factor of it in the product
(ys1k,t1k1)ε1⋯(ysmk,tmkm)εm. For each p∈{1,…,m}, Ap,hpεp contributes with (yspk,tpkp)εp.
Proof.
The proof follows by induction on m. If m=1, the result is
obvious.
Suppose m>1. By the induction hypothesis, we obtain
[TABLE]
Now, the proof follows once one observes that tmk=hm(smk) and
ωkm=ωkm−1(ysmk,tmkm)εm.
∎
Definition 3.10**.**
Let σ∈Sm. For m=xiσ(1),hσ(1)εσ(1)…xiσ(n),hσ(n)εσ(n), and any two integers 1≤k≤l≤n, we denote m[k,l] the subword obtained from m by deleting the first k−1 and the last m−l variables.
Let xi1,h1ε1⋯xir,hrεr and xj1,h1′η1⋯xjl,hl′ηl be two monomials, with εk and ηk being ∗ or nothing, such that the matrices Ai1,h1ε1⋯Air,hrεr and Aj1,h1′η1⋯Ajs,hs′ηs have in the same position, the same nonzero entry.
Then, r=l and there exists a permutation σ∈Sr such that jq=iσ(q) and hq′=hσ(q) for all q∈{1,…,r}. In particular, xi1,h1ε1⋯xir,hrεr−xj1,h1′η1⋯xjl,hl′ηl is a strongly multi-homogeneous polynomial.
If this entry is (ys1k,t1ki1)ε1⋯(ysrk,trkir)εr, then (ysσ(q)k,tσ(q)kiσ(q))εσ(q)=(ys′qk,t′qkjq)ηq
for q=1,…,r.
Proof.
Let Ai1,h1ε1⋯Air,hrεr=k∈Dhmεr⋯h1ε1∑ωkrek,sr+1k, and Aj1,h1′η1⋯Ajl,hl′ηl=k∈Dhl′εl⋯h1′ε1∑ω~klek,sm+1k as in Lemma 3.9. Let
k be the row in which these two matrices have the same nonzero
entry. Let h=(h1,…,hr) and h′=(h1′,…,hl′) and consider the sequences sk(h)=(s1k,…,sr+1k), sk(h′)=(s′1k,…,s′r+1k), tk(h)=(t1k,…,tr+1k), tk(h′)=(t′1k,…,t′r+1k) as in Definition 3.8.
Then ωkr=ω~kl, where
ωkr=(ys1k,t1ki1)ε1⋯(ysrk,trkir)εr and ω~kl=(ys′1k,t′1kj1)η1⋯(ys′lk,t′lkjl)ηl.
Of course, we have r=l, and for each q∈{1…,r}, there exists p∈{1…,r} such
that (ys′qk,t′qkjq)ηq=(yspk,tpkip)εp.
Let us now consider two cases:
Case 1: εp=ηq. Then ip=jq, spk=s′qk and
tpk=t′qk. Since t′qk=hq′(s′qk) and
tpk=hp(spk), we obtain
hp(spk)=hq′(spk) and Lemma 3.4
implies that hp=hq′.
Case 2: εp=ηq. We suppose εp=∗.
Then, we have
[TABLE]
By comparing the indexes, we obtain ip=jq, spk=hq′(s′qk) and s′qk=hp−1(spk).
Hence s′qk=hp−1(hq′(s′qk)) and by Lemmas 3.2 and 3.6, we obtain hq′hp−1=e and hq′=hp.
From the above, we conclude that xi1,h1ε1⋯xir,hrεr−xj1,h1′η1⋯xjl,hl′ηl
is a strongly multi-homogeneous polynomial.
∎
Remark 3.12**.**
Suppose that the same entry is (k,l). Notice that there exist
matrix units ea1b1∈Mn(F)α(xj1,h1′),…,earbr∈Mn(F)α(xjr,hr′)
such that
(ea1b1)η1…(earbr)ηr=ekl and
(eaσ(p)bσ(p))εσ(p)=(eapbp)ηp for p=1,…,r.
4 The main theorem
We denote by J the TG∗-ideal generated by the polynomials
x1,ex2,e−x2,ex1,e and x1,e−x1,e∗.
In next two lemmas, we follow the ideas of [1],
[7], and [18].
Lemma 4.1**.**
Let m1(xi1,h1ε1,…,xir,hrεr),m2(xi1,h1η1,…,xil,hlηl) be two monomials that start with the same variable and let m1 and m2 be the monomials obtained from m1 and m2 by deleting the first variable.
If m1(Ai1,h1ε1,…,Air,hrεr) and m2(Ai1,h1η1,…,Ail,hlηl) have in the same position the same non-zero entry, then
m1(Ai1,h1ε1,…,Air,hrεr) and m2(Ai1,h1η1,…,Ail,hlηl) have in the same position the same non-zero entry.
Let m1=xi1,h1ε1⋯xir,hrεr and m2=xj1,h1′η1⋯xjl,hl′ηl be two monomials such that
Ai1,h1ε1⋯Air,hrεr* and
Aj1,h1′η1⋯Ajl,hl′ηl*
have in the same position, the same non-zero entry. Then m1≡m2modJ.
Proof.
We prove this lemma by induction on n.
Suppose n=1. If Ai1,h1ε1 and
Aj1,h1′η1 have in the position (p,q) the same nonzero entry, then by Lemma 3.11, i1=j1, and
h1′=h1. If ε1=η1, then m1=m2 and they are equivalent modulo J. If ε1=η1, by comparing the (p,q) entries, we have yp,h1(p)i1=yh1−1(p),pi1. Then, h1(p)=p and by Lemma 3.2, we obtain h=e, the neutral element of G. Hence, they are equivalent modulo J.
In proving the inductive step, we will show that m2 is
congruent, modulo J to a monomial m3 that starts with the
same variable of m1. Therefore, m1 and m3 will have in the same position, the same non-zero entry. According to Lemma 4.1, m1 and m3 have in the same position the same non-zero entry. Thus, by induction,
m1≡m3modJ, and consequently, m1≡m3≡m2modJ.
According to Lemma 3.11, m1−m2 is a strongly
multi-homogeneous polynomial. Furthermore, there exists a
permutation σ∈Sl such that hiσ(s)=his′,iσ(s)=js, for all s∈{1,…,l}.
From Remark of Lemma 3.11, there exist matrix units
such that (ea1b1)η1⋯(ealbl)ηl=epq. Furthermore,
(eaσ(u)bσ(u))εσ(u)=(eaubu)ηu for u=1,…,l.
Suppose that the same entry of assumption is
(ys1k,t1ki1)ε1⋯(yslk,tlkil)εl and the same
position is (p,q). Assume σ−1(1)=1. Note that
(ys1k,t1ki1)ε1=(ys′1k,t′1kj1)η1,j1=i1,
and h1=h1′. The letters
(ys1k,t1ki1)ε1=(ys′1k,t′1kj1)η1 will appear in the
p-th row of Ai1,h1ε1 and
Aj1,h1′η1. Therefore, ε1=η1 or
ε1=η1 and h1=h1′=e. The
analysis of first situation is immediate. In the second, we have
m2≡(xj1,h1′η1)∗m2[2,l] by
identity x1,e−x1,e∗.
Now, suppose that σ−1(1)>1. To analyze the monomial
m2, we denote the number σ−1(1) by k2. Let t
be the least positive integer such that σ−1(t+1)<σ−1(1)≤σ−1(t). We denote the number
σ−1(t+1) by k1 and the number σ−1(t) by
k3.
We divide the rest of proof into 4 cases.
Case 1. η1=\mboxnothing and ε1=∗. In
this situation, b1=p. If εσ(1)=∗, then
bσ(1)=p. If εσ(1)=\mboxnothing,
then aσ(1)=p. Note that α(m2[1,k2])=α(eaσ(1)bσ(1)εσ(1)…eaσ(k2)bσ(k2)εσ(k2))=α(epp)=e. Therefore,
The last equivalence follows from identity x1,e−x1,e∗.
If hk2′=h1=e, the result follows from identity
x1,e−x1,e∗. Observe that the variables
xi1,h1ε1 and xi1,h1=xjk2hk2′ could contribute with the same letter of
F[Ω] in entry (p,q). If this occurs, then hk2′=h1=e. From x1,e−x1,e∗, we obtain the desired result.
Otherwise, suppose that h1=e,
xi1h1ε1 and xjk2,hk2′ do
not contribute with the same letter of F[Ω]. Thus, there
exists an integer w,w=k2,1<w≤l, such that
xjw,hw′ηw and
xi1,h1ε1 contribute with the same letter of F[Ω] in entry (p,q). Without loss of generality, suppose that w<k2. Notice that ε1=ηw and α(m4[1,w+1])=e. Hence
m2≡m4≡xi1,h1ε1(m4[1,w])∗m4[w+2,l]modJ.
The Case 1 is verified.
Case 2. ε1=\mboxnothing and η1=∗. It is
analogous to case 2.
Case 3. η1=ε1=∗. Now,
α(m2[1,k2−1])=gb1gb1−1=e. Suppose
that ηt=ηt+1=\mboxnothing (the other three cases
are analogous). We analyze eight subcases.
Case 3.1: k1=1.
Subcase 3.1.1: εt=ηt and
εt+1=ηt+1. Here,
α(m2[1,k2−1])=α(m2[k2,k3−1])=e. Consequently, by
identity x1,ex2,e−x2,ex1,e, we have m2≡m2[k2,k3−1]m2[1,k2−1]m2[k3,l]modJ.
Subcase 3.1.2: εt=ηt and
εt+1=ηt+1. This subcase is similar to
Subcase 3.1.1. Here α(m2[1,k2−1])=α(m2[k2,k3])=e.
Subcase 3.1.3: εt=ηt and
εt+1=ηt+1. Here, α(m2[1,1])=α(m2[2,k2−1])−1=α(m2[k2,k3−1]). Hence, by identity x1,e−x1,e∗, we have
Subcase 3.1.4: εt=ηt and
εt+1=ηt+1 . This subcase is analogous to
Subcase 3.1.3. Now, α(m2[1,1])=α(m2[2,k2−1])−1=α(m2[k2,k3]).
Case 3.2: k1>1.
Subcase 3.2.1: εt=ηt and
εt+1=ηt+1. Here,
α(m2[1,k1−1])=α(m2[k1,k2−1])−1=α(m2[k2,k3]). Thus, by identity x1,e−x1,e∗, we have m2≡m2[k2,k3](m2[1,k1−1])∗(m2[k1,k2−1])∗m2[k3+1,l]modJ.
Subcase 3.2.2: εt=ηt and
εt+1=ηt+1. Here,
α(m2[1,k1−1])=α(m2[k1,k2−1])−1=α(m2[k2,k3−1]). Thus, by identity x1,e−x1,e∗, we have m2≡m2[k2,k3−1](m2[1,k1−1])∗(m2[k1,k2−1])∗m2[k3,l]modJ.
Subcase 3.2.3: εt=ηt and
εt+1=ηt+1. In this subcase,
α(m2[1,k1])=α(m2[k1+1,k2−1])−1=α(m2[k2,k3]). Thus, by identity x1,e−x1,e∗, we have m2≡m2[k2,k3](m2[1,k1])∗(m2[k1+1,k2−1])∗m2[k3,l]modJ.
Subcase 3.2.4: ηt=εt and
ηt+1=εt+1. Finally,
α(m2[1,k1])=α(m2[k1+1,k2−1])−1=α(m2[k2,k3−1]). In this way, by identity x1,e−x1,e∗, we have n≡m2[k2,k3−1](m2[1,k1])∗(m2[k1+1,k2−1])∗m2[k3,l]modJ.
Case 4. η1=ε1=\mboxnothing. It is similar
to case 3.
∎
We now recall the result [8, Corollary 3.2], which is
based on an idea of [4, Corollary 11] about graded
monomial identities.
Lemma 4.3**.**
If a monomial xi1,h1…xip,hp in F⟨X⟩ is a graded identity for Mn(F), then it is a consequence of a monomial in TG(Mn(F)) of length at most 2n−1.
By Lemma 3.7, a monomial xi1,h1ε1⋯xir,hrεr is a (G,∗)-identity for Mn(F) if
and only if Dhrεr⋯h1ε1=∅. In particular, we obtain
the following lemma.
Lemma 4.4**.**
A monomial xi1,h1ε1⋯xir,hrεr is a (G,∗)-identity for Mn(F) if and only if xi1,h1ε1⋯xir,hrεr is a G-graded identity for Mn(F).
The following proposition is a straightforward consequence of the
above lemmas.
Proposition 4.5**.**
Let m be a monomial identity of Mn(F). Then, m is a
consequence of monomial identities of degree up to 2n−1.
Remark 4.6**.**
We recall that in [4] and [8], the
authors conjecture that the graded monomial identities of Mn(F)
follow from the graded identities of degree up to n. We observe
that once this conjecture is true, the same holds for the
(G,∗)-identities of Mn(F).
We now state the main theorem of this paper.
Theorem 4.7**.**
Let U be the TG∗-ideal generated by identities
(1),(2),(3), and by the (G,∗)-monomial identities of degree up to 2n−1 of Mn(F).
Then,
[TABLE]
Proof.
From Proposition 2.4, U⊆TG∗(Mn(F)). Let
us suppose
U⫋TG∗(Mn(F)) Then, there
exists a strongly multi-homogeneous polynomial f∈TG∗(Mn(F))−U. By writing f=∑i=1lλimi, we may suppose that all λi∈F−{0}, mi∈F⟨X∣(G,∗)⟩ are monomials, which are not (G,∗)-identities for Mn(F) and that the number l of nonzero summands of f is minimal among the strongly multi-homogeneous polynomials f∈TG∗(Mn(F))−U.
Since f∈TG∗(Mn(F)), we have
[TABLE]
By substituting the variables by generic matrices, we obtain that m1 and some mj, j>1, have the same nonzero entry in the same position. Hence, by Lemma 4.2, we conclude that m1≡mjmodU.
Now let
[TABLE]
Then h≡fmodU and the number of non-zero summands of h is l−1<l. This is a contradiction.
∎
Acknowledgements
This work was started when the authors were visiting IMPA in (brazilian) summer 2016. The authors would like to thank IMPA for the hospitality and for the financial support.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] S. S. Azevedo, Graded identities for the matrix algebra of order n over an infinite field , Comm. Algebra 30 (2002), no. 12, 5849–5860.
2[2] S. S. Azevedo, A basis for ℤ ℤ \mathbb{Z} -graded identities of matrices over infinite fields , Serdica Math. J. 29 (2003), no. 2, 149–158.
3[3] Yu. Bahturin, V. Drensky, Graded polynomial identities of matrices , Linear Algebra and its Applications, 357 (2002), 15–34.
4[4] L. Centrone, T. C. de Mello, On ℤ n subscript ℤ 𝑛 \mathbb{Z}_{n} -graded identities of block-triangular matrices , Linear and Multilinear Algebra 63 (2015), no. 2, 302–313.
5[5] S. Dăscălescu, C. Năstălescu and J.R. Montes Group gradings on full matrix rings , J. Algebra 220 (1999), 709-728.
6[6] O. M. Di Vincenzo, On the graded identities of M 1 , 1 ( E ) subscript 𝑀 1 1 𝐸 M_{1,1}(E) , Israel J. Math. 80 (1992), no.3, 323–335.
7[7] D. Diniz, On the graded identities for elementary gradings in matrix algebras over infinite fields , Linear Algebra and its Applications 439 (2013), 1530–1537.
8[8] D. Diniz, T.C. de Mello, Graded identities of block-triangular matrices , J. Algebra 464, (2016) , 246-265.