English

Engel-like Identities Characterizing Finite Solvable Groups

Group Theory 2007-05-23 v1

Abstract

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words u1,...,un,...u_1,...,u_n,... is called correct if uk1u_k\equiv 1 in a group GG implies um1u_m\equiv 1 in a group GG for all m>km>k. We are looking for an explicit correct sequence of words u1(x,y),...,un(x,y),...u_1(x,y),...,u_n(x,y),... such that a group GG is solvable if and only if for some nn the word unu_n is an identity in GG. Let u1=x2yminxu_1=x^{-2}y\min x, and un+1=[xunxmin,yunymin]u_{n+1} = [xu_nx\min,yu_ny\min]. The main result states that a finite group GG is solvable if and only if for some nn the identity un(x,y)1u_n(x,y)\equiv 1 holds in GG. In the language of profinite groups this result implies that the provariety of prosolvable groups is determined by a single explicit proidentity in two variables. The proof of the main theorem relies on reduction to J.Thompson's list of minimal non-solvable simple groups, on extensive use of arithmetic geometry (Lang - Weil bounds, Deligne's machinery, estimates of Betti numbers, etc.) and on computer algebra and geometry (SINGULAR, MAGMA) .

Keywords

Cite

@article{arxiv.math/0303165,
  title  = {Engel-like Identities Characterizing Finite Solvable Groups},
  author = {Tatiana Bandman and Gert-Martin Greuel and Fritz Grunewald and Boris Kunyavskii and Gerhard Pfister and Eugene Plotkin},
  journal= {arXiv preprint arXiv:math/0303165},
  year   = {2007}
}

Comments

63 pages, LateX