Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 4.3, (4.4) — integration by parts for ∫_[0,t] f(t−s)(1−G(t−s)) dZ(s)

Disproved
ManyServerFluid.Uniqueness.remark_4_3

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

fluid-limitp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstieltjes-integral

Let Z∈BV0[0,∞)Z \in BV_0[0,\infty)Z∈BV0​[0,∞) be a càdlàg function of bounded variation on bounded intervals with Z(0)=0Z(0) = 0Z(0)=0, let f∈Cb1(R+)f \in \mathcal C_b^1(\mathbb R_+)f∈Cb1​(R+​) and t≥0t \ge 0t≥0. Then

∫[0,t]f(t−s)(1−G(t−s)) dZ(s)=f(0)Z(t)+∫[0,t]f′(t−s)(1−G(t−s))Z(s) ds−∫[0,t]f(t−s) g(t−s) Z(s) ds.\int_{[0,t]} f(t-s)\big(1-G(t-s)\big)\,dZ(s) = f(0)Z(t) + \int_{[0,t]} f'(t-s)\big(1-G(t-s)\big)Z(s)\,ds - \int_{[0,t]} f(t-s)\,g(t-s)\,Z(s)\,ds.∫[0,t]​f(t−s)(1−G(t−s))dZ(s)=f(0)Z(t)+∫[0,t]​f′(t−s)(1−G(t−s))Z(s)ds−∫[0,t]​f(t−s)g(t−s)Z(s)ds.

This rewrites the Stieltjes term of the representation (4.3) through ZZZ itself rather than dZdZdZ; it is what makes the term continuous in ZZZ for the supremum norm, and so drives Lemma 4.5 and Theorem 4.6.

Formalization Note. ZZZ is Z1−Z2Z_1 - Z_2Z1​−Z2​ with Z1,Z2∈I0[0,∞)Z_1, Z_2 \in \mathcal I_0[0,\infty)Z1​,Z2​∈I0​[0,∞) and dZ=dZ1−dZ2dZ = dZ_1 - dZ_2dZ=dZ1​−dZ2​; fff is a C1C^1C1 function on R\mathbb RR with f,f′f, f'f,f′ bounded on [0,∞)[0,\infty)[0,∞) (a Cb1(R+)\mathcal C_b^1(\mathbb R_+)Cb1​(R+​) function, one-sided at 000, extends to one).

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

/-- Remark 4.3, (4.4), p. 52: for Z = Z₁ − Z₂ ∈ BV_0[0, ∞), f ∈ C_b^1(R₊) and t ≥ 0,
∫_[0,t] f(t − s)(1 − G(t − s)) dZ(s)
  = f(0)Z(t) + ∫_[0,t] f′(t − s)(1 − G(t − s)) Z(s) ds − ∫_[0,t] f(t − s) g(t − s) Z(s) ds. -/
theorem remark_4_3 (S : ServiceLaw) (Z₁ Z₂ : ℝ → ℝ) (hZ₁ : ServiceLaw.IsI0 Z₁)
    (hZ₂ : ServiceLaw.IsI0 Z₂) (f : ℝ → ℝ) (hf : IsCb1 f) (t : ℝ) (ht : 0 ≤ t) :
    bvInt Z₁ Z₂ (Icc 0 t) (fun s => f (t - s) * (1 - S.G (t - s))) =
      f 0 * (Z₁ t - Z₂ t)
      + ∫ s in Icc 0 t, deriv f (t - s) * (1 - S.G (t - s)) * (Z₁ s - Z₂ s)
      - ∫ s in Icc 0 t, f (t - s) * S.g (t - s) * (Z₁ s - Z₂ s) := 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. 52, Remark 4.3, (4.4)
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