Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 1 with (16)–(17), p. 19 — under the LPs' no-default constraint the optimal early call is [max{x̲, x̂}, x̄] or x̂(λ, δ)

Proved
PELiquidity.Primary.proposition_1

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

contract-designliquidityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1private-equity

Fix the model parameters and an LP discount factor δ∈(0,1)\delta\in(0,1)δ∈(0,1). Write 1+r(λ,δ)=1/(1−λ(1−δ))1+r(\lambda,\delta)=1/(1-\lambda(1-\delta))1+r(λ,δ)=1/(1−λ(1−δ)), x^(λ,δ)=1−δ/(1−λ(1−δ))\hat x(\lambda,\delta)=1-\delta/(1-\lambda(1-\delta))x^(λ,δ)=1−δ/(1−λ(1−δ)), δ^(λ)=1−p/(p+(1−λ)q)\hat\delta(\lambda)=1-p/(p+(1-\lambda)q)δ^(λ)=1−p/(p+(1−λ)q), x‾=q/(p+q)\underline x=q/(p+q)x​=q/(p+q) and xˉ=p/(p+q)\bar x=p/(p+q)xˉ=p/(p+q). Consider pairs (x,f)(x,f)(x,f) with x∈[0,1]x\in[0,1]x∈[0,1], fff satisfying limited liability and incentive compatibility, and the no-default constraint (5b)

1−x≤δ (1+r(λ,δ)).1-x\le\delta\,(1+r(\lambda,\delta)).1−x≤δ(1+r(λ,δ)).

Call xxx an optimal early call if some such pair (x,f)(x,f)(x,f) minimizes the expected fee fˉ\bar ffˉ​ over all such pairs. Then

  1. if δ≥δ^(λ)\delta\ge\hat\delta(\lambda)δ≥δ^(λ), the optimal early calls form the interval [max⁡{x‾,x^(λ,δ)},xˉ]\big[\max\{\underline x,\hat x(\lambda,\delta)\},\bar x\big][max{x​,x^(λ,δ)},xˉ], and the minimal expected fee is p2B/(p2−q2)p^2B/(p^2-q^2)p2B/(p2−q2);
  2. if δ<δ^(λ)\delta<\hat\delta(\lambda)δ<δ^(λ), the only optimal early call is x∗=x^(λ,δ)x^*=\hat x(\lambda,\delta)x∗=x^(λ,δ), the minimal expected fee is pBp−qx^(λ,δ)\frac{pB}{p-q}\hat x(\lambda,\delta)p−qpB​x^(λ,δ), and every admissible pair has expected fee strictly above the undistorted fee p2B/(p2−q2)p^2B/(p^2-q^2)p2B/(p2−q2).

The LPs' commitment problem thus forces GPs facing illiquid LPs to call too much capital early, which raises the fee and lowers fund size.

Formalization Note The printed definition "xˉ=1−xˉ\bar x=1-\bar xxˉ=1−xˉ" is a slip for xˉ=1−x‾=p/(p+q)\bar x=1-\underline x=p/(p+q)xˉ=1−x​=p/(p+q). The printed "inefficiently accelerates capital calls if δ≤δ^(λ)\delta\le\hat\delta(\lambda)δ≤δ^(λ)" holds only strictly: at δ=δ^(λ)\delta=\hat\delta(\lambda)δ=δ^(λ) one has x^=xˉ\hat x=\bar xx^=xˉ and no distortion, so item 2 is stated for δ<δ^(λ)\delta<\hat\delta(\lambda)δ<δ^(λ).

Preamble
import Mathlib
import Definitions.Def_PELiquidity_Primary_Setting
Formal statement
namespace PELiquidity.Primary

/-- Proposition 1 with (16)–(17): under the no-default constraint (5b),
`1 - x ≤ δ (1 + r(λ, δ))`, the optimal first calls are `[max {x̲, x̂(λ, δ)}, x̄]` when
`δ ≥ δ̂(λ)` and `x̂(λ, δ)` alone when `δ < δ̂(λ)`; the minimal expected fee is (15) at
the optimal call, and for `δ < δ̂(λ)` every feasible fee strictly exceeds the undistorted
`p²B/(p² - q²)`. -/
theorem proposition_1 (P : Params) (δ : ℝ) (hδ0 : 0 < δ) (hδ1 : δ < 1) :
    let c := δ * grossReturn P.lam δ
    let IsFeasibleCall : ℝ → (Outcome → ℝ) → Prop := fun x f =>
      0 ≤ x ∧ x ≤ 1 ∧ 1 - x ≤ c ∧ IsLimitedLiability P.R x f ∧ IsIC P.p P.q P.B x f
    let IsOptimalCall : ℝ → Prop := fun x =>
      ∃ f : Outcome → ℝ, IsFeasibleCall x f ∧
        ∀ (x' : ℝ) (f' : Outcome → ℝ), IsFeasibleCall x' f' →
          expectedFee P.p P.p f ≤ expectedFee P.p P.p f'
    (deltaHat P.p P.q P.lam ≤ δ →
      {x | IsOptimalCall x} = Set.Icc (max (xLow P.p P.q) (xHat P.lam δ)) (xBar P.p P.q) ∧
      IsLeast {v | ∃ x f, IsFeasibleCall x f ∧ v = expectedFee P.p P.p f}
        (P.p ^ 2 * P.B / (P.p ^ 2 - P.q ^ 2))) ∧
    (δ < deltaHat P.p P.q P.lam →
      {x | IsOptimalCall x} = {xHat P.lam δ} ∧
      IsLeast {v | ∃ x f, IsFeasibleCall x f ∧ v = expectedFee P.p P.p f}
        (P.p * P.B / (P.p - P.q) * xHat P.lam δ) ∧
      ∀ (x : ℝ) (f : Outcome → ℝ), IsFeasibleCall x f →
        P.p ^ 2 * P.B / (P.p ^ 2 - P.q ^ 2) < expectedFee P.p P.p f) := by sorry

end PELiquidity.Primary
Source
Maurin, Robinson & Strömberg, A Theory of Liquidity in Private Equity, working paper (draft of December 2020), p. 19, Proposition 1, (16), (17)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me