arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.0475math.GR
收藏

有限群的一个新的可解性判据

A new solvability criterion for finite groups

Silvio Dolfi, Robert Guralnick, Marcel Herzog, Cheryl Praeger

摘要:

1968年,John Thompson证明了一个有限群G是可解的当且仅当G的每个2-生成子群是可解的。本文证明了有限群G的可解性由一个看起来较弱的条件保证:G是可解的,如果对G的所有由素幂阶元素组成的共轭类C和D,C中存在x,D中存在y,且x和y生成一个可解群.证明了有限非交换单群的如下性质,这是证明可解性准则的关键工具:如果G是有限非交换单群,则存在|G|的两个素除子a和b,使得对于G中所有元素x,y,当|x| =a和|y| =b时,由x和y生成的子群不可解.进一步,利用Guralnick和Malle的一个最近结果,我们得到了任意有限群族在形成子群、群元和扩张下闭的一个相似的隶属准则.

英文摘要:

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is solvable if, for all conjugacy classes C and D of G consisting of elements of prime power order, there exist x in C and y in D with x and y generating a solvable group. We also prove the following property of finite nonabelian simple groups, which is the key tool for our proof of the solvability criterion: if G is a finite nonabelian simple group, then there exist two prime divisors a and b of |G| such that, for all elements x, y in G with |x|=a and |y|=b, the subgroup generated by x and y is not solvable. Further, using a recent result of Guralnick and Malle, we obtain a similar membership criterion for any family of finite groups closed under forming subgroups, quotients and extensions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑