This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
theorem:sylow_s_theorem [2013/08/08 06:27] joshuawiscons |
theorem:sylow_s_theorem [2013/08/13 11:29] (current) joshuawiscons |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Sylow' | + | ====== Sylow' |
- | ===== Statement ===== | + | $\DeclareMathOperator{\syl}{Syl}$ |
- | Let $G$ be a finite group and $p$ a prime. Write $|G| = np^k$ with $(n,p) = 1$. Then | + | **Theorem.** |
- | - $G$ acts transitively on $\textrm{Syl}_p(G)$ by conjugation with $|\textrm{Syl}_p(G)| \equiv 1$ modulo $p$, and | + | - $G$ acts [[Definition: |
- | - every $P \in \textrm{Syl}_p(G)$ has order $p^k$. | + | - 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 | % DEPENDENCIES | ||
- | % -Macros: \DeclareMathOperator{\syl}{Syl} | + | % RequiredMacros: \DeclareMathOperator{\syl}{Syl} |
%%%%%%%%%% | %%%%%%%%%% | ||
+ | \begin{theorem}[Sylow' | ||
Let $G$ be a finite group and $p$ a prime. Write $|G| = np^k$ with $(n,p) = 1$. Then | Let $G$ be a finite group and $p$ a prime. Write $|G| = np^k$ with $(n,p) = 1$. Then | ||
\begin{enumerate} | \begin{enumerate} | ||
Line 15: | Line 23: | ||
\item every $P \in \syl_p(G)$ has order $p^k$. | \item every $P \in \syl_p(G)$ has order $p^k$. | ||
\end{enumerate} | \end{enumerate} | ||
+ | \end{theorem} | ||
</ | </ | ||
- | ===== External | + | ---- |
+ | ==== External | ||
+ | * [[wp> |