Odd-order implies solvable: Difference between revisions
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
weaker = solvable group}} | weaker = solvable group}} | ||
{{odd-order-only finite | {{odd-order-only finite group statement}} | ||
{{cfsg-fact}} | {{cfsg-fact}} | ||
Revision as of 22:22, 21 January 2009
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
This result was proved by Feit and Thompson, and is called the Feit-Thompson Theorem or the Odd order theorem.
Statement
Verbal statement
Any finite group of odd order is solvable. Equivalently, any finite simple non-Abelian group has even order.
Property-theoretic statement
The property of being an odd-order group is a stronger property than the property of being solvable.
Applications
- Coprime implies one is solvable: If two finite groups have relatively prime orders, then one of them is solvable.
Proof
The proof of the odd-order theorem is nontrivial and cannot be put into the wiki page.