Hello friends.(adsbygoogle = window.adsbygoogle || []).push({});

I am working trough "Abstract Algebra" by Dummit & Foote.

I recently got to section 3.4, on composition series and "the Hölder program".

The Jordan-Hölder theorem states:

Let G be a finite, non-trivial group. Then:

1)G has a composition series.

2)If

[tex] \{ 1 \} = N_0 \leq N_1 \leq ... \leq N_r = G[/tex]

and

[tex] \{ 1 \} = M_0 \leq M_1 \leq ... \leq M_s = G [/tex]

are two composition series of G, then:

2a)r = s

2b)There is some permutation [tex]\pi[/tex] of {1, 2, ..., r} such that:

[tex]

M_{\pi (i)} / M_{\pi (i) - 1} \cong N_{i} / N_{i-1}

[/tex]

for [tex] 0 \leq i \leq r[/tex].

My questionis on 2b). For [tex] M_{\pi (i)} / M_{\pi (i) - 1} [/tex] to make sense, we must of course have

[tex] M_{\pi (0)} \leq M_{\pi (1)} \leq ... \leq M_{\pi (s)} [/tex]

But how can any permutation satisfy this relation, i.e. not break the subgroup ordering?

Let me rephrase my question with numbers instead of subgroups.

It is clearly impossible to permute the sequence:

[tex]

1 \leq 3 \leq 4 \leq 7 \leq 9 \leq 11

[/tex]

without breaking the ordering.

The only example I can think of where we may permute is something like:

[tex]

1 \leq 3 \leq 4 \leq 7 \leq 7 \leq 7

[/tex]

Where we are allowed to permute only the last three numbers without breaking the ordering.

But the analog of this last example for subgroups would be pretty pointless, since the assertion of 2b would of course hold true before applying such a permutation.

Can somebody please explain what I'm missing?

Edit: Hmm... Is there perhaps one permutation [tex]\pi_i[/tex], say, for each quotient [tex]N_{i} / N_{i-1} [/tex], instead of just a single one for every quotient?

**Physics Forums - The Fusion of Science and Community**

# The Jordan-Hölder theorem

Have something to add?

- Similar discussions for: The Jordan-Hölder theorem

Loading...

**Physics Forums - The Fusion of Science and Community**