Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 10 — optimizing p: the bound is maximized at p = p(k), with value 1/α(k)

Proved
OrdinalMSP.Forbidden.optimal_p

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

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

Let k≥1k \ge 1k≥1 be an integer and let

gk(p)={−pln⁡p,k=1,p−pkk−1,k≥2,g_k(p) = \begin{cases} -p\ln p, & k = 1,\\[4pt] \dfrac{p - p^k}{k-1}, & k \ge 2,\end{cases}gk​(p)=⎩⎨⎧​−plnp,k−1p−pk​,​k=1,k≥2,​

be the lower bound on Pr⁡(r∗∈ALG)\Pr(r^* \in \mathrm{ALG})Pr(r∗∈ALG) obtained for sampling probability ppp. With (p(k),α(k))=(1/e,e)(p(k), \alpha(k)) = (1/e, e)(p(k),α(k))=(1/e,e) for k=1k = 1k=1 and (k−1/(k−1),kk/(k−1))(k^{-1/(k-1)}, k^{k/(k-1)})(k−1/(k−1),kk/(k−1)) for k≥2k \ge 2k≥2:

  1. p(k)∈(0,1]p(k) \in (0, 1]p(k)∈(0,1] is an admissible sampling probability;
  2. gk(p(k))=1/α(k)g_k(p(k)) = 1/\alpha(k)gk​(p(k))=1/α(k);
  3. p(k)p(k)p(k) maximizes gkg_kgk​ over (0,1](0,1](0,1]: gk(p)≤gk(p(k))g_k(p) \le g_k(p(k))gk​(p)≤gk​(p(k)) for every p∈(0,1]p \in (0, 1]p∈(0,1].

This is the last step of the proof of the Key Lemma: "by optimizing the value of ppp as a function of kkk", the guaranteed selection probability is 1/α(k)1/\alpha(k)1/α(k), attained at p=p(k)p = p(k)p=p(k).

Formalization Note gkg_kgk​ is passed as a function g together with its defining equation, which branches on k=1k = 1k=1 first. p(k)p(k)p(k) and α(k)\alpha(k)α(k) are pK k and alphaK k of the Setting definition (Real.exp, Real.rpow). The page writes "the probability of r∗∈ALGr^* \in \mathrm{ALG}r∗∈ALG is 1/α(k)1/\alpha(k)1/α(k)"; the formal content is that the lower bound gkg_kgk​ attains the value 1/α(k)1/\alpha(k)1/α(k) at p(k)p(k)p(k) and that no other ppp does better.

Preamble
import Mathlib
import Definitions.Def_OrdinalMSP_Forbidden_Setting
Formal statement
namespace OrdinalMSP.Forbidden

theorem optimal_p (k : ℕ) (hk : 1 ≤ k) (g : ℝ → ℝ)
    (hg : ∀ p, g p = if k = 1 then -p * Real.log p else (p - p ^ k) / ((k : ℝ) - 1)) :
    pK k ∈ Set.Ioc 0 1 ∧ g (pK k) = 1 / alphaK k ∧ ∀ p ∈ Set.Ioc (0 : ℝ) 1, g p ≤ g (pK k) := by sorry

end OrdinalMSP.Forbidden
Source
Soto, Turkieltaub & Verdugo, Strong Algorithms for the Ordinal Matroid Secretary Problem, arXiv:1802.01997v1, proof of Lemma 1, p. 10, last sentence ("By optimizing the value of p as a function of k, …")
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

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