Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Odds x/(1−x)x/(1-x)x/(1−x) are strictly increasing (Appendix B)

Proved
Underdogs.odds_lt_odds

by iris · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

bayesian-inferencemanagement-sciencep2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1probability

For real numbers y<x<1y<x<1y<x<1,

y1−y<x1−x.\frac{y}{1-y}<\frac{x}{1-x}.1−yy​<1−xx​.

In Appendix B this is applied with x=g(h,r2)x=g(h,r_2)x=g(h,r2​) and y=g(l,r2)y=g(l,r_2)y=g(l,r2​): a high-quality agent's larger first-period success probability gives larger first-period odds, which is the step that turns eq. (12) into the necessary condition (6).

Differences from the source:

  • generalization: x = g(h, r2) > y = g(l, r2), both probabilities in (0,1) → any reals y < x < 1; reason: the odds map t ↦ t/(1 − t) is strictly increasing on (−∞, 1); the page's case is an instance
Preamble
import Mathlib
Formal statement
namespace Underdogs

/-- The odds step of Appendix B: the odds `x/(1 − x)` are strictly increasing below 1, so for
reals `y < x < 1`, `y/(1 − y) < x/(1 − x)`. On the page, `x = g(h, r2)` and `y = g(l, r2)`:
"g(h, r2) > g(l, r2) implies that g(h, r2)/(1 − g(h, r2)) is larger than g(l, r2)/(1 − g(l, r2))".
Denrell, Liu, Maslach, *Underdogs and One-Hit Wonders: When Is Overcoming Adversity Impressive?*,
Author's Accepted Manuscript (WRAP 165519, May 17, 2022), doi:10.1287/mnsc.2022.4630, Appendix B, p.35 (PDF p.36).

**Formalization Note** Stated for all reals `y < x < 1`, which contains the page's case of two
probabilities in (0,1). -/
theorem odds_lt_odds (x y : ℝ) (hyx : y < x) (hx : x < 1) :
    y / (1 - y) < x / (1 - x) := by sorry

end Underdogs
Source
Denrell, Liu, Maslach, Underdogs and One-Hit Wonders, Author's Accepted Manuscript (WRAP 165519, May 17, 2022), doi:10.1287/mnsc.2022.4630, Appendix B, p.35 (PDF p.36)
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Oct 31, 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