Theorems · Theorem · group theory
finite_compl_fixedBy_closure_iff
∀ {G : Type u_1} {α : Type u_2} [inst : Group G] [inst_1 : MulAction G α] {S : Set G},
(∀ g ∈ Subgroup.closure S, (MulAction.fixedBy α g)ᶜ.Finite) ↔ ∀ g ∈ S, (MulAction.fixedBy α g)ᶜ.FiniteIf the support of each element in a generating set of a permutation group is finite, then the support of every element in the group is finite.
- Defined in
- Mathlib.GroupTheory.Perm.ClosureSwap
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 71 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
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
- Subgroupstatement · cited by 3,593
- Compl.complstatement and proof · cited by 2,925
- Set.Finitestatement and proof · cited by 1,814
- MulActionstatement and proof · cited by 1,294
- Set.Finite.subsetproof · cited by 285
- Subgroup.closurestatement and proof · cited by 196
- Set.Finite.unionproof · cited by 74
- Subgroup.subset_closureproof · cited by 53
- Set.compl_univproof · cited by 41
- MulAction.fixedBystatement and proof · cited by 36
Cited by1
Results whose statement or proof uses this declaration.
- mem_closure_isSwapproof · cited by 2