Equiv.Perm.exists_with_cycleType_iff

∀ (α : Type u_1) [inst : DecidableEq α] [inst_1 : Fintype α] {m : Multiset ℕ},
  (∃ g, g.cycleType = m) ↔ m.sum ≤ Fintype.card α ∧ ∀ a ∈ m, 2 ≤ a

There are permutations with cycleType m if and only if its sum is at most Fintype.card α and its members are at least 2.

Defined in: Mathlib.GroupTheory.Perm.Cycle.PossibleTypes
Cited by: 2 results in Mathlib
Foundations: Depth 101 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.