Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2, p. 18 — the minimal expected IC fee is (15), and x ∈ [q/(p+q), p/(p+q)] minimizes it

Proved
PELiquidity.Primary.lemma_2

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

contract-designlinear-programmingmoral-hazardp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1private-equity

Let 0<q<p≤10<q<p\le 10<q<p≤1, B>0B>0B>0 and B≤p(p−q)RB\le p(p-q)RB≤p(p−q)R. For a share x∈[0,1]x\in[0,1]x∈[0,1] of the fund invested in period 0, consider the fee schedules fff satisfying limited liability (2) and incentive compatibility (effort on both investments). The minimal expected fee fˉ\bar ffˉ​ over these schedules is

fˉx∗={pBp−q(1−x)x∈[0,qp+q],p2Bp2−q2x∈[qp+q,pp+q],pBp−q xx∈[pp+q,1],(15)\bar f^*_x=\begin{cases}\dfrac{pB}{p-q}(1-x) & x\in\big[0,\tfrac{q}{p+q}\big],\\[2mm] \dfrac{p^2B}{p^2-q^2} & x\in\big[\tfrac{q}{p+q},\tfrac{p}{p+q}\big],\\[2mm] \dfrac{pB}{p-q}\,x & x\in\big[\tfrac{p}{p+q},1\big],\end{cases}\qquad(15)fˉ​x∗​=⎩⎨⎧​p−qpB​(1−x)p2−q2p2B​p−qpB​x​x∈[0,p+qq​],x∈[p+qq​,p+qp​],x∈[p+qp​,1],​(15)

and the minimum is attained. Moreover, a share x∈[0,1]x\in[0,1]x∈[0,1] belongs to a pair (x,f)(x,f)(x,f) minimizing the expected fee over all x′∈[0,1]x'\in[0,1]x′∈[0,1] and all admissible schedules if and only if

x∈[qp+q,pp+q].x\in\Big[\frac{q}{p+q},\frac{p}{p+q}\Big].x∈[p+qq​,p+qp​].

The minimal fee is U-shaped in xxx: spreading the fund over two investments lets the GP be paid only after a joint success, which is the most informative outcome about effort (cross-pledging).

Formalization Note The hypothesis B≤p(p−q)RB\le p(p-q)RB≤p(p−q)R guarantees that the incentive-compatible fee paid on joint success never exceeds the cash flow RRR, so that limited liability can be met at every xxx. Fees are indexed by the four outcomes.

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

/-- Lemma 2: the minimal expected fee over limited-liability, incentive-compatible fee
schedules, for a first call `x ∈ [0, 1]`, is (15); and the call fractions `x` that are
part of an unconstrained fee-minimizing pair `(x, f)` are exactly `[q/(p+q), p/(p+q)]`. -/
theorem lemma_2 (p q B R : ℝ) (hq : 0 < q) (hqp : q < p) (hp1 : p ≤ 1) (hB : 0 < B)
    (hLL : B ≤ p * (p - q) * R) :
    (∀ x : ℝ, 0 ≤ x → x ≤ xLow p q →
      IsLeast {v | ∃ f : Outcome → ℝ, IsLimitedLiability R x f ∧ IsIC p q B x f ∧
          v = expectedFee p p f}
        (p * B / (p - q) * (1 - x))) ∧
    (∀ x : ℝ, xLow p q ≤ x → x ≤ xBar p q →
      IsLeast {v | ∃ f : Outcome → ℝ, IsLimitedLiability R x f ∧ IsIC p q B x f ∧
          v = expectedFee p p f}
        (p ^ 2 * B / (p ^ 2 - q ^ 2))) ∧
    (∀ x : ℝ, xBar p q ≤ x → x ≤ 1 →
      IsLeast {v | ∃ f : Outcome → ℝ, IsLimitedLiability R x f ∧ IsIC p q B x f ∧
          v = expectedFee p p f}
        (p * B / (p - q) * x)) ∧
    (∀ x : ℝ, (0 ≤ x ∧ x ≤ 1 ∧ ∃ f : Outcome → ℝ, IsLimitedLiability R x f ∧ IsIC p q B x f ∧
        ∀ (x' : ℝ) (f' : Outcome → ℝ), 0 ≤ x' → x' ≤ 1 → IsLimitedLiability R x' f' →
          IsIC p q B x' f' → expectedFee p p f ≤ expectedFee p p f') ↔
      x ∈ Set.Icc (xLow p q) (xBar p q)) := by sorry

end PELiquidity.Primary
Source
Maurin, Robinson & Strömberg, A Theory of Liquidity in Private Equity, working paper (draft of December 2020), pp. 17–18, Lemma 2, (13)–(15)
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