Research article Special Issues

Varieties of a class of elementary subalgebras

  • Let G be a connected standard simple algebraic group of type C or D over an algebraically closed field k of positive characteristic p>0, and g:=Lie(G) be the Lie algebra of G. Motivated by the variety of E(r,g) of r-dimensional elementary subalgebras of a restricted Lie algebra g, in this paper we characterize the irreducible components of E(rkp(g)1,g) where the p-rank rkp(g) is defined to be the maximal dimension of an elementary subalgebra of g.

    Citation: Yang Pan, Yanyong Hong. Varieties of a class of elementary subalgebras[J]. AIMS Mathematics, 2022, 7(2): 2084-2101. doi: 10.3934/math.2022119

    Related Papers:

    [1] M. Mohseni Takallo, Rajab Ali Borzooei, Seok-Zun Song, Young Bae Jun . Implicative ideals of BCK-algebras based on MBJ-neutrosophic sets. AIMS Mathematics, 2021, 6(10): 11029-11045. doi: 10.3934/math.2021640
    [2] Nazia Jabeen, Junaid Alam Khan . Subalgebra analogue of Standard bases for ideals in $ K[[t_{1}, t_{2}, \ldots, t_{m}]][x_{1}, x_{2}, \ldots, x_{n}] $. AIMS Mathematics, 2022, 7(3): 4485-4501. doi: 10.3934/math.2022250
    [3] Anas Al-Masarwah, Abd Ghafur Ahmad . On (complete) normality of m-pF subalgebras in BCK/BCI-algebras. AIMS Mathematics, 2019, 4(3): 740-750. doi: 10.3934/math.2019.3.740
    [4] Anas Al-Masarwah, Abd Ghafur Ahmad . Subalgebras of type (α, β) based on m-polar fuzzy points in BCK/BCI-algebras. AIMS Mathematics, 2020, 5(2): 1035-1049. doi: 10.3934/math.2020072
    [5] Sun Shin Ahn, Young Joo Seo, Young Bae Jun . Pseudo subalgebras and pseudo filters in pseudo BE-algebras. AIMS Mathematics, 2023, 8(2): 4964-4972. doi: 10.3934/math.2023248
    [6] Rajab Ali Borzooei, Hee Sik Kim, Young Bae Jun, Sun Shin Ahn . MBJ-neutrosophic subalgebras and filters in $ BE $-algebras. AIMS Mathematics, 2022, 7(4): 6016-6033. doi: 10.3934/math.2022335
    [7] Dilara Siraeva . The invariant solution with blow-up for the gas dynamics equations from one-parameter three-dimensional subalgebra consisting of space, Galilean and pressure translations. AIMS Mathematics, 2024, 9(1): 89-98. doi: 10.3934/math.2024006
    [8] Wenbo Huang, Jiankui Li, Shaoze Pan . Some zero product preserving additive mappings of operator algebras. AIMS Mathematics, 2024, 9(8): 22213-22224. doi: 10.3934/math.20241080
    [9] Eunsuk Yang, Eun Hwan Roh, Young Bae Jun . An introduction to the theory of OBCI-algebras. AIMS Mathematics, 2024, 9(12): 36336-36350. doi: 10.3934/math.20241723
    [10] Remala Mounikalakshmi, Tamma Eswarlal, Chiranjibe Jana . Bipolar fuzzy INK-subalgebras of INK-algebras. AIMS Mathematics, 2024, 9(10): 27593-27606. doi: 10.3934/math.20241340
  • Let G be a connected standard simple algebraic group of type C or D over an algebraically closed field k of positive characteristic p>0, and g:=Lie(G) be the Lie algebra of G. Motivated by the variety of E(r,g) of r-dimensional elementary subalgebras of a restricted Lie algebra g, in this paper we characterize the irreducible components of E(rkp(g)1,g) where the p-rank rkp(g) is defined to be the maximal dimension of an elementary subalgebra of g.



    Let (g,[p]) be a finite dimensional restricted Lie algebra over an algebraically closed field k of positive characteristic p>0. Following [3] we say that g is elementary, provided g is abelian and [p]=0. Given a positive integer r, there is a mount of literatures investigating the set E(r,g) of elementary subalgebras of dimension r. For instance, the very original paper [3] studies the geometric properties of E(r,g), which shows that it is a projective variety. The structure of E(r,g) is described there for simple algebraic Lie algebras of types A,C and r=rkp(g) being the p-rank of g. For a finite dimensional restricted Lie algebra g, the p-rank rkp(g) is defined as follows

    rkp(g):=max{rN0;E(r,g)}.

    Later on, the first author explores the irreducible components of the variety E(r,g) in [6] for simple algebraic Lie algebras of type A when r equals rkp(g)1.

    We now assume that G is a simple algebraic k-group with irreducible root system Φ. The interested reader may consult [1,2,4,10] for the theory of algebraic groups. Let Δ:={α1,,αn} be the set of positive simple roots. For any IΔ define the parabolic subgroup WI and its corresponding root system ΦI with Φ+I being the set of positive roots. We recall two definitions in [9].

    Definition 1. We set S:=ΔI and then define

    ΦradS=Φ+Φ+I

    to be the set of positive roots that cannot be written as a linear combination of the simple roots not in S. If S={αi}, then we simply write Φradi instead of Φrad{αi}.

    Definition 2. Let α and β be two roots of Φ. We say that α and β commute if α+β is not a root.

    Building on methods developed in [5,7,9], we find that the maximal elementary subalgebras of dimension rkp(g) are given by the combinatorics of the commuting roots of Φ. It is our aim in this paper to present the method of finding the maximal subsets of commuting positive roots of order rsmax:=rkp(g)1 for types C and D, and the geometric properties of the varieties E(rsmax,g) for these two types. Let Φ be the root system of type C or D respectively, and Max(r,Φ+) be the set of maximal subsets of commuting positive roots of order r. We refer to [5] for his linear algebraic approach to sets of commuting roots for irreducible root systems, which enables our set Max(rsmax,Φ+) to be more tractable. We compute E(rsmax,g) under the assumption that G is standard, which means the derived subgroup of G is simply connected, p is a good prime for G and the Lie algebra g=Lie(G) admits a non-degenerate G-invariant symmetric bilinear form. We rely on the result of Premet (see Lemma 2.2, [8]) to show that any elementary subalgebras of g can be conjugated into ug, the Lie algebra of the unipotent radical U of the Borel subgroup BG. We define E(rsmax,u)max as the set of maximal elementary subalgebras of dimension rsmax in u. The calculation of E(rsmax,g) then proceeds via two steps. First, we determine E(rsmax,u)max as a set. We define a map Lie:Max(rsmax,Φ+)E(rsmax,u)max which sends a maximal subset of commuting positive roots of order rsmax to a maximal elementary subalgebra of dimension rsmax in u and show that there is an inverse map LT:E(rsmax,u)maxMax(rsmax,Φ+) which splits Lie. The map Lie is not necessarily surjective but we show that for types C and D except for small ranks it is surjective up to conjugation by U. Further, after giving the definition of ideals of the root system Φ, we effectively prove that the maximal elementary subalgebras of dimension rsmax in u up to conjugation by G are given by the ideals of Φ. To finish the calculation of E(rsmax,g), we allow actions by the Weyl group WG and determine the irreducible components of E(rsmax,g).

    This paper is organized as follows: In section 2, we determine the set Max(rsmax,Φ+) for types Cn(n3) and Dn(n5). Section 3 deals with the surjection of the map Lie up to conjugation by G for types C and D. Finally in section 4 we give the irreducible components of E(rsmax,g).

    Throughout this section, if M and N are two subsets of Φ, we will use the symbol [M,N]=0 to denote that roots in M and N commute. Let rmax be the maximal order of a subset of commuting positive roots. The result in [9] tells us that rkp(g) and rmax are equal. Since the p-rank rkp(g) should be clear for our consideration in this section, we list the related facts through Table 1.

    Table 1.  Maximal sets of commuting roots.
    Type T Rank Max(rmax,Φ+) rmax
    Cn n3 Φradn 12n(n+1)
    Dn n=4 Φrad1,Φrad3,Φrad4 6
    n5 Φradn1,Φradn 12n(n1)

     | Show Table
    DownLoad: CSV

    Let G be a simple algebraic group with root system Φ which is of type Cn (n3), and g:=Lie(G). Let Φ+={ϵiϵj1i<jn}{ϵi+ϵj1ijn} be the set of positive roots and Φ=Φ+Φ+. Setting αi=ϵiϵi+1, where 1in1 and αn=2ϵn. It follows that Δ={α1,,αn} is a base of Φ.

    Theorem 2.1. Let Φ be of type Cn. The set Max(rsmax,Φ+) consists only one element

    ΦCn1,n:={ϵi+ϵj1ij<n}{ϵrϵn1r<n}.

    Proof. Let J be a subset of {1,,n} and J:={1,,n}J be its complement. A maximal subset of commuting roots of Φ is uniquely given by (see [9,A.3])

    ϕ(J):={ϵi+ϵi,ϵiϵj,ϵjϵji,iJandj,jJ}.

    Notice that ϕ(J)Φ+ if and only if J={1,,n}. It follows that

    Φradn=ϕ({1,,n})

    of order 12n(n+1) is the unique element of Max(rmax,Φ+).

    Let M(C) be an element of Max(rsmax,Φ+). The fact above implies that M(C) cannot be a maximal subset of commuting roots of Φ. It asserts that M(C)ϕ(J0) for some J0, and |ϕ(J0)|=|M(C)|+1. We conclude that J0={1,,n1} and

    M(C)={ϵi+ϵj1ij<n}{ϵrϵn1r<n}

    which will be denoted by ΦCn1,n.

    Let G be a simple algebraic group with root system Φ which is of type Dn(n4), and g:=Lie(G). Let

    Φ+={ϵi±ϵj1i<jn}

    be the set of positive roots of Φ. Defining αi=ϵiϵi+1 for 1in1 together with αn=ϵn1+ϵn, then Δ={α1,,αn} is a base of Φ.

    Definition 3. We define Φradα1,α2 as a subset of Φ consisting of roots

    ϵ1±ϵi,ϵ2±ϵj,where2inand3jn.

    Proposition 2.2. Let RΦradα1,α2 be a subset of commuting positive roots. We either have

    (1) RΦrad1, or

    (2) RSab:={ϵ1+ϵ2}SaSb.

    where Sa{ϵ1ϵr,ϵ2+ϵr3rn} is a maximal subset having the property ϵ1ϵrSa if and only if ϵ2+ϵrSa and Sb{ϵ1+ϵr,ϵ2ϵr3rn} is a maximal subset with the property ϵ1+ϵrSb if and only if ϵ2ϵrSb.

    Proof. If ϵ1ϵ2R, then ϵ2±ϵjR for 3jn, which implies the inclusion RΦrad1={ϵ1±ϵi}2in. Alternatively, ϵ1ϵ2R, it follows that RSab.

    Notation 2.3. We make a restriction on the rank by letting n=4. There are four possibilities for Sa, denoted by

    (1) S1a={ϵ1ϵ3,ϵ1ϵ4},

    (2) S2a={ϵ1ϵ3,ϵ2+ϵ4},

    (3) S3a={ϵ2+ϵ3,ϵ2+ϵ4},

    (4) S4a={ϵ1ϵ4,ϵ2+ϵ3}.

    Similarly, Sb has the following four forms

    (1) S1b={ϵ1+ϵ3,ϵ1+ϵ4},

    (2) S2b={ϵ1+ϵ3,ϵ2ϵ4},

    (3) S3b={ϵ2ϵ3,ϵ2ϵ4},

    (4) S4b={ϵ1+ϵ4,ϵ2ϵ3}.

    Lemma 2.4. Let Φ be of type D4. Then the elements of Max(5,Φ+) are

    (1) Sijab:={ϵ1+ϵ2}SiaSjbwhere1i,j4\; and \; (i,j)(1,1),(3,1),(4,1),

    (2) S1:={ϵ1±ϵ2,ϵ1+ϵ3,ϵ1ϵ4,ϵ3ϵ4},

    (3) S2:={ϵ1±ϵ2,ϵ1+ϵ3,ϵ1+ϵ4,ϵ3+ϵ4},

    (4) S3:={ϵ1±ϵ2,ϵ1+ϵ3,ϵ3±ϵ4},

    (5) S4:={ϵ1+ϵ2,ϵ1+ϵ3,ϵ2+ϵ3,ϵ3±ϵ4}.

    Proof. It is known that rsmax=rkp(g)1=5 for D4. Let Ψ+=Φ+Φradα1,α2={ϵ3±ϵ4} be the complement of Φradα1,α2 in Φ+, and M(D)Max(5,Φ+). Assume that M(D)=MaMb, where MaΨ+ and MbΦradα1,α2.

    If Ma=, then |Mb|=5. By Proposition 1, M(D)Sab. Since M(D) is maximal, according to Notation 1, we have

    M(D)=Sijab:={ϵ1+ϵ2}SiaSjb

    where 1i,j4 and (i,j)(1,1),(3,1),(4,1).

    If |Ma|=1, then |Mb|=4. Since MaΨ+, it follows that MbΦrad1, Mb{ϵ1+ϵ2}S4aS2b, or Mb{ϵ1+ϵ2}S3aS1b. But M(D) is maximal, so Mb={ϵ1±ϵ2,ϵ1+ϵ3,ϵ1ϵ4} when Ma={ϵ3ϵ4} and Mb={ϵ1±ϵ2,ϵ1+ϵ3,ϵ1+ϵ4} when Ma={ϵ3+ϵ4}.

    If |Ma|=2, then |Mb|=3. Then Ma=Ψ+, and Mb={ϵ1±ϵ2,ϵ1+ϵ3}Φrad1, or Mb={ϵ1+ϵ2,ϵ1+ϵ3,ϵ2+ϵ3}Sab.

    Summarizing here, there are 17 possibilities of M(D), they are Sijab for 1i,j4 and (i,j)(1,1),(3,1),(4,1), S1:={ϵ1±ϵ2,ϵ1+ϵ3,ϵ1ϵ4,ϵ3ϵ4}, S2=:{ϵ1±ϵ2,ϵ1+ϵ3,ϵ1+ϵ4,ϵ3+ϵ4}, S3:={ϵ1±ϵ2,ϵ1+ϵ3,ϵ3±ϵ4}, and S4:={ϵ1+ϵ2,ϵ1+ϵ3,ϵ2+ϵ3,ϵ3±ϵ4}.

    Lemma 2.5. Let Φ be of type D5. Then the elements of Max(9,Φ+) are of the forms

    {ϵi+ϵi,ϵiϵjii,i,iIsandjJs}Φ+fors{1,2},

    where I1={1,2,3} with J1={4,5} and I2={1,2,3,5} with J2={4}.

    Proof. Note that rsmax=rkp(g)1=9 for D5. Let

    Ψ+=Φ+Φradα1,α2={ϵ3±ϵ4,ϵ3±ϵ5,ϵ4±ϵ5},

    and M(D)Max(9,Φ+). Assume that M(D)=MaMb, where MaΨ+,MbΦradα1,α2.

    If ϵ3ϵ4Ma, then ϵ4±ϵ5Ma which gives MaM0a:={ϵ3±ϵ4,ϵ3±ϵ5}. Alternatively, if ϵ3ϵ4Ma, then MaM1a:={ϵ3+ϵ4,ϵ3+ϵ5,ϵ4+ϵ5}, or MaM2a:={ϵ3+ϵ4,ϵ3ϵ5,ϵ4ϵ5}, or MaM3a:={ϵ3+ϵ4,ϵ3±ϵ5}, or MaM4a:={ϵ3+ϵ4,ϵ4±ϵ5}. So, we have |Ma|4. If |Mb|=8, then Mb must be Φrad1, which is maximal in Φ+, it is a contradiction. Hence, |Ma|2.

    If |Ma|=4, then |Mb|=5 and Ma=M0a={ϵ3±ϵ4,ϵ3±ϵ5}. But [Ma,Mb]=0, which implies |Mb|3 whenever MbΦrad1 or MbSab, it is a contradiction.

    If |Ma|=3, then |Mb|=6. In this case, we first assume that MbΦrad1. Then ϵ1±ϵi exist for at least one choice for i from the set {3,4,5}, this implies |Ma|2 by [Ma,Mb]=0, it is a contradiction. Then we may assume MbSab, it follows that |Mb(SaSb)|5. We list several possibilities to get a contradiction in this case: (a) Ma=M1a or M2a, there is no Mb with |Mb|=6 such that M(D) is maximal; (b)Ma=M3a or M4a, then Mb{ϵi+ϵj}{ϵ1+ϵ2} where 1i2 and 3j4, thus |Mb(SaSb)|4; (c)MaM0a, then ϵ3±ϵi occurs in Ma for i=4 or i=5, which implies |Mb|5.

    If |Ma|=2, then |Mb|=7. If MbΦrad1, then Ma= by [Ma,Mb]=0, it is a contradiction. If MbSab, then

    Mb={ϵ1+ϵ2}{ϵi+ϵj,ϵiϵ4i=1,2andj=3,5}

    with Ma={ϵ3ϵ4,ϵ3+ϵ5}, or

    Mb={ϵ1+ϵ2}{ϵi+ϵ3,ϵiϵji=1,2andj=4,5}

    with Ma={ϵ3ϵ4,ϵ3ϵ5}.

    Summarizing here, by taking I1={1,2,3} with J1={4,5} and I2={1,2,3,5} with J2={4} there are two possibilities for M(D), that is

    M(D)={ϵi+ϵi,ϵiϵjii,i,iIsandjJs}Φ+fors{1,2}.

    Proposition 2.6. Suppose that Φ is of type Dn with n6. Let Ψradn2:=Ψ+Φradn and Ψradn3:=Ψ+Φradn1, where Ψ=Φ±Φradα1,α2 is a root system of Dn2. Let M(D)Max(n(n1)21,Φ+), then there is no such a decomposition M(D)=MaMb with Ma=Ψradn2 or Ψradn3 and MbΦradα1,α2.

    Proof. We first know that n(n1)21 is the rank rsmax of Dn, and (n2)(n3)2 is the p-rank of Dn2. Since Ψ is the root system of Dn2 and by Table 1

    Max(n(n1)2,Φ+)={Φradn1,Φradn},

    it follows that

    Ψradn2:=Ψ+Φradn,

    and

    Ψradn3:=Ψ+Φradn1()

    are the only two elements of Max((n2)(n3)2,Ψ+).

    Recall that Φradα1,α2={ϵ1±ϵi,ϵ2±ϵj2inand3jn}. If Ma=Ψradn2, then ϵiϵjMb for i=1,2 and 3jn by [Ma,Mb]=0, this gives rise to

    Mb{ϵ1±ϵ2,ϵ1+ϵi}3in,

    or

    Mb{ϵ1+ϵi,ϵ2+ϵj2inand3jn}.

    Note that |Mb|=|M(D)||Ma|=2n4 if M(D) exists. An inspection of these two cases gives either |Mb|n<2n4 or M(D)=MaMbΦradn, from which we deduce that M(D) does not exist. Alternatively, we assume that Ma=Ψradn3. For this situation, we get

    Mb{ϵ1±ϵ2,ϵ1ϵn,ϵ1+ϵj}3jn1,

    or

    Mb{ϵ1ϵn,ϵ1+ϵi}2in1{ϵ2ϵn,ϵ2+ϵj}3jn1.

    Accordingly, we have either |Mb|n<2n4 or M(D)=MaMbΦradn1, which also shows the non-existence of M(D).

    Lemma 2.7. Let n=6. Keep the notations for Ψ,M(D),Ma and Mb as above. Then the elements of Max(14,Φ+) are

    {ϵi+ϵi,ϵiϵjii,i,iIsandjJs}Φ+fors{1,2}

    where I1={1,2,3,4} with J1={5,6} and I2={1,2,3,4,6} with J2={5}.

    Proof. Since n=6, the p-rank rkp(g) is 15 and the rank rsmax=rkp(g)1 is 14. Since Ψ is the root system of D4, and the p-rank of D4 is 6, it gives |Ma|6. By Proposition 1 and the maximality of Φrad1 in Φ+, we have |Mb|9. Hence, there are only two possibilities for M(D) if it exists: |Ma|=6 and |Mb|=8, or |Ma|=5 and |Mb|=9.

    If |Ma|=6, then Ma=Ψrad3,Ψrad4 or Ψrad1 b Table 1. By Proposition 2, one only needs to check the case when Ma=Ψrad1. Recall that

    Ψrad1={ϵ3±ϵi}4i6,

    it gives

    Mb{ϵ1±ϵ2,ϵ1+ϵ3}

    or

    Mb{ϵ1+ϵ2,ϵ1+ϵ3,ϵ2+ϵ3},

    there is no Mb with |Mb|=8. If |Ma|=5, then |Mb|=9 if M(D) exists. If MbΦrad1, then every element in Ψ+ cannot commute with the elements of Mb, so M(D) does not exist. Otherwise, we let MbSab, then it has to be Mb=Sab by comparing their orders. If Ma is not maximal in Ψ+, then MaΨrad1,Ψrad3 or Ψrad4. We discuss these three possibilities to get a contradiction:

    (a) MaΨrad1, then there exists i0 where 4i06 such that ϵ3±ϵi0Ma. But ϵ3±ϵi0 cannot commute with elements of Sab from each of the sets

    {ϵ1+ϵi0,ϵ2ϵi0}

    and

    {ϵ1ϵi0,ϵ2+ϵi0};

    (b) MaΨrad3, then Sab must be

    {ϵ1+ϵi,ϵ2+ϵi}3i5{ϵ1+ϵ2,ϵ1ϵ6,ϵ2ϵ6},

    but now MaMbΦrad5;

    (c) MaΨrad4, then Sab must be

    {ϵ1+ϵi}2i6{ϵ2+ϵr}3r6,

    but again

    MaMbΦrad6.

    Now the consideration is left only for Ma being maximal with |Ma|=5. Since the rank rsmax is 5 for D4, we have MaMax(5,Ψ+). By Lemma 2.4 there are only two are suitable here, they are

    Ma={ϵ3+ϵ4,ϵiϵ5,ϵiϵ6}3i4,

    or

    Ma={ϵ3+ϵ4,ϵiϵ5,ϵi+ϵ6}3i4.

    Given by these, the corresponding Mb is

    Mb={ϵ1+ϵ2,ϵi+ϵr,ϵiϵs}1i2,3r4,5s6,

    or

    Mb={ϵ1+ϵ2,ϵi+ϵr,ϵiϵ5,ϵi+ϵ6}1i2,3r4.

    Summarizing here, by denoting I1={1,2,3,4} with J1={5,6} and I2={1,2,3,4,6} with J2={5} we have

    M(D)={ϵi+ϵi,ϵiϵjii,i,iIsandjJs}Φ+fors{1,2}.

    Notation 2.8. Let J be a subset of {1,,n}. We denote by

    ϕ(J):={ϵi+ϵi,ϵiϵj,ϵjϵjii,i,iJandjj,j,jJ}

    a set of commuting roots and consider the following sets

    ΦDn2,n1:=ϕ(J)Φ+whenJ={1,,n2},
    ΦDn1,n:=ϕ(J)Φ+whenJ={1,,n2,n}.

    Theorem 2.9. Suppose that Φ is of type Dn(n5). Let M(D)Max(rsmax,Φ+), then M(D) is either of the form ΦDn2,n1 or of the form ΦDn1,n.

    Proof. We prove the above statement by induction. The statement is clear for n=5 and n=6 by Lemmas 2 and 3. Assume it is proved for 2m1 and 2m, m3. We prove the statement is true for 2m+1 and 2m+2.

    Keep the notation for Ψ,Ma and Mb as above again. Let M(D)Max(rsmax,Φ+) and Φ be of type Dn, where n{2m+1,2m+2}. Assume that M(D)=MaMb where MaΨ+,MbΦradα1,α2. Then we get the upper bounds for |Ma| and |Mb|:

    |Ma|(n2)(n3)2,|Mb|2n2

    which are constrained by |Ma|+|Mb|=n(n1)21. By Proposition 2, we have |Ma|(n2)(n3)2. By the maximality of Φrad1, we have |Mb|2n2 (otherwise Mb=Φrad1 but 2n2<n(n1)21 when n7). The only case left for our consideration is when |Ma|=(n2)(n3)21 and |Mb|=2n3.

    Note that (n2)(n3)21 is the rank rsmax for Ψ of Dn2. If Ma is maximal in Ψ+, then by induction hypothesis

    Ma=ϕ(ˆJ)Ψ+forˆJ={3,,n2}orˆJ={3,,n2,n}.

    According to this, we get Mb=Sab. More precisely,

    Mb={ϵ1+ϵ2,ϵi+ϵr,ϵiϵn1,ϵiϵn}1i2,3rn2

    when ˆJ={3,,n2}, or

    Mb={ϵ1+ϵ2,ϵi+ϵr,ϵiϵn1,ϵi+ϵn}1i2,3rn2

    when ˆJ={3,,n2,n}. Both of them give rise to

    M(D)=ϕ(J)Φ+

    where J=ˆJ{1,2}(i.e. J={1,,n2} or J={1,,n2,n}).

    Afterwards, let us turn to the case when Ma is not maximal. Since

    Max(rmax,Ψ+)={Ψradn3,Ψradn2}

    by (), this gives MaΨradn3 or MaΨradn2. If MaΨradn3, then

    Mb={ϵ1+ϵ2,ϵi+ϵr,ϵiϵn}1i2,3rn1

    by [Ma,Mb]=0, but then MaMbΦradn1 which is not maximal, so M(D) does not exist. If MaΨradn2, then

    Mb={ϵ1+ϵ2,ϵi+ϵr}1i2,3rn

    by [Ma,Mb]=0, but MaMbΦradn, so there is no M(D) by the same reason.

    (Sect. 3.1 of [9]). We have to choose a total ordering on Φ+ which respects addition of positive roots, that is, if β,γ,λ,β+λ,γ+λΦ+ and βγ then β+λγ+λ. We note that the standard ordering on Φ respects addition, as does a reverse lexicographical ordering with respect to any ordering of the simple roots. This ordering will define the extraspecial pairs in our root system and consequently the signs in the structure constants of the chevalley basis.

    Let Eu be an elementary subalgebra. The ordering on Φ+ gives an ordering on the basis elements xβ of u. Choose the unique basis of E which is in reduced echelon form with respect to this ordering and let LT(E) be the set of roots β such that the corresponding xβ are the leading term in this reduced basis. Observe that if xβ and xγ are the leading terms of b1=xβ+<lower terms> and b2=xγ+<lower terms> respectively, and if β+γΦ+ then [xβ,xγ]=Nβ,γxβ+γ is the leading term of [b1,b2]. Thus if [b1,b2]=0 then β and γ commute. This proves that LT(E) is a set of commuting roots.

    We concentrate on G being a connected simple algebraic k-group of type C or D with g:=Lie(G) and p is a good prime. Let Φ be the root system of G with positive roots Φ+. Let u:=Lie(U) be the Lie algebra of the unipotent radical U of the Borel subgroup BG, and {xα:αΦ+} be a basis of u. Since p is good for G, we have [xα,xβ]=0 if and only if α+βΦ for α,βΦ. Recall that x[p]α=0 for αΦ, one does have an elementary subalgebra

    Lie(R):=Spank{xα ; αR}

    when R is a subset of commuting roots.

    In section 2, we have determined all the elements of the set Max(rsmax,Φ+). In virtue of LT, for RMax(rsmax,Φ+), Lie(R) is not properly contained in any elementary subalgebra Eu. If there were such E, then we would have RLT(E), violating the maximality of R. We present the result through the following corollary:

    Corollary 3.1. Suppose p is a good prime. Let G be a connected simple algebraic group of type Cn(n3) or Dn(n5) over an algebraically closed field k of positive characteristic p>0 and u:=Lie(U) be the Lie algebra of the unipotent radical U of the Borel subgroup BG. Then the assignment

    RLie(R)

    induces an injective map

    Lie:Max(rsmax,Φ+)E(rsmax,u)max

    where Max(rsmax,Φ+) is summarized by Table 2.

    Table 2.  Maximal subsets of commuting roots of order rsmax.
    Type T Rank Max(rsmax,Φ+) rsmax
    Cn n3 ΦCn1,n 12n(n+1)1
    Dn n5 ΦDn2,n1,ΦDn1,n 12n(n1)1

     | Show Table
    DownLoad: CSV

    Suppose that G is of type Cn(n3). Let be the reverse lexicographic ordering given by αnαn1α1.

    Lemma 3.2. Suppose that G is of type Cn with n3. If EE(rsmax,u)max, then LT(E)Max(rsmax,Φ+) with respect to .

    Proof. If LT(E)Max(rsmax,Φ+), then LT(E)Φradn by Table 1. Note that Φ+ΦradnΦradn, it follows that all terms of basis vectors correspond to the roots lying in Φradn. Hence, E is contained in the elementary subalgebra Lie(Φradn). Notice that dimE<dimLie(Φradn), the containment is proper which contradicts maximality.

    In what follows, we will refine sets Φ+ and ΦCn1,n. We define for 1in

    Φ+i:={ϵ1+ϵi,ϵ2+ϵi,,2ϵi},

    and for 1<in

    Φi:={ϵ1ϵi,ϵ2ϵi,,ϵi1ϵi}.

    Then the elements of Φ+i and Φi satisfy

    2ϵiϵi1+ϵiϵ1+ϵi,ϵi1ϵiϵi2ϵiϵ1ϵi

    and Φ+ is the union of the following subsets:

    Φ2Φn1ΦnΦ+nΦ+n1Φ+1.

    Recall the definition of ΦCn1,n for Cn in Section 2.1, we get

    ΦCn1,n=Φnn1i=1Φ+i.

    Theorem 3.3. Suppose that G is of type Cn with n3. If EE(rsmax,u) satisfies LT(E)=ΦCn1,n then E=Lie(ΦCn1,n)exp(ad(axαn)) for some a.

    Proof. If LT(E)=ΦCn1,n, the reduced echelon form basis of E is

    xij=xϵi+ϵj,1ij<n,

    and

    yi=xϵiϵn+ns=1aisxϵs+ϵn,1i<n.

    Step I. We prove that a11=0. Let exp(ad(a11N12ϵn,ϵ1ϵnxαn)) be the conjugation acting on E, which is lower triangular with respect to . Therefore,

    LT(exp(ad(a11N12ϵn,ϵ1ϵnxαn))(E))=LT(E)

    and the term xϵ1+ϵn in exp(ad(a11N12ϵn,ϵ1ϵnxαn))(y1) is eliminated.

    Step II. We prove that all ais=0. For j>1, we have

    [y1,yj]=ns=1Nϵ1ϵn,ϵs+ϵnajsxϵ1+ϵs+ns=2Nϵs+ϵn,ϵjϵna1sxϵs+ϵj.

    The coefficient of xϵs+ϵj in [y1,yj] is Nϵs+ϵn,ϵjϵna1s, so a1s=0; the coefficient of xϵ1+ϵs in [y1,yj] is Nϵ1ϵn,ϵs+ϵnajs, so ajs=0. Thus E=Lie(ΦCn1,n)exp(ad(axαn)) for a=a11N12ϵn,ϵ1ϵn.

    Suppose that G is of type Dn. Let be the reverse lexicographic ordering given by

    αn2α2α1αn1αn.

    One can compute that if i<j<n, then Nϵi+ϵn,ϵjϵn=Nϵiϵn,ϵj+ϵn=1.

    Let R={ϵi+ϵj1i<jn1}. Then

    Φradn=R{ϵr+ϵn1r<n},Φradn1=R{ϵrϵn1r<n}.

    According to , it gives rise to an refinement of Φ+:

    {ϵiϵj2i<j<n}{ϵ1ϵj2j<n}Φradn1RΦradnRR.

    Lemma 3.4. Suppose that G is of type Dn with n5. If EE(rsmax,u)max, then LT(E)Max(rsmax,Φ+) with respect to .

    Proof. We prove it by assuming LT(E)Max(rsmax,Φ+). Then LT(E)Φradn, or LT(E)Φradn1 by Table 1.

    Case 1. LT(E)Φradn. If ΦradnLT(E)={ϵs+ϵn} for some 1s<n, then the reduced echelon form basis of E consists of

    xij=xϵi+ϵj,1i<j<n,yi=xϵi+ϵn+aisxϵs+ϵn,1i<n,isandais=0wheni<s.

    Alternatively, we have ΦradnLT(E)={ϵs+ϵt} for 1s<tn1. And then the reduced echelon form basis of E for 1i<j<n and is,jt

    xij=xϵi+ϵj+aijxϵs+ϵt,aij=0wheni<sori=s,j<t,yi=xϵi+ϵn+bixϵs+ϵt,1i<n.

    One can easily see that, both of them yield ELie(Φradn), it is a contradiction.

    Case 2. LT(E)Φradn1. If Φradn1LT(E)={ϵsϵn}, then there is the reduced echelon form basis of E

    xij=xϵi+ϵj,1i<jn1,yi=xϵiϵn+aisxϵsϵn+n1t=1bitxϵt+ϵn,1i<n,isandais=0wheni<s.

    Note that exp(ad(aisN1ϵsϵi,ϵiϵnxϵsϵi)) for i>s will rule out the term aisxϵsϵn in yi and fix ajsxϵsϵn in yj if ji. Let λi=aisN1ϵsϵi,ϵiϵn, then conjugation by b:=exp(ad(λn1xϵsϵn1))exp(ad(λs+1xϵsϵs+1)) on E yields the final reduced basis

    xij=xϵi+ϵj,1i<jn1,yi=xϵiϵn+n1t=1bitxϵt+ϵn,1is<n,

    where xij=b.xij and yi=b.yi. As n5, the proof in [9]HY__HY, Theorem 3.6] shows that all bit=0. Consequently ELie(Φradn1)b1, which is not maximal. Alternatively, we get Φradn1LT(E)={ϵs+ϵt} for 1s<t<n and the reduced echelon form basis of E

    xij=xϵi+ϵj+aijxϵs+ϵt,aij=0wheni<sori=s,j<t,yi=xϵiϵn+n1r=1birxϵr+ϵn+dixϵs+ϵt,1i<n.

    If i,j,r<n are distinct, then the coefficient of xϵj+ϵr in [yi,yj] is Nϵr+ϵn,ϵjϵnbir. As n5, we have bir=0 for all ri. Now for ij the coefficient of xϵi+ϵj in [yi,yj] is Nϵiϵn,ϵj+ϵnbjj+Nϵi+ϵn,ϵjϵnbii. Thus if i<j<t<n we have a system of equations

    Nϵiϵn,ϵj+ϵnbjj+Nϵi+ϵn,ϵjϵnbii=bjj+bii=0Nϵiϵn,ϵt+ϵnbtt+Nϵi+ϵn,ϵtϵnbii=btt+bii=0Nϵjϵn,ϵt+ϵnbtt+Nϵj+ϵn,ϵtϵnbjj=btt+bjj=0

    whose solution is bii=bjj=btt=0. This gives bii=0 for all i. Therefore, we have ELie(Φradn1), it is a contradiction.

    Theorem 3.5. Suppose that G is of type Dn with n6. If EE(rsmax,u) satisfies LT(E)=ΦDn1,n or ΦDn2,n1 then E=Lie(ΦDn1,n)exp(ad(axαn1)) or E=Lie(ΦDn2,n1)exp(ad(axαn)) for some a.

    Proof. Case 1. LT(E)=ΦDn1,n. Then the reduced echelon form basis of E is

    xij=xϵi+ϵj+i1h=1aijhxϵh+ϵn1,1i<j<n1,yi=xϵi+ϵn+n2r=1birxϵr+ϵn1,1i<n1zi=xϵiϵn1+i1v=1n2t=v+1civtxϵvϵt+n1r=1dirxϵrϵn+kixϵn1+ϵn+n2s=1isxϵs+ϵn1,1i<n1.

    Step I. We prove that civt=aijh=0. If i3 and v2, the coefficient of xϵ1+ϵv in [x1t,zi] is Nϵ1+ϵt,ϵvϵtcivt, so civt=0. Then for all i2, we have

    zi=xϵiϵn1+n2t=2ci1txϵ1ϵt+n1r=1dirxϵrϵn+kixϵn1+ϵn+n2s=1isxϵs+ϵn1.

    Consider the bracket for i2

    0=[x2t,zi]=ci12Nϵ2+ϵt,ϵ1ϵ2xϵ1+ϵt+ci1tNϵ2+ϵt,ϵ1ϵtxϵ1+ϵ2+a2t1Nϵ1+ϵn1,ϵiϵn1xϵ1+ϵi.

    Then a2t1=0 (It is possible since n6), and finally ci1t=0. Now for i2, the coefficient of xϵh+ϵi in [xij,zi] is Nϵh+ϵn1,ϵiϵn1aijh, thus aijh=0 for all h<i.

    Step II. We prove that bir=dir=0. Let λ=d11N1ϵn1ϵn,ϵ1ϵn1. Using conjugation by exp(ad(λxϵn1ϵn)), we may assume that d11=0. If i,j,r are distinct, then we have

    [yi,zj]=n1r=1Nϵi+ϵn,ϵrϵndjrxϵi+ϵr+n2r=1Nϵr+ϵn1,ϵjϵn1birxϵj+ϵr.

    This gives dir=bir=0 for all ri. Now for ij, the coefficient of xϵi+ϵj in [yi,zj] is Nϵi+ϵn,ϵjϵndjj+Nϵi+ϵn1,ϵjϵn1bii=djj+bii=0. As n6 (n5 is enough), this gives dii=bii=0 for all i.

    Step III. We prove that ki=is=0. For ij, the coefficient of xϵj+ϵn in [zi,zj] is Nϵn1+ϵn,ϵjϵn1ki, so all ki=0. If i,j,s<n1 are distinct, then the coefficient of xϵs+ϵj in [zi,zj] is Nϵs+ϵn1,ϵjϵn1is. As n6 (n5 is enough), this gives is=0 for all si. Now for ij, the coefficient of xϵi+ϵj in [zi,zj] is Nϵiϵn1,ϵj+ϵn1jj+Nϵi+ϵn1,ϵjϵn1ii. Thus if i<j<t<n1 are distinct, we have a system of equations

    Nϵiϵn1,ϵj+ϵn1jj+Nϵi+ϵn1,ϵjϵn1ii=jj+ii=0Nϵiϵn1,ϵt+ϵn1tt+Nϵi+ϵn1,ϵtϵn1ii=tt+ii=0Nϵjϵn1,ϵt+ϵn1tt+Nϵj+ϵn1,ϵtϵn1jj=tt+jj=0

    with unique solution ii=jj=tt=0. This gives ii=0 for all i and finally yields E=Lie(ΦDn1,n)exp(ad(axαn1)).

    Case 2. LT(E)=ΦDn2,n1. Then the reduced echelon form basis of E is

    xij=xϵi+ϵj+i1h=1aijhxϵh+ϵn1,1i<j<n1,yi=xϵiϵn+n1p=1bipxϵp+ϵn+n2q=1ciqxϵq+ϵn1,1i<n1,zi=xϵiϵn1+i1v=1n2t=v+1divtxϵvϵt+kixϵn1ϵn+n1r=1firxϵr+ϵn+n2s=1gisxϵs+ϵn1,1i<n1.

    If i,j,p are distinct, then the coefficient of xϵp+ϵj in [yi,yj] is Nϵp+ϵn,ϵjϵnbip, it follows that bip=0 for all pi. If ij, the coefficient of xϵi+ϵj in [yi,yj] is Nϵiϵn,ϵj+ϵnbjj+Nϵi+ϵn,ϵjϵnbii. Thus if i<j<t<n1 are distinct, we have a system of equations

    Nϵiϵn,ϵj+ϵnbjj+Nϵi+ϵn,ϵjϵnbii=bjj+bii=0Nϵiϵn,ϵt+ϵnbtt+Nϵi+ϵn,ϵtϵnbii=btt+bii=0Nϵjϵn,ϵt+ϵnbtt+Nϵj+ϵn,ϵtϵnbjj=btt+bjj=0

    with bii=bjj=btt=0. This implies bii=0 for all i. Then the calculation for the other coefficients is similar to Case 1. We conclude that there exists some a such that E=Lie(LT(E))exp(ad(axαn)).

    Summarizing the discussions for G in section 3, we are to give the main result except for some small ranks for each type. Before doing this, we recall the definition of an ideal of Φ+. We say RΦ+ is an ideal if α+βR whenever αΦ+,βR and α+βΦ+; see [9,Definition 2.10]. A prototypical example for such an ideal arises from Φradi, where αi is a simple root. In the sequel, the move to ideals helps to establish that both G.Lie(R) and G.E(rsmax,Lie(H)) are closed.

    Lemma 4.1. If αi is a simple root, then Φradi{αi} is an ideal.

    Proof. Suppose that αΦ+,βΦradi{αi} and α+βΦ+. Since Φradi is an ideal, it follows that α+βΦradi. As αi is a simple root, then α+βαi, which gives α+βΦradi{αi}, so Φradi{αi} is an ideal.

    Theorem 4.2. Suppose that G is of type Cn(n3) or Dn(n6). Then

    E(rsmax,u)maxG.Lie(R),

    where R is the ideal listed in the third column of the following Table 3.

    Table 3.  Ideals for Theorem 4.2.
    Type Rank Ideal R
    Cn n3 Φradn{αn}
    Dn n6 Φradn1{αn1}

     | Show Table
    DownLoad: CSV

    Proof. Theorems 3.3 and 3.5 ensure that

    E(rsmax,u)maxIMax(rsmax,Φ+)U.Lie(I).

    where I is the set of commuting roots showing in Table 4.

    Table 4.  sets for Theorem 4.2.
    Type Rank Set I
    Cn n3 ΦCn1,n
    Dn n6 ΦDn1,n,ΦDn2,n1

     | Show Table
    DownLoad: CSV

    Let ˙wNG(T) be a representative of an element w in Weyl group W and I be a set of commuting roots. It is clear that ˙w.Lie(I)=Lie(w.I). We are to show that each I of Max(rsmax,Φ+) can be W-conjugated to an ideal R. For type C, the simple reflection sn acts by negating ϵn and fixing the remaining ϵi therefore any representative ˙snNG(T) conjugates Lie(ΦCn1,n) to Lie(Φradn{αn}). For type D, the Weyl group is a semidirect product of (Z/2Z)n1 and Sn, and its action on roots is induced from the action on the set {ϵ1,ϵ2,...,ϵn} where we may take Sn to permute the indices of the ϵi and the jth generator of (Z/2Z)n1 to send ϵj to ϵj, ϵj+1 to ϵj+1, and fix all other ϵi. So by conjugation we may assume our elementary subalgebras are of the form Lie(Φradn1{αn1}). Finally we use Lemma 6 to prove that Φradn{αn} and Φradn1{αn1} are ideals and are done.

    Corollary 4.3. Let G be a standard simple algebraic k-group with root system Cn(n3) or Dn(n6). Then

    E(rsmax,g)=G.Lie(R)HanidealG.E(rsmax,Lie(H))

    is the union of irreducible closed subsets, where ideals R,H are listed in the Table 5.

    Table 5.  Ideals for Corollary 4.3.
    Type Rank Ideal R Ideal H
    Cn n3 Φradn{αn} Φradn
    Dn n6 Φradn1{αn1} Φradn1,Φradn

     | Show Table
    DownLoad: CSV

    Proof. Theorem 4.2 gives the set E(rsmax,u)max. We need to consider the elements of E(rsmax,u)E(rsmax,u)max. In accordance with [9,Corollary 3.9] and [8,Lemma 2.2], we arrive at the equality. In viewing of the proof of Corollary 3.7 of [6], the right hand is a union of irreducible closed subsets.

    Theorem 4.4. Let G be a standard simple algebraic k-group with root system Cn(n3) or Dn(n6). Then the irreducible components of E(rsmax,g) for each type can be characterized; see Table 6.

    Table 6.  Irreducible components for Theorem 4.4.
    Type Rank Irreducible components
    Cn n3 G.E(rsmax,Lie(Φradn))
    Dn n6 G.E(rsmax,Lie(Φradn1)), G.E(rsmax,Lie(Φradn))

     | Show Table
    DownLoad: CSV

    Proof. By Corollary 4.3, it suffices to check the maximality of each irreducible closed subvariety. For type Cn, it is clear that G.E(rsmax,Lie(Φradn)) is the unique irreducible component. For type Dn, it is clear that G.Lie(Φradn1{αn1}) is not maximal, so it suffices to check the maximality of G.E(rsmax,Lie(R)) for R=Φradn1 or R=Φradn. We may assume

    G.E(rsmax,Lie(Φradn1))G.E(rsmax,Lie(Φradn)).

    Then we have Lie(Φradn1{αn1})=g.Lie(Φradn{γ}) for some gG and γΦradn. By Lemma 3.8 of [6], we have Φradn1{αn1} and Φradn{γ} are W-conjugate. On the other hand, one can easily check that Φradn{γ} and Φradn{αn} are W-conjugate, so there is some wW such that w.Φradn1{αn1}=Φradn{αn}. Notice that

    Φradn1{αn1}={ϵi+ϵj1i<jn1}{ϵiϵn1i<n1},Φradn{αn}={ϵi+ϵj1i<jn1}{ϵi+ϵn1i<n1}.

    Let

    A:={ϵi+ϵn1i<n1}.

    We now consider w1.A in Φradn1{αn1}. By the order of set A, one can verify that

    w1.A=B:={ϵi+ϵn11i<n1}

    or

    w1.A=C:={ϵiϵn1i<n1}.

    If w1.A=B, then by observing the action of w on Φradn1{αn1}, we have w.C={ϵiϵn11i<n1}. Since {ϵiϵn11i<n1}Φradn{αn}, it is impossible. If w1.A=C, then we find that w.B={ϵiϵn11i<n1}. This is also impossible by the same reason. Hence, the closed subset G.E(rsmax,Lie(Φradn1)) is maximal. The maximality of G.E(rsmax,Lie(Φradn)) is verified in a similar way and is omitted.

    Remark. In [9] the authors show that E(rmax,g) is a finite disjoint union of partial flag varieties, which differs from the above result.

    In this paper we characterize the irreducible components of the variety E(rkp(g)1,g), where g:=Lie(G) is the Lie algebra of a connected standard simple algebraic group G of type C or D. The results show that E(rkp(g)1,g) is not a finite disjoint union of partial flag varieties, which differs from E(rkp(g),g).

    This work was supported by University Natural Science Research Project of Anhui Province (No.KJ2019A0845), Talent Research Fund Project of Hefei University (No.18-19RC57), National Natural Science Foundation of China (No.12171129), Zhejiang Provincial Natural Science Foundation of China (No.LY20A010022) and Scientific Research Foundation of Hangzhou Normal University (No.2019QDL012).

    All authors declare no conflicts of interest in this paper.



    [1] A. Borel, Linear algebraic groups, Graduate Texts in Mathematics, New York: Springer Science+Business Media, 1991.
    [2] N. Bourbaki, Lie groups and Lie algebras, Chapters 4–6, Elements of Mathematics, Springer, 2002.
    [3] J. F. Carlson, E. M. Friedlander, J. Pevtsova, Elementary subalgebras of Lie algebras, J. Algebra, 442 (2015), 155–189. doi: 10.1016/j.jalgebra.2014.10.015
    [4] R. W. Cater, Simple group of Lie type, John Wiley & Sons, 1989.
    [5] A. I. Malcev, Commutative subalgebras of semi-simple Lie algebras, Bull. Acad. Sci. URSS, Ser. Math., 9 (1945), 291–300.
    [6] Y. Pan, Varieties of elementary subalgebras of submaximal rank in type A, arXiv. Available from: https://arXiv.org/abs/1707.00446.
    [7] Y. Pan, Saturation rank for finite group schemes and varieties of elementary subalgebras, Doctoral dissertation, Christian-Albrechts Universität Kiel, 2016.
    [8] A. Premet, A modular analogue of Morozov's theorem on maximal subalgebras of simple Lie algebras, Adv. Math., 311 (2017), 833–884. doi: 10.1016/j.aim.2017.03.011
    [9] J. Pevtsova, J. Stark, Varieties of elementary subalgebras in modular Lie algebras, In: J. Carlson, S. Iyengar, J. Pevtsova, Geometric and topological aspects of the representation theory of finite groups, PSSW 2016, Springer Proceedings in Mathematics & Statistics, Springer, 242 (2018), 339–375. doi: 10.1007/978-3-319-94033-5_14
    [10] T. A. Springer, Linear algebraic group, In: A. N. Parshin, I. R. Shafarevich, Algebraic geometry IV, Encyclopaedia of Mathematical Sciences, Vol. 55, Springer, 1994. doi: 10.1007/978-3-662-03073-8_1
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2511) PDF downloads(61) Cited by(0)

Figures and Tables

Tables(6)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog