Theorems · Theorem · order theory
CompositionSeries.jordan_holder
- 1000+ list: Jordan–Hölder theorem
∀ {X : Type u} [inst : Lattice X] [inst_1 : JordanHolderLattice X] (s₁ s₂ : CompositionSeries X),
RelSeries.head s₁ = RelSeries.head s₂ → RelSeries.last s₁ = RelSeries.last s₂ → s₁.Equivalent s₂The Jordan-Hölder theorem, stated for any JordanHolderLattice.
If two composition series start and finish at the same place, they are equivalent.
- Defined in
- Mathlib.Order.JordanHolder
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LatticeJordanHolderLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites26
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredstatement · cited by 6,101
- Latticestatement and proof · cited by 916
- RelSeries.lengthproof · cited by 195
- RelSeries.laststatement and proof · cited by 114
- RelSeries.toFunproof · cited by 114
- RelSeries.headstatement and proof · cited by 89
- JordanHolderLatticestatement and proof · cited by 44
- JordanHolderLattice.IsMaximalstatement and proof · cited by 42
- CompositionSeriesstatement and proof · cited by 40
- RelSeries.snocproof · cited by 24
- RelSeries.eraseLastproof · cited by 21
- JordanHolderLattice.Isoproof · cited by 13
Cited by1
Results whose statement or proof uses this declaration.
- Module.length_compositionSeriesproof · cited by 4