Engel-like Identities Characterizing Finite Solvable Groups

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,... is called correct if uk 1 in a group G implies um 1 in a group G for all m>k. We are looking for an explicit correct sequence of words u1(x,y),...,un(x,y),... such that a group G is solvable if and only if for some n the word un is an identity in G. Let u1=x-2y x, and un+1 = [xunx,yuny]. The main result states that a finite group G is solvable if and only if for some n the identity un(x,y) 1 holds in G. 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) .

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…