Group theory and generalizations Finite groups Theorem
Jordan–Hölder theorem
Builds on Composition seriesComposition factors
Statement
Let be a group and let and be two composition series of . Then , and there is a permutation of with for each .
Remarks
So the composition factors and the composition length of are well defined. For , the theorem gives the uniqueness of the prime factorisation of . 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
- no evidence level
- Group concept
- Conjugate elements definition
- Subgroup definition
- Conjugate subgroup definition
- Left coset definition
- Right coset definition
- Normal subgroup definition
- Simple group definition
- Normality via left and right cosets statement
- Quotient group definition
- Subnormal series definition
- Composition series definition
- Composition factors definition
- Jordan–Hölder theorem statement
Further reading
- Web https://en.wikipedia.org/wiki/Composition_series, Uniqueness: Jordan–Hölder theorem
About this page
| Tag | 0E088ZP533 |
|---|---|
| URI | m2://0E088ZP533 |
| Aliases | jordan-holder-theorem |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 20E15, 20D30 |
| Status | This copy of the site has no build data. Run m2 status 0E088ZP533. |
| Uses | Composition 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.