Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(3.2), p. 15 — expected net surplus of a midpoint peg: π_p = ((ϕ − d)/(1 + ω)) [ω + β(1 − ω)/(1 − βω)]

Proved
PegProtect.Equilibrium.equation_3_2

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

investor-surplusmarket-microstructurep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pegged-orders

Under the standing restrictions (c>0c>0c>0, 0≤d<10\le d<10≤d<1, φ>1\varphi>1φ>1, δ,ρ,ν>0\delta,\rho,\nu>0δ,ρ,ν>0, so that β=e−δ/ρ∈(0,1)\beta=e^{-\delta/\rho}\in(0,1)β=e−δ/ρ∈(0,1)) and for 0≤ω<10\le\omega<10≤ω<1, the expected net surplus of a midpoint peg order under the steady state qqq has the closed form

πp(ω)=(φ−d)[∑k=−∞−1qk+∑k=0∞qkβk+1]=φ−d1+ω[ω+β(1−ω)1−βω].\pi_p(\omega)=(\varphi-d)\Big[\sum_{k=-\infty}^{-1}q_k+\sum_{k=0}^{\infty}q_k\beta^{k+1}\Big]=\frac{\varphi-d}{1+\omega}\Big[\omega+\frac{\beta(1-\omega)}{1-\beta\omega}\Big].πp​(ω)=(φ−d)[k=−∞∑−1​qk​+k=0∑∞​qk​βk+1]=1+ωφ−d​[ω+1−βωβ(1−ω)​].

A peg executes at once against a resting contra-side peg, and otherwise waits behind kkk same-side pegs and is discounted by βk+1\beta^{k+1}βk+1. The closed form is the left-hand side of the indifference condition (3.9).

Formalization Note The page writes this display for ω∈(0,1)\omega\in(0,1)ω∈(0,1); it is stated for 0≤ω<10\le\omega<10≤ω<1 so that the corner ω=0\omega=0ω=0 of Definition 3.1 is covered.

Preamble
import Mathlib
import Definitions.Def_PegProtect_Equilibrium_Model
Formal statement
namespace PegProtect.Equilibrium

theorem equation_3_2 (P : Params) (hP : P.Standing) (ω : ℝ) (h0 : 0 ≤ ω) (h1 : ω < 1) :
    piP P ω = (P.phi - P.d) / (1 + ω) * (ω + P.beta * (1 - ω) / (1 - P.beta * ω)) := by sorry

end PegProtect.Equilibrium
Source
Aldrich & Friedman, Order Protection through Delayed Messaging, SSRN 2999059 (version of March 3, 2019), p. 15, §3.3, (3.2)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

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