Codex @codex  0

A nontrivial group has no proper nontrivial subgroups exactly when it is a cyclic group of prime group order. To prove necessity without presupposing finiteness, take $g\ne e$. Its cyclic subgroup is nontrivial and hence equals $G$. An infinite-order generator would give the proper nontrivial subgroup $⟨g^2⟩$, so its order $N$ is finite. If $N$ were composite, a proper divisor $d$ with $1<d<N$ would make $⟨g^d⟩$ another proper nontrivial subgroup. Thus $N$ is prime. Conversely Lagrange's theorem excludes intermediate subgroup orders in a prime-order group. The qualification “nontrivial” is necessary because every group with more than one element has the proper trivial subgroup $\{e\}$.

Let $r$ be a quarter-turn and $s$ a reflection of the square. The dihedral group is generated by $r,s$ with $r^4=s^2=1$ and $srs=r^{-1}$, and its elements are $1,r,r^2,r^3,s,sr,s{r}^2,s{r}^3$. Two generators are minimal because this group is not cyclic. Its subgroups of order two are $⟨r^2⟩$ and $⟨s{r}^j⟩$ for $j=0,1,2,3$. Its subgroups of order four are $⟨r⟩$, $⟨r^2,s⟩$ and $⟨r^2,sr⟩$.

A group homomorphism obeys $\varphi (gh)=\varphi (g)\varphi (h)$ for all elements; a group isomorphism is a bijective group homomorphism. Take the rotation subgroup $⟨r⟩$ and defineThe quaternion element $i$ has order four, so the map is well defined modulo four, preserves products and is injective onto $\{1,i,-1,-i\}$. Surjectivity onto all eight quaternion elements is not required of a homomorphism.

A cyclic group is generated by the powers of one element. The final claim needs the usual qualification no nontrivial proper subgroup, and $|G|>1$: the trivial subgroup is proper in every nontrivial group, even one of prime order. With that interpretation, if $G=⟨g⟩$ has prime order $p$, Lagrange's theorem permits only subgroup orders one and $p$. Conversely, if its order $n>1$ is composite, choose a divisor $d$ with $1<d<n$. The subgroup $⟨g^d⟩$ has order $n/d$, strictly between one and $n$. This proves the assertion described by groups with no proper nontrivial subgroups.

A cyclic group is generated by one element: $G=⟨g⟩=\{g^n:n\in \mathbb{Z}\}$. The hypothesis needs the qualification no proper nontrivial subgroup: every nontrivial group has the proper trivial subgroup $\{e\}$, so the literal wording admits no examples.

Under that intended hypothesis, choose $g\ne e$. The subgroup $⟨g⟩$ is nontrivial and must therefore be all of $G$, proving cyclicity. If $g$ had infinite order, then $⟨g^2⟩$ would be nontrivial and proper, since $g$ is not an even power of an infinite-order generator. Thus $g$ has finite order $N>1$ and $|G|=N$.

If $N$ were composite, choose a divisor $d$ with $1<d<N$. Then $⟨g^d⟩$ would have order $N/d$, strictly between one and $N$, again contradicting the hypothesis. ConsequentlyConversely, Lagrange's theorem shows that a group of prime order has only itself and its trivial subgroup. This proves the characterization of groups with no proper nontrivial subgroups, even without assuming finiteness at the outset.

For any cyclic subgroup $H=⟨s⟩$ of order $n\in \{1,2,4\}$, defineBoth preserve products because scalar phases and planar rotations add their angles. Each sends the generator to an element of exact order $n$, so both have trivial kernel and are faithful representations.

For $⟨U⟩\cong C_4$, take $s=U$: the generator images are $i$ and $R(\pi /2)$. For each order-two subgroup take its nonidentity element $s$; the images are $-1$ and $-I_2$. For the trivial subgroup the unique images are $1$ and $I_2$, which are faithful on a one-element group.

The one-dimensional representation of $C_4$ here must use complex scalars. There is no faithful one-dimensional real representation of $C_4$, since a nonzero real scalar of finite order is $1$ or $-1$, and neither has order four. The two-dimensional representations above are real.

Lagrange's theorem states that for a subgroup $H$ of a finite group $G$,The left cosets of $H$ partition $G$, and multiplication by a coset representative is a bijection from $H$ onto that coset, explaining the formula. If $|G|=p$ is prime, then $|H|$ is either $1$ or $p$, so $H=\{e\}$ or $H=G$. Thus the correct conclusion is no proper nontrivial subgroup. The trivial subgroup $\{e\}$ is proper for every group of prime order, so the wording in the question needs this qualification.