Documentation

ToCslib.Order.AddSupDistrib

Addition distributing over suprema #

AddSupDistrib ω says that, in a complete lattice with an addition, adding on the left distributes over suprema of nonempty sets: a + sSup s ≤ ⨆ b ∈ s, a + b. The reverse inequality holds whenever addition is monotone. It holds in ℕ∞ (from ENat.add_sSup) and pointwise in families. Mathlib proves the equation separately for ℕ∞ and ℝ≥0∞ (ENat.add_sSup, ENNReal.add_sSup); the class names the common hypothesis. Mathlib's IsAddQuantale asks for the equation on every set, the empty one included, where it reads a + ⊥ = ⊥. That fails in ℕ∞, whose bottom is 0, so this class asks only for nonempty sets.

iSup_zero_eq_zero is the constant supremum of 0 over a possibly empty index in a canonically ordered monoid, whose bottom is 0. Mathlib has it for ℕ∞ and ℝ≥0∞ (ENat.iSup_zero, ENNReal.iSup_zero).

class AddSupDistrib (ω : Type w) [Add ω] [CompleteLattice ω] :

Addition on the left distributes over suprema of nonempty sets.

Instances
    theorem add_iSup_le_iSup_add {ω : Type w} [Add ω] [CompleteLattice ω] [AddSupDistrib ω] {ι : Sort u_1} [Nonempty ι] (a : ω) (f : ι → ω) :
    a + ⨆ (i : ι), f i ≤ ⨆ (i : ι), a + f i
    instance Pi.addSupDistrib {ι : Type u_1} {ω : ι → Type w} [(i : ι) → Add (ω i)] [(i : ι) → CompleteLattice (ω i)] [∀ (i : ι), AddSupDistrib (ω i)] :
    AddSupDistrib ((i : ι) → ω i)
    @[simp]
    theorem iSup_zero_eq_zero {ω : Type w} [AddZeroClass ω] [CompleteLattice ω] [CanonicallyOrderedAdd ω] {ι : Sort u_1} :
    ⨆ (x : ι), 0 = 0