logo

Proof of Cauchy's Theorem in group Theory 📂Abstract Algebra

Proof of Cauchy's Theorem in group Theory

Theorem 1

For a finite group GG, if a prime number pp is a divisor of G|G|, then there exists a subgroup HGH \leqslant G satisfying H=p|H| = p.

Explanation

When people usually refer to Cauchy’s theorem, they don’t typically mean this theorem. Another Cauchy’s theorem, which is fundamental to complex analysis, is much more significant and often mentioned. More so because this theorem is generally superseded by the First Sylow theorem, making it quite rare to specifically use Cauchy’s theorem.

While it might not necessarily be useful to know, the method of proof is very unique, starting from its setup. It is recommended to try to prove it at least once, even if just for interest.

Proof

Consider i=1,pi=1 , \cdots p where giGg_{i} \in G and let the identity of GG be ee. Consider the set X:={(g1,,gp)  g1gp=e} X := \left\{ (g_{1} , \cdots , g_{p}) \ | \ g_{1} \cdots g_{p} = e \right\} and the symmetric group SpS_{p}.

ρ1Sp\rho_{1} \in S_{p} acts as a permuting permutation that shifts each tuple of XX by one place, ρ1(g1,g2,,gp1,gp)=(g2,g3,,gp,g1) \rho_{1} (g_{1}, g_{2} , \cdots , g_{p-1} , g_{p}) = (g_{2}, g_{3} , \cdots , g_{p} , g_{1}) in such action. Defined as gp=(g1gp1)1g_{p} = (g_{1} \cdots g_{p-1} )^{-1}, therefore X=Gp1|X| = |G|^{p-1} and since pp is a divisor of G|G|, pp is also a divisor of X|X|.

Properties of pp-group: If finite group GG is a pp-group and XX is a GG-set, then XXG(modp)|X| \equiv |X_{G}| \pmod{p}

Hence <ρ1>=p| \left< \rho_{1} \right> | = p, XX<ρ1>(modp) |X| \equiv \left| X_{ \left< \rho_{1} \right> } \right| \pmod{p} and pp also divides X<ρ1>\left| X_{ \left< \rho_{1} \right> } \right|. This means that there are at least as many tuples in X<ρ1>\left| X_{ \left< \rho_{1} \right> } \right| with all elements being the same, regardless of whether it becomes (e,e,,e)(e, e, \cdots , e) or (g,g,,g)(g , g , \cdots , g ), as multiples of pp. However, the very presence of these elements in X<ρ1>\left| X_{ \left< \rho_{1} \right> } \right| signifies gg=gp=eg \cdots g = g^p = e. Therefore, one can confirm that at least <g>=p\left< g \right> = p satisfying <g>\left< g \right> will be a subgroup of GG.

See Also


  1. Fraleigh. (2003). A first course in abstract algebra(7th Edition): p322. ↩︎