Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 5.1, p. 42, display — a perturbed scoring with OPT(I) = M and E[w(Alg(I))] ≤ (1+ε)OPT(I)/ω

Proved
PosetSecretary.LowerBound.exists_perturbation_expectedScore_le

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

competitive-ratiolower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1posetsecretary-problem

Let k≥1k\ge1k≥1, ω≥1\omega\ge1ω≥1, and let μ\muμ be a selection rule with capacity kkk on Chains(ω,k)\mathrm{Chains}(\omega,k)Chains(ω,k). Let i0i_0i0​ be a chain whose selection probabilities satisfy ∑jpji0≤k/ω\sum_j p^{i_0}_j\le k/\omega∑j​pji0​​≤k/ω, and let M>0M>0M>0 and ε>0\varepsilon>0ε>0. Then there is a scoring www consistent with the order such that OPT(w,k)=M\mathrm{OPT}(w,k)=MOPT(w,k)=M and

Eμ[w(Alg)]≤(1+ε) OPT(w,k)ω.\mathbb E_\mu\big[w(\mathrm{Alg})\big]\le\frac{(1+\varepsilon)\,\mathrm{OPT}(w,k)}{\omega}.Eμ​[w(Alg)]≤ω(1+ε)OPT(w,k)​.

This is the display of the proof of Proposition 5.1: the score is concentrated on the least-selected chain, and the remaining chains carry an arbitrarily small total score that only serves to make all scores distinct.

Formalization Note The statement is existential in the scoring. The page's middle inequality drops the term ∑jpji0εji0\sum_jp^{i_0}_j\varepsilon^{i_0}_j∑j​pji0​​εji0​​, which the page's constraints (∣εji0∣<M/2k|\varepsilon^{i_0}_j|<M/2k∣εji0​​∣<M/2k, ∑jεji0=0\sum_j\varepsilon^{i_0}_j=0∑j​εji0​​=0) do not make nonpositive; the bound holds for perturbations chosen small enough, not for every admissible one, and the existential form records exactly that. The scoring is chosen after μ\muμ, as on the page, where pjip^i_jpji​ is fixed before the scores.

Preamble
import Mathlib
import Definitions.Def_AppliedComb_Posets_width
import Definitions.Def_PosetSecretary_LowerBound_Setting
Formal statement
namespace PosetSecretary.LowerBound

theorem exists_perturbation_expectedScore_le (ω k : ℕ) (hk : 1 ≤ k) (hω : 1 ≤ ω)
    (μ : Finset (ChainsPoset ω k) → ℝ) (hμ : IsSelectionRule k μ) (i₀ : Fin ω)
    (hi₀ : ∑ j : Fin k, selProb μ ⟨i₀, j⟩ ≤ (k : ℝ) / ω) (M : ℝ) (hM : 0 < M)
    (ε : ℝ) (hε : 0 < ε) :
    ∃ w : ChainsPoset ω k → ℝ, PosetSecretary.ProxyLabel.IsConsistentScoring w ∧ PosetSecretary.ProxyLabel.opt w k = M ∧
      expectedScore μ w ≤ (1 + ε) * PosetSecretary.ProxyLabel.opt w k / ω := by sorry

end PosetSecretary.LowerBound
Source
Salem & Gupta, Secretary Problems with Biased Evaluations Using Partial Ordinal Information, SSRN 3444283 (version of 2022-04-17), proof of Proposition 5.1, Appendix F, p. 42, third paragraph and display
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