Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.4 — reflection of linearly centered paths

Proved
WhittFLT.Reflection.theorem_6_4

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

heavy-trafficp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1reflectionskorohod-space

Let TTT be a real interval with closed left endpoint 000. Let xn,x∈D(T,R)x_n,x\in D(T,\mathbb R)xn​,x∈D(T,R) and cn∈Rc_n\in\mathbb Rcn​∈R, suppose xn−cne→xx_n-c_ne\to xxn​−cn​e→x in J1J_1J1​, and assume x(0)=0x(0)=0x(0)=0. For f(z)=z−z↓f(z)=z-z^{\downarrow}f(z)=z−z↓ and e(t)=te(t)=te(t)=t:

  1. If cn→cc_n\to ccn​→c, then f(xn)→f(x+ce)f(x_n)\to f(x+ce)f(xn​)→f(x+ce) in J1J_1J1​.
  2. If cn→+∞c_n\to+\inftycn​→+∞, then f(xn)−cne→xf(x_n)-c_ne\to xf(xn​)−cn​e→x in J1J_1J1​.
  3. If cn→−∞c_n\to-\inftycn​→−∞ and xxx has no positive jumps, then f(xn)→0f(x_n)\to0f(xn​)→0 uniformly on compact subintervals of TTT.

The three conclusions describe how the reflecting barrier behaves under finite, large positive, and large negative linear drifts.

Formalization Note Membership in DDD is included in the J1J_1J1​ hypothesis. The paper’s standing assumptions that TTT is an interval, 000 is its closed left endpoint, and S=RS=\mathbb RS=R are explicit. Paths are total functions on R\mathbb RR; convergence is sequential and uses the extended nonnegative metric. The paper’s fff subtracts the entire running infimum.

Preamble
import Mathlib
import Definitions.Def_WhittFLT_Reflection_Supremum
Formal statement
namespace WhittFLT.Reflection

open Set Filter Topology

/-- Whitt (1980), Theorem 6.4, p. 81. -/
theorem theorem_6_4 (T : Set ℝ) (hT : T.OrdConnected) (h0 : IsLeast T 0)
    (xs : ℕ → ℝ → ℝ) (x : ℝ → ℝ) (c : ℕ → ℝ)
    (hconv : WhittFLT.Composition.J1Tendsto T (fun n t => xs n t - c n * t) x) (hx0 : x 0 = 0) :
    (∀ c₀ : ℝ, Tendsto c atTop (𝓝 c₀) →
      WhittFLT.Composition.J1Tendsto T (fun n => barrier (xs n)) (barrier (fun t => x t + c₀ * t))) ∧
    (Tendsto c atTop atTop →
      WhittFLT.Composition.J1Tendsto T (fun n t => barrier (xs n) t - c n * t) x) ∧
    (Tendsto c atTop atBot → NoPosJump T x →
      WhittFLT.Composition.UTendsto T (fun n => barrier (xs n)) (fun _ => 0)) := by sorry

end WhittFLT.Reflection
Source
Whitt, Some Useful Functions for Functional Limit Theorems, Math. Oper. Res. 5(1) (1980), Theorem 6.4, p. 81
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