A landmark theorem in finite group theory: every finite group of odd order is solvable. In particular, there are no nonabelian simple finite groups whose order is odd. The proof is long and uses deep representation-theoretic and local analysis, and the statement is a major structural restriction on finite simple groups.

Principle

Odd-order solvability principle: parity of the group order imposes strong restrictions on composition factors and local subgroup structure; in odd order settings certain obstructions to solvability that occur for even-order groups disappear, allowing inductive and character-theoretic arguments to show solvability.

Demonstration

Example application: any group of order 21 = 3·7 must be solvable; indeed Sylow analysis yields normal Sylow subgroups or a semidirect product structure that is solvable. The Feit–Thompson theorem generalizes such case-by-case small-order arguments to all odd orders.

Misapplication

Assuming the converse (every solvable finite group has odd order) or extending the theorem to infinite groups. Also misusing it to infer properties that require stronger hypotheses such as supersolvability or nilpotence; solvability is strictly weaker than those properties and holds under odd-order hypotheses but does not imply the stronger ones.

Consequence

Drastically restricts the possible finite simple groups to even orders, feeding into classification efforts and enabling structural arguments that separate odd-order and even-order behavior; it simplifies possibilities in classification and local analysis by ruling out odd-order simple obstructions.

Reversal

The direct reversal is false: there exist many non-solvable finite groups of even order (for example simple groups of even order). The contrast highlights how parity conditions (presence of 2) are central to the existence of nonabelian simple finite groups.

Boundary

Applies only to finite groups and only to the parity condition of odd order; it does not describe the nature of solvable groups of odd order beyond solvability itself, nor does it extend to infinite groups or to refinements like supersolvability unless additional hypotheses are given.

Semantic Tension

Tension appears between this broad solvability conclusion and other finiteness theorems such as Burnside's p^a q^b theorem; while both constrain simplicity and solvability, they rely on different hypotheses (prime factor patterns versus parity) and have distinct scopes and strengths.

Synthesis

Feit–Thompson Theorem asserts that every finite group whose order is odd is solvable, thereby excluding nonabelian simple finite groups of odd order and providing a decisive parity-based structural dichotomy that underlies deeper classification results.