Abstract Algebra/Composition series

From testwiki
Jump to navigation Jump to search

Template:TextBox

Template:TextBox

Proof:

We prove the theorem by induction over |G|.

1. |G|=1. In this case, G is the trivial group, and M1 with M1=G is a composition series of G.

2. Assume the theorem is true for all n, n<|G|.

Since the trivial subgroup {e}G is a normal subgroup of G, the set of proper normal subgroups of G is not empty. Therefore, we may choose a proper normal subgroup N of maximum cardinality. This must also be a maximal proper normal subgroup, since any group in which it is contained must have at least equal cardinality, and thus, if M is normal such that

NMG

, then

|M|>|N|

, which is why N is not a proper normal subgroup of maximal cardinality.

Due to theorem 2.6.?, G/N is simple. Further, since |N|<|G|, the induction hypothesis implies that there exists a composition series of N, which we shall denote by N2,,Nn, where

{e}=NnNn1N2=N

. But then we have

{e}=NnN2=NN1:=G

, and further for each m{1,,n1}:

Nm/Nm+1 is simple.

Thus, N1,,Nn is a composition sequence of G.

Our next goal is to prove that given two normal sequences of a group, we can find two 'refinements' of these normal sequences which are equivalent. Let us first define what we mean by a refinement of a normal sequence.

Template:TextBox

Template:TextBox

Proof:

Template:TextBox

Proof:

Due to theorem 2.6.?, all the elements of {N1,,Nn} must be pairwise different, and the same holds for the elements of {M1,,Mk}.

Due to theorem 2.7.4, there exist refinements N1,,Nm of N1,,Nn and M1,,Ml of M1,,Mk such that N1,,Nm and M1,,Ml are equivalent.

But these refinements satisfy

{N1,,Nm}={N1,,Nn}

and

{M1,,Ml}={M1,,Mk}

, since if this were not the case, we would obtain a contradiction to theorem 2.6.?.

We now choose a bijection σ:{1,,m}{1,,m} such that for all j{1,,m1}:

Nj/Nj+1Mσ(j)/Mσ(j)+1

Template:BookCat