Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.7, p. 34 — f(p,α)f(p,\alpha)f(p,α) is increasing and g(p,α)g(p,\alpha)g(p,α) is decreasing in α\alphaα

Proved
SampleDrivenOS.Linear.b7_monotone

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

monotonicityoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Fix p∈(0,1)p\in(0,1)p∈(0,1) and let

f(p,α)=ln⁡p+α(1−p)2p,g(p,α)=∑i=1∞ln⁡(1+α(pi(1+i(1−p))−1))i(i+1)f(p,\alpha)=\ln p+\frac{\alpha(1-p)^2}{p},\qquad g(p,\alpha)=\sum_{i=1}^{\infty}\frac{\ln\bigl(1+\alpha(p^i(1+i(1-p))-1)\bigr)}{i(i+1)}f(p,α)=lnp+pα(1−p)2​,g(p,α)=i=1∑∞​i(i+1)ln(1+α(pi(1+i(1−p))−1))​

be the two sides of equation (19). Then

  1. α↦f(p,α)\alpha\mapsto f(p,\alpha)α↦f(p,α) is strictly increasing on [0,1][0,1][0,1];
  2. α↦g(p,α)\alpha\mapsto g(p,\alpha)α↦g(p,α) is non-increasing on [0,1)[0,1)[0,1).

Together they give the uniqueness of the root α~(p)\tilde\alpha(p)α~(p) of (19) (Lemma 7), and after the substitution α=f(p) p\alpha=f(p)\,pα=f(p)p they are the monotonicity used in the first step of the proof of Theorem 9.

Formalization Note The paper's sentences say "increasing" and "decreasing" without naming the domain. Strictness is stated for fff (its slope (1−p)2/p(1-p)^2/p(1−p)2/p is positive); ggg is stated as non-increasing on [0,1)[0,1)[0,1), where every logarithm's argument is at least 1−α>01-\alpha>01−α>0; at α=1\alpha=1α=1 the paper itself notes g(p,1)=−∞g(p,1)=-\inftyg(p,1)=−∞, so α=1\alpha=1α=1 is excluded. The continuity claim of the same paragraph is used only for Lemma 7 and is not part of this statement.

Preamble
import Mathlib
import Definitions.Def_SampleDrivenOS_Linear_Setting
Formal statement
namespace SampleDrivenOS.Linear

theorem b7_monotone (p : ℝ) (hp : p ∈ Set.Ioo (0 : ℝ) 1) :
    StrictMonoOn (fB7 p) (Set.Icc 0 1) ∧ AntitoneOn (gB7 p) (Set.Ico 0 1) := by sorry

end SampleDrivenOS.Linear
Source
Correa, Cristi, Epstein & Soto, Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality, arXiv:2011.06516v2, p. 34, B.7 (Proof of Lemma 7), first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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