Theorems · Theorem · group theory
Equiv.Perm.IsThreeCycle.mem_commutatorSet_alternatingGroup
∀ {α : Type u_1} [inst : Fintype α] [inst_1 : DecidableEq α],
5 ≤ Nat.card α → ∀ {g : ↥(alternatingGroup α)}, (↑g).IsThreeCycle → g ∈ commutatorSet ↥(alternatingGroup α)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 104 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.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Fintypestatement and proof · cited by 7,736
- Subgroupstatement · cited by 3,593
- Equiv.Permstatement and proof · cited by 1,375
- Nat.cardstatement and proof · cited by 844
- sqproof · cited by 280
- alternatingGroupstatement and proof · cited by 96
- Equiv.Perm.IsThreeCyclestatement and proof · cited by 34
- commutatorSetstatement · cited by 20
- Equiv.Perm.IsThreeCycle.congr_simpproof · cited by 2
- Equiv.Perm.IsThreeCycle.isThreeCycle_sqproof · cited by 2
- mem_commutatorSet_of_isConj_sqproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Equiv.Perm.IsThreeCycle.mem_commutator_alternatingGroupproof · cited by 1