Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

• Forgot your password?
• Apply for membership

1. • CommentRowNumber1.
   • CommentAuthorUrs
   • CommentTimeOct 31st 2012
   • PermaLink
   Author: Urs
   Format: MarkdownItex_[[Feit-Thompson theorem]]_

   Feit-Thompson theorem

2. • CommentRowNumber2.
   • CommentAuthorDean
   • CommentTimeFeb 23rd 2025
   • PermaLink
   Author: Dean
   Format: TextIn this article one sees that unsolvable implies even order for a finite group. There is also the Brauer-Fowler theorem from On Groups of Even Order (Richard Brauer, K.A. Fowler): https://www.jstor.org/stable/1970080?seq=1 It could be a good idea to add an article on this about as long as this one, and then mention them both in the article on the classification of finite simple groups.

   In this article one sees that unsolvable implies even order for a finite group. There is also the Brauer-Fowler theorem from On Groups of Even Order (Richard Brauer, K.A. Fowler):
   
   https://www.jstor.org/stable/1970080?seq=1
   
   It could be a good idea to add an article on this about as long as this one, and then mention them both in the article on the classification of finite simple groups.
3. • CommentRowNumber3.
   • CommentAuthorDavidRoberts
   • CommentTimeFeb 26th 2025
   • PermaLink
   Author: DavidRoberts
   Format: MarkdownItexThe operative point being: > It then follows that there exist only a finite number of simple groups in which the normalizer of an involution is isomorphic to a given group. This is stated more formally as Corollary (2I) in the paper.

   The operative point being:

   It then follows that there exist only a finite number of simple groups in which the normalizer of an involution is isomorphic to a given group.

   This is stated more formally as Corollary (2I) in the paper.

4. • CommentRowNumber4.
   • CommentAuthorUrs
   • CommentTimeFeb 26th 2025
   • (edited Feb 26th 2025)
   • PermaLink
   Author: Urs
   Format: MarkdownItexHave added the proper reference for the Coq proof: * [[Georges Gonthier]] et al.: *A Machine-Checked Proof of the Odd Order Theorem*, in: *Interactive Theorem Proving. ITP 2013*, Lecture Notes in Computer Science **7998**, Springer (2013) &lbrack;[doi:10.1007/978-3-642-39634-2_14](https://doi.org/10.1007/978-3-642-39634-2_14)&rbrack; <a href="https://ncatlab.org/nlab/revision/diff/Feit-Thompson+theorem/3">diff</a>, <a href="https://ncatlab.org/nlab/revision/Feit-Thompson+theorem/3">v3</a>, <a href="https://ncatlab.org/nlab/show/Feit-Thompson+theorem">current</a>

   Have added the proper reference for the Coq proof:

   • Georges Gonthier et al.: A Machine-Checked Proof of the Odd Order Theorem, in: Interactive Theorem Proving. ITP 2013, Lecture Notes in Computer Science 7998, Springer (2013) [doi:10.1007/978-3-642-39634-2_14]

   diff, v3, current