Proof of Theorem 1, p. 496 —
ProvedSDDiP.Envelope.conv_binary_eq_cubebinary-optimizationconvex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polytopes
For every , the convex hull of the binary points of is the unit cube:
In the proof of Theorem 1 this identifies the domain of Definition 3 with the cube and makes the dual program feasible at every .
Preamble
import Mathlib import Definitions.Def_SDDiP_Envelope_ConvexLowerEnvelope
Formal statement
namespace SDDiP.Envelope
/-- Proof of Theorem 1, p. 496 (Zou, Ahmed, Sun, Math. Program. 175 (2019)): "`Cₙ` is the convex hull
of `{0,1}ⁿ`", i.e. `conv({0,1}ⁿ) = [0,1]ⁿ`. -/
theorem conv_binary_eq_cube (n : ℕ) : convexHull ℝ (binaryPoints n) = cube n := by sorry
end SDDiP.Envelope
Source
Zou, Ahmed, Sun, Stochastic dual dynamic integer programming, Math. Program. 175 (2019), p. 496, proof of Theorem 1 ('Since C_n is the convex hull of {0, 1}^n')
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.