Upper Bound of Order of Non-Abelian Finite Simple Group

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $G$ be a non-abelian finite simple group.

Let $t \in G$ be a self-inverse element of $G$.

Let $\map {C_G} t$ denote the centralizer of $t$ in $G$.

Let $m = \order {\map {C_G} t}$ be the order of $\map {C_G} t$.


Then:

$\order G \le \paren {\dfrac {m \paren {m + 1} } 2}!$


Corollary

Let $H$ be a finite group of even order.

Let $u \in H$ be a self-inverse element of $H$.


Then there are finitely many types of finite simple group $G$ such that:

$G$ has a self-inverse element $t \in G$
$\map {C_G} t \cong H$


Proof


This theorem requires a proof.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Upper_Bound_of_Order_of_Non-Abelian_Finite_Simple_Group&oldid=380151"