Theorems · Definition · group theory
Equiv.Perm.truncCycleFactors
{α : Type u_2} →
[DecidableEq α] →
[Fintype α] →
(f : Equiv.Perm α) → Trunc { 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,
without a linear order.
- Defined in
- Mathlib.GroupTheory.Perm.Cycle.Factors
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEqFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Equiv.Permstatement and proof · cited by 1,375
- Finset.valproof · cited by 438
- Equiv.Perm.IsCyclestatement · cited by 108
- Equiv.Perm.Disjointstatement · cited by 81
- Truncstatement · cited by 39
- Trunc.mkproof · cited by 21
- Equiv.Perm.cycleFactorsAuxproof · cited by 0
Cited by4
Results whose statement or proof uses this declaration.
- Equiv.Perm.cycleFactorsFinsetproof · cited by 96
- Equiv.Perm.cycle_induction_onproof · cited by 8
- Equiv.Perm.mem_cycleType_iffproof · cited by 2
- Equiv.Perm.cycleFactorsFinset_eq_list_toFinsetproof · cited by 1