Sylow intersection technique

From Groupprops

Description

The Sylow intersection technique is a technique used to obtain further and tighter conditions on the Sylow numbers of a simple group. The idea is to start with a given integer, obtain constraints on the Sylow numbers of any simple group whose order is that integer, and finally use these constraints to obtain a contradiction.

Motivation

The idea starts off by revisiting the proof that . Recall the proof:

Let be a -Sylow subgroup and denote the set of all -Sylow subgroups. acts on by inner automorphisms. In particular, acts on by conjugation.

Under this action, any member cannot be fixed by all elements in , because if it were, then would be a group of prime power order strictly greater than both and (this follows from the product formula).

Thus, every orbit in under the action of (other than itself) is a nontrivial orbit. Since the size of any orbit must divide the size of , any orbit must have size a power of , hence a multiple of , and we are done.

Getting stronger version

For the general version, first observe that for any .

Our aim is to show that every orbit under the conjugation action of has size a multiple of for some given . In order to do that, it suffices to show that for any Sylow subgroup , has index at least in . This in turn in equivalent to saying that has index at least in both and .

If we show that, it then follows directly that .

Finding conditions for the stronger version

Here is a special situation where we can apply the stronger version. Suppose is a simple group of order where and are primes. Let and be -Sylow subgroups.

Suppose has order . Then it has index in both and . From the theory of -groups. it follows that is normal in both and , hence it is also normal in the subgroup generated by them.

Since is a maximal subgroup of (on account of being a subgroup of prime index), the subgroup generated by and is the whole of . Hence is normal in and this contradicts the simplicity of .

The upshot is that if has order then .

But since , we have either or . Hence, any simple group of order where must satisfy .