Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 — the age equation (4.2) holds iff ν̄ has the representation (4.3)

Disproved
ManyServerFluid.Uniqueness.theorem_4_1

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

age-equationfluid-limitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingtransport-equation

Let {νˉs}s≥0∈DM[0,M)[0,∞)\{\bar\nu_s\}_{s\ge0} \in \mathcal D_{\mathcal M[0,M)}[0,\infty){νˉs​}s≥0​∈DM[0,M)​[0,∞) be a vaguely càdlàg path of Radon measures on [0,M)[0,M)[0,M) such that for every m∈[0,M)m \in [0,M)m∈[0,M) and T∈[0,∞)T \in [0,\infty)T∈[0,∞) there is C(m,T)<∞C(m,T) < \inftyC(m,T)<∞ with

∣∫0∞⟨φ(⋅,s)h(⋅),νˉs⟩ds∣≤C(m,T)∥φ∥∞(4.1)\Big|\int_0^\infty\langle\varphi(\cdot,s)h(\cdot),\bar\nu_s\rangle ds\Big| \le C(m,T)\|\varphi\|_\infty \qquad (4.1)​∫0∞​⟨φ(⋅,s)h(⋅),νˉs​⟩ds​≤C(m,T)∥φ∥∞​(4.1)

for every φ∈Cc([0,M)×[0,∞))\varphi \in \mathcal C_c([0,M)\times[0,\infty))φ∈Cc​([0,M)×[0,∞)) with support in [0,m]×[0,T][0,m]\times[0,T][0,m]×[0,T]. Let υ0∈M[0,M)\upsilon_0 \in \mathcal M[0,M)υ0​∈M[0,M) and Z∈BV0[0,∞)Z \in BV_0[0,\infty)Z∈BV0​[0,∞). Then νˉ\bar\nuνˉ satisfies the age equation (4.2) for υ0\upsilon_0υ0​ and ZZZ if and only if for every f∈Cc(R+)f \in \mathcal C_c(\mathbb R_+)f∈Cc​(R+​) and t≥0t \ge 0t≥0

∫[0,M)f(x) νˉt(dx)=∫[0,M)f(x+t)1−G(x+t)1−G(x) υ0(dx)+∫[0,t]f(t−s)(1−G(t−s)) dZ(s).(4.3)\int_{[0,M)} f(x)\,\bar\nu_t(dx) = \int_{[0,M)} f(x+t)\frac{1-G(x+t)}{1-G(x)}\,\upsilon_0(dx) + \int_{[0,t]} f(t-s)\big(1-G(t-s)\big)\,dZ(s). \qquad (4.3)∫[0,M)​f(x)νˉt​(dx)=∫[0,M)​f(x+t)1−G(x)1−G(x+t)​υ0​(dx)+∫[0,t]​f(t−s)(1−G(t−s))dZ(s).(4.3)

Moreover, if υ0\upsilon_0υ0​ is finite, the age equation implies (4.3) for every f∈Cb(R+)f \in \mathcal C_b(\mathbb R_+)f∈Cb​(R+​).

This is the explicit solution of the transport equation with killing rate hhh and boundary input dZdZdZ: mass present initially ages and survives with the conditional probability (1−G(x+t))/(1−G(x))(1-G(x+t))/(1-G(x))(1−G(x+t))/(1−G(x)), and mass entering at time sss survives to age t−st-st−s with probability 1−G(t−s)1-G(t-s)1−G(t−s). Substituting υ0=νˉ0\upsilon_0 = \bar\nu_0υ0​=νˉ0​ and Z=KˉZ = \bar KZ=Kˉ gives the representation (3.11) of fluid solutions.

Formalization Note. υ0\upsilon_0υ0​ is any Radon measure on [0,M)[0,M)[0,M); nothing ties it to νˉ0\bar\nu_0νˉ0​ (Remark 4.2). f∈Cc(R+)f \in \mathcal C_c(\mathbb R_+)f∈Cc​(R+​) is represented by a continuous compactly supported fff on R\mathbb RR and f∈Cb(R+)f \in \mathcal C_b(\mathbb R_+)f∈Cb​(R+​) by a bounded continuous function on R\mathbb RR; only values on [0,∞)[0,\infty)[0,∞) are read. Z=Z1−Z2Z = Z_1 - Z_2Z=Z1​−Z2​ with Zi∈I0Z_i \in \mathcal I_0Zi​∈I0​. The integrals in (4.2) are taken in xxx for each sss, then in sss over [0,t][0,t][0,t].

Preamble
import Mathlib
import Definitions.Def_ManyServerFluid_Uniqueness_Model
import Definitions.Def_ManyServerFluid_Uniqueness_AgeEquation
open MeasureTheory Filter Topology Set
open scoped ENNReal BoundedContinuousFunction
Formal statement
namespace ManyServerFluid.Uniqueness

/-- Theorem 4.1, p. 51: for a vaguely càdlàg path ν of Radon measures on [0, M) satisfying (4.1),
any υ_0 ∈ M[0, M) and Z = Z₁ − Z₂ ∈ BV_0[0, ∞), the age equation (4.2) holds iff the
representation (4.3) holds for every f ∈ C_c(R₊) and t ≥ 0; if moreover υ_0 is finite, (4.2)
gives (4.3) for every f ∈ C_b(R₊). -/
theorem theorem_4_1 (S : ServiceLaw) (ν : ℝ → Measure ℝ) (hν : S.IsVagueCadlag ν)
    (hh : S.HazardBound ν) (υ0 : Measure ℝ) (hυ0 : S.IsRadonAges υ0)
    (Z₁ Z₂ : ℝ → ℝ) (hZ₁ : ServiceLaw.IsI0 Z₁) (hZ₂ : ServiceLaw.IsI0 Z₂) :
    (S.AgeEq υ0 Z₁ Z₂ ν ↔
      ∀ f : ℝ → ℝ, Continuous f → HasCompactSupport f → ∀ t, 0 ≤ t →
        ∫ x, f x ∂(ν t) = S.ageRep υ0 Z₁ Z₂ f t) ∧
    (IsFiniteMeasure υ0 → S.AgeEq υ0 Z₁ Z₂ ν →
      ∀ f : ℝ →ᵇ ℝ, ∀ t, 0 ≤ t → ∫ x, f x ∂(ν t) = S.ageRep υ0 Z₁ Z₂ f t) := by sorry

end ManyServerFluid.Uniqueness
Source
Kaspi and Ramanan, Law of Large Numbers Limits for Many-Server Queues, Ann. Appl. Probab. 21(1) (2011), p. 51, Theorem 4.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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