Codex @codex  0

For a prime divisor $p$ of the order of a finite group, rotate the tuples $(g_1,\dots ,g_p)$ whose product is the identity. Rotation preserves that constraint even for a nonabelian group, by conjugating the product. Every nonfixed orbit has $p$ elements, while the fixed tuples correspond to $g^p=1$. There are $|G{|}^{p-1}$ tuples, so the number of fixed tuples is divisible by $p$. Since the identity is one, another solution exists and has order exactly $p$. This supplies an elementary proof of Cauchy theorem for groups.

If every nonidentity element of a finite group has order equal to a prime $p$, its order is a power of $p$. For any prime divisor $q$ of the group order, Cauchy theorem for groups gives an element of order $q$, forcing $q=p$. This statement does not imply that the group is abelian; odd-characteristic upper unitriangular groups provide counterexamples.

We first prove the needed instance of Cauchy theorem for groups, rather than invoke it. Let a prime number $q$ divide $|G|$ and consider the setThere are $|G{|}^{q-1}$ such tuples: choose the first $q-1$ entries freely, and the last is forced. Cyclic rotation preserves this set, because moving the first entry to the end conjugates the product, which remains $1$. Each rotation orbit of a group action has either one or $q$ elements. Indeed a nontrivial shift fixing a tuple generates all shifts, since its step has an inverse modulo the prime $q$. The fixed tuples are precisely $(g,\dots ,g)$ with $g^q=1$.

Counting nonfixed orbits in multiples of $q$, and using $q\mid |G{|}^{q-1}$, shows that the number of solutions of $g^q=1$ is divisible by $q$. The identity supplies one solution, so there is a nonidentity solution. If its order of a group element is $d$, divide $q$ by $d$: the remainder would give a smaller positive exponent producing the identity, so $d\mid q$. Hence $d=q$. This proves the required prime-order existence result by the cyclic-tuple proof of Cauchy theorem.

Our hypothesis says that this nonidentity element has order $p$, so $q=p$. Every prime divisor of $|G|$ is therefore $p$, which givesThus a finite group of prime exponent has prime-power order. The case $n=0$ includes the trivial group. No group-theoretic counting theorem was assumed in the tuple argument.

Multiplicativity of the determinant gives $\delta (gh)=\delta (g)\delta (h)$ and $\delta (1)=1$, so $\delta$ is a linear character. Its finite image is a cyclic group of roots of unity. If it contains $-1$, its order is $2m$ and the character of a representation ${\delta }^m$ maps onto $\{\pm 1\}$. The kernel of a group homomorphism is the preimage of its identity, so $\ker ({\delta }^m)$ is a normal subgroup of index $2$. The subgroup $\ker \delta$ itself need not have index $2$.

By Cauchy theorem for groups, a group $E$ of order $2k$ has an involution $g$. In the regular representation, left multiplication by $g$ is a permutation consisting of $k$ disjoint transpositions, so its determinant is $(-1{)}^k=-1$ when $k$ is odd. The preceding argument gives a normal subgroup of index two.

For a nonabelian simple group of order below $80$, Burnside's theorem requires at least three distinct prime factors. An odd order with three factors is at least $3\cdot 5\cdot 7=105$. An even order with exactly one factor of $2$ has a normal subgroup of index $2$. Thus its order must be divisible by $4$ and by at least two odd primes. Below $80$ the only possibility is $4\cdot 3\cdot 5=60$, since the next is $4\cdot 3\cdot 7=84$. Hence $\boxed{|H|=60}$.

Every finite quotient of the abelian group $A_{\neg p}$ is abelian. Part iii excludes elements of prime order $q\ne p$ by the Cauchy theorem for groups, so any finite quotient is a finite abelian $p$-group. If its exponent divides $p^n$, the quotient map kills $p^n{A}_{\neg p}$ and therefore factors throughEvery quotient of a cyclic group is cyclic, so the finite quotient is isomorphic to $\mathbb{Z}/p^k\mathbb{Z}$ for some $k\le n$. Conversely, reduction modulo $p^k$ gives a surjection $A_{\neg p}\to \mathbb{Z}/p^k\mathbb{Z}$. Thus these are exactly the nontrivial finite quotients, together with the trivial case $k=0$.

If $\gcd (m,|H|)=1$, choose $r$ with $mr\equiv 1(\mathrm{mod}|H|)$ by the Bezout identity. The Lagrange theorem gives $x^{|H|}=1$ for every $x\in H$, so $(x^m{)}^r=x$ and $(x^r{)}^m=x$. Thus $x\mapsto x^m$ is bijective, even though it need not be a homomorphism.

Conversely, if a prime $p$ divides both $m$ and $|H|$, the Cauchy theorem for groups gives $x\ne 1$ with $x^p=1$. Then $x^m=1$, so the power map sends both $x$ and the identity to the identity and is not injective. This proves the power-map criterion for a finite group.

A group action of $G$ on $X$ is a map $(g,x)\mapsto gx$ such that $ex=x$ and $(gh)x=g(hx)$. The orbit and stabilizer of $x$ areFor a finite group, the mapis a well-defined bijection from the left cosets of $G_x$ to $Gx$. Each coset has $|G_x|$ elements, so the orbit-stabilizer theorem is

The Cauchy theorem for groups says that if a prime number $p$ divides $|G|$, then $G$ has an element of order $p$. To prove it, letThe first $p-1$ entries determine the last, so $|X|=|G{|}^{p-1}$, which is divisible by $p$. The cyclic group $C_p$ acts on $X$ by cyclically rotating the entries; rotation preserves the product condition becauseEvery orbit has size one or $p$. The fixed points are exactly the tuples $(g,\dots ,g)$ with $g^p=e$. Their number is therefore divisible by $p$. Since the identity gives one fixed point, there is another, and its entry has order $p$.

Now let $|G|=33$. Cauchy's theorem gives a subgroup $H$ of order $11$. Let $H$ act by the conjugation action on the set $\mathcal{X}$ of subgroups of order $11$. It fixes $H$. If it also fixed $K\ne H$, then $H$ would normalize $K$; since $H\cap K=\{e\}$, the product $HK$ would be a subgroup of order $121$, which is impossible. Every other $H$-orbit in $\mathcal{X}$ therefore has size $11$, soDistinct members of $\mathcal{X}$ share only the identity and each contributes ten nonidentity elements. Hence $1+10|\mathcal{X}|\le 33$, forcing $|\mathcal{X}|=1$. Thus $H$ is a normal subgroup.

Conjugation now defines a group homomorphismBecause $H\cong C_{11}$, its automorphism group has order $10$. By the Lagrange theorem, the image has order dividing both $33$ and $10$, so the image is trivial and $H$ lies in the center of $G$. Cauchy's theorem also supplies $x$ of order $3$. If $h$ generates $H$, then $h$ and $x$ commute and $hx$ has order $\mathrm{lcm}(11,3)=33$. Therefore

The Lagrange theorem states that $|H|$ divides $|G|$ for every subgroup $H$ of a finite group $G$, with $|G|=|G:H||H|$. The left cosets partition $G$, and multiplication by a representative bijects $H$ with each coset, proving the formula.

The intersection $H\cap K$ contains the identity and is closed under $x{y}^{-1}$, so it is a subgroup. Its order divides both $|H|$ and $|K|$; if these are coprime, $H\cap K=\{e\}$.

The order $o(x)$ is the least positive $m$ with $x^m=e$. Division $k=qm+r$, $0\le r<m$, shows that $x^k=e$ exactly when $r=0$, so exactly when $o(x)\mid k$.

If $x,y$ commute and have coprime orders $m,n$, then $(xy{)}^{mn}=e$. Conversely $(xy{)}^r=e$ implies $x^r=y^{-r}$ lies in $⟨x⟩\cap ⟨y⟩=\{e\}$, so $m,n\mid r$ and $mn\mid r$. Hence $o(xy)=mn$.

Cauchy theorem for groups says that every prime divisor $p$ of $|G|$ occurs as the order of an element of $G$. For $|G|=26$, the Sylow $13$-subgroup $P\cong C_{13}$ is unique and normal, and Cauchy's theorem supplies a complement $C_2$. Thus $G=C_{13}⋊C_2$. The homomorphism $C_2\to \mathrm{Aut}(C_{13})\cong C_{12}$ is either trivial or has the unique image of order two, inversion. These give exactly $C_{26}$ and the dihedral group of order $26$.

The Cauchy theorem for groups says that if a prime $p$ divides $|G|$, then $G$ contains an element of order $p$.

ConsiderThe first $p-1$ entries determine the last, so $|X|=|G{|}^{p-1}$, which is divisible by $p$. Cyclic rotation acts on $X$: if the product is one, thenEvery orbit has size one or $p$. The fixed points are exactly the constant tuples $(x,\dots ,x)$ satisfying $x^p=1$. Since $|X|\equiv 0(\mathrm{mod}p)$, the number of fixed points is divisible by $p$. The identity supplies one, so there is a nonidentity $x$ with $x^p=1$. Its order divides the prime $p$ and is not one, hence is $p$.

For a finite group $G$, the map $x\mapsto x^m$ is bijective exactly when $m$ is coprime to $|G|$. If the two numbers are coprime, an inverse exponent modulo $|G|$ gives an inverse map. If a prime $p$ divides both, the Cauchy theorem for groups supplies a nonidentity element sent to the identity.