Theorems · Theorem · group theory
Equiv.Perm.centralizer_le_alternating_iff
∀ {α : Type u_1} [inst : Fintype α] [inst_1 : DecidableEq α] {g : Equiv.Perm α},
Subgroup.centralizer {g} ≤ alternatingGroup α ↔
(∀ c ∈ g.cycleType, Odd c) ∧ Fintype.card α ≤ g.cycleType.sum + 1 ∧ ∀ (i : ℕ), Multiset.count i g.cycleType ≤ 1The centralizer of a permutation is contained in the alternating group if and only if its cycles have odd length, with at most one of each, and there is at most one fixed point.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 114 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- FintypeDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites49
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Set.Elemproof · cited by 7,166
- mul_oneproof · cited by 3,885
- Subgroupstatement and proof · cited by 3,593
- Finset.univproof · cited by 3,473
- Unitsproof · cited by 2,804
- Multisetstatement and proof · cited by 2,627
- Finset.prodproof · cited by 2,356
- Finset.cardproof · cited by 2,327
- Fintype.cardstatement and proof · cited by 1,386
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.