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 08:50] joshuawiscons |
theorem:sylow_s_theorem [2013/08/13 11:29] (current) joshuawiscons |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Sylow theorems | + | ====== Sylow's theorem |
| + | $\DeclareMathOperator{\syl}{Syl}$ | ||
| **Theorem.** Let $G$ be a finite [[Definition: | **Theorem.** Let $G$ be a finite [[Definition: | ||
| - | - $G$ acts [[Definition: | + | - $G$ acts [[Definition: |
| - | - every $P \in \textrm{Syl}_p(G)$ has [[Definition: | + | - every $P \in \syl_p(G)$ has [[Definition: |
| ---- | ---- | ||
| ==== Remarks ==== | ==== Remarks ==== | ||
| - | * $\textrm{Syl}_p(G)$ denotes the collection of [[Definition: | + | |
| + | | ||
| ---- | ---- | ||
| - | ==== LaTeX version ==== | + | ==== $\LaTeX$ version ==== |
| < | < | ||
| %%%%%%%%%% | %%%%%%%%%% | ||
| % DEPENDENCIES | % DEPENDENCIES | ||
| - | % --RequiredMacros: | + | % RequiredMacros: |
| %%%%%%%%%% | %%%%%%%%%% | ||
| - | \begin{theorem}[Sylow' | + | \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} | ||