Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 17, p. 17 — explicit closed form of the greedy dual solution for secretaries with k samples

Proved
SecretaryAdvice.SamplesDual.theorem_17

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

backward-inductionclosed-formlp-dualityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1secretary-problem

Consider the secretary problem with nnn secretaries and kkk samples: the signal of a secretary is s∈{0,…,k}s\in\{0,\dots,k\}s∈{0,…,k}, the number of sample elements smaller than it. Let u(i,s)u(i,s)u(i,s) be the greedy (backward-induction) solution (8) of the dual LP of §5, with coefficients a(i,s)=1k+1∏t=1n−1s+tk+t+1a(i,s)=\frac{1}{k+1}\prod_{t=1}^{n-1}\frac{s+t}{k+t+1}a(i,s)=k+11​∏t=1n−1​k+t+1s+t​ and c(j,s′,i,s)=1s′+1∏t=1i−1s+ts′+t+1c(j,s',i,s)=\frac{1}{s'+1}\prod_{t=1}^{i-1}\frac{s+t}{s'+t+1}c(j,s′,i,s)=s′+11​∏t=1i−1​s′+t+1s+t​ for s′≥ss'\ge ss′≥s (and 000 for s′<ss'<ss′<s). Then for every signal sss,

u(n,s)=1k+1∏t=1n−1s+tk+t+1,u(n,s)=\frac{1}{k+1}\prod_{t=1}^{n-1}\frac{s+t}{k+t+1},u(n,s)=k+11​t=1∏n−1​k+t+1s+t​,

and for every round 1≤i<n1\le i<n1≤i<n and every signal sss,

u(i,s)=max⁡{0,  1k+1∏t=1i−1s+tk+t+1(∏t=in−1s+tk+t+1−∑j=1n−i(n−ij)1j∏ℓ=1j(k−s+ℓ)∏ℓ=1n−i−j(s+i−1+ℓ)∏t=in−1(k+t+1))},u(i,s)=\max\left\{0,\;\frac{1}{k+1}\prod_{t=1}^{i-1}\frac{s+t}{k+t+1}\left(\prod_{t=i}^{n-1}\frac{s+t}{k+t+1}-\frac{\sum_{j=1}^{n-i}\binom{n-i}{j}\frac1j\prod_{\ell=1}^{j}(k-s+\ell)\prod_{\ell=1}^{n-i-j}(s+i-1+\ell)}{\prod_{t=i}^{n-1}(k+t+1)}\right)\right\},u(i,s)=max{0,k+11​t=1∏i−1​k+t+1s+t​(t=i∏n−1​k+t+1s+t​−∏t=in−1​(k+t+1)∑j=1n−i​(jn−i​)j1​∏ℓ=1j​(k−s+ℓ)∏ℓ=1n−i−j​(s+i−1+ℓ)​)},

with the convention ∏t=abxt=1\prod_{t=a}^{b}x_t=1∏t=ab​xt​=1 if b<ab<ab<a.

Since the greedy solution is optimal for the dual (Theorem 16), this gives a non-recursive description of the optimal dual solution, from which the optimal thresholds in signal space can be read off.

Formalization Note Rounds are 1,…,n1,\dots,n1,…,n as natural numbers, signals are Fin (k + 1), and all arithmetic is in R\mathbb RR. The statement keeps the max⁡{0,⋅}\max\{0,\cdot\}max{0,⋅}: it is about the greedy recursion (8) as defined, which clips at every round. The paper's proof treats the recursion with the maximum removed (the companion milestone unclipped_closed_form); the passage from the un-clipped to the clipped recursion is not argued in the paper and is part of this goal.

Preamble
import Mathlib
import Definitions.Def_SecretaryAdvice_SamplesDual_ClosedForm

open Finset
Formal statement
namespace SecretaryAdvice.SamplesDual

/-- Theorem 17, p. 17: the greedy dual solution (8) with the samples coefficients of §5 is
`u(n,s) = 1/(k+1)·∏_{t=1}^{n−1} (s+t)/(k+t+1)` and, for `i < n`,
`u(i,s) = max {0, innerFormula n k i s}`, for every round `1 ≤ i ≤ n` and signal `s ∈ {0,…,k}`. -/
theorem theorem_17 (n k i : ℕ) (hi : 1 ≤ i) (hin : i ≤ n) (s : Fin (k + 1)) :
    samplesGreedy n k i s = explicitFormula n k i s := by sorry

end SecretaryAdvice.SamplesDual
Source
Dütting et al., Secretaries with Advice, arXiv:2011.06726v1, p. 17, Theorem 17
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