Theorems · Theorem · group theory
Equiv.Perm.SameCycle.exists_pow_eq_of_mem_support
∀ {α : Type u_2} {x y : α} {f : Equiv.Perm α} [inst : DecidableEq α] [inst_1 : Fintype α],
f.SameCycle x y → x ∈ f.support → ∃ i < (f.cycleOf x).support.card, (f ^ i) x = y- Defined in
- Mathlib.GroupTheory.Perm.Cycle.Factors
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 85 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.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Finset.cardstatement · cited by 2,327
- Equiv.Permstatement and proof · cited by 1,375
- Equiv.Perm.supportstatement and proof · cited by 230
- Equiv.Perm.SameCyclestatement and proof · cited by 116
- Equiv.Perm.cycleOfstatement · cited by 59
Cited by5
Results whose statement or proof uses this declaration.
- Equiv.Perm.mem_toList_iffproof · cited by 4
- Equiv.Perm.next_toList_eq_applyproof · cited by 2
- Equiv.Perm.formPerm_toListproof · cited by 1
- Equiv.Perm.SameCycle.toList_isRotatedproof · cited by 0
- Equiv.Perm.SameCycle.exists_pow_eqproof · cited by 0