Theorems · Definition · probability
PMF.ofFintype
{α : Type u_1} → [inst : Fintype α] → (f : α → ENNReal) → ∑ a, f a = 1 → PMF αGiven a finite type α and a function f : α → ℝ≥0∞ with sum 1, we get a PMF.
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 121 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENNRealstatement and proof · cited by 9,879
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement and proof · cited by 5,195
- Finset.univstatement and proof · cited by 3,473
- PMFstatement · cited by 127
- PMF.ofFinsetproof · cited by 7
Cited by9
Results whose statement or proof uses this declaration.
- PMF.binomialproof · cited by 7
- PMF.bernoulliproof · cited by 6
- PMF.ofFintype.congr_simpstatement and proof · cited by 2
- PMF.toOuterMeasure_ofFintype_applystatement and proof · cited by 1
- PMF.ofFintype_applystatement · cited by 0
- PMF.map_ofFintypestatement and proof · cited by 0
- PMF.mem_support_ofFintype_iffstatement · cited by 0
- PMF.toMeasure_ofFintype_applystatement and proof · cited by 0
- PMF.support_ofFintypestatement · cited by 0