Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 5.1, p. 42 — for the perturbed scoring w = w′ + ε of Figure 8, OPT(I) = M

Proved
PosetSecretary.LowerBound.opt_perturbation_eq

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

offline-optimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1posetsecretary-problem

Let k≥1k\ge1k≥1, ω≥0\omega\ge0ω≥0, M>0M>0M>0, and let i0i_0i0​ be one of the ω\omegaω chains of Chains(ω,k)\mathrm{Chains}(\omega,k)Chains(ω,k). Let www be a scoring consistent with the order (nonnegative, distinct, increasing along each chain) which is a perturbation of

w′(i,j)={M/k,i=i0,0,i≠i0,w'(i,j)=\begin{cases}M/k,& i=i_0,\\ 0,& i\ne i_0,\end{cases}w′(i,j)={M/k,0,​i=i0​,i=i0​,​

in the following sense:

  1. on every chain i≠i0i\ne i_0i=i0​: 0≤w(i,j)<M2k0\le w(i,j)<\dfrac{M}{2k}0≤w(i,j)<2kM​;
  2. on the chain i0i_0i0​: ∣w(i0,j)−Mk∣<M2k\Big|w(i_0,j)-\dfrac Mk\Big|<\dfrac{M}{2k}​w(i0​,j)−kM​​<2kM​ for all jjj;
  3. ∑j(w(i0,j)−Mk)=0\displaystyle\sum_j\Big(w(i_0,j)-\frac Mk\Big)=0j∑​(w(i0​,j)−kM​)=0.

Then the offline optimum with kkk selections is

OPT(w,k)=M.\mathrm{OPT}(w,k)=M .OPT(w,k)=M.

The perturbation makes the scores distinct without moving the optimum away from the heavy chain i0i_0i0​.

Formalization Note The page's further constraint ∑i<ω,jεji≤εM/ω\sum_{i<\omega,j}\varepsilon^i_j\le\varepsilon M/\omega∑i<ω,j​εji​≤εM/ω is not needed for this claim and is omitted. Distinctness is part of consistency. The hypothesis k≥1k\ge1k≥1 is necessary: for k=0k=0k=0 the poset is empty and the optimum is 000.

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

theorem opt_perturbation_eq (ω k : ℕ) (hk : 1 ≤ k) (i₀ : Fin ω) (M : ℝ) (hM : 0 < M)
    (w : ChainsPoset ω k → ℝ) (hw : PosetSecretary.ProxyLabel.IsConsistentScoring w)
    (hlight : ∀ (i : Fin ω) (j : Fin k), i ≠ i₀ → 0 ≤ w ⟨i, j⟩ ∧ w ⟨i, j⟩ < M / (2 * k))
    (hheavy : ∀ j : Fin k, |w ⟨i₀, j⟩ - M / k| < M / (2 * k))
    (hsum : ∑ j : Fin k, (w ⟨i₀, j⟩ - M / k) = 0) :
    PosetSecretary.ProxyLabel.opt w k = M := 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
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