Lesson 4.31,252 words

The Sylow Theorems

Lagrange's theorem forbids subgroups whose order fails to divide the group order; Sylow's theorems supply a partial converse for prime powers. A Sylow p-subgroup always exists, all of them are conjugate, and their count satisfies two congruence-and-divisibility constraints tight enough to prove many groups non-simple from their order alone.

╌╌╌╌

Lagrange's theorem says the order of a subgroup divides the order of the group. Its converse fails: has order but no subgroup of order . The Sylow theorems recover as much of the converse as is true — for every prime power dividing to its maximal extent, a subgroup of that order exists — and then say precisely how many there are.1 The count is constrained enough that, for many orders, it alone forces a normal subgroup, which is the standard route to proving a group is not simple.

Sylow subgroups

Write for the set of Sylow -subgroups and for their number. The definition isolates the -part of the order: factor once, and a Sylow -subgroup accounts for the entire .

With and , a Sylow -subgroup has order ; it sits inside its normalizer, whose index in is the count .

The theorems

Two independent constraints bound : the congruence and the divisibility . Their intersection is often a very short list.

Existence and the congruence both rest on a lemma controlling how a -subgroup meets a Sylow normalizer.

If , then is a subgroup (because normalizes ) of order , a power of ; since and already has the maximal -power order, , forcing .2

The congruence

Let act by conjugation on the set of conjugates of one Sylow -subgroup . Restrict the action to a -subgroup and split into -orbits. By orbit-stabilizer and the lemma, the orbit of has size . Taking : the orbit of is a single point (since ), while every other orbit has size , a positive power of . Summing,

The conjugacy part then shows is all of , so , and orbit-stabilizer for the full group gives .3 Existence is a separate induction on using the class equation: if , quotient by a central subgroup of order ; otherwise some non-central centralizer has index prime to and supplies the Sylow subgroup by induction.

The conjugacy part: permutes its Sylow -subgroups transitively by conjugation, so there is a single orbit of size .

Normality from uniqueness

If then for all , so is normal. Conversely a normal is the only Sylow -subgroup, since all are conjugate to it. A unique subgroup of its order is characteristic, hence normal.4 Proving therefore proves normality, the target of every non-simplicity argument below.

Reading the count in examples

Factor the order, list the candidate , and let the two constraints prune.

GroupNotes
unique (normal) Sylow -subgroup
normal Sylow -subgroup ;
Sylow -subgroups
abelian: one Sylow per prime
Sylow constraints prune the candidate counts for order : divisors of are boxed and those congruent to modulo are shaded, leaving and .

For : and leave , and the four subgroups realize ; meanwhile and force , the normal Klein four-group. The largest prime tends to give the tightest constraint, since rules out more values as grows.

Proving non-simplicity

If some , the corresponding Sylow subgroup is a proper nontrivial normal subgroup, so is not simple. Three techniques cover most small orders.

Direct pruning. Suppose with primes . Then and ; since the only option is , so the Sylow -subgroup is normal and is not simple. Any group of order has a normal Sylow subgroup for the larger prime.5

Element counting. When the constraints allow , count elements of each prime order. Take and suppose neither the Sylow - nor the Sylow -subgroup is normal, so and . Distinct Sylow -subgroups meet only in the identity, so they contribute elements of order ; the ten Sylow -subgroups contribute elements of order . That is non-identity elements in a group of — a contradiction. One of the Sylow subgroups must be normal.

The order- contradiction: assuming no normal Sylow - or -subgroup forces elements of prime order into a group of size .

Changing primes and using cosets. For borderline orders the coset action supplies the last step. If has index and is simple, then embeds in (the kernel of the coset action is a proper normal subgroup, hence trivial), so . This bounds how small an index a simple group can have, and combined with element counting it classifies the simple group of order as .

Worked example: groups of order 12

The three techniques together settle the structure of every group of order . The claim is that such a either has a normal Sylow -subgroup or is isomorphic to .5

Suppose the Sylow -subgroup is not normal, so . The constraints and leave . The four Sylow -subgroups have prime order , so they intersect pairwise in the identity and account for elements of order . Since , the normalizer equals itself. Now let act by conjugation on its four Sylow -subgroups; the resulting homomorphism has kernel , and since is not normal, . So is injective and embeds in . The elements of order map to the three-cycles of , all of which lie in , so the image meets in a subgroup of order at least ; both groups have order , forcing and . In that case the Sylow -subgroup — the Klein four-group of double transpositions — is the unique one, hence normal, so still has some normal Sylow subgroup. The order- groups are thereby sorted into those with a normal Sylow -subgroup and the single exception .

The same bound settles order . A simple group of order can have no subgroup of index less than , since an index would embed in with . Running the possible values through this bound and an element count forces the Sylow -normalizer to have index ; the coset action then embeds in as a subgroup that must coincide with . Every simple group of order is isomorphic to .

Algorithm:TestNonSimple(G)\textsc{TestNonSimple}(G) — the standard order-based argument
  1. 1
    factor G=p1a1ptat|G| = p_1^{a_1}\cdots p_t^{a_t}
  2. 2
    for each prime pip_i do
  3. 3
    list candidates: npin_{p_i} with npi1(modpi)n_{p_i} \equiv 1 \pmod{p_i} and npimin_{p_i} \mid m_i
  4. 4
    if the only candidate is npi=1n_{p_i} = 1 then
  5. 5
    return "not simple"
    unique Sylow subgroup is normal
  6. 6
    for each prime with npi>1n_{p_i} > 1 forced do
  7. 7
    count elements of order pip_i across distinct Sylow subgroups
  8. 8
    if the counts exceed G|G| then
  9. 9
    return "not simple"
    some Sylow subgroup must be normal
  10. 10
    embed GG in SkS_k via a small-index coset action; check Gk!|G| \mid k!

Footnotes

  1. Dummit & Foote, §4.5 — The Sylow Theorems: the definitions of -group and Sylow -subgroup and the statement of Sylow's theorem as a partial converse to Lagrange's theorem.
  2. Dummit & Foote, §4.5, Lemma 19: for a Sylow -subgroup and any -subgroup .
  3. Dummit & Foote, §4.5, Theorem 18: existence, conjugacy/domination, and the count with ; the orbit-counting proof of the congruence.
  4. Dummit & Foote, §4.5, Corollary 20: is equivalent to normality and to being characteristic.
  5. Judson, §15.2 — Examples and Applications: groups of order , element-counting arguments, and non-simplicity of groups of small order. 2 3 4

╌╌ END ╌╌