TheoremComplete

Group Actions and Sylow Theorems - Applications

The Sylow theorems provide powerful constraints on the structure of finite groups, enabling classification results and non-existence proofs.

TheoremSylow Theorems (Complete Statement)

Let GG be a finite group with G=pnm|G| = p^n m where pp is prime and gcd(p,m)=1\gcd(p,m) = 1. Let npn_p be the number of Sylow pp-subgroups. Then:

  1. Existence: Sylow pp-subgroups exist (of order pnp^n)
  2. Conjugacy: All Sylow pp-subgroups are conjugate
  3. Counting: np1(modp)n_p \equiv 1 \pmod{p} and npmn_p \mid m

These theorems transform the question "what subgroups must exist?" into concrete divisibility constraints that can often determine group structure completely.

ExampleNo Simple Group of Order 30

Suppose GG is simple with G=30=235|G| = 30 = 2 \cdot 3 \cdot 5. For Sylow 5-subgroups:

  • n51(mod5)n_5 \equiv 1 \pmod{5} and n56n_5 \mid 6
  • So n5{1,6}n_5 \in \{1, 6\}

If n5=1n_5 = 1, the unique Sylow 5-subgroup is normal, contradicting simplicity.

If n5=6n_5 = 6, we have 6 subgroups of order 5, contributing 64=246 \cdot 4 = 24 elements of order 5. Similarly analyzing Sylow 3-subgroups forces n3=10n_3 = 10, contributing 20 more elements. But 24+20>3024 + 20 > 30, a contradiction!

Therefore, no simple group of order 30 exists.

TheoremGroups of Order $p^2$

Every group of order p2p^2 (where pp is prime) is abelian. Moreover, there are exactly two such groups up to isomorphism: Zp2\mathbb{Z}_{p^2} and Zp×Zp\mathbb{Z}_p \times \mathbb{Z}_p.

This follows from the class equation: G=Z(G)+[G:CG(gi)]|G| = |Z(G)| + \sum [G:C_G(g_i)]. Since each term is a power of pp and Z(G)p|Z(G)| \geq p, we must have Z(G){p,p2}|Z(G)| \in \{p, p^2\}. If Z(G)=p|Z(G)| = p, the quotient G/Z(G)G/Z(G) has order pp, hence is cyclic, which forces GG to be abelian (contradicting Z(G)=p|Z(G)| = p). Thus Z(G)=p2=G|Z(G)| = p^2 = |G|.

Remark

The Sylow theorems enable a systematic approach to finite group theory. For small orders, we can often enumerate all possible groups by:

  1. Decomposing G|G| into prime powers
  2. Determining possible values of npn_p for each prime
  3. Using semi direct products when unique Sylow subgroups don't exist

Combined with the classification of finite simple groups, the Sylow theorems provide a nearly complete understanding of finite group structure.