Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, inequality (2), p. 9 (read with v(i∗)) — ı̂, i∗ ∉ M: v(ı̂) ≥ (1−θ)/(1+θ)·v(i∗)

Proved
SecretaryPred.LearnedDynkin.inequality_2

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^, let i∗i^*i∗ be the best candidate (largest value, ties broken by the smaller index), and let θ≥0\theta\ge 0θ≥0. If neither ı^\hat\imath^ nor i∗i^*i∗ deviates, i.e. ∣1−v^(ı^)/v(ı^)∣≤θ|1-\hat v(\hat\imath)/v(\hat\imath)|\le\theta∣1−v^(^)/v(^)∣≤θ and ∣1−v^(i∗)/v(i∗)∣≤θ|1-\hat v(i^*)/v(i^*)|\le\theta∣1−v^(i∗)/v(i∗)∣≤θ, then

v(ı^)  ≥  11+θv^(ı^)  ≥  11+θv^(i∗)  ≥  1−θ1+θ v(i∗).v(\hat\imath)\;\ge\;\frac{1}{1+\theta}\hat v(\hat\imath)\;\ge\;\frac{1}{1+\theta}\hat v(i^*)\;\ge\;\frac{1-\theta}{1+\theta}\,v(i^*).v(^)≥1+θ1​v^(^)≥1+θ1​v^(i∗)≥1+θ1−θ​v(i∗).

This is inequality (2) in case (vi) of the proof of Theorem 1: when both ı^\hat\imath^ and i∗i^*i∗ are predicted accurately up to θ\thetaθ, hiring ı^\hat\imath^ recovers a (1−θ)/(1+θ)(1-\theta)/(1+\theta)(1−θ)/(1+θ) fraction of the optimum.

Formalization Note Candidates are Fin n (0-based); "does not deviate" is ∣v(i)−v^(i)∣≤θ v(i)|v(i)-\hat v(i)|\le\theta\,v(i)∣v(i)−v^(i)∣≤θv(i).

Differences from the source:

  • reading: the printed last term of (2) is (1 − θ)/(1 + θ)·v̂(i∗) → (1 − θ)/(1 + θ)·v(i∗); reason: the case's ratio is taken against v(i∗), so the proof uses the inequality with v(i∗); the analogue in §6.1 (p. 23) prints v(i∗); the printed chain is true but is not the inequality used
  • generalization: θ = 0.646 → any θ ≥ 0; reason: the chain of (2) uses only 1 + θ > 0; at θ = 0.646 it is the source's inequality
  • reading: line 8 of Algorithm 1: 'i is the best so far', with ties not addressed; i∗ ∈ argmax v → i beats every earlier arrival in the strict order 'larger value, then smaller index' (Beats); istar is the top candidate of that order; reason: both untied readings make Theorem 1 false: strictly larger value fails for n ≥ 5 candidates all with v = 1 and exact predictions except v̂(ı̂) = 10 (P(hire) ≤ 1/n < 0.215); weakly larger value fails for i∗ with v = v̂ = 1, ı̂ with v = δ, v̂ = 10 and n − 2 fillers with v = v̂ = δ (ratio → δ as n → ∞); for distinct values the order is the source's
  • 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
Preamble
import Mathlib
import Definitions.Def_SecretaryPred_LearnedDynkin_Setting
Formal statement
namespace SecretaryPred.LearnedDynkin

theorem inequality_2 (n : ℕ) (theta : ℝ) (v vhat : Fin n → ℝ) (ihat istar : Fin n)
    (hv : ∀ i, 0 ≤ v i) (hvhat : ∀ i, 0 ≤ vhat i) (hihat : ∀ j, vhat j ≤ vhat ihat)
    (histar : ∀ j, j ≠ istar → Beats v istar j) (htheta : 0 ≤ theta)
    (hhatM : ¬ Deviates theta v vhat ihat) (hstarM : ¬ Deviates theta v vhat istar) :
    (1 - theta) / (1 + theta) * v istar ≤ v ihat := by sorry

end SecretaryPred.LearnedDynkin
Source
Fujii, Yoshida, The Secretary Problem with Predictions, arXiv:2306.08340v1, p. 9, proof of Theorem 1, case (vi), inequality (2)
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