Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2.1 — exponential race: P(ζi=min⁡jζj)=λi/∑jλjP(\zeta_i=\min_j\zeta_j)=\lambda_i/\sum_j\lambda_jP(ζi​=minj​ζj​)=λi​/∑j​λj​

Proved
KTaxi.Competitive.theorem_2_1

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

exponential-distributionp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let ζ1,…,ζm\zeta_1,\dots,\zeta_mζ1​,…,ζm​ be independent real random variables on a probability space, with ζi∼Exp(λi)\zeta_i\sim\mathrm{Exp}(\lambda_i)ζi​∼Exp(λi​) and λi>0\lambda_i>0λi​>0. Then for every iii,

P(ζi=min⁡1≤j≤mζj)=λi∑j=1mλj.P\Bigl(\zeta_i=\min_{1\le j\le m}\zeta_j\Bigr)=\frac{\lambda_i}{\sum_{j=1}^m\lambda_j}.P(ζi​=1≤j≤mmin​ζj​)=∑j=1m​λj​λi​​.

Among independent exponential random variables, the probability that a given one is the smallest is proportional to its rate. It gives the selection probabilities wi/(diZm)w_i/(d_iZ_m)wi​/(di​Zm​) of Algorithm 1.

Formalization Note The variables are measurable maps ζ : Fin m → Ω → ℝ with iIndepFun ζ P and P.map (ζ i) = expMeasure (rate i). The event is {ω:ζi(ω)≤ζj(ω) ∀j}\{\omega:\zeta_i(\omega)\le\zeta_j(\omega)\ \forall j\}{ω:ζi​(ω)≤ζj​(ω) ∀j}, and the probability is compared in ℝ≥0∞.

Differences from the source:

  • encoding: ζ_i = min_j ζ_j → ζ_i ≤ ζ_j for every j; reason: the same event
  • encoding: indices 1, …, m → Fin m (0-based); reason: Lean convention; same instances
Preamble
import Mathlib

open MeasureTheory ProbabilityTheory
Formal statement
namespace KTaxi.Competitive

/-- **Theorem 2.1** (exponential race; Coester–Huang–Poon, STOC 2027 #96, PDF p. 4).
Let `ζ₁, …, ζ_m` be independent real random variables on a probability space with
`ζ_i ∼ Exp(λ_i)` and `λ_i > 0`. Then for every `i`,
`P(ζ_i = min_j ζ_j) = λ_i / ∑_j λ_j`. -/
theorem theorem_2_1 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    {m : ℕ} (ζ : Fin m → Ω → ℝ) (rate : Fin m → ℝ) (hrate : ∀ i, 0 < rate i)
    (hmeas : ∀ i, Measurable (ζ i)) (hind : iIndepFun ζ P)
    (hlaw : ∀ i, P.map (ζ i) = expMeasure (rate i)) (i : Fin m) :
    P {ω | ∀ j, ζ i ω ≤ ζ j ω} = ENNReal.ofReal (rate i / ∑ j, rate j) := by sorry

end KTaxi.Competitive
Source
Christian Coester, Yichen Huang, Tze-Yang Poon, The k-Taxi Problem Is Competitive on All Metrics, STOC 2027 submission #96 (October 2026; PDF SHA-256 09242267e431f586117500ee75c63e6f203519f497d01ee4d90d6989341648ed), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/96.pdf, Theorem 2.1, PDF p. 4 (printed p. 3)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 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