Sequences of words characterizing finite solvable groups. (Q833316)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5594040
Language Label Description Also known as
default for all languages
No label defined
    English
    Sequences of words characterizing finite solvable groups.
    scientific article; zbMATH DE number 5594040

      Statements

      Sequences of words characterizing finite solvable groups. (English)
      0 references
      0 references
      12 August 2009
      0 references
      Finite nilpotent groups can be characterised by means of the identity \([x_0,x_1,\dots,x_n]=1\) for some \(n\in\mathbb{N}\) and all \(x_i\in G\), \(0\leq i\leq n\), or, as \textit{M. Zorn} has proved [in Bull. Am. Math. Soc. 42, 485-486 (1936; JFM 62.0088.10)], by means of the Engel identity \(e_n(x,y)=1\) for \(n\in\mathbb{N}\), where \(e_1(x,y)=[x,y]\) and \(e_n(x,y)=[e_{n-1}(x,y),y]\). During many years it has been an open question whether solvability could be described by an identity involving only two variables. Recently two such sequences of words have been found: \textit{T. Bandman, G.-M. Greuel, F. Grunewald, B. Kunyavskiĭ, G. Pfister, E. Plotkin} [Compos. Math. 142, No. 3, 734-764 (2006; Zbl 1112.20016)] gave the sequences \(u_n(x,y)\) defined by \(u_1(x,y)=x^{-2}y^{-1}x\) and \(u_n(x,y)=[xu_{n-1}(x,y)^{-1}x^{-1},yu_{n-1}(x,y)^{-1}y^{-1}]\), while \textit{J. N. Bray, J. S. Wilson, R. A. Wilson} [Bull. Lond. Math. Soc. 37, No. 2, 179-186 (2005; Zbl 1075.20008)] found the sequence \(s_1(x,y)=x\), \(s_n(x,y)=[s_{n-1}(x,y)^{-y},s_{n-1}(x,y)]\). In the paper under review, solvability of finite groups is characterised in terms of the following sequences: (1) \(v_1=yx^2\), \(v_k=[v_{k-1}^{y^{-1}x^{-1}},v_{k-1}^{x^{-1}}]\);\qquad (2) \(v_1=yx^2\), \(v_k=[v_{k-1}^{y^{-1}x^{-1}},v_{k-1}^{yx}]\); (3) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}}, v_{k-1}^x]\);\qquad (4) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{y^{-1}}]\); (5) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{xyx}]\);\qquad (6) \(v_1=xy\), \(v_k=[v_{k-1}^{yx^{-1}y^{-1}},v_{k-1}^{y^{-1}x^{-1}y^{-1}}]\). These sequences characterise soluble groups in the sense that if there is an \(n\in\mathbb{N}\) such that \(v_n(x,y)=1\) for all \(x,y\in G\), then \(G\) is soluble. A minimal counterexample to this theorem must be a simple group whose proper subgroups are soluble. These groups were classified by \textit{J. G. Thompson} [Bull. Am. Math. Soc. 74, 383-437 (1968; Zbl 0159.30804)]. Some computations with SINGULAR or MAGMA, which are detailed in the PhD Thesis of the author, among other techniques of group theory, ring theory, and algebraic geometry, are used to show that there exist \(x,y\in G\) such that \(v_1(x,y)=v_2(x,y)\) and \(v_1(x,y)\neq 1\) (Lemma~2.1). This, combined with the techniques of Bandman et al., is enough to prove the main theorem.
      0 references
      finite soluble groups
      0 references
      words
      0 references
      identities
      0 references
      finite simple groups
      0 references
      Gröbner bases
      0 references
      Engel groups
      0 references
      laws
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references