Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 2, p. 26 — |C(s)| = C(K−1, d−1) and the arrival rate of copies to a server is λC(K−1,d−1)/C(K,d) = λd/K

Proved
RedundancyStab.IID.copy_arrival_rate

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

combinatoricsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingredundancy

Let 1≤d≤K1\le d\le K1≤d≤K, let CCC be the set of ddd-element subsets of the servers S={1,…,K}S=\{1,\dots,K\}S={1,…,K} and C(s)={c∈C:s∈c}C(s)=\{c\in C: s\in c\}C(s)={c∈C:s∈c}. Types arrive at rate λ/(Kd)\lambda/\binom{K}{d}λ/(dK​) each, so copies arrive at server sss at rate ∣C(s)∣ λ/(Kd)|C(s)|\,\lambda/\binom{K}{d}∣C(s)∣λ/(dK​). Then ∣C(s)∣=(K−1d−1)|C(s)|=\binom{K-1}{d-1}∣C(s)∣=(d−1K−1​) and

λ(K−1d−1)(Kd)=λdK.\frac{\lambda\binom{K-1}{d-1}}{\binom{K}{d}}=\frac{\lambda d}{K}.(dK​)λ(d−1K−1​)​=Kλd​.

This is the arrival term of the drift (14) of the number of copies at a server.

Formalization Note The real number λ\lambdaλ is arbitrary (the identity is linear in it); typesAt K d s is C(s)C(s)C(s).

Preamble
import Mathlib
import Definitions.Def_RedundancyStab_IID_Model
Formal statement
namespace RedundancyStab.IID

theorem copy_arrival_rate (K d : ℕ) (hd : 1 ≤ d) (hdK : d ≤ K) (lam : ℝ) (s : Fin K) :
    (typesAt K d s).card = (K - 1).choose (d - 1) ∧
      ((typesAt K d s).card : ℝ) * lam / (K.choose d : ℝ) = lam * d / K := by sorry

end RedundancyStab.IID
Source
Anton, Ayesta, Jonckheere & Verloop, On the stability of redundancy models, arXiv:1903.04414v2, p. 26, proof of Lemma 2 (and |C(s)| on p. 5)
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 19, 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