Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 496 — g(x)=f(x)g(x) = f(x)g(x)=f(x) at every binary point

Proved
SDDiP.Envelope.g_eq_f_binary

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

binary-optimizationconvex-envelopep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let fff be a real function on {0,1}n\{0,1\}^n{0,1}n and g(x)=max⁡(α,β)∈Π{α⊤x+β}g(x) = \max_{(\alpha,\beta)\in\Pi}\{\alpha^\top x + \beta\}g(x)=max(α,β)∈Π​{α⊤x+β} as in the proof of Theorem 1. For every binary point x∈{0,1}nx \in \{0,1\}^nx∈{0,1}n the maximum defining g(x)g(x)g(x) is attained and

g(x)=f(x).g(x) = f(x).g(x)=f(x).

This is the exactness half of Theorem 1 for the proof's function ggg; it fails for general finite sets in place of {0,1}n\{0,1\}^n{0,1}n.

Formalization Note The attained maximum is stated as IsGreatest (primalValues f x) (f x).

Preamble
import Mathlib
import Definitions.Def_SDDiP_Envelope_ProofLP
Formal statement
namespace SDDiP.Envelope

/-- Proof of Theorem 1, p. 496: `g(x) = f(x)` at every binary point `x ∈ {0,1}ⁿ`, where
`g(x) = max_{(α,β) ∈ Π} {αᵀx + β}`; the maximum is attained and equals `f(x)`. -/
theorem g_eq_f_binary {n : ℕ} (f : (Fin n → ℝ) → ℝ) (x : Fin n → ℝ) (hx : x ∈ binaryPoints n) :
    IsGreatest (primalValues f x) (f x) ∧ g f x = f x := by sorry

end SDDiP.Envelope
Source
Zou, Ahmed, Sun, Stochastic dual dynamic integer programming, Math. Program. 175 (2019), p. 496, proof of Theorem 1 ('Therefore, g(x) = f(x) for all x ∈ {0, 1}^n')
Human review
  • Endorsed by Shuze Chen · Oct 11, 2026

    Confirmed by the moderator at approval.

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