Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 17, p. 18 — key identity Σ_{s′=s}^{k} T(i,s′) = Σ_j C(n−i,j)(1/j)∏_{ℓ≤j}(k−s+ℓ)∏_{t=i}^{n−j−1}(s+t)

Proved
SecretaryAdvice.SamplesDual.key_identity

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

binomial-coefficientsclosed-formcombinatorial-identityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n,kn,kn,k be natural numbers, 1≤i<n1\le i<n1≤i<n and 0≤s≤k0\le s\le k0≤s≤k, and let T(i,s′)T(i,s')T(i,s′) be the quantity of the proof of Theorem 17 (p. 17). Then

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

By the reduction step of the proof, this identity is exactly what is needed to establish the inductive step of Theorem 17 (with the maximum ignored).

Formalization Note The empty-product convention ∏t=abxt=1\prod_{t=a}^{b}x_t=1∏t=ab​xt​=1 for b<ab<ab<a is used (the term j=n−ij=n-ij=n−i has an empty product over ttt).

Preamble
import Mathlib
import Definitions.Def_SecretaryAdvice_SamplesDual_ClosedForm

open Finset
Formal statement
namespace SecretaryAdvice.SamplesDual

/-- Proof of Theorem 17, p. 18: for `1 ≤ i < n` and `0 ≤ s ≤ k`,
`Σ_{s'=s}^{k} T(i,s') = Σ_{j=1}^{n−i} C(n−i,j) · (1/j) · ∏_{ℓ=1}^{j} (k−s+ℓ) · ∏_{t=i}^{n−j−1} (s+t)`. -/
theorem key_identity (n k i s : ℕ) (hi : 1 ≤ i) (hin : i < n) (hs : s ≤ k) :
    ∑ s' ∈ Icc s k, T n k i s' = keyRHS n k i s := by sorry

end SecretaryAdvice.SamplesDual
Source
Dütting et al., Secretaries with Advice, arXiv:2011.06726v1, p. 18, proof of Theorem 17 ("to establish the claim it suffices to show that")
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