Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (19) — lower threshold and gap identity

Proved
ShortTermDisclosure.Equilibrium.gap_identity

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

disclosure-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1shareholder-activismshort-termismvoluntary-disclosure

For 0<λ<10<\lambda<10<λ<1 and v2<μˉv_2<\bar\muv2​<μˉ​, the lower threshold equation

λμˉ+1−λ2v1−1+λ2v2=0\lambda\bar\mu+\frac{1-\lambda}{2}v_1-\frac{1+\lambda}{2}v_2=0λμˉ​+21−λ​v1​−21+λ​v2​=0

is equivalent to v1=1+λ1−λv2−2λ1−λμˉv_1=\frac{1+\lambda}{1-\lambda}v_2-\frac{2\lambda}{1-\lambda}\bar\muv1​=1−λ1+λ​v2​−1−λ2λ​μˉ​ and implies

v2−v1=2λ1−λ(μˉ−v2)>0.v_2-v_1=\frac{2\lambda}{1-\lambda}(\bar\mu-v_2)>0.v2​−v1​=1−λ2λ​(μˉ​−v2​)>0.

This identifies the positive width of the two-tailed withholding interval.

Preamble
import Mathlib
import Definitions.Def_ShortTermDisclosure_Equilibrium_Model
Formal statement
namespace ShortTermDisclosure.Equilibrium

theorem gap_identity (ell muhi v1 v2 : ℝ)
    (hell0 : 0 < ell) (hell1 : ell < 1) (hm : v2 < muhi) :
    (ell * muhi + (1 - ell) / 2 * v1 - (1 + ell) / 2 * v2 = 0 ↔
      v1 = (1 + ell) / (1 - ell) * v2 - 2 * ell / (1 - ell) * muhi) ∧
    (ell * muhi + (1 - ell) / 2 * v1 - (1 + ell) / 2 * v2 = 0 →
      v2 - v1 = 2 * ell / (1 - ell) * (muhi - v2) ∧ 0 < v2 - v1) := by sorry

end ShortTermDisclosure.Equilibrium
Source
Jia & Menon, Shareholder short-termism, corporate control and voluntary disclosure, authors' manuscript (SSRN 4029096, Minerva Access copy), pp. 38–39 (PDF 41–42), (19) and proof of Proposition 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