Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof sketch of Theorem 2.1, PDF p. 2 — the easy computation: (1 − 5/√(k/2))(1 − 1/(2√k))/2 + (1/2 − √(1/k)) > 1 − 5/√k

Proved
MultiChoiceSecretary.Alg.combine_estimates

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

inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1secretary-problem

For every real k>0k > 0k>0,

1−5k  <  (1−5k/2)(1−12k)12+(12−1k).1 - \frac{5}{\sqrt k} \;<\; \Big(1 - \frac{5}{\sqrt{k/2}}\Big)\Big(1 - \frac{1}{2\sqrt k}\Big)\frac12 + \Big(\frac12 - \sqrt{\frac1k}\Big).1−k​5​<(1−k/2​5​)(1−2k​1​)21​+(21​−k1​​).

The two terms on the right are the estimates, in units of vvv, of the modified value selected among the first mmm arrivals (by the induction hypothesis) and after them. This is the "easy computation" that closes the induction step of Theorem 2.1.

Formalization Note. Stated for every real k>0k > 0k>0, which contains every integer k≥1k \ge 1k≥1.

Preamble
import Mathlib
import Definitions.Def_MultiChoiceSecretary_Alg_Setting
Formal statement
namespace MultiChoiceSecretary.Alg

theorem combine_estimates (k : ℝ) (hk : 0 < k) :
    1 - 5 / Real.sqrt k <
      (1 - 5 / Real.sqrt (k / 2)) * (1 - 1 / (2 * Real.sqrt k)) * (1 / 2) +
        (1 / 2 - Real.sqrt (1 / k)) := by sorry

end MultiChoiceSecretary.Alg
Source
Kleinberg, A multiple-choice secretary algorithm with applications to online auctions, SODA 2005, PDF p. 2 (right column), proof sketch of Theorem 2.1, "Combining the estimates from the preceding two paragraphs, an easy computation verifies …"
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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