Theorems · Definition · probability
PMF.ofFinset
{α : Type u_1} → (f : α → ENNReal) → (s : Finset α) → ∑ a ∈ s, f a = 1 → (∀ a ∉ s, f a = 0) → PMF αGiven a finset s and a function f : α → ℝ≥0∞ with sum 1 on s,
such that f a = 0 for a ∉ s, we get a PMF.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 120 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- ENNRealstatement and proof · cited by 9,879
- Finset.sumstatement and proof · cited by 5,195
- PMFstatement · cited by 127
Cited by9
Results whose statement or proof uses this declaration.
- PMF.uniformOfFinsetproof · cited by 8
- PMF.ofFintypeproof · cited by 7
- PMF.toOuterMeasure_ofFinset_applystatement and proof · cited by 1
- PMF.support_ofFinsetstatement and proof · cited by 1
- PMF.ofFinset_apply_of_notMemstatement · cited by 0
- PMF.ofFinset.congr_simpstatement and proof · cited by 0
- PMF.mem_support_ofFinset_iffstatement · cited by 0
- PMF.toMeasure_ofFinset_applystatement and proof · cited by 0
- PMF.ofFinset_applystatement · cited by 0