Theorems · Theorem · probability
ProbabilityTheory.setBernoulli_singleton
∀ {ι : Type u_1} {s u : Set ι} (p : ↑unitInterval) [Countable ι],
s ⊆ u →
u.Finite →
(ProbabilityTheory.setBernoulli u p) {s} =
↑(unitInterval.toNNReal p) ^ s.ncard * ↑(unitInterval.toNNReal (unitInterval.symm p)) ^ (u \ s).ncard- Cited by
- 3 results in Mathlib
- Foundations
- Depth 287 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Countable
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites42
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
- Setstatement and proof · cited by 53,352
- Realstatement · cited by 25,697
- Finsetproof · cited by 13,712
- MeasureTheory.Measurestatement · cited by 10,939
- ENNRealstatement and proof · cited by 9,879
- SetLike.coeproof · cited by 8,199
- Set.Elemstatement and proof · cited by 7,166
- Compl.complproof · cited by 2,925
- add_zeroproof · cited by 2,707
- zero_addproof · cited by 2,366
- Finset.prodproof · cited by 2,356
Cited by3
Results whose statement or proof uses this declaration.
- ProbabilityTheory.setBernoulli_emptyproof · cited by 2
- ProbabilityTheory.setBernoulli_real_singletonproof · cited by 1
- SimpleGraph.binomialRandom_singletonproof · cited by 0