Theorems · Theorem · group theory
MulAction.IsPreprimitive.isMultiplyPreprimitive
∀ {G : Type u_1} {α : Type u_2} [inst : Group G] [inst_1 : MulAction G α],
MulAction.IsPreprimitive G α →
∀ {s : Set α} {n : ℕ},
s.ncard = n + 1 →
n + 2 < Nat.card α →
MulAction.IsPreprimitive ↥(fixingSubgroup G s) ↥(SubMulAction.ofFixingSubgroup G s) →
MulAction.IsMultiplyPreprimitive G α (n + 2)Jordan's multiple primitivity criterion (Wielandt, 13.3)
- Defined in
- Mathlib.GroupTheory.GroupAction.Jordan
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 107 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites38
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Groupstatement and proof · cited by 6,238
- Set.imageproof · cited by 5,609
- Set.preimageproof · cited by 4,946
- Subgroupstatement · cited by 3,593
- Finiteproof · cited by 3,029
- Set.Nonemptyproof · cited by 2,627
- zero_addproof · cited by 2,366
- Set.extproof · cited by 2,266
- MulActionstatement and proof · cited by 1,294
- Nat.cardstatement and proof · cited by 844
- Subtype.propproof · cited by 505
Cited by2
Results whose statement or proof uses this declaration.
- Equiv.Perm.alternatingGroup_le_of_isPreprimitive_of_isThreeCycle_memproof · cited by 2
- Equiv.Perm.subgroup_eq_top_of_isPreprimitive_of_isSwap_memproof · cited by 1