Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix C, p. 29 — binary greedy vector minimizes the dual LP

Proved
SecretaryAdvice.Binary.greedy_optimal

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

binary-classifierlinear-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1secretary-problem

Let uuu be the binary-classifier greedy dual vector of equation (10). It satisfies every nonnegativity and dual LP constraint, and among all feasible dual vectors vvv it minimizes the objective:

∑i=1n(uiY+uiN)≤∑i=1n(viY+viN).\sum_{i=1}^n(u_i^Y+u_i^N)\leq\sum_{i=1}^n(v_i^Y+v_i^N).i=1∑n​(uiY​+uiN​)≤i=1∑n​(viY​+viN​).

This identifies the dual certificate used in the threshold-optimality argument.

Formalization Note The theorem quantifies over all dual-feasible vectors, with constraints only on rounds 1,…,n1,\ldots,n1,…,n. No optimal vector is assumed to exist as an extra hypothesis.

Preamble
import Mathlib
import Definitions.Def_SecretaryAdvice_Binary_LP
Formal statement
namespace SecretaryAdvice.Binary

/-- Appendix C, p. 29: equation (10) gives a feasible, minimum-value dual vector. -/
theorem greedy_optimal (n : ℕ) (hn : 1 ≤ n) (p p' : ℝ)
    (hp0 : (1 / 2 : ℝ) ≤ p) (hp1 : p ≤ 1)
    (hp'0 : (1 / 2 : ℝ) ≤ p') (hp'1 : p' ≤ 1) :
    DualFeasible n p p' (greedy n p p') ∧
    ∀ u : ℕ → Bool → ℝ, DualFeasible n p p' u →
      dualValue n (greedy n p p') ≤ dualValue n u := by sorry

end SecretaryAdvice.Binary
Source
Dütting et al., Secretaries with Advice, arXiv:2011.06726v1, p. 29, Appendix C, final 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