Skip to Content

Dummit And Foote Solutions Chapter 4 Overleaf Guide

\beginsolution Let $G$ act on $G/H = gH : g \in G$ by $g \cdot (xH) = (gx)H$. \beginenumerate \item \textbfTransitivity: Take any two cosets $aH, bH \in G/H$. Choose $g = ba^-1 \in G$. Then [ g \cdot (aH) = (ba^-1a)H = bH. ] Hence, there is exactly one orbit, so the action is transitive. \item \textbfStabilizer of $1H$: [ \Stab_G(1H) = g \in G : g \cdot (1H) = 1H = g \in G : gH = H. ] But $gH = H$ if and only if $g \in H$. Therefore $\Stab_G(1H) = H$. \endenumerate \endsolution

\beginsolution Let $n_3$ denote the number of Sylow $3$-subgroups. By Sylow's theorems, $n_3 \equiv 1 \pmod3$ and $n_3 \mid 4$. The divisors of $4$ are $1,2,4$. Which are $\equiv 1 \pmod3$? $1 \equiv 1 \pmod3$, $4 \equiv 1 \pmod3$, but $2 \equiv 2 \pmod3$. Hence $n_3 = 1$ or $n_3 = 4$. No other possibilities. \endsolution Dummit And Foote Solutions Chapter 4 Overleaf

\sectionApplications to $p$-groups and Sylow Theorems \beginsolution Let $G$ act on $G/H = gH

% Theorem environments \newtheoremtheoremTheorem[section] \newtheoremlemma[theorem]Lemma \newtheoremproposition[theorem]Proposition \newtheoremcorollary[theorem]Corollary \theoremstyledefinition \newtheoremdefinition[theorem]Definition \newtheoremexample[theorem]Example \newtheoremexerciseExercise[section] \newtheoremsolutionSolution[section] Then [ g \cdot (aH) = (ba^-1a)H = bH

Alternatively, consider the action of $G$ on the set of all subsets of size $n$? A standard proof uses the regular representation and the sign homomorphism. Let $G$ act on itself by left multiplication; this yields an embedding $\pi: G \hookrightarrow S_2n$. Since $n$ is odd, $2n$ is even. Compose with the sign map $\sgn: S_2n \to \pm1$. The kernel of $\sgn \circ \pi$ is a subgroup of index at most $2$. If the image is $\pm1$, the kernel has index $2$ and hence order $n$. If the image is trivial, then every element acts as an even permutation. But in $S_2n$, a transposition is odd; careful analysis (see D&F) shows this forces a contradiction for $n$ odd. Thus the kernel is the desired subgroup of order $n$. \endsolution