Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (A5), p. 28 — the branch threshold

Proved
ToneAtTop.Diversion.threshold_A5

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

accountingadverse-selectioninternal-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tone-at-the-top

Assume the standing diversion model and τ<2λxˉ/p\tau<\sqrt{2\lambda\bar x/p}τ<2λxˉ/p​. At the first-region first-order candidate, its high-type tipping point is no greater than the maximum temptation exactly when τ\tauτ is below the branch threshold:

τxˉ2λxˉ−pτ2≤xˉ⟺τ≤2λxˉ1+p.\frac{\tau\bar x}{\sqrt{2\lambda\bar x-p\tau^2}}\le\bar x \quad\Longleftrightarrow\quad \tau\le\sqrt{\frac{2\lambda\bar x}{1+p}}.2λxˉ−pτ2​τxˉ​≤xˉ⟺τ≤1+p2λxˉ​​.

This is the comparison behind equation (A5), separating the two cases of Proposition 1. Positivity of the square-root argument follows from the displayed Lemma 1 condition and the standing assumptions.

Preamble
import Mathlib
import Definitions.Def_ToneAtTop_Diversion_Model
Formal statement
namespace ToneAtTop.Diversion

/-- Equation (A5) locates where the interior solution reaches the kink. -/
theorem threshold_A5 (P : Params) (hS : P.Standing)
    (hL1a : P.tau < Real.sqrt (2 * P.lam * P.xbar / P.p)) :
    P.tau * P.xbar /
        Real.sqrt (2 * P.lam * P.xbar - P.p * P.tau ^ 2) ≤ P.xbar ↔
      P.tau ≤ Real.sqrt (2 * P.lam * P.xbar / (1 + P.p)) := by sorry

end ToneAtTop.Diversion
Source
Penno, A Theory of Assurance: Balancing Costly Formal Control with Tone at the Top, SSRN working paper 2876700 (revision of May 2019), p. 28 (PDF 30), Appendix, proof of Proposition 1, eq. (A5)
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