TwoDegenerateGraphs.binomialProbabilityMass_succ_mul
ProvedTwoDegenerateGraphs.binomialProbabilityMass_succ_mulPreamble
import Mathlib import Definitions.Def_CompactnessAndDegeneracy set_option autoImplicit true open TwoDegenerateGraphs open Filter Finset SimpleGraph open scoped Topology
Formal statement
theorem TwoDegenerateGraphs.binomialProbabilityMass_succ_mul
(trialCount successCount : ℕ) (probability : ℝ)
(hcount : successCount < trialCount) :
binomialProbabilityMass trialCount (successCount + 1) probability *
((successCount + 1 : ℕ) : ℝ) * (1 - probability) =
binomialProbabilityMass trialCount successCount probability *
((trialCount - successCount : ℕ) : ℝ) * probability := by sorrySource