Is there a version of Jordan-Hölder theorem for infinite composition series?

  • Context: Graduate 
  • Thread starter Thread starter cup
  • Start date Start date
  • Tags Tags
    Theorem
Click For Summary
SUMMARY

The discussion centers on the Jordan-Hölder theorem and its implications for infinite composition series in group theory and module theory. The theorem asserts that every finite, non-trivial group has a composition series, and any two such series are equivalent in terms of their length and structure. The user seeks clarification on the uniqueness of composition series in infinite cases, particularly regarding the uniqueness of presentations of modules as direct sums of simple submodules and the role of the choice axiom and Zorn's lemma in this context.

PREREQUISITES
  • Understanding of group theory, specifically the Jordan-Hölder theorem.
  • Familiarity with composition series and subgroup ordering.
  • Knowledge of module theory and direct sums of modules.
  • Basic concepts of the choice axiom and Zorn's lemma in set theory.
NEXT STEPS
  • Research the application of the Jordan-Hölder theorem to infinite groups and modules.
  • Study the uniqueness of composition series in the context of infinite direct sums.
  • Explore the implications of the choice axiom and Zorn's lemma in algebraic structures.
  • Examine existing literature on infinite composition series and their properties.
USEFUL FOR

Mathematicians, particularly those specializing in abstract algebra, group theory, and module theory, will benefit from this discussion, especially those interested in the complexities of infinite composition series and their uniqueness properties.

cup
Messages
27
Reaction score
0
Hello friends.

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 question is 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?
 
Last edited:
Physics news on Phys.org
Never mind. I found my own error.

I was thinking

[tex] M_{\pi (i)} / M_{\pi (i-1)}[/tex]

instead of

[tex] M_{\pi (i)} / M_{\pi (i) - 1}[/tex]

which is what the theorem says.

Sorry about that.
Cool theorem, though. :smile:
 
Hello Folks,

I would like to know if there is a version of Jordan-Hölder theorem for infinite composition series (in the case of Groups or Modules). If yes, please, give me a reference to its statement and its proof.

Assume that some module is presented as a direct sum of infinite number of simple submodules. Is this presentation unique up to a permutation? What can you say about multiplicities? Choice axiom and Zorn lemma are admissible for me.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
Replies
17
Views
4K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
9K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
4
Views
5K