Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.2, p. 18 — the root ω̂ of (3.9) is < 1, and ω̂ ≤ 0 implies π_p(0) ≤ π_m(0)

Proved
PegProtect.Equilibrium.boundary

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

corner-solutionmarket-equilibriump2o-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, β=e−δ/ρ\beta=e^{-\delta/\rho}β=e−δ/ρ), let

ω^=φ−d−β−1(φ−1)1−d\hat\omega=\frac{\varphi-d-\beta^{-1}(\varphi-1)}{1-d}ω^=1−dφ−d−β−1(φ−1)​

be the last expression of (3.9). Then

  1. ω^<1\hat\omega<1ω^<1;
  2. if ω^≤0\hat\omega\le0ω^≤0, then πp(0)≤πm(0)\pi_p(0)\le\pi_m(0)πp​(0)≤πm​(0): when no investor uses pegs, a peg order earns no more than a market order.

These are the two boundary claims of the proof of Proposition 3.2: the first rules out ω∗=1\omega^*=1ω∗=1, the second makes ω∗=0\omega^*=0ω∗=0 an equilibrium share when the root is not positive.

Formalization Note The paper states the second claim for a negative root; at ω^=0\hat\omega=0ω^=0 it holds with equality, so it is stated for ω^≤0\hat\omega\le0ω^≤0. The first claim uses φ>1\varphi>1φ>1 and β<1\beta<1β<1.

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

theorem boundary (P : Params) (hP : P.Standing) :
    omegaHat P < 1 ∧ (omegaHat P ≤ 0 → piP P 0 ≤ piM P 0) := by sorry

end PegProtect.Equilibrium
Source
Aldrich & Friedman, Order Protection through Delayed Messaging, SSRN 2999059 (version of March 3, 2019), p. 18, proof of Proposition 3.2, paragraph after (3.9)
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