Theorems · Inductive type · order theory
PosSMulStrictMono
(α : Type u_1) → (β : Type u_2) → [SMul α β] → [Preorder α] → [Preorder β] → [Zero α] → Prop
Typeclass for strict monotonicity of scalar multiplication by positive elements on the left,
namely b₁ < b₂ → a • b₁ < a • b₂ if 0 < a.
You should usually not use this very granular typeclass directly, but rather a typeclass like
IsOrderedModule.
- Defined in
- Mathlib.Algebra.Order.Module.Defs
- Cited by
- 128 results in Mathlib
- Foundations
- Depth 1 from the axioms, rests on 4 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement · cited by 7,952
Cited by133
Results whose statement or proof uses this declaration.
- smul_lt_smul_of_pos_leftstatement and proof · cited by 23
- convex_Ioistatement and proof · cited by 13
- Set.OrdConnected.strictConvexstatement and proof · cited by 9
- convex_Icostatement and proof · cited by 9
- smul_lt_smul_iff_of_pos_leftstatement and proof · cited by 8
- convex_Iocstatement and proof · cited by 8
- convex_Iiostatement and proof · cited by 6
- smul_posstatement and proof · cited by 5
- ConvexCone.strictlyPositivestatement and proof · cited by 5
- MonovaryOn.sum_smul_comp_perm_eq_sum_smul_iffstatement and proof · cited by 5
- Finset.expect_lt_expectstatement and proof · cited by 4
- smul_lt_smul_iff_of_neg_leftstatement and proof · cited by 4