Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, (56), p. 12 — unique minimum-fluctuation rates for a prescribed mean

Proved
KendallBD.MinVar.min_fluctuation

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

birth-death-processminimum-fluctuationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1variance

Let nˉ\bar nnˉ be a positive C1C^1C1 mean curve with nˉ0=1\bar n_0=1nˉ0​=1 and write g(t)=nˉt′/nˉtg(t)=\bar n_t'/\bar n_tg(t)=nˉt′​/nˉt​. Set λ∗(t)=max⁡{g(t),0}\lambda_*(t)=\max\{g(t),0\}λ∗​(t)=max{g(t),0} and μ∗(t)=max⁡{−g(t),0}\mu_*(t)=\max\{-g(t),0\}μ∗​(t)=max{−g(t),0}. Then:

  1. These are continuous nonnegative rates that give the mean nˉ\bar nnˉ.
  2. For every other continuous nonnegative rate pair λ,μ\lambda,\muλ,μ with the same mean and every t≥0t\ge0t≥0,
Vλ∗,μ∗(t)≤Vλ,μ(t).V_{\lambda_*,\mu_*}(t)\le V_{\lambda,\mu}(t).Vλ∗​,μ∗​​(t)≤Vλ,μ​(t).
  1. If equality holds for every t≥0t\ge0t≥0, then λ(t)=λ∗(t)\lambda(t)=\lambda_*(t)λ(t)=λ∗​(t) and μ(t)=μ∗(t)\mu(t)=\mu_*(t)μ(t)=μ∗​(t) for every t≥0t\ge0t≥0.

Thus the pair simultaneously minimizes the variance throughout the entire time course and is the unique pair doing so. On a decreasing, increasing or constant interval of nˉ\bar nnˉ, this is precisely the respective case of (56).

Formalization Note The positive-and-negative-part formula applies to every positive C1C^1C1 mean, extending Kendall's presentation, which assumes a partition into monotonicity intervals. Strict positivity on all real times makes the candidate rates continuous; the conclusions concern nonnegative time only. The variance is represented by (14c), rather than by a separately constructed probability law.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_KendallBD_MinVar_Setting
Formal statement
namespace KendallBD.MinVar

/-- Kendall (1948), (56), p. 12: the unique rate pair minimizing variance
simultaneously at all nonnegative times for a prescribed mean. -/
theorem min_fluctuation (nbar : ℝ → ℝ)
    (hn : ContDiff ℝ 1 nbar) (hpos : ∀ t, 0 < nbar t) (h0 : nbar 0 = 1) :
    (Admissible (lamStar nbar) (muStar nbar) ∧
      HasMean (lamStar nbar) (muStar nbar) nbar) ∧
    (∀ lam mu : ℝ → ℝ, Admissible lam mu → HasMean lam mu nbar →
      ∀ t : ℝ, 0 ≤ t →
        fluct (lamStar nbar) (muStar nbar) t ≤ fluct lam mu t) ∧
    (∀ lam mu : ℝ → ℝ, Admissible lam mu → HasMean lam mu nbar →
      (∀ t : ℝ, 0 ≤ t →
        fluct lam mu t = fluct (lamStar nbar) (muStar nbar) t) →
      ∀ t : ℝ, 0 ≤ t →
        lam t = lamStar nbar t ∧ mu t = muStar nbar t) := by sorry

end KendallBD.MinVar
Source
Kendall, On the generalized "birth-and-death" process, Ann. Math. Statist. 19 (1948), §6, (56) and preceding paragraph, p. 12; variance (14c), p. 4
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me