Feit-Thompson theorem

Feit-Thompson theorem

[¦fīt ¦täm·sən ‚thir·əm]
(mathematics)
The proposition that every group of odd order is solvable.
References in periodicals archive ?
One can easily see that the same argument holds for all groups generated by elements of order 2, for example for all non-abelian simple groups (by the Feit-Thompson theorem they contain at least one element of order 2, and those elements generate a normal subgroup, which has to be the group itself).
To the well-known proof of the Four Color theorem [12] and the efforts around the Kepler Conjecture [16], we could add the finishing (September 2012) of the Coq formalization for the Feit-Thompson theorem, an important step towards the mechanization of the simple finite group classification, led by Georges Gonthier [14].
Gonthier, The Feit-Thompson theorem proved in Coq, 2012, http://www.msr-inria.inria.fr/events-news/feit-thompson-proved-in-coq