This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
|
theorem:sylow_s_theorem [2013/08/08 06:14] joshuawiscons created |
theorem:sylow_s_theorem [2013/08/13 11:29] (current) joshuawiscons |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Sylow' | + | ====== Sylow' |
| - | ===== Statement ===== | + | $\DeclareMathOperator{\syl}{Syl}$ |
| + | **Theorem.** Let $G$ be a finite [[Definition: | ||
| + | - $G$ acts [[Definition: | ||
| + | - every $P \in \syl_p(G)$ has [[Definition: | ||
| + | ---- | ||
| + | ==== Remarks ==== | ||
| + | * $(n,p)$ denotes the greatest common divisor of $n$ and $p$. | ||
| + | * $\syl_p(G)$ denotes the collection of [[Definition: | ||
| + | ---- | ||
| + | ==== $\LaTeX$ version ==== | ||
| + | < | ||
| + | %%%%%%%%%% | ||
| + | % DEPENDENCIES | ||
| + | % RequiredMacros: | ||
| + | %%%%%%%%%% | ||
| + | \begin{theorem}[Sylow' | ||
| + | Let $G$ be a finite group and $p$ a prime. Write $|G| = np^k$ with $(n,p) = 1$. Then | ||
| + | \begin{enumerate} | ||
| + | \item $G$ acts transitively on $\syl_p(G)$ by conjugation with $|\syl_p(G)| \equiv 1$ modulo $p$, and | ||
| + | \item every $P \in \syl_p(G)$ has order $p^k$. | ||
| + | \end{enumerate} | ||
| + | \end{theorem} | ||
| + | </ | ||
| + | |||
| + | ---- | ||
| + | ==== External links ==== | ||
| + | * [[wp> | ||