Theorems · Definition · group theory
Equiv.Perm.cycleFactors
{α : Type u_2} →
[Fintype α] →
[LinearOrder α] →
(f : Equiv.Perm α) → { l // l.prod = f ∧ (∀ g ∈ l, g.IsCycle) ∧ List.Pairwise Equiv.Perm.Disjoint l }Factors a permutation f into a list of disjoint cyclic permutations that multiply to f.
- Defined in
- Mathlib.GroupTheory.Perm.Cycle.Factors
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeLinearOrder
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.
- LinearOrderstatement and proof · cited by 8,572
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Equiv.Permstatement and proof · cited by 1,375
- Equiv.Perm.IsCyclestatement · cited by 108
- Equiv.Perm.Disjointstatement · cited by 81
- Finset.sortproof · cited by 42
- Equiv.Perm.cycleFactorsAuxproof · cited by 0
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.