Haldane's survival probability of a beneficial mutation
TheoremGenerating function of the Poisson distribution#✓fully proved
The Poisson(r) generating function: ∑ e^{-r} r^k / k! x^k = exp (r (x - 1)).
theorem pgf_poissonMeasure (r : ℝ≥0) (x : ℝ) :
pgf id (poissonMeasure r) x = exp (r * (x - 1))
noncomputable def pgf (X : Ω → ℕ) (μ : Measure Ω) (s : ℝ) : ℝ :=
∫ ω, s ^ X ω ∂μ
MathlibExt/Probability/ProbabilityGeneratingFunction.lean:47
Uses 1 · Used by 2
TheoremMean of the Poisson distribution#✓fully proved
The Poisson(r) law has mean r.
theorem mean_poissonMeasure (r : ℝ≥0) : GaltonWatson.mean (poissonMeasure r) = r
noncomputable def mean : ℝ≥0∞ :=
∫⁻ k, (k : ℝ≥0∞) ∂ν
MathlibExt/Probability/BranchingProcess/GaltonWatson.lean:69
Uses 1 · Used by 1
DefinitionHaldane's survival probability of a mutant#✓fully proved
Haldane's survival probability π(s) = 1 - q(s) of a mutant with selective advantage s
per generation, whose number of copies in the next generation is Poisson with mean 1 + s.
The model needs s ≥ -1; for s < -1 the mean is truncated to 0 (Real.toNNReal), the
mutant leaves no copies, and π(s) = 0.
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
noncomputable def extinctionProb : ℝ :=
⨆ n, (law ν n).real {0}
MathlibExt/Probability/BranchingProcess/GaltonWatson.lean:77
Uses 1 · Used by 5
TheoremHaldane's equation for the survival probability#✓fully proved
π(s) solves Haldane's equation 1 - π = exp (-(1 + s) π).
theorem one_sub_survivalProb {s : ℝ} (hs : -1 ≤ s) :
1 - survivalProb s = exp (-(1 + s) * survivalProb s)
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
MathlibExt/Biology/PopulationGenetics/Haldane.lean:193
TheoremBeneficial mutant survives with positive probability#✓fully proved
A beneficial mutant survives with positive probability.
theorem survivalProb_pos {s : ℝ} (hs : 0 < s) : 0 < survivalProb s
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
MathlibExt/Biology/PopulationGenetics/Haldane.lean:193
Uses 7 · Used by 1
TheoremSurvival probability is less than one#✓fully proved
The survival probability is less than 1: the mutant leaves no copies with positive
probability exp (-(1 + s)). (For s < -1, outside the model, π(s) = 0.)
theorem survivalProb_lt_one (s : ℝ) : survivalProb s < 1
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
MathlibExt/Biology/PopulationGenetics/Haldane.lean:193
TheoremNonnegativity of the survival probability#✓fully proved
The survival probability is non-negative.
theorem survivalProb_nonneg (s : ℝ) : 0 ≤ survivalProb s
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
MathlibExt/Biology/PopulationGenetics/Haldane.lean:193
TheoremHaldane's approximation \(\pi(s) \approx 2s\)#✓fully proved
Haldane's approximation (Haldane 1927): π(s) / s → 2 as s → 0⁺.
theorem tendsto_survivalProb_div :
Tendsto (fun s => survivalProb s / s) (𝓝[>] 0) (𝓝 2)
noncomputable def survivalProb (s : ℝ) : ℝ :=
1 - GaltonWatson.extinctionProb (poissonMeasure (1 + s).toNNReal)
MathlibExt/Biology/PopulationGenetics/Haldane.lean:193
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.