Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 17, p. 17 — under the induction hypothesis, v(i,s) = a(n,s) − (1/(k+1))∏1/(k+t+1)·∏_{t<i}(s+t)·Σ_{s′≥s}T(i,s′)

Proved
SecretaryAdvice.SamplesDual.t_reduction

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

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

Consider the secretary problem with nnn secretaries and kkk samples, and let v(i,s)v(i,s)v(i,s) be the un-clipped backward recursion of the dual LP with the samples coefficients a(i,s)a(i,s)a(i,s), c(j,s′,i,s)c(j,s',i,s)c(j,s′,i,s) of §5. Let 1≤i<n1\le i<n1≤i<n and assume the inductive hypothesis of the proof of Theorem 17: for every round i′i'i′ with i<i′≤ni<i'\le ni<i′≤n and every signal s′∈{0,…,k}s'\in\{0,\dots,k\}s′∈{0,…,k}, v(i′,s′)v(i',s')v(i′,s′) equals the un-clipped closed form (a(n,s′)a(n,s')a(n,s′) if i′=ni'=ni′=n, and the expression inside the maximum of Theorem 17 if i′<ni'<ni′<n). Then for every signal s∈{0,…,k}s\in\{0,\dots,k\}s∈{0,…,k},

v(i,s)=1k+1∏t=1n−1s+tk+t+1−1k+1∏t=1n−11k+t+1⋅∏t=1i−1(s+t)⋅∑s′=skT(i,s′),v(i,s)=\frac{1}{k+1}\prod_{t=1}^{n-1}\frac{s+t}{k+t+1}-\frac{1}{k+1}\prod_{t=1}^{n-1}\frac{1}{k+t+1}\cdot\prod_{t=1}^{i-1}(s+t)\cdot\sum_{s'=s}^{k}T(i,s'),v(i,s)=k+11​t=1∏n−1​k+t+1s+t​−k+11​t=1∏n−1​k+t+11​⋅t=1∏i−1​(s+t)⋅s′=s∑k​T(i,s′),

where T(i,s′)=(n−i)∏t=i+1n−1(s′+t)−∑z=i+1n−1∑j=1n−z(n−zj)1j∏ℓ=1j(k−s′+ℓ)∏t=i+1n−j−1(s′+t)T(i,s')=(n-i)\prod_{t=i+1}^{n-1}(s'+t)-\sum_{z=i+1}^{n-1}\sum_{j=1}^{n-z}\binom{n-z}{j}\frac1j\prod_{\ell=1}^{j}(k-s'+\ell)\prod_{t=i+1}^{n-j-1}(s'+t)T(i,s′)=(n−i)∏t=i+1n−1​(s′+t)−∑z=i+1n−1​∑j=1n−z​(jn−z​)j1​∏ℓ=1j​(k−s′+ℓ)∏t=i+1n−j−1​(s′+t).

This step reduces the inductive step of Theorem 17 to an identity about the sum ∑s′=skT(i,s′)\sum_{s'=s}^k T(i,s')∑s′=sk​T(i,s′).

Preamble
import Mathlib
import Definitions.Def_SecretaryAdvice_SamplesDual_ClosedForm

open Finset
Formal statement
namespace SecretaryAdvice.SamplesDual

/-- Proof of Theorem 17, p. 17: if the un-clipped recursion agrees with the claimed closed form
at every round `i' > i` and every signal, then at round `i`
`v(i,s) = 1/(k+1)·∏_{t=1}^{n−1} (s+t)/(k+t+1)
  − 1/(k+1)·∏_{t=1}^{n−1} 1/(k+t+1) · ∏_{t=1}^{i−1} (s+t) · Σ_{s'=s}^{k} T(i,s')`. -/
theorem t_reduction (n k i : ℕ) (hi : 1 ≤ i) (hin : i < n)
    (ih : ∀ i' : ℕ, i < i' → i' ≤ n → ∀ s' : Fin (k + 1),
      samplesUnclipped n k i' s' = unclippedFormula n k i' s')
    (s : Fin (k + 1)) :
    samplesUnclipped n k i s =
      1 / ((k : ℝ) + 1) * (∏ t ∈ Icc 1 (n - 1), (((s : ℕ) : ℝ) + t) / ((k : ℝ) + t + 1)) -
        1 / ((k : ℝ) + 1) * (∏ t ∈ Icc 1 (n - 1), 1 / ((k : ℝ) + t + 1)) *
          (∏ t ∈ Icc 1 (i - 1), (((s : ℕ) : ℝ) + t)) *
          ∑ s' ∈ Icc (s : ℕ) k, T n k i s' := by sorry

end SecretaryAdvice.SamplesDual
Source
Dütting et al., Secretaries with Advice, arXiv:2011.06726v1, p. 17, proof of Theorem 17, inductive step (first display and the definition of T(i, s′))
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