Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 1332 — problem (13) is separable in γ (F-a.e.)

Proved
FragLOB.Collapse.proof_thm1_separable

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

limit-order-bookp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1routing-equilibriumstate-space-collapse

Let FFF be a probability distribution of investor types on [0,∞)[0,\infty)[0,∞) with finite mean ∫γ dF(γ)<∞\int\gamma\,dF(\gamma) < \infty∫γdF(γ)<∞. Fix arbitrary delays d1,…,dN∈Rd_1,\dots,d_N \in \mathbb Rd1​,…,dN​∈R and write uγ(p)=p0γr~0+∑i=1Npi(γr~i−di)u_\gamma(p) = p_0\gamma\tilde r_0 + \sum_{i=1}^N p_i(\gamma\tilde r_i - d_i)uγ​(p)=p0​γr~0​+∑i=1N​pi​(γr~i​−di​) for the payoff of a type-γ\gammaγ investor using the routing vector ppp. Let π∈P\pi \in \mathcal Pπ∈P be a routing decision (measurable, with π(γ)\pi(\gamma)π(γ) in the simplex for every γ≥0\gamma \ge 0γ≥0). Then π\piπ maximizes the aggregate payoff over all routing decisions,

∫0∞uγ(π′(γ)) dF(γ)≤∫0∞uγ(π(γ)) dF(γ)for all π′∈P,\int_0^\infty u_\gamma(\pi'(\gamma))\,dF(\gamma) \le \int_0^\infty u_\gamma(\pi(\gamma))\,dF(\gamma) \quad\text{for all } \pi' \in \mathcal P,∫0∞​uγ​(π′(γ))dF(γ)≤∫0∞​uγ​(π(γ))dF(γ)for all π′∈P,

if and only if, for FFF-almost every type γ\gammaγ, π(γ)\pi(\gamma)π(γ) maximizes uγu_\gammauγ​ over the simplex {p:pi≥0, ∑i=0Npi=1}\{p : p_i \ge 0,\ \sum_{i=0}^N p_i = 1\}{p:pi​≥0, ∑i=0N​pi​=1}.

This is the separability of problem (13) in γ\gammaγ invoked in the proof of Theorem 1: it turns optimality of the aggregated problem into individual rationality (10), type by type, and back.

Formalization Note. The pointwise statement holds only FFF-almost everywhere: changing π\piπ on an FFF-null set of types does not change any integral, so optimality in (13) cannot force rationality at every single type (for N=1N=1N=1, λ1=0\lambda_1 = 0λ1​=0, Λ=2\Lambda = 2Λ=2, μ=β1=1\mu = \beta_1 = 1μ=β1​=1, r~=(−1,1)\tilde r = (-1, 1)r~=(−1,1) and FFF exponential, altering the threshold policy at γ=5\gamma = 5γ=5 keeps it optimal but makes type 555 irrational). The finite mean makes every objective a genuine (integrable) integral; without it Lean's integral of a non-integrable function would be 000.

Preamble
import Mathlib
import Definitions.Def_FragLOB_Collapse_Model

open MeasureTheory
Formal statement
namespace FragLOB.Collapse

theorem proof_thm1_separable {N : ℕ} (M : Market N) (F : Measure ℝ) [IsProbabilityMeasure F]
    (hF : F (Set.Iio 0) = 0) (hmean : Integrable (fun γ => γ) F) (d : Fin N → ℝ)
    (pi : ℝ → Fin (N + 1) → ℝ) (hpi : IsRouting pi) :
    (∀ pi' : ℝ → Fin (N + 1) → ℝ, IsRouting pi' →
        ∫ γ, payoff M d γ (pi' γ) ∂F ≤ ∫ γ, payoff M d γ (pi γ) ∂F) ↔
      ∀ᵐ γ ∂F, IsBestResponse M d γ (pi γ) := by sorry

end FragLOB.Collapse
Source
Maglaras, Moallemi & Zheng, Operations Research 69(4):1324–1348 (2021), p. 1332, proof of Theorem 1 (separability of (13) with respect to γ)
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