Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix C, p. 29 — binary greedy dual variables are non-decreasing

Proved
SecretaryAdvice.Binary.greedy_monotone

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

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

Let uisu_i^suis​ be the binary-classifier dual vector constructed by the backward recurrence in equation (10). For each signal s∈{Y,N}s\in\{Y,N\}s∈{Y,N} and each adjacent pair of rounds 1≤i<n1\leq i<n1≤i<n,

uis≤ui+1s.u_i^s\leq u_{i+1}^s.uis​≤ui+1s​.

This monotonicity is one of the two dual properties required by Proposition 12 to obtain a threshold policy.

Formalization Note The theorem uses the exact finite greedy vector, including the maximum with zero, and the model's ranges p,p′∈[1/2,1]p,p'\in[1/2,1]p,p′∈[1/2,1].

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

/-- Appendix C, p. 29: the greedy dual variables increase with round number. -/
theorem greedy_monotone (n : ℕ) (hn : 1 ≤ n) (p p' : ℝ)
    (hp0 : (1 / 2 : ℝ) ≤ p) (hp1 : p ≤ 1)
    (hp'0 : (1 / 2 : ℝ) ≤ p') (hp'1 : p' ≤ 1) :
    ∀ i : ℕ, 1 ≤ i → i < n → ∀ s : Bool,
      greedy n p p' i s ≤ greedy n p p' (i + 1) s := by sorry

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