Equiv.Perm.truncSwapFactors

{α : Type u} → [inst : DecidableEq α] → [Fintype α] → (f : Equiv.Perm α) → Trunc { l // l.prod = f ∧ ∀ g ∈ l, g.IsSwap }

This computably represents the fact that any permutation can be represented as the product of a list of transpositions.

Defined in: Mathlib.GroupTheory.Perm.Sign
Cited by: 5 results in Mathlib
Foundations: Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes: DecidableEq Fintype

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Results whose statement or proof uses this declaration.