Bind operation for multisets

This file defines a few basic operations on Multiset, notably the monadic bind.

Main declarations

• Multiset.join: The join, aka union or sum, of multisets.
• Multiset.bind: The bind of a multiset-indexed family of multisets.
• Multiset.product: Cartesian product of two multisets.
• Multiset.sigma: Disjoint sum of multisets in a sigma type.

Join

ink

def Multiset.join {α : Type u_1} : Multiset (Multiset α) → Multiset α

join S, where S is a multiset of multisets, is the lift of the list join operation, that is, the union of all the sets. join {{1, 2}, {1, 2}, {0, 1}} = {0, 1, 1, 1, 2, 2}

Equations

• Multiset.join = Multiset.sum

ink

theorem Multiset.coe_join {α : Type u_1} (L : List (List α)) : Multiset.join ↑(List.map Multiset.ofList L) = ↑(List.join L)

ink

@[simp]

theorem Multiset.join_zero {α : Type u_1} : Multiset.join 0 = 0

ink

@[simp]

theorem Multiset.join_cons {α : Type u_1} (s : Multiset α) (S : Multiset (Multiset α)) : Multiset.join (s ::ₘ S) = s + Multiset.join S

ink

@[simp]

theorem Multiset.join_add {α : Type u_1} (S : Multiset (Multiset α)) (T : Multiset (Multiset α)) : Multiset.join (S + T) = Multiset.join S + Multiset.join T

ink

@[simp]

theorem Multiset.singleton_join {α : Type u_1} (a : Multiset α) : Multiset.join {a} = a

ink

@[simp]

theorem Multiset.mem_join {α : Type u_1} {a : α} {S : Multiset (Multiset α)} : a ∈ Multiset.join S ↔ ∃ s, s ∈ S ∧ a ∈ s

ink

@[simp]

theorem Multiset.card_join {α : Type u_1} (S : Multiset (Multiset α)) : ↑Multiset.card (Multiset.join S) = Multiset.sum (Multiset.map (↑Multiset.card) S)

ink

theorem Multiset.rel_join {α : Type u_1} {β : Type u_2} {r : α → β → Prop} {s : Multiset (Multiset α)} {t : Multiset (Multiset β)} (h : Multiset.Rel (Multiset.Rel r) s t) : Multiset.Rel r (Multiset.join s) (Multiset.join t)

Bind

ink

def Multiset.bind {α : Type u_1} {β : Type u_2} (s : Multiset α) (f : α → Multiset β) : Multiset β

s.bind f is the monad bind operation, defined as (s.map f).join. It is the union of f a as a ranges over s.

Equations

• Multiset.bind s f = Multiset.join (Multiset.map f s)

ink

@[simp]

theorem Multiset.coe_bind {α : Type u_1} {β : Type u_2} (l : List α) (f : α → List β) : (Multiset.bind ↑l fun a => ↑(f a)) = ↑(List.bind l f)

ink

@[simp]

theorem Multiset.zero_bind {α : Type u_2} {β : Type u_1} (f : α → Multiset β) : Multiset.bind 0 f = 0

ink

@[simp]

theorem Multiset.cons_bind {α : Type u_2} {β : Type u_1} (a : α) (s : Multiset α) (f : α → Multiset β) : Multiset.bind (a ::ₘ s) f = f a + Multiset.bind s f

ink

@[simp]

theorem Multiset.singleton_bind {α : Type u_2} {β : Type u_1} (a : α) (f : α → Multiset β) : Multiset.bind {a} f = f a

ink

@[simp]

theorem Multiset.add_bind {α : Type u_2} {β : Type u_1} (s : Multiset α) (t : Multiset α) (f : α → Multiset β) : Multiset.bind (s + t) f = Multiset.bind s f + Multiset.bind t f

ink

@[simp]

theorem Multiset.bind_zero {α : Type u_2} {β : Type u_1} (s : Multiset α) : (Multiset.bind s fun x => 0) = 0

ink

@[simp]

theorem Multiset.bind_add {α : Type u_2} {β : Type u_1} (s : Multiset α) (f : α → Multiset β) (g : α → Multiset β) : (Multiset.bind s fun a => f a + g a) = Multiset.bind s f + Multiset.bind s g

ink

@[simp]

theorem Multiset.bind_cons {α : Type u_2} {β : Type u_1} (s : Multiset α) (f : α → β) (g : α → Multiset β) : (Multiset.bind s fun a => f a ::ₘ g a) = Multiset.map f s + Multiset.bind s g

ink

@[simp]

theorem Multiset.bind_singleton {α : Type u_2} {β : Type u_1} (s : Multiset α) (f : α → β) : (Multiset.bind s fun x => {f x}) = Multiset.map f s

ink

@[simp]

theorem Multiset.mem_bind {α : Type u_1} {β : Type u_2} {b : β} {s : Multiset α} {f : α → Multiset β} : b ∈ Multiset.bind s f ↔ ∃ a, a ∈ s ∧ b ∈ f a

ink

@[simp]

theorem Multiset.card_bind {α : Type u_2} {β : Type u_1} (s : Multiset α) (f : α → Multiset β) : ↑Multiset.card (Multiset.bind s f) = Multiset.sum (Multiset.map (↑Multiset.card ∘ f) s)

ink

theorem Multiset.bind_congr {α : Type u_2} {β : Type u_1} {f : α → Multiset β} {g : α → Multiset β} {m : Multiset α} : (∀ (a : α), a ∈ m → f a = g a) → Multiset.bind m f = Multiset.bind m g

ink

theorem Multiset.bind_hcongr {α : Type u_2} {β : Type u_1} {β' : Type u_1} {m : Multiset α} {f : α → Multiset β} {f' : α → Multiset β'} (h : β = β') (hf : ∀ (a : α), a ∈ m → HEq (f a) (f' a)) : HEq (Multiset.bind m f) (Multiset.bind m f')

ink

theorem Multiset.map_bind {α : Type u_1} {β : Type u_2} {γ : Type u_3} (m : Multiset α) (n : α → Multiset β) (f : β → γ) : Multiset.map f (Multiset.bind m n) = Multiset.bind m fun a => Multiset.map f (n a)

ink

theorem Multiset.bind_map {α : Type u_1} {β : Type u_3} {γ : Type u_2} (m : Multiset α) (n : β → Multiset γ) (f : α → β) : Multiset.bind (Multiset.map f m) n = Multiset.bind m fun a => n (f a)

ink

theorem Multiset.bind_assoc {α : Type u_1} {β : Type u_2} {γ : Type u_3} {s : Multiset α} {f : α → Multiset β} {g : β → Multiset γ} : Multiset.bind (Multiset.bind s f) g = Multiset.bind s fun a => Multiset.bind (f a) g

ink

theorem Multiset.bind_bind {α : Type u_1} {β : Type u_2} {γ : Type u_3} (m : Multiset α) (n : Multiset β) {f : α → β → Multiset γ} : (Multiset.bind m fun a => Multiset.bind n fun b => f a b) = Multiset.bind n fun b => Multiset.bind m fun a => f a b

ink

theorem Multiset.bind_map_comm {α : Type u_1} {β : Type u_2} {γ : Type u_3} (m : Multiset α) (n : Multiset β) {f : α → β → γ} : (Multiset.bind m fun a => Multiset.map (fun b => f a b) n) = Multiset.bind n fun b => Multiset.map (fun a => f a b) m

ink

@[simp]

theorem Multiset.sum_bind {α : Type u_2} {β : Type u_1} [inst : AddCommMonoid β] (s : Multiset α) (t : α → Multiset β) : Multiset.sum (Multiset.bind s t) = Multiset.sum (Multiset.map (fun a => Multiset.sum (t a)) s)

ink

@[simp]

theorem Multiset.prod_bind {α : Type u_2} {β : Type u_1} [inst : CommMonoid β] (s : Multiset α) (t : α → Multiset β) : Multiset.prod (Multiset.bind s t) = Multiset.prod (Multiset.map (fun a => Multiset.prod (t a)) s)

ink

theorem Multiset.rel_bind {α : Type u_1} {β : Type u_2} {γ : Type u_3} {δ : Type u_4} {r : α → β → Prop} {p : γ → δ → Prop} {s : Multiset α} {t : Multiset β} {f : α → Multiset γ} {g : β → Multiset δ} (h : (r ⇒ Multiset.Rel p) f g) (hst : Multiset.Rel r s t) : Multiset.Rel p (Multiset.bind s f) (Multiset.bind t g)

ink

theorem Multiset.count_sum {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] {m : Multiset β} {f : β → Multiset α} {a : α} : Multiset.count a (Multiset.sum (Multiset.map f m)) = Multiset.sum (Multiset.map (fun b => Multiset.count a (f b)) m)

ink

theorem Multiset.count_bind {α : Type u_1} {β : Type u_2} [inst : DecidableEq α] {m : Multiset β} {f : β → Multiset α} {a : α} : Multiset.count a (Multiset.bind m f) = Multiset.sum (Multiset.map (fun b => Multiset.count a (f b)) m)

ink

theorem Multiset.le_bind {α : Type u_1} {β : Type u_2} {f : α → Multiset β} (S : Multiset α) {x : α} (hx : x ∈ S) : f x ≤ Multiset.bind S f

ink

theorem Multiset.attach_bind_coe {α : Type u_1} {β : Type u_2} (s : Multiset α) (f : α → Multiset β) : (Multiset.bind (Multiset.attach s) fun i => f ↑i) = Multiset.bind s f

Product of two multisets

ink

def Multiset.product {α : Type u_1} {β : Type u_2} (s : Multiset α) (t : Multiset β) : Multiset (α × β)

The multiplicity of (a, b) in s ×ˢ t×ˢ t is the product of the multiplicity of a in s and b in t.

Equations

• s ×ˢ t = Multiset.bind s fun a => Multiset.map (Prod.mk a) t

ink

def Multiset.«term_×ˢ_» : Lean.TrailingParserDescr

The multiplicity of (a, b) in s ×ˢ t×ˢ t is the product of the multiplicity of a in s and b in t.

Equations

• Multiset.«term_×ˢ_» = Lean.ParserDescr.trailingNode `Multiset.term_×ˢ_ 82 83 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ×ˢ ") (Lean.ParserDescr.cat `term 82))

ink

@[simp]

theorem Multiset.coe_product {α : Type u_1} {β : Type u_2} (l₁ : List α) (l₂ : List β) : ↑l₁ ×ˢ ↑l₂ = ↑(l₁ ×ˢ l₂)

ink

@[simp]

theorem Multiset.zero_product {α : Type u_1} {β : Type u_2} (t : Multiset β) : 0 ×ˢ t = 0

ink

@[simp]

theorem Multiset.cons_product {α : Type u_1} {β : Type u_2} (a : α) (s : Multiset α) (t : Multiset β) : (a ::ₘ s) ×ˢ t = Multiset.map (Prod.mk a) t + s ×ˢ t

ink

@[simp]

theorem Multiset.product_zero {α : Type u_1} {β : Type u_2} (s : Multiset α) : s ×ˢ 0 = 0

ink

@[simp]

theorem Multiset.product_cons {α : Type u_1} {β : Type u_2} (b : β) (s : Multiset α) (t : Multiset β) : s ×ˢ (b ::ₘ t) = Multiset.map (fun a => (a, b)) s + s ×ˢ t

ink

@[simp]

theorem Multiset.product_singleton {α : Type u_1} {β : Type u_2} (a : α) (b : β) : {a} ×ˢ {b} = {(a, b)}

ink

@[simp]

theorem Multiset.add_product {α : Type u_1} {β : Type u_2} (s : Multiset α) (t : Multiset α) (u : Multiset β) : (s + t) ×ˢ u = s ×ˢ u + t ×ˢ u

ink

@[simp]

theorem Multiset.product_add {α : Type u_1} {β : Type u_2} (s : Multiset α) (t : Multiset β) (u : Multiset β) : s ×ˢ (t + u) = s ×ˢ t + s ×ˢ u

ink

@[simp]

theorem Multiset.mem_product {α : Type u_1} {β : Type u_2} {s : Multiset α} {t : Multiset β} {p : α × β} : p ∈ s ×ˢ t ↔ p.fst ∈ s ∧ p.snd ∈ t

ink

@[simp]

theorem Multiset.card_product {α : Type u_2} {β : Type u_1} (s : Multiset α) (t : Multiset β) : ↑Multiset.card (s ×ˢ t) = ↑Multiset.card s * ↑Multiset.card t

Disjoint sum of multisets

ink

def Multiset.sigma {α : Type u_1} {σ : α → Type u_2} (s : Multiset α) (t : (a : α) → Multiset (σ a)) : Multiset ((a : α) × σ a)

sigma s t is the dependent version of product. It is the sum of (a, b) as a ranges over s and b ranges over t a.

Equations

• Multiset.sigma s t = Multiset.bind s fun a => Multiset.map (Sigma.mk a) (t a)

ink

@[simp]

theorem Multiset.coe_sigma {α : Type u_1} {σ : α → Type u_2} (l₁ : List α) (l₂ : (a : α) → List (σ a)) : (Multiset.sigma ↑l₁ fun a => ↑(l₂ a)) = ↑(List.sigma l₁ l₂)

ink

@[simp]

theorem Multiset.zero_sigma {α : Type u_1} {σ : α → Type u_2} (t : (a : α) → Multiset (σ a)) : Multiset.sigma 0 t = 0

ink

@[simp]

theorem Multiset.cons_sigma {α : Type u_1} {σ : α → Type u_2} (a : α) (s : Multiset α) (t : (a : α) → Multiset (σ a)) : Multiset.sigma (a ::ₘ s) t = Multiset.map (Sigma.mk a) (t a) + Multiset.sigma s t

ink

@[simp]

theorem Multiset.sigma_singleton {α : Type u_1} {β : Type u_2} (a : α) (b : α → β) : (Multiset.sigma {a} fun a => {b a}) = {{ fst := a, snd := b a }}

ink

@[simp]

theorem Multiset.add_sigma {α : Type u_1} {σ : α → Type u_2} (s : Multiset α) (t : Multiset α) (u : (a : α) → Multiset (σ a)) : Multiset.sigma (s + t) u = Multiset.sigma s u + Multiset.sigma t u

ink

@[simp]

theorem Multiset.sigma_add {α : Type u_2} {σ : α → Type u_1} (s : Multiset α) (t : (a : α) → Multiset (σ a)) (u : (a : α) → Multiset (σ a)) : (Multiset.sigma s fun a => t a + u a) = Multiset.sigma s t + Multiset.sigma s u

ink

@[simp]

theorem Multiset.mem_sigma {α : Type u_1} {σ : α → Type u_2} {s : Multiset α} {t : (a : α) → Multiset (σ a)} {p : (a : α) × σ a} : p ∈ Multiset.sigma s t ↔ p.fst ∈ s ∧ p.snd ∈ t p.fst

ink

@[simp]

theorem Multiset.card_sigma {α : Type u_1} {σ : α → Type u_2} (s : Multiset α) (t : (a : α) → Multiset (σ a)) : ↑Multiset.card (Multiset.sigma s t) = Multiset.sum (Multiset.map (fun a => ↑Multiset.card (t a)) s)