Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 496 — conv⁡({0,1}n)=[0,1]n\operatorname{conv}(\{0,1\}^n) = [0,1]^nconv({0,1}n)=[0,1]n

Proved
SDDiP.Envelope.conv_binary_eq_cube

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

binary-optimizationconvex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polytopes

For every n≥0n \ge 0n≥0, the convex hull of the binary points of Rn\mathbb R^nRn is the unit cube:

conv⁡({0,1}n)=Cn=[0,1]n.\operatorname{conv}\big(\{0,1\}^n\big) = C_n = [0,1]^n.conv({0,1}n)=Cn​=[0,1]n.

In the proof of Theorem 1 this identifies the domain conv⁡(X)\operatorname{conv}(X)conv(X) of Definition 3 with the cube and makes the dual program (D)(D)(D) feasible at every x∈[0,1]nx \in [0,1]^nx∈[0,1]n.

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
  • 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