Sylow number: Difference between revisions

From Groupprops
No edit summary
No edit summary
Line 40: Line 40:
We can in fact refine the congruence condition further, to obtain certain conditions where we can force <math>n_p</math> to be 1 modulo higher powers of <math>p</math>. The idea in those is to argue that any intersection of Sylow subgroups must have large index in both.
We can in fact refine the congruence condition further, to obtain certain conditions where we can force <math>n_p</math> to be 1 modulo higher powers of <math>p</math>. The idea in those is to argue that any intersection of Sylow subgroups must have large index in both.


===Other facts===
* [[Congruence condition on Sylow numbers in terms of maximal Sylow intersection]]
==Using Sylow numbers==
==Using Sylow numbers==



Revision as of 13:52, 24 August 2010

Definition

Definition with symbols

Let be a finite group and a prime dividing the order of . Then the Sylow number for , denoted as , is any of the following equivalent values:

Equivalence of definitions

Further information: Sylow number equals index of Sylow normalizer

The equivalence of definitions follows from the fact that any two -Sylow subgroups are conjugate.

Facts

It divides the index of the Sylow subgroup

Further information: Divisibility condition on Sylow numbers

Let be the index of the Sylow subgroup. Then divides . The easiest way of seeing this is from the fact that if is a -Sylow subgroup, then:

or:

It is 1 modulo the prime

Further information: Congruence condition on Sylow numbers

This is the congruence condition on the Sylow number. It states that:

This follows from the fact that if we fix any one Sylow subgroup and look at the orbits on the set of all Sylow subgroups under conjugation by elements of , all the orbits except itself have sizes as multiples of .

We can in fact refine the congruence condition further, to obtain certain conditions where we can force to be 1 modulo higher powers of . The idea in those is to argue that any intersection of Sylow subgroups must have large index in both.

Other facts

Using Sylow numbers

Note that the above constraints on Sylow numbers are all constraints that arise purely from the order of the group. Thus, given any positive integer , we define a set of Sylow numbers for this positive integer as a set (ordered) of associations of to each prime dividing such that there exists a group of order whose Sylow numbers are precisely .

Of course, given a positive integer, there may be many possibilities for the set of Sylow numbers for that positive integer. Imposing conditions on the kind of group we allow can put further constraints on the set of Sylow numbers. For instance:

  • A set of simple Sylow numbers is a set of Sylow numbers that arises from a simple group.