Structures involving * and 0 on WithTop and WithBot

The main results of this section are WithTop.canonicallyOrderedCommSemiring and WithBot.orderedCommSemiring.

instance WithTop.instDecidableEqWithTop {α : Type u_1} [DecidableEq α] : DecidableEq (WithTop α)

instance WithTop.instMulZeroClassWithTop {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] : MulZeroClass (WithTop α)

theorem WithTop.mul_def {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithTop α} {b : WithTop α} : a * b = if a = 0 ∨ b = 0 then 0 else Option.map₂ (fun x x_1 => x * x_1) a b

theorem WithTop.top_mul_top {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] : ⊤ * ⊤ = ⊤

theorem WithTop.mul_top' {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] (a : WithTop α) : a * ⊤ = if a = 0 then 0 else ⊤

@[simp]

theorem WithTop.mul_top {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithTop α} (h : a ≠ 0) : a * ⊤ = ⊤

theorem WithTop.top_mul' {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] (a : WithTop α) : ⊤ * a = if a = 0 then 0 else ⊤

@[simp]

theorem WithTop.top_mul {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithTop α} (h : a ≠ 0) : ⊤ * a = ⊤

theorem WithTop.mul_eq_top_iff {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithTop α} {b : WithTop α} : a * b = ⊤ ↔ a ≠ 0 ∧ b = ⊤ ∨ a = ⊤ ∧ b ≠ 0

theorem WithTop.mul_lt_top' {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] [LT α] {a : WithTop α} {b : WithTop α} (ha : a < ⊤) (hb : b < ⊤) : a * b < ⊤

theorem WithTop.mul_lt_top {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] [LT α] {a : WithTop α} {b : WithTop α} (ha : a ≠ ⊤) (hb : b ≠ ⊤) : a * b < ⊤

instance WithTop.noZeroDivisors {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] [NoZeroDivisors α] : NoZeroDivisors (WithTop α)

@[simp]

theorem WithTop.coe_mul {α : Type u_1} [DecidableEq α] [MulZeroClass α] {a : α} {b : α} : ↑(a * b) = ↑a * ↑b

theorem WithTop.mul_coe {α : Type u_1} [DecidableEq α] [MulZeroClass α] {b : α} (hb : b ≠ 0) {a : WithTop α} : a * ↑b = Option.bind a fun a => some (a * b)

@[simp]

theorem WithTop.untop'_zero_mul {α : Type u_1} [DecidableEq α] [MulZeroClass α] (a : WithTop α) (b : WithTop α) : WithTop.untop' 0 (a * b) = WithTop.untop' 0 a * WithTop.untop' 0 b

instance WithTop.instMulZeroOneClassWithTop {α : Type u_1} [DecidableEq α] [MulZeroOneClass α] [Nontrivial α] : MulZeroOneClass (WithTop α)

Nontrivial α is needed here as otherwise we have 1 * ⊤ = ⊤ but also 0 * ⊤ = 0.

@[simp]

theorem MonoidWithZeroHom.withTopMap_apply {R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ↑f) : ↑(MonoidWithZeroHom.withTopMap f hf) = WithTop.map ↑f

def MonoidWithZeroHom.withTopMap {R : Type u_2} {S : Type u_3} [MulZeroOneClass R] [DecidableEq R] [Nontrivial R] [MulZeroOneClass S] [DecidableEq S] [Nontrivial S] (f : R →*₀ S) (hf : Function.Injective ↑f) : WithTop R →*₀ WithTop S

A version of WithTop.map for MonoidWithZeroHoms.

instance WithTop.instSemigroupWithZeroWithTop {α : Type u_1} [DecidableEq α] [SemigroupWithZero α] [NoZeroDivisors α] : SemigroupWithZero (WithTop α)

instance WithTop.monoidWithZero {α : Type u_1} [DecidableEq α] [MonoidWithZero α] [NoZeroDivisors α] [Nontrivial α] : MonoidWithZero (WithTop α)

instance WithTop.commMonoidWithZero {α : Type u_1} [DecidableEq α] [CommMonoidWithZero α] [NoZeroDivisors α] [Nontrivial α] : CommMonoidWithZero (WithTop α)

instance WithTop.commSemiring {α : Type u_1} [DecidableEq α] [CanonicallyOrderedCommSemiring α] [Nontrivial α] : CommSemiring (WithTop α)

This instance requires CanonicallyOrderedCommSemiring as it is the smallest class that derives from both NonAssocNonUnitalSemiring and CanonicallyOrderedAddMonoid, both of which are required for distributivity.

instance WithTop.instCanonicallyOrderedCommSemiringWithTop {α : Type u_1} [DecidableEq α] [CanonicallyOrderedCommSemiring α] [Nontrivial α] : CanonicallyOrderedCommSemiring (WithTop α)

@[simp]

theorem RingHom.withTopMap_apply {R : Type u_2} {S : Type u_3} [CanonicallyOrderedCommSemiring R] [DecidableEq R] [Nontrivial R] [CanonicallyOrderedCommSemiring S] [DecidableEq S] [Nontrivial S] (f : R →+* S) (hf : Function.Injective ↑f) : ↑(RingHom.withTopMap f hf) = (↑(MonoidWithZeroHom.withTopMap (RingHom.toMonoidWithZeroHom f) hf)).toFun

def RingHom.withTopMap {R : Type u_2} {S : Type u_3} [CanonicallyOrderedCommSemiring R] [DecidableEq R] [Nontrivial R] [CanonicallyOrderedCommSemiring S] [DecidableEq S] [Nontrivial S] (f : R →+* S) (hf : Function.Injective ↑f) : WithTop R →+* WithTop S

A version of WithTop.map for RingHoms.

instance WithBot.instDecidableEqWithBot {α : Type u_1} [DecidableEq α] : DecidableEq (WithBot α)

instance WithBot.instMulZeroClassWithBot {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] : MulZeroClass (WithBot α)

theorem WithBot.mul_def {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithBot α} {b : WithBot α} : a * b = if a = 0 ∨ b = 0 then 0 else Option.map₂ (fun x x_1 => x * x_1) a b

@[simp]

theorem WithBot.mul_bot {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithBot α} (h : a ≠ 0) : a * ⊥ = ⊥

@[simp]

theorem WithBot.bot_mul {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithBot α} (h : a ≠ 0) : ⊥ * a = ⊥

@[simp]

theorem WithBot.bot_mul_bot {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] : ⊥ * ⊥ = ⊥

theorem WithBot.mul_eq_bot_iff {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] {a : WithBot α} {b : WithBot α} : a * b = ⊥ ↔ a ≠ 0 ∧ b = ⊥ ∨ a = ⊥ ∧ b ≠ 0

theorem WithBot.bot_lt_mul' {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] [LT α] {a : WithBot α} {b : WithBot α} (ha : ⊥ < a) (hb : ⊥ < b) : ⊥ < a * b

theorem WithBot.bot_lt_mul {α : Type u_1} [DecidableEq α] [Zero α] [Mul α] [LT α] {a : WithBot α} {b : WithBot α} (ha : a ≠ ⊥) (hb : b ≠ ⊥) : ⊥ < a * b

@[simp]

theorem WithBot.coe_mul {α : Type u_1} [DecidableEq α] [MulZeroClass α] {a : α} {b : α} : ↑(a * b) = ↑a * ↑b

theorem WithBot.mul_coe {α : Type u_1} [DecidableEq α] [MulZeroClass α] {b : α} (hb : b ≠ 0) {a : WithBot α} : a * ↑b = Option.bind a fun a => some (a * b)

instance WithBot.instMulZeroOneClassWithBot {α : Type u_1} [DecidableEq α] [MulZeroOneClass α] [Nontrivial α] : MulZeroOneClass (WithBot α)

Nontrivial α is needed here as otherwise we have 1 * ⊥ = ⊥ but also = 0 * ⊥ = 0.

instance WithBot.instNoZeroDivisorsWithBotToMulInstMulZeroClassWithBotToZeroZero {α : Type u_1} [DecidableEq α] [MulZeroClass α] [NoZeroDivisors α] : NoZeroDivisors (WithBot α)

instance WithBot.instSemigroupWithZeroWithBot {α : Type u_1} [DecidableEq α] [SemigroupWithZero α] [NoZeroDivisors α] : SemigroupWithZero (WithBot α)

instance WithBot.instMonoidWithZeroWithBot {α : Type u_1} [DecidableEq α] [MonoidWithZero α] [NoZeroDivisors α] [Nontrivial α] : MonoidWithZero (WithBot α)

instance WithBot.commMonoidWithZero {α : Type u_1} [DecidableEq α] [CommMonoidWithZero α] [NoZeroDivisors α] [Nontrivial α] : CommMonoidWithZero (WithBot α)

instance WithBot.commSemiring {α : Type u_1} [DecidableEq α] [CanonicallyOrderedCommSemiring α] [Nontrivial α] : CommSemiring (WithBot α)

instance WithBot.instPosMulMonoWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [PosMulMono α] : PosMulMono (WithBot α)

instance WithBot.instMulPosMonoWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [MulPosMono α] : MulPosMono (WithBot α)

instance WithBot.instPosMulStrictMonoWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [PosMulStrictMono α] : PosMulStrictMono (WithBot α)

instance WithBot.instMulPosStrictMonoWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [MulPosStrictMono α] : MulPosStrictMono (WithBot α)

instance WithBot.instPosMulReflectLTWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [PosMulReflectLT α] : PosMulReflectLT (WithBot α)

instance WithBot.instMulPosReflectLTWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [MulPosReflectLT α] : MulPosReflectLT (WithBot α)

instance WithBot.instPosMulMonoRevWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [PosMulMonoRev α] : PosMulMonoRev (WithBot α)

instance WithBot.instMulPosMonoRevWithBotToMulInstMulZeroClassWithBotToZeroZeroPreorder {α : Type u_1} [DecidableEq α] [MulZeroClass α] [Preorder α] [MulPosMonoRev α] : MulPosMonoRev (WithBot α)

instance WithBot.orderedCommSemiring {α : Type u_1} [DecidableEq α] [CanonicallyOrderedCommSemiring α] [Nontrivial α] : OrderedCommSemiring (WithBot α)