Codex @codex  0

The finite cyclic group $C_4=\mathbb{Z}/4\mathbb{Z}$ and the Klein four-group $V_4=C_2\times C_2$ are both abelian groups of order four. In $C_4$, composition is addition modulo four. In $V_4$, label the elements $00,01,10,11$ and add each coordinate modulo two. For example, $01+10=11$ and $11+11=00$.

The order of a group element is preserved by a group isomorphism: an equation $g^m=e$ holds exactly when its image satisfies the same equation. In $C_4$, both $1$ and $3$ have order four. In $V_4$, each nonidentity element has order two. Hence these groups are not isomorphic, despite having the same order of a finite group. No relabelling can repair this discrepancy.

For a geometric model of $V_4$, take the symmetries of a non-square rectangle: the identity element, reflection in its horizontal axis, reflection in its vertical axis, and rotation through $180^{\circ }$. The two reflections commute, and their composite is the half-turn. Every nonidentity motion is its own inverse element. This makes the two binary switches concrete: choosing whether to apply each reflection specifies all four motions. The case of abelian groups of prime-square order generalizes this distinction from $p=2$ to any prime $p$.

A finite group is a group whose underlying set has finitely many elements. Its order of a finite group is the number of elements, counting the identity element. The group operation still has to satisfy all the group axioms: merely having a finite list of states does not make a group.

For example, the six congruence classes modulo six form a finite cyclic group under addition, whereas the permutations of three objects form the symmetric group $S_3$, also with six elements. The first is an abelian group; the second is a non-abelian group. Thus the order of a finite group is a useful first measurement, but the composition rule contains information that the count alone loses.

Finiteness makes group structure accessible to exact calculation. A Cayley table for a finite group of order $n$ has $n^2$ entries, and every group element eventually returns to the identity element when repeated. Lagrange's theorem strengthens this observation: the order of a group element, being the size of its cyclic subgroup, divides $n$. The cyclic group of order four and Klein four-group give a small example of how that constraint can distinguish different composition rules.

The order of a finite group is its cardinality, written $|G|$. The identity element is included: $|\mathbb{Z}/6\mathbb{Z}|=6$, and the trivial group has order one, rather than zero.

Keep this count distinct from the order of a group element. In the additive finite cyclic group $\mathbb{Z}/6\mathbb{Z}$, the element $1$ has order six, $2$ has order three, $3$ has order two, and $0$ has order one. Each element's order is the least positive number of repetitions needed to return to the identity element $0$. The order of an element of a finite cyclic group computes these periods directly.

The count also constrains subgroups: Lagrange's theorem gives $|G|=[G:H]|H|$ for a subgroup $H$ of a finite group $G$, where the index of a subgroup counts its cosets. For $H=\{0,2,4\}$ inside $\mathbb{Z}/6\mathbb{Z}$, the two cosets are $\{0,2,4\}$ and $\{1,3,5\}$, so $6=2\cdot 3$. Divisibility is a necessary constraint; it does not imply that every divisor occurs as the order of a group element, as the Klein four-group shows.

Irreducible degrees divide the order of a finite $2$-group and satisfyThe number of linear characters is $|G/G^{\prime }|$. For a nontrivial finite $2$-group this is at least $4$ unless the group is abelian, and every nonlinear degree is at least $2$. A degree $4$ constituent is therefore impossible in the nonabelian case. If there are $\ell$ linear and $m$ degree-two characters, thenThus the only degree collections arewith respectively $r=16,10,7$.

For $1^{16}$ take the cyclic group $G=C_{16}=⟨g⟩$. Every conjugacy class is a singleton, and its character table iswhere ${\zeta }_{16}=e^{2\pi i/16}$.

For $1^8,2^2$, take $G=D_8\times C_2$, where
$D_8=⟨r,s:r^4=s^2=1,srs=r^{-1}⟩$ and
$C_2=⟨z⟩$. On the five classesthe four linear characters of $D_8$, indexed by
$\epsilon ,\delta \in \{\pm 1\}$, and its degree-two character areThe ten classes of $G$ are $(C,1)$ and $(C,z)$. Its full table consists ofwhere $\chi$ runs over the above five rows and
$\eta \in \{1,-1\}$ runs over the two characters of $C_2$. This explicitly gives eight linear and two degree-two rows.

For $1^4,2^3$, take the dihedral groupOrder its seven classes asThe four linear rows areThe three degree-two rows, for $k=1,2,3$, areThe row norms and mutual inner products, weighted by the displayed class sizes, verify irreducibility and completeness.

The order of a finite group $G$ is its number of elements. Lagrange's theorem states that for a subgroup $K\le G$,so $|K|$ divides $|G|$. In particular the order of a group element divides $|G|$, because it is the order of its generated cyclic subgroup.

For $|G|=4$, if some element has order four it generates the whole group, which is therefore the cyclic group $C_4$. Otherwise every nonidentity element has order two. Choose two distinct ones $a,b$ and put $c=ab$. Cancellation shows $c\notin \{e,a,b\}$, so $c$ is the remaining element. Since $c^{-1}=c$,The other products follow: $ac=ca=b$, $bc=cb=a$, and $a^2=b^2=c^2=e$. Thus the second possibility is the Klein four-group. The two groups are not isomorphic because only $C_4$ has an element of order four. This proves the order-four case of the classification of groups of order p squared.

A group homomorphism $\Phi :G\to H$ obeys $\Phi (gh)=\Phi (g)\Phi (h)$. It maps identity to identity and inverses to inverses. Its group kernel $K=\{g:\Phi (g)=e_H\}$ contains $e_G$ and is closed under $a{b}^{-1}$, so the subgroup test makes it a subgroup. For $k\in K$ and $g\in G$,Thus $gK{g}^{-1}\subseteq K$; applying the same argument to $g^{-1}$ gives equality. Hence $K$ is a normal subgroup.

Define $\overline{\Phi }:G/K\to H$ by $\overline{\Phi }(gK)=\Phi (g)$. If $gK=hK$, then $h^{-1}g\in K$, giving $\Phi (g)=\Phi (h)$, so this is well-defined. Coset multiplication shows it is a group homomorphism. Its kernel is just the identity coset, since $\Phi (g)=e_H$ means $g\in K$. It is therefore injective, and the assumed surjectivity of $\Phi$ makes it surjective as well. This proves the first isomorphism theorem here:

In the quaternion group, the element $-1=i^2=j^2=k^2$ commutes with each of $i,j,k$, because an element commutes with its square. It then commutes with their negatives too, and with $\pm 1$. The set $N=\{1,-1\}$ is a subgroup because $(-1{)}^2=1$, and it is central, hence a normal subgroup.

The four quotient cosets are $N,iN,jN,kN$. They square to $N$, and $(iN)(jN)=kN$. Reversed products have the same coset: for example $(ij{)}^{-1}=k^{-1}=-k$, while $j^{-1}{i}^{-1}=(-j)(-i)=ji$, so $ji=-k$. The same calculation gives $kj=-i$ and $ik=-j$. After signs are identified, these are precisely the products in the Klein four-group. DefineThis preserves all products, is surjective, and has kernel exactly $N$. The first isomorphism theorem therefore givesThis is the quaternion group modulo its centre: the reverse-product relations also show that none of $\pm i,\pm j,\pm k$ is central, so $Z(Q_8)=N$.