Odd-order implies solvable

This article gives the statement and possibly, proof, of an implication relation between two group properties. That is, it states that every group satisfying the first group property (i.e., odd-order group) must also satisfy the second group property (i.e., solvable group)
View all group property implications | View all group property non-implications
Get more facts about odd-order group|Get more facts about solvable group

This article states and (possibly) proves a fact that is true for certain kinds of odd-order groups. The analogous statement is not in general true for groups of even order.
View other such facts for finite groups

This fact is useful in work leading up to the Classification of finite simple groups

History

Original proof

This result was proved by Feit and Thompson, and is called the Feit-Thompson Theorem or the Odd order theorem.

Computer verification of proof

In September 2012, it was announced that the Feit-Thompson theorem proof had been completely verified using the proof assistant Coq.

Statement

There are two versions of the statement:

1. There is no finite simple non-abelian group that has odd order.
2. Every odd-order group is a solvable group, i.e., all its composition factors are abelian groups (and hence, cyclic of prime order).

Applications

• Coprime implies one is solvable: If two finite groups have relatively prime orders, then one of them is solvable.

There are several applications of the result that given two groups of coprime order, one of them is solvable. In fact, many theorems in group theory can be proved modulo the assumption that among two given groups of coprime order, one is solvable. For a list of such facts, refer:

Category:Facts about groups of coprime order whose proof requires the assumption that one of them is solvable

Facts used

1. Lagrange's theorem
2. Solvability is extension-closed

Proof

Proof that (1) implies (2)

Suppose (1) holds, i.e., there is no finite simple non-abelian group of odd order. Then, we want to show that (2) holds. Consider a minimal counterexample to (2), i.e., an odd-order group $G$ that is not solvable and has the minimum possible order among such groups.

Step no.	Assertion/construction	Facts used	Given data/assumptions used	Previous steps used	Explanation
1	$G$ is nontrivial.				the trivial group is solvable
2	$G$ is not simple non-abelian.		(1) holds, i.e., there is no simple non-abelian group of odd order		direct
3	$G$ must has a proper nontrivial normal subgroup $N$			Steps (1), (2)	direct
4	Both $N$ and $G/N$ have odd order.	Fact (1)		Step (3)	Step-fact direct
5	Both $N$ and $G/N$ have order strictly smaller than $G$.			Step (3)	$N$ is proper and nontrivial in $G$.
6	Both $N$ and $G/N$ are solvable.		$G$ is a counterexample of minimal order	Steps (4), (5)	direct
7	$G$ is solvable, leading to a contradiction to our assumption that it is a counterexample.	Fact (2)		Step (6)	Step-fact direct.

Proof of (1)

The complete proof (which forms the subject of a 255-page paper) is beyond the scope of this page. However, we will attempt to describe the key idea.

The idea is to attempt to construct a "minimal counterexample" to (1), i.e., a simple non-abelian group of odd order that has the smallest possible order among such groups. Any such minimal counterexample must in particular be a minimal simple group: every proper subgroup is solvable (note therefore that the classification of finite minimal simple groups would settle this question; however, such a classification is itself conditional to first proving this fact, hence it does not help). In particular, it is a N-group: every local subgroup (the normalizer of a nontrivial solvable subgroup) is solvable. Or equivalently, for every prime $p$, every p-local subgroup is solvable (this follows from the fact that local subgroup of finite group is contained in p-local subgroup for some prime p).

The CN-group case

An example that is relatively easy to follow is the proof that odd-order and CN implies solvable.

A CN-group is a group where the centralizer of every non-identity element is nilpotent. The structure of CN-groups allows us to define an equivalence relation on the prime divisors of the group order based on commuting (see commuting of non-identity elements defines an equivalence relation between prime divisors of the order of a finite CN-group). For each equivalence class $\omega$ under the equivalence relation on the prime divisors of the order of a finite CN-group $G$, $G$ has a nilpotent $\omega$-Hall subgroup.

What we have said so far applies to all finite CN-groups. Restricting to the "minimal odd-order counterexample" that we want to show does not exist, we can obtain more structural restrictions on the nature of the Hall subgroups. The structural restrictions obtained from the proof mimic those used in the proof that finite non-abelian and every proper subgroup is abelian implies not simple. However, they are not quite as strong, and ultimately, we need to use ideas from character theory to complete the proof.

The general case

PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]

One of the people editing this page intended to fill in this information at a later stage, but hasn't gotten around to doing it yet. If you see this placeholder for a long time, file an error report at the error reporting page.

References

Journal references

• Solvability of groups of odd order by Walter Feit and John Griggs Thompson, Pacific Journal of Mathematics, Volume 13, Page 775 - 1029(Year 1963): This 255-page long paper gives a proof that odd-order implies solvable: any odd-order group (i.e., any finite group whose order is odd) is a solvable group.^{Project Euclid pageMore info}
• A solvability criterion for finite groups and some consequences by Walter Feit and John Griggs Thompson, Proceedings of the National Academy of Sciences, Volume 48, Page 968 - 970(Year 1962): ^{More info}

Textbook references

• Finite Groups by Daniel Gorenstein, ISBN 0821843427, Page 450, Section 16.2 (Groups of Odd Order), (four pages of verbal description of the proof ideas, followed by an outline and proofs of some of the main steps not already covered in the book.)^{More info}

External links

• Announcement of verification using Coq