Documentation

Linglib.Core.Order.SupIndep

Sums of an independent set #

[UPSTREAM] candidate for Mathlib/Order/SupIndep.lean.

Summing a set of elements of s is left adjoint to taking the elements of s below a given element. When s is independent and does not contain ⊥, the elements of s below a sum are the elements summed, so the adjunction is a coinsertion and sums of distinct subsets of s are distinct. This is the complete counterpart of Finset.SupIndep.le_sup_iff.

theorem gc_sSup_Iic_inter {α : Type u_1} [CompleteLattice α] (s : Set α) :
GaloisConnection (fun (t : ↑(𝒫 s)) => sSup ↑t) fun (a : α) => ⟨Set.Iic a ∩ s, ⋯⟩

Taking the supremum of a set of elements of s is left adjoint to taking the elements of s below an element.

theorem sSupIndep.le_sSup_iff {α : Type u_1} [CompleteLattice α] {s t : Set α} {a : α} (hs : sSupIndep s) (hts : t ⊆ s) (ha : a ∈ s) (ha0 : a ≠ ⊥) :
a ≤ sSup t ↔ a ∈ t
theorem sSupIndep.Iic_sSup_inter {α : Type u_1} [CompleteLattice α] {s t : Set α} (hs : sSupIndep s) (hbot : ⊥ ∉ s) (hts : t ⊆ s) :
Set.Iic (sSup t) ∩ s = t

The elements of an independent set below a supremum of its elements are the elements the supremum is taken over.

def sSupIndep.gciSSupIicInter {α : Type u_1} [CompleteLattice α] {s : Set α} (hs : sSupIndep s) (hbot : ⊥ ∉ s) :
GaloisCoinsertion (fun (t : ↑(𝒫 s)) => sSup ↑t) fun (a : α) => ⟨Set.Iic a ∩ s, ⋯⟩

Over an independent set without ⊥, the adjunction between suprema and the elements below is a coinsertion.

Equations
Instances For
    theorem sSupIndep.injOn_sSup {α : Type u_1} [CompleteLattice α] {s : Set α} (hs : sSupIndep s) (hbot : ⊥ ∉ s) :
    Set.InjOn sSup (𝒫 s)