Math 2.0

Group theory and generalizations Finite groups Theorem

Jordan–Hölder theorem

Builds on Composition seriesComposition factors

Statement

Let GG be a group and let {e}=G0⊴⋯⊴Gn=G\{e\} = G_0 \trianglelefteq \cdots \trianglelefteq G_n = G and {e}=H0⊴⋯⊴Hm=G\{e\} = H_0 \trianglelefteq \cdots \trianglelefteq H_m = G be two composition series of GG. Then n=mn = m, and there is a permutation σ\sigma of {1,…,n}\{1, \dots, n\} with Gi/Gi−1≅Hσ(i)/Hσ(i)−1G_i / G_{i-1} \cong H_{\sigma(i)} / H_{\sigma(i) - 1} for each ii.

Remarks

So the composition factors and the composition length of GG are well defined. For G=ℤ/nℤG = \mathbb{Z}/n\mathbb{Z}, the theorem gives the uniqueness of the prime factorisation of nn. One proof uses the Schreier refinement theorem, which says that two subnormal series have equivalent refinements.

History

The theorem is named after Camille Jordan and Otto Hölder.

Reading path

To understand this page from the ground up, read these 14 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Conjugate elements definition
  3. Subgroup definition
  4. Conjugate subgroup definition
  5. Left coset definition
  6. Right coset definition
  7. Normal subgroup definition
  8. Simple group definition
  9. Normality via left and right cosets statement
  10. Quotient group definition
  11. Subnormal series definition
  12. Composition series definition
  13. Composition factors definition
  14. Jordan–Hölder theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Composition_series, Uniqueness: Jordan–Hölder theorem
About this page
Tag0E088ZP533
URIm2://0E088ZP533
Aliasesjordan-holder-theorem
Kindstatement, theorem
WritingW1 stated
MSC20E15, 20D30
StatusThis copy of the site has no build data. Run m2 status 0E088ZP533.
UsesComposition series, Composition factors

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.