AFTD Auto-Formalizing Theoretical Domains

Cslib.Probability.PMF.bind_pair_tsum_fst

theoremverifiedformalizationimported Lean

Summing the pairing bind over the first component gives the marginal.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open ENNReal in
universe u v in
variable {α : Type u} {β : Type v} in
theorem Cslib.Probability.PMF.bind_pair_tsum_fst (p : PMF α) (f : α → PMF β) (b : β) :
    ∑' a, (p.bind fun a' => (f a').bind fun b' => PMF.pure (a', b')) (a, b) =
      (p.bind f) b
Formalizes
CSLib, `Cslib.Probability.PMF.bind_pair_tsum_fst`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen ENNReal inuniverse u v invariable {α : Type u} {β : Type v} in/-- Summing the pairing bind over the first component gives the marginal. -/theorem Cslib.Probability.PMF.bind_pair_tsum_fst (p : PMF α) (f : α → PMF β) (b : β) :    ∑' a, (p.bind fun a' => (f a').bind fun b' => PMF.pure (a', b')) (a, b) =      (p.bind f) b := by  simp_rw [bind_pair_apply, PMF.bind_apply]
See it in the graphDiscuss this resultChallenge it