Theorems · Theorem · group theory
Set.powersetCard.isPreprimitive_alternatingGroup
∀ {α : Type u_2} [inst : DecidableEq α] [inst_1 : Fintype α] {n : ℕ},
3 ≤ n → n < Nat.card α → Nat.card α ≠ 2 * n → MulAction.IsPreprimitive ↥(alternatingGroup α) ↑(Set.powersetCard α n)The action of alternatingGroup α on Set.powersetCard α n is preprimitive
provided 1 ≤ n < Nat.card α and Nat.card α ≠ 2 * n.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 112 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.
Cites26
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- SetLike.coeproof · cited by 8,199
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- Subgroupstatement and proof · cited by 3,593
- Nontrivialproof · cited by 2,416
- LT.lt.leproof · cited by 2,189
- Equiv.Permstatement and proof · cited by 1,375
- le_transproof · cited by 985
- Nat.cardstatement and proof · cited by 844
- lt_of_lt_of_leproof · cited by 438
- ne_of_ltproof · cited by 203
Cited by2
Results whose statement or proof uses this declaration.
- alternatingGroup.normal_subgroup_eq_bot_or_eq_top_of_card_ne_eightproof · cited by 1
- alternatingGroup.normal_subgroup_eq_bot_or_eq_top_of_card_ne_sixproof · cited by 1