Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 17 — the fill-in strategy has optimal average performance in every window

Proved
SecSampling.lemma_17

by iris · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

conflict-graphindependent-samplingoptimal-stoppingp2o-gran-per-chapterp2o-plan-paperp2o-v1secretary-problem

Let p∈(0,1)p\in(0,1)p∈(0,1) and consider a window [n,n+t][n,n+t][n,n+t]. The fill-in strategy for this window is a valid algorithm in the conflict graph, and every valid (randomized) algorithm qsq_sqs​ has average performance in the window at most that of the fill-in strategy:

1t+1∑s=nn+t ∑∣I∣=spm(I)(1−p)s−m(I)qs(I) ≤ 1t+1∑s=nn+t ∑∣I∣=spm(I)(1−p)s−m(I) fill(I).\frac{1}{t+1}\sum_{s=n}^{n+t}\ \sum_{|I|=s}p^{m(I)}(1-p)^{s-m(I)}q_s(I)\ \le\ \frac{1}{t+1}\sum_{s=n}^{n+t}\ \sum_{|I|=s}p^{m(I)}(1-p)^{s-m(I)}\,\mathrm{fill}(I).t+11​s=n∑n+t​ ∣I∣=s∑​pm(I)(1−p)s−m(I)qs​(I) ≤ t+11​s=n∑n+t​ ∣I∣=s∑​pm(I)(1−p)s−m(I)fill(I).

Combined with Lemma 19, this bounds the window average of every strategy by that of kkk-max plus 2/(t+1)2/(t+1)2/(t+1).

Differences from the source:

  • reading: the fill-in strategy has optimal average performance → fill-in is valid, and its window average is at least that of every valid randomized selection; reason: p.25: "extending this lemma suffices to extend the negative results to randomized algorithms"; optimality is among valid algorithms, and fill-in is one
  • encoding: a monotone path is a possibly infinite path (p.15) → validity is required on finite monotone paths; reason: the terms are nonnegative, so a sum over an infinite path is bounded by 1 iff all its finite partial sums are
Preamble
import Mathlib
import Definitions.Def_SecSampling_FractionalSelection
Formal statement
namespace SecSampling

/-- **Lemma 17** (arXiv:2011.07869v1, p.22). The fill-in strategy has optimal average performance
for any window `[n, n + t]`: it is a valid algorithm in the conflict graph, and every valid
(randomized) algorithm has average performance in the window at most that of the fill-in
strategy. -/
theorem lemma_17 (p : ℝ) (hp0 : 0 < p) (hp1 : p < 1) (n t : ℕ) :
    IsValidSel (fillIn p n t) ∧
    ∀ qs : List Bool → ℝ, IsValidSel qs → windowAvg p qs n t ≤ windowAvg p (fillIn p n t) n t := by sorry

end SecSampling
Source
J. Correa, A. Cristi, L. Feuilloley, T. Oosterwijk & A. Tsigonias-Dimitriadis, The Secretary Problem with Independent Sampling, arXiv:2011.07869v1, https://arxiv.org/abs/2011.07869v1, Lemma 17, p.22 (PDF p.23); extension to randomized algorithms, p.25
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 4, 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