Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, case M = ∅ and (1), pp. 6–7 — if no candidate deviates, Algorithm 1 hires ı̂ and v(ı̂) ≥ (1−ϵ)/(1+ϵ)·v(i)

Proved
SecretaryPred.LearnedDynkin.case_M_empty

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

competitive-ratiolearning-augmented-algorithmsoptimal-stoppingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1secretary-problem

Let nnn candidates have values v(i)≥0v(i)\ge 0v(i)≥0 and predictions v^(i)≥0\hat v(i)\ge 0v^(i)≥0, let ı^\hat\imath^ be any maximizer of v^\hat vv^, and run Algorithm 1 (learned Dynkin) with any threshold θ\thetaθ and time τ\tauτ. Suppose no candidate deviates, i.e. M={i:∣1−v^(i)/v(i)∣>θ}=∅M=\{i : |1-\hat v(i)/v(i)|>\theta\}=\emptysetM={i:∣1−v^(i)/v(i)∣>θ}=∅. Then:

  1. on every arrival vector the algorithm stays in Prediction mode and hires ı^\hat\imath^, so its value is v(ı^)v(\hat\imath)v(^);
  2. hence E[ALG]=v(ı^)\mathbb E[\mathrm{ALG}]=v(\hat\imath)E[ALG]=v(^);
  3. inequality (1): for every ϵ≥0\epsilon\ge 0ϵ≥0 with (1−ϵ)v(i)≤v^(i)≤(1+ϵ)v(i)(1-\epsilon)v(i)\le\hat v(i)\le(1+\epsilon)v(i)(1−ϵ)v(i)≤v^(i)≤(1+ϵ)v(i) for all iii, and every candidate jjj,
v(ı^)  ≥  11+ϵv^(ı^)  ≥  11+ϵv^(j)  ≥  1−ϵ1+ϵ v(j).v(\hat\imath)\;\ge\;\frac{1}{1+\epsilon}\hat v(\hat\imath)\;\ge\;\frac{1}{1+\epsilon}\hat v(j)\;\ge\;\frac{1-\epsilon}{1+\epsilon}\,v(j).v(^)≥1+ϵ1​v^(^)≥1+ϵ1​v^(j)≥1+ϵ1−ϵ​v(j).

This is the first half of the proof of Theorem 1: when the predictions are accurate up to θ\thetaθ, the algorithm follows them and is (1−ϵ)/(1+ϵ)(1-\epsilon)/(1+\epsilon)(1−ϵ)/(1+ϵ)-competitive.

Formalization Note Candidates are Fin n (0-based). The prediction-error condition is written ∣v(i)−v^(i)∣≤ϵ v(i)|v(i)-\hat v(i)|\le\epsilon\,v(i)∣v(i)−v^(i)∣≤ϵv(i).

Differences from the source:

  • generalization: θ = 0.646, τ = 0.313 → any θ and τ; reason: the case M = ∅ never uses θ or τ beyond the definition of M; it specializes to the source's values
  • generalization: (1) for the optimal candidate i∗ → (1) for every candidate j; reason: i∗ is one of the j; the chain of (1) uses nothing about i∗
  • generalization: ϵ = max_i |1 − v̂(i)/v(i)| → every ε ≥ 0 with |v(i) − v̂(i)| ≤ ε·v(i) for all i; reason: when all v(i) > 0 the source's ϵ is one such ε; the Lean clause also covers v(i) = 0, where the source's ϵ is undefined
  • encoding: the algorithm hires ı̂ → algValue = v(ı̂) on every arrival vector t, and expectedValue = v(ı̂); reason: the value of the run and its expectation when ı̂ is the hire
  • encoding: |1 − v̂(i)/v(i)| > θ (line 4 and the set M, p. 6) → θ·v(i) < |v(i) − v̂(i)| (Deviates); reason: identical when v(i) > 0; avoids Lean's x/0 = 0, and for v(i) = 0 a candidate deviates iff v̂(i) ≠ 0
  • encoding: candidates N = [n] interviewed in random order, arrival times iid Uniform[0, 1] (§2.1), exactly one hire → candidates Fin n (0-based), t uniform on the cube [0, 1]^n (arrivalLaw n), the mode at i is Secretary iff some deviating j has t_j ≤ t_i, and algValue sums the values of all candidates that are first to stop; reason: the run differs from the source's single-hire run only on the null set of arrival vectors with two equal times
Preamble
import Mathlib
import Definitions.Def_SecretaryPred_LearnedDynkin_Setting
Formal statement
namespace SecretaryPred.LearnedDynkin

theorem case_M_empty (n : ℕ) (theta tau : ℝ) (v vhat : Fin n → ℝ) (ihat : Fin n)
    (hv : ∀ i, 0 ≤ v i) (hvhat : ∀ i, 0 ≤ vhat i) (hihat : ∀ j, vhat j ≤ vhat ihat)
    (hM : Mset theta v vhat = ∅) :
    (∀ t : Fin n → ℝ, algValue theta tau v vhat ihat t = v ihat) ∧
      expectedValue theta tau v vhat ihat = v ihat ∧
      ∀ eps : ℝ, 0 ≤ eps → (∀ i, |v i - vhat i| ≤ eps * v i) →
        ∀ j, (1 - eps) / (1 + eps) * v j ≤ v ihat := by sorry

end SecretaryPred.LearnedDynkin
Source
Fujii, Yoshida, The Secretary Problem with Predictions, arXiv:2306.08340v1, pp. 6–7, proof of Theorem 1, case M = ∅, inequality (1)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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