Theorems · Theorem · group theory
AddAction.set_mem_fixedBy_of_subset_fixedBy
∀ {α : Type u_1} {G : Type u_2} [inst : AddGroup G] [inst_1 : AddAction G α] {s : Set α} {g : G},
s ⊆ AddAction.fixedBy α g → s ∈ AddAction.fixedBy (Set α) gIf s ⊆ fixedBy α g, then g +ᵥ s = s, which means that s ∈ fixedBy (Set α) g.
Note that the reverse implication is in general not true, as s ∈ fixedBy (Set α) g is a
weaker statement (it allows for points x ∈ s for which g +ᵥ x ≠ x and g +ᵥ x ∈ s).
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- AddGroupstatement and proof · cited by 4,410
- Set.extproof · cited by 2,266
- HVAdd.hVAddproof · cited by 1,820
- AddActionstatement and proof · cited by 820
- Set.addActionSetstatement · cited by 39
- neg_vadd_vaddproof · cited by 34
- AddAction.fixedBystatement and proof · cited by 26
- Set.mem_neg_vadd_set_iffproof · cited by 5
- AddAction.fixedBy_negproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.