Theorems · Inductive type · order theory
JordanHolderLattice
(X : Type u) → [Lattice X] → Type u
A JordanHolderLattice is the class for which the Jordan Hölder theorem is proved. A
Jordan Hölder lattice is a lattice equipped with a notion of maximality, IsMaximal.
Examples include Subgroup G if G is a group, and Submodule R M if M is an R-module.
In the example of subgroups, IsMaximal H K means that H is a maximal normal subgroup of K.
In the example of submodules, IsMaximal M N means that M is a maximal submodule of N.
- Defined in
- Mathlib.Order.JordanHolder
- Cited by
- 44 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Lattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Latticestatement · cited by 916
Cited by54
Results whose statement or proof uses this declaration.
- JordanHolderLattice.IsMaximalstatement and proof · cited by 42
- CompositionSeriesstatement and proof · cited by 40
- JordanHolderLattice.Isostatement and proof · cited by 13
- CompositionSeries.Equivalentstatement and proof · cited by 9
- CompositionSeries.strictMonostatement and proof · cited by 6
- JordanHolderLattice.iso_reflstatement and proof · cited by 5
- JordanHolderLattice.lt_of_isMaximalstatement and proof · cited by 3
- CompositionSeries.eq_snoc_eraseLaststatement and proof · cited by 3
- CompositionSeries.extstatement and proof · cited by 3
- CompositionSeries.isMaximal_eraseLast_laststatement and proof · cited by 3
- JordanHolderLattice.iso_symmstatement and proof · cited by 2
- JordanHolderLattice.sup_eq_of_isMaximalstatement and proof · cited by 2