On a theorem of Frobenius. (Q4173556)
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 3608282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a theorem of Frobenius. |
scientific article; zbMATH DE number 3608282 |
Statements
On a theorem of Frobenius. (English)
0 references
1978
0 references
finite groups
0 references
Frobenius conjecture
0 references
divisors
0 references
Let \( G \) be a finite group of order \( |G|, n \) a divisor of \( |G| \). Frobenius proved that the number of elements satisfying the equation \( x^{n}=1 \) is a multiple of \( n \). He conjectured that \( I=\left\{x \in G \mid x^{n}=1\right\} \) is a subgroup of \( G \), if \( |I|=n \). This conjecture is proved in the case \( (n,|G| / n) \neq 1 \). The proof is based on the fact that the p-Sylow subgroups which belong to a prime dividing \( (n,|G| / n) \) are cyclic. This follows by an application of an ``Anzahl-theorem'' of \textit{P. Hall} [Proc. Lond. Math. Soc. (2) 40, 468--480 (1936; Zbl 0015.20201)]. Thereby a connection between the case for \( G \) and the case for the normaliser of a maximal p-subgroup in \( L \) can be established, where \( p \) is the minimal prime dividing \( (n,|G| / n) \). An induction argument leads to the result.
0 references