Theorems · Definition · order theory
CompositionSeries.Equivalent
{X : Type u} → [inst : Lattice X] → [inst_1 : JordanHolderLattice X] → CompositionSeries X → CompositionSeries X → PropTwo CompositionSeries X, s₁ and s₂ are equivalent if there is a bijection
e : Fin s₁.length ≃ Fin s₂.length such that for any i,
Iso (s₁ i) (s₁ i.succ) (s₂ (e i), s₂ (e i.succ))
- Defined in
- Mathlib.Order.JordanHolder
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses Quot.sound
- Assumes
- LatticeJordanHolderLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Equivproof · cited by 8,337
- Latticestatement and proof · cited by 916
- RelSeries.lengthproof · cited by 195
- RelSeries.toFunproof · cited by 114
- JordanHolderLatticestatement and proof · cited by 44
- CompositionSeriesstatement and proof · cited by 40
- JordanHolderLattice.Isoproof · cited by 13
Cited by9
Results whose statement or proof uses this declaration.
- CompositionSeries.Equivalent.snocstatement and proof · cited by 2
- CompositionSeries.Equivalent.transstatement and proof · cited by 2
- CompositionSeries.exists_last_eq_snoc_equivalentstatement and proof · cited by 1
- CompositionSeries.Equivalent.reflstatement · cited by 1
- CompositionSeries.Equivalent.snoc_snoc_swapstatement · cited by 1
- CompositionSeries.jordan_holderstatement and proof · cited by 1
- CompositionSeries.Equivalent.length_eqstatement and proof · cited by 0
- CompositionSeries.Equivalent.smashstatement and proof · cited by 0
- CompositionSeries.Equivalent.symmstatement and proof · cited by 0