This article gives a proof/explanation of the equivalence of multiple definitions for the term collection of groups satisfying a universal congruence condition
View a complete list of pages giving proofs of equivalence of definitions
Statement
Suppose
is a finite collection of finite
-groups, groups of prime power order for the prime
. The following conditions are equivalent for
:
- For any finite
-group
that contains a subgroup isomorphic to an element of
, the number of subgroups of
isomorphic to elements of
is congruent to
modulo
.
- For any finite
-group
that contains a subgroup isomorphic to an element of
, the number of normal subgroups of
isomorphic to elements of
is congruent to
modulo
.
- For any finite
-group
and any normal subgroup
of
such that
contains a subgroup isomorphic to an element of
, the number of normal subgroups of
isomorphic to elements of
and contained in
is congruent to
modulo
.
- For any finite
-group
that contains a subgroup isomorphic to an element of
, the number of p-core-automorphism-invariant subgroups of
isomorphic to elements of
is congruent to
modulo
.
- For any finite group
containing a subgroup isomorphic to an element of
, the number of subgroups of
isomorphic to an element of
is congruent to
modulo
.
Facts used
- Size of conjugacy class of subgroups equals index of normalizer
- Lagrange's theorem
- Sylow subgroups exist
- Sylow implies order-dominating
- Product formula
- Fundamental theorem of group actions
Proof
Equivalence of (1) and (2)
It suffices to prove that the number of non-normal subgroups isomorphic to elements of
is divisible by
.
Given: A finite
-group
, a collection
of finite
-groups.
To prove: The number of non-normal subgroups of
isomorphic to an element of
is divisible by
.
Proof:
| Step no. |
Assertion/construction |
Facts used |
Given data used |
Previous steps used |
Explanation
|
| 1 |
The set of non-normal subgroups of isomorphic to an element of is a disjoint union of conjugacy classes of subgroups in , each having size more than one. |
|
|
|
[SHOW MORE]Conjugate subgroups are isomorphic, so if any element of a conjugacy class is isomorphic to an element of  , all elements of the conjugacy class are. Further, any conjugate to a non-normal subgroup is non-normal. Thus, we get a union of conjugacy classes. Further, since the subgroups are consideration are non-normal, all conjugacy classes have size greater than 1.
|
| 2 |
The size of any conjugacy class of non-normal subgroups in is divisible by . |
Facts (1), (2) |
|
|
[SHOW MORE]By Fact (1), the size equals the index of the normalizer of the subgroup, and by Fact (2), this divides the order of the group and is hence a power of  . Because of non-normality, this number is not 1, hence is a power of  , so it is divisible by  .
|
| 3 |
The number of non-normal subgroups of isomorphic to an element of is divisible by . |
|
|
Steps (1), (2) |
[SHOW MORE]By Step (1), the total number of non-normal subgroups of  isomorphic to an element of  is a sum of sizes of conjugacy classes of subgroups, each of which is bigger than 1. By Step (2), each summand is a multiple of  , so the total sum is divisible by  .
|
Equivalence of (1) and (3)
For this, it suffices to show that the number of subgroups of
isomorphic to elements of
and not normal inside
is divisible by
. This is because:
Total number of subgroups of
isomorphic to elements of
= (Number of subgroups of
isomorphic to elements of
that are not normal in
) + (Number of subgroups of
isomorphic to elements of
that are normal in
)
Given: A finite
-group
that is a normal subgroup of a group
. A collection
of finite
-groups.
To prove: The number of subgroups of
that are not normal in
and are isomorphic to elements of
is divisible by
.
Proof:
| Step no. |
Assertion/construction |
Facts used |
Given data used |
Previous steps used |
Explanation
|
| 1 |
The set of subgroups of isomorphic to an element of and not normal in is a disjoint union of conjugacy classes of subgroups in (the subgroups are all in , but conjugacy is relative to ), each having size more than one. |
|
is normal in . |
|
[SHOW MORE]Conjugate subgroups in  are isomorphic, so if any element of a conjugacy class is isomorphic to an element of  , all elements of the conjugacy class are. Further, any  -conjugate of a subgroup contained inside  is also contained in  , because  is normal. Further, any conjugate to a non-normal subgroup is non-normal. Thus, we get a union of  -conjugacy classes. Further, since the subgroups are consideration are non-normal, all conjugacy classes have size greater than 1.
|
| 2 |
The size of any conjugacy class of non-normal subgroups in is divisible by . |
Facts (1), (2) |
|
|
[SHOW MORE]By Fact (1), the size equals the index of the normalizer of the subgroup, and by Fact (2), this divides the order of the group and is hence a power of  . Because of non-normality, this number is not 1, hence is a power of  , so it is divisible by  .
|
| 3 |
The number of non-normal subgroups of isomorphic to an element of is divisible by . |
|
|
Steps (1), (2) |
[SHOW MORE]By Step (1), the total number of subgroups of  not normal in  and isomorphic to an element of  is a sum of sizes of conjugacy classes of subgroups, each of which is bigger than 1. By Step (2), each summand is a multiple of  , so the total sum is divisible by  .
|
Equivalence of (3) and (4)
This follows by taking
as the semidirect product of
and the
-core of
.
Equivalence of (2) and (5)
Given: A finite group
.
is a prime number.
is a collection of finite
-groups such that, in any finite
-group containing a subgroup isomorphic to an element of
, the number of normal subgroups isomorphic to an element of
is congruent to 1 mod
.
contains a subgroup isomorphic to an element of
.
To prove: The number of subgroups of
isomorphic to an element of
is congruent to 1 mod
.
Proof:
| Step no. |
Assertion/construction |
Facts used |
Given data used |
Previous steps used |
Explanation
|
| 1 |
Let be a -Sylow subgroup of . |
Fact (3) |
|
|
|
| 2 |
contains a subgroup isomorphic to an element of . |
Fact (4) |
contains a subgroup isomorphic to an element of  |
Step (1) |
[SHOW MORE]By Fact (4), every  -subgroup of  has a conjugate in  . Since conjugation preserves the isomorphism class, we can pass from a subgroup isomorphic to an element of  to a new subgroup contained in  .
|
| 3 |
The number of normal subgroups of isomorphic to an element of is congruent to 1 mod . |
|
Assumption of congruence condition |
Steps (1), (2) |
Step-given combination direct.
|
| 4 |
A subgroup of of prime power order is normalized by if and only if it is contained in and normal in . |
Facts (2), (5) |
|
Step (1) |
[SHOW MORE]Suppose  is a subgroup of prime power order in  . Then, if  normalizes  , we get that  is a group. By Fact (5), it has order  . This is a power of  dividing the order of  , and using that  is  -Sylow, we obtain it must be equal to  , so  .
|
| 5 |
The number of subgroups of isomorphic to an element of and not normalized by is divisible by . |
Fact (6) |
|
Step (1) |
[SHOW MORE]Consider the action of  on the collection of all subgroups of  isomorphic to an element of  and not normalized by  . The action is well defined because conjugation by elements of  preserves the isomorphism class and also the property of not being normalized by  . By Fact (6), each orbit has size dividing the order of  . Also, the orbits are nontrivial, since  does not normalize the subgroups. Thus, the size of each orbit is a power of  greater than 1, so is divisible by  . The total size is thus also divisible by  .
|
| 6 |
The total number of subgroups of isomorphic to an element of is congruent to 1 mod . |
|
|
Steps (3), (4), (5) |
[SHOW MORE]The subgroups normalized by  have a count congruent to 1 mod  by combining Steps (3) and (4). The subgroups not normalized by  have a count divisible by  by Step (5). Adding up, we get a total congruent to 1 mod  .
|