Theorems · Theorem · probability
PMF.seq_apply
∀ {α : Type u_1} {β : Type u_2} (q : PMF (α → β)) (p : PMF α) (b : β),
(q.seq p) b = ∑' (f : α → β) (a : α), if b = f a then q f * p a else 0- Cited by
- 0 results in Mathlib
- Foundations
- Depth 143 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- ENNRealstatement · cited by 9,879
- MulZeroClass.mul_zeroproof · cited by 2,091
- SummationFilter.unconditionalstatement and proof · cited by 2,068
- tsumstatement and proof · cited by 1,148
- mul_iteproof · cited by 159
- PMFstatement and proof · cited by 127
- tsum_congrproof · cited by 64
- ENNReal.tsum_mul_leftproof · cited by 21
- mul_booleproof · cited by 13
- PMF.seqstatement · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.