Ordered scalar product #

In this file we define

OrderedSMul R M : an ordered additive commutative monoid M is an OrderedSMul over an OrderedSemiring R if the scalar product respects the order relation on the monoid and on the ring. There is a correspondence between this structure and convex cones, which is proven in Analysis/Convex/Cone.lean.

Implementation notes #

We choose to define OrderedSMul as a Prop-valued mixin, so that it can be used for actions, modules, and algebras (the axioms for an "ordered algebra" are exactly that the algebra is ordered as a module).
To get ordered modules and ordered vector spaces, it suffices to replace the OrderedAddCommMonoid and the OrderedSemiring as desired.

References #

https://en.wikipedia.org/wiki/Ordered_vector_space

Tags #

ordered module, ordered scalar, ordered smul, ordered action, ordered vector space

source

class OrderedSMul (R : Type u_1) (M : Type u_2) [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] :

Prop

The ordered scalar product property is when an ordered additive commutative monoid with a partial order has a scalar multiplication which is compatible with the order.

smul_lt_smul_of_pos : ∀ {a b : M} {c : R}, a < b → 0 < c → c • a < c • b
Scalar multiplication by positive elements preserves the order.
lt_of_smul_lt_smul_of_pos : ∀ {a b : M} {c : R}, c • a < c • b → 0 < c → a < b
If c • a < c • b for some positive c, then a < b.

Instances

source

instance OrderDual.instOrderedSMul {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] :

OrderedSMul R Mᵒᵈ

Equations

(_ : OrderedSMul R Mᵒᵈ) = (_ : OrderedSMul R Mᵒᵈ)

source

theorem smul_lt_smul_of_pos {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} :

a < b → 0 < c → c • a < c • b

source

theorem smul_le_smul_of_nonneg {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} (h₁ : a ≤ b) (h₂ : 0 ≤ c) :

c • a ≤ c • b

source

theorem smul_le_smul_of_nonneg_left {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} (h₁ : a ≤ b) (h₂ : 0 ≤ c) :

c • a ≤ c • b

Alias of smul_le_smul_of_nonneg.

source

theorem smul_nonneg {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {c : R} (hc : 0 ≤ c) (ha : 0 ≤ a) :

0 ≤ c • a

source

theorem smul_nonpos_of_nonneg_of_nonpos {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {c : R} (hc : 0 ≤ c) (ha : a ≤ 0) :

c • a ≤ 0

source

theorem eq_of_smul_eq_smul_of_pos_of_le {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} (h₁ : c • a = c • b) (hc : 0 < c) (hle : a ≤ b) :

a = b

source

theorem lt_of_smul_lt_smul_of_nonneg {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} (h : c • a < c • b) (hc : 0 ≤ c) :

a < b

source

theorem smul_lt_smul_iff_of_pos {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {b : M} {c : R} (hc : 0 < c) :

c • a < c • b ↔ a < b

source

theorem smul_pos_iff_of_pos {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {c : R} (hc : 0 < c) :

0 < c • a ↔ 0 < a

source

theorem smul_pos {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : M} {c : R} (hc : 0 < c) :

0 < a → 0 < c • a

Alias of the reverse direction of smul_pos_iff_of_pos.

source

theorem monotone_smul_left {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {c : R} (hc : 0 ≤ c) :

Monotone (SMul.smul c)

source

theorem strictMono_smul_left {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {c : R} (hc : 0 < c) :

StrictMono (SMul.smul c)

source

theorem smul_lowerBounds_subset_lowerBounds_smul {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {s : Set M} {c : R} (hc : 0 ≤ c) :

c • lowerBounds s ⊆ lowerBounds (c • s)

source

theorem smul_upperBounds_subset_upperBounds_smul {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {s : Set M} {c : R} (hc : 0 ≤ c) :

c • upperBounds s ⊆ upperBounds (c • s)

source

theorem BddBelow.smul_of_nonneg {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {s : Set M} {c : R} (hs : BddBelow s) (hc : 0 ≤ c) :

BddBelow (c • s)

source

theorem BddAbove.smul_of_nonneg {R : Type u_6} {M : Type u_7} [OrderedSemiring R] [OrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {s : Set M} {c : R} (hs : BddAbove s) (hc : 0 ≤ c) :

BddAbove (c • s)

source

theorem OrderedSMul.mk'' {𝕜 : Type u_5} {M : Type u_7} [OrderedSemiring 𝕜] [LinearOrderedAddCommMonoid M] [SMulWithZero 𝕜 M] (h : ∀ ⦃c : 𝕜⦄, 0 < c → StrictMono fun (a : M) => c • a) :

OrderedSMul 𝕜 M

To prove that a linear ordered monoid is an ordered module, it suffices to verify only the first axiom of OrderedSMul.

source

instance Nat.orderedSMul {M : Type u_7} [LinearOrderedCancelAddCommMonoid M] :

OrderedSMul ℕ M

Equations

(_ : OrderedSMul ℕ M) = (_ : OrderedSMul ℕ M)

source

instance Int.orderedSMul {M : Type u_7} [LinearOrderedAddCommGroup M] :

OrderedSMul ℤ M

Equations

(_ : OrderedSMul ℤ M) = (_ : OrderedSMul ℤ M)

source

instance LinearOrderedSemiring.toOrderedSMul {R : Type u_6} [LinearOrderedSemiring R] :

OrderedSMul R R

Equations

(_ : OrderedSMul R R) = (_ : OrderedSMul R R)

source

theorem smul_max {R : Type u_6} {M : Type u_7} [LinearOrderedSemiring R] [LinearOrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : R} (ha : 0 ≤ a) (b₁ : M) (b₂ : M) :

a • max b₁ b₂ = max (a • b₁) (a • b₂)

source

theorem smul_min {R : Type u_6} {M : Type u_7} [LinearOrderedSemiring R] [LinearOrderedAddCommMonoid M] [SMulWithZero R M] [OrderedSMul R M] {a : R} (ha : 0 ≤ a) (b₁ : M) (b₂ : M) :

a • min b₁ b₂ = min (a • b₁) (a • b₂)

source

theorem OrderedSMul.mk' {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] (h : ∀ ⦃a b : M⦄ ⦃c : 𝕜⦄, a < b → 0 < c → c • a ≤ c • b) :

OrderedSMul 𝕜 M

To prove that a vector space over a linear ordered field is ordered, it suffices to verify only the first axiom of OrderedSMul.

source

instance instOrderedSMulProdToOrderedSemiringToOrderedCommSemiringToStrictOrderedCommSemiringToLinearOrderedCommSemiringInstOrderedAddCommMonoidSumSmulWithZeroToZeroToMonoidWithZeroToSemiringToZeroToAddMonoidToAddCommMonoidToZeroToAddMonoidToAddCommMonoidToSMulWithZeroToSemiringToStrictOrderedSemiringToLinearOrderedSemiringToSMulWithZero {𝕜 : Type u_5} {M : Type u_7} {N : Type u_8} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [OrderedAddCommMonoid N] [MulActionWithZero 𝕜 M] [MulActionWithZero 𝕜 N] [OrderedSMul 𝕜 M] [OrderedSMul 𝕜 N] :

OrderedSMul 𝕜 (M × N)

Equations

(_ : OrderedSMul 𝕜 (M × N)) = (_ : OrderedSMul 𝕜 (M × N))

source

instance Pi.orderedSMul {ι : Type u_1} {𝕜 : Type u_5} [LinearOrderedSemifield 𝕜] {M : ι → Type u_9} [(i : ι) → OrderedAddCommMonoid (M i)] [(i : ι) → MulActionWithZero 𝕜 (M i)] [∀ (i : ι), OrderedSMul 𝕜 (M i)] :

OrderedSMul 𝕜 ((i : ι) → M i)

Equations

(_ : OrderedSMul 𝕜 ((i : ι) → M i)) = (_ : OrderedSMul 𝕜 ((i : ι) → M i))

source

instance Pi.orderedSMul' {ι : Type u_1} {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] :

OrderedSMul 𝕜 (ι → M)

Equations

(_ : OrderedSMul 𝕜 (ι → M)) = (_ : OrderedSMul 𝕜 (ι → M))

source

instance Pi.orderedSMul'' {ι : Type u_1} {𝕜 : Type u_5} [LinearOrderedSemifield 𝕜] :

OrderedSMul 𝕜 (ι → 𝕜)

Equations

(_ : OrderedSMul 𝕜 (ι → 𝕜)) = (_ : OrderedSMul 𝕜 (ι → 𝕜))

source

theorem smul_le_smul_iff_of_pos {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {a : M} {b : M} {c : 𝕜} (hc : 0 < c) :

c • a ≤ c • b ↔ a ≤ b

source

theorem inv_smul_le_iff {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {a : M} {b : M} {c : 𝕜} (h : 0 < c) :

c⁻¹ • a ≤ b ↔ a ≤ c • b

source

theorem inv_smul_lt_iff {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {a : M} {b : M} {c : 𝕜} (h : 0 < c) :

c⁻¹ • a < b ↔ a < c • b

source

theorem le_inv_smul_iff {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {a : M} {b : M} {c : 𝕜} (h : 0 < c) :

a ≤ c⁻¹ • b ↔ c • a ≤ b

source

theorem lt_inv_smul_iff {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {a : M} {b : M} {c : 𝕜} (h : 0 < c) :

a < c⁻¹ • b ↔ c • a < b

source

@[simp]

theorem OrderIso.smulLeft_symm_apply {𝕜 : Type u_5} (M : Type u_7) [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {c : 𝕜} (hc : 0 < c) (b : M) :

(RelIso.symm (OrderIso.smulLeft M hc)) b = c⁻¹ • b

source

@[simp]

theorem OrderIso.smulLeft_apply {𝕜 : Type u_5} (M : Type u_7) [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {c : 𝕜} (hc : 0 < c) (b : M) :

(OrderIso.smulLeft M hc) b = c • b

source

def OrderIso.smulLeft {𝕜 : Type u_5} (M : Type u_7) [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {c : 𝕜} (hc : 0 < c) :

M ≃o M

Left scalar multiplication as an order isomorphism.

Equations

One or more equations did not get rendered due to their size.

Instances For

source

@[simp]

theorem lowerBounds_smul_of_pos {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {s : Set M} {c : 𝕜} (hc : 0 < c) :

lowerBounds (c • s) = c • lowerBounds s

source

@[simp]

theorem upperBounds_smul_of_pos {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {s : Set M} {c : 𝕜} (hc : 0 < c) :

upperBounds (c • s) = c • upperBounds s

source

@[simp]

theorem bddBelow_smul_iff_of_pos {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {s : Set M} {c : 𝕜} (hc : 0 < c) :

BddBelow (c • s) ↔ BddBelow s

source

@[simp]

theorem bddAbove_smul_iff_of_pos {𝕜 : Type u_5} {M : Type u_7} [LinearOrderedSemifield 𝕜] [OrderedAddCommMonoid M] [MulActionWithZero 𝕜 M] [OrderedSMul 𝕜 M] {s : Set M} {c : 𝕜} (hc : 0 < c) :

BddAbove (c • s) ↔ BddAbove s

source

def Mathlib.Meta.Positivity.evalHSMul :

Mathlib.Meta.Positivity.PositivityExt

Positivity extension for HSMul, i.e. (_ • _).

Equations

One or more equations did not get rendered due to their size.

Instances For