3-subnormal subgroup need not have a unique fastest ascending subnormal series

From Groupprops

Statement

Suppose A is a group and B is a 3-subnormal subgroup of A. Then, it is not necessary that B have a fastest ascending subnormal series in A.

The existence of a fastest ascending subnormal series could fail in two ways:

  • There is no unique largest 2-subnormal subgroup of A among those that normalize B.
  • There is a unique largest 2-subnormal subgroup of A, say C, among those that normalize B. However, there is a smaller subgroup that is part of another ascending subnormal series that overtakes the fastest one involving C at the next stage.

Related facts

Facts used

  1. Normality is not transitive: This is important to have examples of 2-subnormal subgroups that are not normal.
  2. 2-subnormality is not finite-join-closed: A join of two 2-subnormal subgroups need not be 2-subnormal.
  3. Subnormality satisfies image condition
  4. Subnormality satisfies inverse image condition
  5. 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 N is a normal subgroup of a group M, and N≤P≤M, the subnormal depth of P in M equals the subnormal depth of P/N in M/N.

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 H be a nontrivial 2-subnormal subgroup of a group G that is not normal. Fact (1) Fact-direct
2 Let's say the fastest ascending subnormal series for H is H<K<G. In other words, K is the largest normal subgroup of G containing H as a normal subgroup, and both containments are strict. Fact (5) Step (1) Step-fact direct (the strictness comes from H not being normal).
3 Let p be a prime. Let A be the wreath product of the group of prime order p with G. Equivalently, A=Fp[G]⋊G is the semidirect product of the additive group of Fp[G] with G acting by left multiplication. Let B=Fp[H], identified as a subgroup of Fp[G], and hence of A, via the inclusion of H in G. Step (1) This references H and G from Step (1), but we have not yet used 2-subnormality. In fact, we don't even use that H is a subgroup of G to establish that B=Fp[H] is a subgroup of Fp[G]; it's simply a statement that since H is a subset of G, the Fp-vector space spanned by H is a subspace of the Fp-vector space spanned by G.
4 NA(B)=Fp[G]⋊H. Steps (1), (3) Clearly, Fp[G], being an abelian group containing B, normalizes it, so NA(B) contains Fp[G], and is therefore a union of cosets of Fp[G] in A=Fp[G]⋊G. To check if a given coset of Fp[G] in A=Fp[G]⋊G normalizes B, it suffices to check whether the corresponding element of G normalizes B. The element of G normalizes B if and only if its action by multiplication sends elements of H within H, which happens if and only if the element itself is in H, yielding that the normalizer is Fp[G]⋊H as stated. Note that we do use here that H is a subgroup to observe that the elements whose left multiplication sends H to H are precisely the elements of H. We do not use 2-subnormality of H.
5 B≤Fp[G]⋊H≤Fp[G]⋊K≤A is a subnormal series for B in A 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) NA(B)=Fp[G]⋊H by Step (4), so the first step is as large as it can possibly be (it's in fact the largest subgroup of A in which B is normal). Since H<K<G is the fastest ascending subnormal series of length two for H in G, Facts (3) and (4) essentially give that Fp[G]⋊H≤Fp[G]⋊K≤A is the fastest ascending series for Fp[G]⋊H in A=Fp[G]⋊G. Therefore, the whole series ascends as fast as possible at each step.
6 B≤Fp[G]≤A≤A is a subnormal series for B in A that reaches the whole group (A) in two steps. Step (3) Step-direct; note that normality for B≤Fp[G] follows from B being a direct factor of Fp[G] (or, alternatively, just from Fp[G] being abelian), and normality for Fp[G]≤A follows from it being the base of a semidirect product.
7 We do not have a unique fastest ascending subnormal series for B in A. 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 Fp[G]⋊H as its first term cannot go all the way to the whole group A in the second term, because H being 2-subnormal but not normal in G means that Fp[G]⋊H is 2-subnormal but not normal in Fp[G]⋊G=A. Thus, completing the first series would still require a second term that is proper in A. 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 Fp[G]⋊H; 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 G equal to dihedral group:D8, H equal to one of its (order two) non-normal subgroups, and p=2 (the smallest prime available). We get that K 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 |G|, |H|, |K|, and p, then translate that to the order for the specific parameter choice described above

Group (subgroup of A) Formula for its order in terms of |G|, |H|, |K|, and p Value when G is dihedral of order eight, H is non-normal of order 2, K has order 4, and p=2 Exponent of 2 in value
A |G|p|G| 2048 11
B=Fp[H] p|H| 4 2
Fp[G] (the right choice for a subnormal series of length two for B) p|G| 256 8
NA(B)=Fp[G]⋊H |H|p|G| 512 9
Fp[G]⋊K (term in the locally greedy ascending series) |K|p|G| 1024 10

The locally greedy subnormal series B≤Fp[G]⋊H≤Fp[G]⋊K≤A has orders 4≤512≤1024≤2048, and taking logarithms to base 2 we get 2≤9≤10≤11.

In contrast, the ascending subnormal series B≤Fp[G]≤A≤A has orders 4≤256≤2048≤2048, and taking logarithms to base 2 we get 2≤8≤11≤11.

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 2≤4≤8≤16 (or after taking logarithms to base 2, 1≤2≤3≤4).

Taking the direct product of this with the construction above gives ambient group of order |A| times 16, which works out to 215=32768, and a subgroup of order |B| times 2, which works out to 23=8. The 3-subnormal series orders also multiply so we get the following orders:

  • For the series arising from the locally greedy series: 8≤2048≤8192≤32768, or after taking logarithms to base 2, 3≤11≤13≤15.
  • For the series arising from the series that got to the whole group in two steps: 8≤1024≤16384≤32768, or after taking logarithms to base 2, 3≤10≤14≤15. 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 (14>13), so it still works as an example.

Example of a 3-subnormal subgroup with no unique largest normalizing 2-subnormal subgroup containing it

Let H be a nontrivial subgroup of a finite group G that is a join of two 2-subnormal subgroups H1,H2 of G but is not itself 2-subnormal (such subgroups exist, see Fact (2)). In symbols, H=⟨H1,H2⟩.

Let p be a prime. Let A be the wreath product of the group of prime order with G. Equivalently, A is the semidirect product of the additive group of Fp[G] with G acting by left multiplication.

Let B=Fp[H]. Then, NA(B)=Fp[G]⋊H. Facts (3) and (4) imply that the subnormal depth of NA(B) in A equals the subnormal depth of H in G, so by our assumption that H is not 2-subnormal in G, we get that NA(B) is not 2-subnormal in A.

However, any 2-subnormal subgroup that normalizes B and contains B must be in NA(B). Further, we can see that the subgroups:

C1=Fp[G]⋊H1,C2=Fp[G]⋊H2

both are in NA(B) and 2-subnormal (we again use Facts (3) and (4)). Hence, if there is a unique largest 2-subnormal subgroup of A in NA(B) it must contain both C1 and C2. But ⟨C1,C2⟩=NA(B), which is not 2-subnormal as established above.