Prove that every finite group having more than two elements has a nontrivial automorphism.

(Michigan State University, Abstract Algebra Qualifying Exam)
 

Proof.

Let $G$ be a finite group and $|G|> 2$.

Case When $G$ is a Non-Abelian Group

Let us first consider the case when $G$ is a non-abelian group.
Then there exist elements $g, h\in G$ such that $gh\neq hg$.

Consider the map $\phi: G \to G$ defined by sending $x\in G$ to $gxg^{-1}$.
Then it is straightforward to check that $\phi$ is a group homomorphism and its inverse is given by the conjugation by $g^{-1}$.
Hence $\phi$ is an automorphism.

If $\phi=1$, then we have $h=\phi(h)=ghg^{-1}$, and this implies that $gh=hg$.
This contradicts our choice of $g$ and $h$.
Hence $\phi$ is a non-trivial automorphism of $G$.

Case When $G$ is an Abelian Group

Next consider the case when $G$ is a finite abelian group of order greater than $2$.
Since $G$ is an abelian group the map $\psi:G\to G$ given by $x \mapsto x^{-1}$ is an isomorphism, hence an automorphism.

If $\psi$ is a trivial automorphism, then we have $x=\psi(x)=x^{-1}$.
Thus, $x^2=e$, where $e$ is the identity element of $G$.

Sub-Case When $G$ has an Element of Order $\geq 3$.

Therefore, if $G$ has at least one element of order greater than $2$, then $\psi$ is a non-trivial automorphism.

Sub-Case When Elements of $G$ has order $\leq 2$.

It remains to consider the case when $G$ is a finite abelian group such that $x^2=e$ for all elements $x\in G$.
In this case, the group $G$ is isomorphic to
\[\Zmod{2}\times \Zmod{2}\times \cdots \Zmod{2}=(\Zmod{2})^n.\] Since $|G| > 2$, we have $n>1$.

Then the map $(\Zmod{2})^n\to (\Zmod{2})^n$ defined by exchanging the first two entries
\[(x_1, x_2, x_3, \dots, x_n) \mapsto (x_2, x_1, x_3, \dots, x_n)\] is an example of nontrivial automorphism of $G$.

Therefore, in any case, the group $G$ has a nontrivial automorphism.

The post Every Finite Group Having More than Two Elements Has a Nontrivial Automorphism first appeared on Problems in Mathematics.

Let $G$ be a finite group of order $p^n$, where $p$ is a prime number and $n$ is a positive integer.
Suppose that $H$ is a subgroup of $G$ with index $[G:P]=p$.
Then prove that $H$ is a normal subgroup of $G$.

(Michigan State University, Abstract Algebra Qualifying Exam)

Proof.

Let $G/H$ be the set of left cosets of $H$.
Then the group $G$ acts on $G/H$ by the left multiplication.
This action induces the permutation representation homomorphism
\[\phi: G\to S_{G/H},\] where $S_{G/H}$ is the symmetric group on $G/H$.
For each $g\in G$, the map $\phi(g):G/H \to G/H$ is given by $x\mapsto gx$.

By the first isomorphism theorem, we have
\begin{align*}
G/\ker(\phi) \cong \im(\phi) < S_{G/H}.
\end{align*}
This implies the order $|G/\ker(\phi)|$ divides the order $|S_{G/H}|=p!$.

Since
\[|G/\ker(\phi)|=\frac{|G|}{|\ker(\phi)|}=\frac{p^n}{|\ker(\phi)|}\] and $p!$ contains only one factor of $p$, we must have either $|\ker(\phi)|=p^n$ or $|\ker(\phi)|=p^{n-1}$.

Note that if $g\in \ker(\phi)$, then $\phi(g)=\id:G/H \to G/H$.
This yields that $gH=H$, and hence $g\in H$.
As a result, we have $\ker(\phi) \subset H$.

Since the index of $H$ is $p$, the order of $H$ is $p^{n-1}$.
Thus we conclude that $|\ker(\phi)|=p^{n-1}$ and
\[\ker(\phi)=H.\]

Since every kernel of a group homomorphism is a normal subgroup, the subgroup $H=\ker(\phi)$ is a normal subgroup of $G$.

The post A Subgroup of Index a Prime $p$ of a Group of Order $p^n$ is Normal first appeared on Problems in Mathematics.