Theorems · Inductive type · group theory
SubMulAction
(R : Type u) → (M : Type v) → [SMul R M] → Type v
A SubMulAction is a set which is closed under scalar multiplication.
- Cited by
- 120 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 2 definitions · uses no axioms
- Assumes
- SMul
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by157
Results whose statement or proof uses this declaration.
- SubMulAction.ofFixingSubgroupstatement · cited by 43
- SubMulAction.ofStabilizerstatement · cited by 33
- SemigroupIdealproof · cited by 12
- Submodule.toSubMulActionstatement · cited by 9
- SubMulAction.inclusionstatement and proof · cited by 6
- MulAction.IsMultiplyPreprimitive.isPreprimitive_ofFixingSubgroupstatement · cited by 6
- SubMulAction.ofStabilizer.conjMapstatement · cited by 6
- SubMulAction.carrierstatement and proof · cited by 6
- SubMulAction.closurestatement and proof · cited by 6
- SubMulAction.smul_memstatement and proof · cited by 5
- MulAction.isMultiplyPreprimitive_iffstatement · cited by 5
- SubMulAction.ofStabilizer.isMultiplyPretransitivestatement · cited by 5