Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(12), §3.2, p. 1331 — the expected delay on every exchange is W/(μβ_i)

Proved
FragLOB.Collapse.eq_12

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

limit-order-bookp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingworkload

Consider the fragmented limit order book market with NNN exchanges, market-order rate μ>0\mu > 0μ>0 and attraction coefficients βi>0\beta_i > 0βi​>0. Let Q∈R+NQ \in \mathbb R^N_+Q∈R+N​ be a vector of queue lengths with positive workload W=∑i=1NβiQi>0W = \sum_{i=1}^N \beta_i Q_i > 0W=∑i=1N​βi​Qi​>0, and let the market orders be split by the linear attraction model μi(Q)=μβiQi/W\mu_i(Q) = \mu\beta_i Q_i/Wμi​(Q)=μβi​Qi​/W. Then the expected delay on every exchange iii is

EDi=Wμβi.\mathrm{ED}_i = \frac{W}{\mu\beta_i}.EDi​=μβi​W​.

So the one-dimensional workload determines the delays at all exchanges at once. This is the identity (12) of the paper and the first ingredient of state space collapse.

Formalization Note. For Qi>0Q_i > 0Qi​>0 the delay is defined by (1) as Qi/μi(Q)Q_i/\mu_i(Q)Qi​/μi​(Q), and the statement is the identity Qi/μi(Q)=W/(μβi)Q_i/\mu_i(Q) = W/(\mu\beta_i)Qi​/μi​(Q)=W/(μβi​). At an empty exchange (Qi=0Q_i = 0Qi​=0), where (1) reads 0/00/00/0, the delay is defined as W/(μβi)W/(\mu\beta_i)W/(μβi​), so the claim there holds by that convention.

Preamble
import Mathlib
import Definitions.Def_FragLOB_Collapse_Model

open MeasureTheory
Formal statement
namespace FragLOB.Collapse

theorem eq_12 {N : ℕ} (M : Market N) (hM : M.Standing) (Q : Fin N → ℝ)
    (hQ : ∀ i, 0 ≤ Q i) (hW : 0 < workload M Q) :
    ∀ i, delay M Q i = workload M Q / (M.mu * M.beta i) := by sorry

end FragLOB.Collapse
Source
Maglaras, Moallemi & Zheng, Operations Research 69(4):1324–1348 (2021), p. 1331, §3.2, eq. (12)
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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