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.Cslib.Probability.PMF.bind_pair_tsum_fst← Cslib.Probability.PMF.bind_pair_tsum_fst (Cslib/Probability/PMF.lean:58): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Cslib.Probability.PMF.bind_pair_applyEvaluating the "pairing" bind
(do let a ← p; return (a, ← f a))at(a, b)gives the productp a * f a b.
- Cslib.Probability.PMF.bind_pair_applyEvaluating the "pairing" bind
- Used by 2
- Cslib.Probability.PMF.posterior_hasSumPosterior probabilities
joint(a, b) / marginal(b)sum to 1 whenbis in the support of the marginal. - Cslib.Crypto.Protocols.PerfectSecrecy.jointDist_tsum_fstSumming the joint distribution over messages gives the marginal ciphertext distribution.
- Cslib.Probability.PMF.posterior_hasSumPosterior probabilities
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
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]