3-subnormal subgroup need not have a unique fastest ascending subnormal series
Statement
Suppose is a group and is a 3-subnormal subgroup of . Then, it is not necessary that have a fastest ascending subnormal series in .
The existence of a fastest ascending subnormal series could fail in two ways:
- There is no unique largest 2-subnormal subgroup of among those that normalize .
- There is a unique largest 2-subnormal subgroup of , say , among those that normalize . However, there is a smaller subgroup that is part of another ascending subnormal series that overtakes the fastest one involving at the next stage.
Related facts
- 2-subnormal subgroup has a unique fastest ascending subnormal series
- Subnormal subgroup has a unique fastest descending subnormal series
- 2-subnormal not implies hypernormalized encodes a similar idea in a more extreme form: ascending fast by going to the normalizer can not only be suboptimal, but can result in getting stuck entirely. The second construction on that page is similar to the constructions used here.
Facts used
- Normality is not transitive: This is important to have examples of 2-subnormal subgroups that are not normal.
- 2-subnormality is not finite-join-closed: A join of two 2-subnormal subgroups need not be 2-subnormal.
- Subnormality satisfies image condition
- Subnormality satisfies inverse image condition
- 2-subnormal subgroup has a unique fastest ascending subnormal series (strictly speaking, we can write our proofs without assuming this, but it helps make the construction more concrete)
Proof
Both proofs rely on the same construction, and liberally use Facts (3) and (4), which together yield that the subnormal depth of the full inverse image of a subnormal subgroup under a surjective homomorphism equals the subnormal depth of the subgroup itself. In symbols, if is a normal subgroup of a group , and , the subnormal depth of in equals the subnormal depth of in .
Note also that the examples constructed in both cases are subgroups that are not just 3-subnormal but in fact 2-subnormal, and we know that as 2-subnormal subgroups, they have a unique fastest ascending subnormal series of length two (per 2-subnormal subgroup has a unique fastest ascending subnormal series). The existence of such a series does not contradict our statement, which is about ascending series of length three (and in particular, allows us to ascend faster in the beginning as long as we still get to the whole group in three steps). We can modify these to strictly 3-subnormal examples by taking a direct product of the construction with a strictly 3-subnormal subgroup.
Example of a 3-subnormal subgroup for which there are two ascending subnormal series with one locally greedy and the other lagging but overtaking
| Step no. | Assertion/construction | Facts used | Given data used | Previous steps used | Explanation |
|---|---|---|---|---|---|
| 1 | Let be a nontrivial 2-subnormal subgroup of a group that is not normal. | Fact (1) | Fact-direct | ||
| 2 | Let's say the fastest ascending subnormal series for is . In other words, is the largest normal subgroup of containing as a normal subgroup, and both containments are strict. | Fact (5) | Step (1) | Step-fact direct (the strictness comes from not being normal). | |
| 3 | Let be a prime. Let be the wreath product of the group of prime order with . Equivalently, is the semidirect product of the additive group of with acting by left multiplication. Let , identified as a subgroup of , and hence of , via the inclusion of in . | Step (1) | This references and from Step (1), but we have not yet used 2-subnormality. In fact, we don't even use that is a subgroup of to establish that is a subgroup of ; it's simply a statement that since is a subset of , the -vector space spanned by is a subspace of the -vector space spanned by . | ||
| 4 | . | Steps (1), (3) | Clearly, , being an abelian group containing , normalizes it, so contains , and is therefore a union of cosets of in . To check if a given coset of in normalizes , it suffices to check whether the corresponding element of normalizes . The element of normalizes if and only if its action by multiplication sends elements of within , which happens if and only if the element itself is in , yielding that the normalizer is as stated. Note that we do use here that is a subgroup to observe that the elements whose left multiplication sends to are precisely the elements of . We do not use 2-subnormality of . | ||
| 5 | is a subnormal series for in of length three that ascends as fast as possible at each step, and only reaches the whole group in the last step. | Facts (3), (4) | Steps (2), (3), (4) | by Step (4), so the first step is as large as it can possibly be (it's in fact the largest subgroup of in which is normal). Since is the fastest ascending subnormal series of length two for in , Facts (3) and (4) essentially give that is the fastest ascending series for in . Therefore, the whole series ascends as fast as possible at each step. | |
| 6 | is a subnormal series for in that reaches the whole group () in two steps. | Step (3) | Step-direct; note that normality for follows from being a direct factor of (or, alternatively, just from being abelian), and normality for follows from it being the base of a semidirect product. | ||
| 7 | We do not have a unique fastest ascending subnormal series for in . | Steps (5), (6) | Step (5) constructs a subnormal series that ascends as fast as possible in each step and yet takes three steps to reach the whole group, but Step (6) constructs a subnormal series that reaches the whole group in two steps. If there were a unique fastest ascending subnormal series, it would have to be the series of Step (5), and yet the series of Step (6) is faster at two steps; therefore, there is no unique fastest ascending subnormal series. |
Note about Fact (5) not being strictly necessary for the proof: Fact (5) is what allows us to claim that our first series construction is greedy, with fastest growth at each step. Without using Fact (5), we would not have a naturally greedy construction as our first series currently is. However, it would still be true that a construction with as its first term cannot go all the way to the whole group in the second term, because being 2-subnormal but not normal in means that is 2-subnormal but not normal in . Thus, completing the first series would still require a second term that is proper in . Therefore, we'd still get that the second series overtakes the first, establishing that there is no fastest ascending 3-subnormal series. (It's also worth noting that if Fact (5) were actually false, we'd directly get a contradiction from the existence of no fastest way to complete the first series after making the first move selecting ; however, we don't want to go there since we know that Fact (5) is, in fact, true).
This proof uses a tabular format for presentation. Provide feedback on tabular proof formats in a survey (opens in new window/tab) | Learn more about tabular proof formats|View all pages on facts with proofs in tabular format
Working out the smallest group orders for the above example recipe
NOTE: This is not claimed to be the smallest example for the claim in general, just the smallest instantiation of this specific construction. The smallest parameter choice for finite groups for the above construction is with equal to dihedral group:D8, equal to one of its (order two) non-normal subgroups, and (the smallest prime available). We get that is one of the (order four) Klein four-subgroups of dihedral group:D8.
Below, we work out various order and index values for the groups in our construction in terms of , , , and , then translate that to the order for the specific parameter choice described above
| Group (subgroup of ) | Formula for its order in terms of , , , and | Value when is dihedral of order eight, is non-normal of order 2, has order 4, and | Exponent of 2 in value |
|---|---|---|---|
| 2048 | 11 | ||
| 4 | 2 | ||
| (the right choice for a subnormal series of length two for ) | 256 | 8 | |
| 512 | 9 | ||
| (term in the locally greedy ascending series) | 1024 | 10 |
The locally greedy subnormal series has orders , and taking logarithms to base 2 we get .
In contrast, the ascending subnormal series has orders , and taking logarithms to base 2 we get .
Using direct products with a strictly 3-subnormal example to get a strict example
The smallest order of a group with a strictly 3-subnormal subgroup (i.e., a 3-subnormal subgroup that is not 2-subnormal) is where the group has order 16 and the subgroup has order 2. For instance, we can take the group to be dihedral group:D16 and the subgroup of order two generated by a reflection. The 3-subnormal series for the subgroup of order two has orders (or after taking logarithms to base 2, ).
Taking the direct product of this with the construction above gives ambient group of order times 16, which works out to , and a subgroup of order times 2, which works out to . The 3-subnormal series orders also multiply so we get the following orders:
- For the series arising from the locally greedy series: , or after taking logarithms to base 2, .
- For the series arising from the series that got to the whole group in two steps: , or after taking logarithms to base 2, . As desired, this new series now takes the full three steps to reach the whole group, since the subgroup is strictly 3-subnormal. However, it still overtakes the locally greedy series in the second term (), so it still works as an example.
Example of a 3-subnormal subgroup with no unique largest normalizing 2-subnormal subgroup containing it
Let be a nontrivial subgroup of a finite group that is a join of two 2-subnormal subgroups of but is not itself 2-subnormal (such subgroups exist, see Fact (2)). In symbols, .
Let be a prime. Let be the wreath product of the group of prime order with . Equivalently, is the semidirect product of the additive group of with acting by left multiplication.
Let . Then, . Facts (3) and (4) imply that the subnormal depth of in equals the subnormal depth of in , so by our assumption that is not 2-subnormal in , we get that is not 2-subnormal in .
However, any 2-subnormal subgroup that normalizes and contains must be in . Further, we can see that the subgroups:
both are in and 2-subnormal (we again use Facts (3) and (4)). Hence, if there is a unique largest 2-subnormal subgroup of in it must contain both and . But , which is not 2-subnormal as established above.