The type of nonnegative elements

This file defines instances and prove some properties about the nonnegative elements {x : α // 0 ≤ x} of an arbitrary type α.

Currently we only state instances and states some simp/norm_cast lemmas.

When α is ℝ, this will give us some properties about ℝ≥0.

Main declarations

• {x : α // 0 ≤ x} is a CanonicallyLinearOrderedAddMonoid if α is a LinearOrderedRing.

Implementation Notes

Instead of {x : α // 0 ≤ x} we could also use Set.Ici (0 : α), which is definitionally equal. However, using the explicit subtype has a big advantage: when writing an element explicitly with a proof of nonnegativity as ⟨x, hx⟩, the hx is expected to have type 0 ≤ x. If we would use Ici 0, then the type is expected to be x ∈ Ici 0. Although these types are definitionally equal, this often confuses the elaborator. Similar problems arise when doing cases on an element.

The disadvantage is that we have to duplicate some instances about Set.Ici to this subtype.

instance Nonneg.orderBot {α : Type u_1} [Preorder α] {a : α} : OrderBot { x // a ≤ x }

This instance uses data fields from Subtype.partialOrder to help type-class inference. The Set.Ici data fields are definitionally equal, but that requires unfolding semireducible definitions, so type-class inference won't see this.

theorem Nonneg.bot_eq {α : Type u_1} [Preorder α] {a : α} : ⊥ = { val := a, property := (_ : a ≤ a) }

instance Nonneg.noMaxOrder {α : Type u_1} [PartialOrder α] [NoMaxOrder α] {a : α} : NoMaxOrder { x // a ≤ x }

instance Nonneg.semilatticeSup {α : Type u_1} [SemilatticeSup α] {a : α} : SemilatticeSup { x // a ≤ x }

instance Nonneg.semilatticeInf {α : Type u_1} [SemilatticeInf α] {a : α} : SemilatticeInf { x // a ≤ x }

instance Nonneg.distribLattice {α : Type u_1} [DistribLattice α] {a : α} : DistribLattice { x // a ≤ x }

instance Nonneg.densely_ordered {α : Type u_1} [Preorder α] [DenselyOrdered α] {a : α} : DenselyOrdered { x // a ≤ x }

@[reducible]

noncomputable def Nonneg.conditionallyCompleteLinearOrder {α : Type u_1} [ConditionallyCompleteLinearOrder α] {a : α} : ConditionallyCompleteLinearOrder { x // a ≤ x }

If sSup ∅ ≤ a then {x : α // a ≤ x} is a ConditionallyCompleteLinearOrder.

@[reducible]

noncomputable def Nonneg.conditionallyCompleteLinearOrderBot {α : Type u_1} [ConditionallyCompleteLinearOrder α] (a : α) : ConditionallyCompleteLinearOrderBot { x // a ≤ x }

If sSup ∅ ≤ a then {x : α // a ≤ x} is a ConditionallyCompleteLinearOrderBot.

This instance uses data fields from Subtype.linearOrder to help type-class inference. The Set.Ici data fields are definitionally equal, but that requires unfolding semireducible definitions, so type-class inference won't see this.

instance Nonneg.inhabited {α : Type u_1} [Preorder α] {a : α} : Inhabited { x // a ≤ x }

instance Nonneg.zero {α : Type u_1} [Zero α] [Preorder α] : Zero { x // 0 ≤ x }

@[simp]

theorem Nonneg.coe_zero {α : Type u_1} [Zero α] [Preorder α] : ↑0 = 0

@[simp]

theorem Nonneg.mk_eq_zero {α : Type u_1} [Zero α] [Preorder α] {x : α} (hx : 0 ≤ x) : { val := x, property := hx } = 0 ↔ x = 0

instance Nonneg.add {α : Type u_1} [AddZeroClass α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] : Add { x // 0 ≤ x }

@[simp]

theorem Nonneg.mk_add_mk {α : Type u_1} [AddZeroClass α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] {x : α} {y : α} (hx : 0 ≤ x) (hy : 0 ≤ y) : { val := x, property := hx } + { val := y, property := hy } = { val := x + y, property := (_ : 0 ≤ x + y) }

@[simp]

theorem Nonneg.coe_add {α : Type u_1} [AddZeroClass α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] (a : { x // 0 ≤ x }) (b : { x // 0 ≤ x }) : ↑(a + b) = ↑a + ↑b

instance Nonneg.nsmul {α : Type u_1} [AddMonoid α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] : SMul ℕ { x // 0 ≤ x }

@[simp]

theorem Nonneg.nsmul_mk {α : Type u_1} [AddMonoid α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] (n : ℕ) {x : α} (hx : 0 ≤ x) : n • { val := x, property := hx } = { val := n • x, property := (_ : 0 ≤ n • x) }

@[simp]

theorem Nonneg.coe_nsmul {α : Type u_1} [AddMonoid α] [Preorder α] [CovariantClass α α (fun x x_1 => x + x_1) fun x x_1 => x ≤ x_1] (n : ℕ) (a : { x // 0 ≤ x }) : ↑(n • a) = n • ↑a

instance Nonneg.orderedAddCommMonoid {α : Type u_1} [OrderedAddCommMonoid α] : OrderedAddCommMonoid { x // 0 ≤ x }

instance Nonneg.linearOrderedAddCommMonoid {α : Type u_1} [LinearOrderedAddCommMonoid α] : LinearOrderedAddCommMonoid { x // 0 ≤ x }

instance Nonneg.orderedCancelAddCommMonoid {α : Type u_1} [OrderedCancelAddCommMonoid α] : OrderedCancelAddCommMonoid { x // 0 ≤ x }

instance Nonneg.linearOrderedCancelAddCommMonoid {α : Type u_1} [LinearOrderedCancelAddCommMonoid α] : LinearOrderedCancelAddCommMonoid { x // 0 ≤ x }

def Nonneg.coeAddMonoidHom {α : Type u_1} [OrderedAddCommMonoid α] : { x // 0 ≤ x } →+ α

Coercion {x : α // 0 ≤ x} → α as an AddMonoidHom.

theorem Nonneg.nsmul_coe {α : Type u_1} [OrderedAddCommMonoid α] (n : ℕ) (r : { x // 0 ≤ x }) : ↑(n • r) = n • ↑r

instance Nonneg.one {α : Type u_1} [OrderedSemiring α] : One { x // 0 ≤ x }

@[simp]

theorem Nonneg.coe_one {α : Type u_1} [OrderedSemiring α] : ↑1 = 1

@[simp]

theorem Nonneg.mk_eq_one {α : Type u_1} [OrderedSemiring α] {x : α} (hx : 0 ≤ x) : { val := x, property := hx } = 1 ↔ x = 1

instance Nonneg.mul {α : Type u_1} [OrderedSemiring α] : Mul { x // 0 ≤ x }

@[simp]

theorem Nonneg.coe_mul {α : Type u_1} [OrderedSemiring α] (a : { x // 0 ≤ x }) (b : { x // 0 ≤ x }) : ↑(a * b) = ↑a * ↑b

@[simp]

theorem Nonneg.mk_mul_mk {α : Type u_1} [OrderedSemiring α] {x : α} {y : α} (hx : 0 ≤ x) (hy : 0 ≤ y) : { val := x, property := hx } * { val := y, property := hy } = { val := x * y, property := (_ : 0 ≤ x * y) }

instance Nonneg.addMonoidWithOne {α : Type u_1} [OrderedSemiring α] : AddMonoidWithOne { x // 0 ≤ x }

@[simp]

theorem Nonneg.coe_nat_cast {α : Type u_1} [OrderedSemiring α] (n : ℕ) : ↑↑n = ↑n

@[simp]

theorem Nonneg.mk_nat_cast {α : Type u_1} [OrderedSemiring α] (n : ℕ) : { val := ↑n, property := (_ : 0 ≤ ↑n) } = ↑n

instance Nonneg.pow {α : Type u_1} [OrderedSemiring α] : Pow { x // 0 ≤ x } ℕ

@[simp]

theorem Nonneg.coe_pow {α : Type u_1} [OrderedSemiring α] (a : { x // 0 ≤ x }) (n : ℕ) : ↑(a ^ n) = ↑a ^ n

@[simp]

theorem Nonneg.mk_pow {α : Type u_1} [OrderedSemiring α] {x : α} (hx : 0 ≤ x) (n : ℕ) : { val := x, property := hx } ^ n = { val := x ^ n, property := (_ : 0 ≤ x ^ n) }

instance Nonneg.orderedSemiring {α : Type u_1} [OrderedSemiring α] : OrderedSemiring { x // 0 ≤ x }

instance Nonneg.strictOrderedSemiring {α : Type u_1} [StrictOrderedSemiring α] : StrictOrderedSemiring { x // 0 ≤ x }

instance Nonneg.orderedCommSemiring {α : Type u_1} [OrderedCommSemiring α] : OrderedCommSemiring { x // 0 ≤ x }

instance Nonneg.strictOrderedCommSemiring {α : Type u_1} [StrictOrderedCommSemiring α] : StrictOrderedCommSemiring { x // 0 ≤ x }

instance Nonneg.monoidWithZero {α : Type u_1} [OrderedSemiring α] : MonoidWithZero { x // 0 ≤ x }

instance Nonneg.commMonoidWithZero {α : Type u_1} [OrderedCommSemiring α] : CommMonoidWithZero { x // 0 ≤ x }

instance Nonneg.semiring {α : Type u_1} [OrderedSemiring α] : Semiring { x // 0 ≤ x }

instance Nonneg.commSemiring {α : Type u_1} [OrderedCommSemiring α] : CommSemiring { x // 0 ≤ x }

instance Nonneg.nontrivial {α : Type u_1} [LinearOrderedSemiring α] : Nontrivial { x // 0 ≤ x }

instance Nonneg.linearOrderedSemiring {α : Type u_1} [LinearOrderedSemiring α] : LinearOrderedSemiring { x // 0 ≤ x }

instance Nonneg.linearOrderedCommMonoidWithZero {α : Type u_1} [LinearOrderedCommRing α] : LinearOrderedCommMonoidWithZero { x // 0 ≤ x }

def Nonneg.coeRingHom {α : Type u_1} [OrderedSemiring α] : { x // 0 ≤ x } →+* α

Coercion {x : α // 0 ≤ x} → α as a RingHom.

instance Nonneg.canonicallyOrderedAddMonoid {α : Type u_1} [OrderedRing α] : CanonicallyOrderedAddMonoid { x // 0 ≤ x }

instance Nonneg.canonicallyOrderedCommSemiring {α : Type u_1} [OrderedCommRing α] [NoZeroDivisors α] : CanonicallyOrderedCommSemiring { x // 0 ≤ x }

instance Nonneg.canonicallyLinearOrderedAddMonoid {α : Type u_1} [LinearOrderedRing α] : CanonicallyLinearOrderedAddMonoid { x // 0 ≤ x }

def Nonneg.toNonneg {α : Type u_1} [Zero α] [LinearOrder α] (a : α) : { x // 0 ≤ x }

The function a ↦ max a 0 of type α → {x : α // 0 ≤ x}.

@[simp]

theorem Nonneg.coe_toNonneg {α : Type u_1} [Zero α] [LinearOrder α] {a : α} : ↑(Nonneg.toNonneg a) = max a 0

@[simp]

theorem Nonneg.toNonneg_of_nonneg {α : Type u_1} [Zero α] [LinearOrder α] {a : α} (h : 0 ≤ a) : Nonneg.toNonneg a = { val := a, property := h }

@[simp]

theorem Nonneg.toNonneg_coe {α : Type u_1} [Zero α] [LinearOrder α] {a : { x // 0 ≤ x }} : Nonneg.toNonneg ↑a = a

@[simp]

theorem Nonneg.toNonneg_le {α : Type u_1} [Zero α] [LinearOrder α] {a : α} {b : { x // 0 ≤ x }} : Nonneg.toNonneg a ≤ b ↔ a ≤ ↑b

@[simp]

theorem Nonneg.toNonneg_lt {α : Type u_1} [Zero α] [LinearOrder α] {a : { x // 0 ≤ x }} {b : α} : a < Nonneg.toNonneg b ↔ ↑a < b

instance Nonneg.sub {α : Type u_1} [Zero α] [LinearOrder α] [Sub α] : Sub { x // 0 ≤ x }

@[simp]

theorem Nonneg.mk_sub_mk {α : Type u_1} [Zero α] [LinearOrder α] [Sub α] {x : α} {y : α} (hx : 0 ≤ x) (hy : 0 ≤ y) : { val := x, property := hx } - { val := y, property := hy } = Nonneg.toNonneg (x - y)

instance Nonneg.orderedSub {α : Type u_1} [LinearOrderedRing α] : OrderedSub { x // 0 ≤ x }