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

  • Thread starter Thread starter cup
  • Start date Start date
  • Tags Tags
    Theorem
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

\{ 1 \} = N_0 \leq N_1 \leq ... \leq N_r = G

and

\{ 1 \} = M_0 \leq M_1 \leq ... \leq M_s = G

are two composition series of G, then:

2a) r = s
2b) There is some permutation \pi of {1, 2, ..., r} such that:

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

for 0 \leq i \leq r.My question is on 2b). For M_{\pi (i)} / M_{\pi (i) - 1} to make sense, we must of course have

M_{\pi (0)} \leq M_{\pi (1)} \leq ... \leq M_{\pi (s)}

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:

<br /> 1 \leq 3 \leq 4 \leq 7 \leq 9 \leq 11<br />

without breaking the ordering.
The only example I can think of where we may permute is something like:

<br /> 1 \leq 3 \leq 4 \leq 7 \leq 7 \leq 7<br />

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 \pi_i, say, for each quotient N_{i} / N_{i-1}, 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

<br /> M_{\pi (i)} / M_{\pi (i-1)}<br />

instead of

<br /> M_{\pi (i)} / M_{\pi (i) - 1}<br />

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.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top