Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
โ† Formalpedia

Remark 7.5, p. 14 โ€” if ๐’ด โІ [0, 1]แต, every point of ๐’ด โˆฉ {0, 1}แต is an extreme point of ๐’ด

Proved
ShortestGCS.Relax.remark_7_5

by mikedeng1 ยท Oct 9, 2026 ยท Mathlib 0df444a (Lean v4.33.1)

binary-pointsextreme-pointsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reformulation-linearization

Let YโІ[0,1]m\mathcal Y \subseteq [0, 1]^mYโІ[0,1]m. Then every yโˆˆYy \in \mathcal YyโˆˆY whose coordinates all lie in {0,1}\{0, 1\}{0,1} is an extreme point of Y\mathcal YY:

yโˆˆYโˆฉ{0,1}mโ€…โ€ŠโŸนโ€…โ€ŠyโˆˆextโกY.y \in \mathcal Y \cap \{0, 1\}^m \implies y \in \operatorname{ext}\mathcal Y .yโˆˆYโˆฉ{0,1}mโŸนyโˆˆextY.

Combined with Lemma 7.4 this says that the relaxation Sโ€ฒ\mathcal S'Sโ€ฒ is exact at all binary points of such a Y\mathcal YY, which is the setting of the first-level Reformulation-Linearization Technique for mixed-binary bilinear programs.

Formalization Note Only the first clause of the remark is stated; its second clause is Lemma 7.4 at these points. No convexity of Y\mathcal YY is needed.

Preamble
import Mathlib
import Definitions.Def_ShortestGCS_MICP_Perspective
import Definitions.Def_ShortestGCS_Relax_Setting
Formal statement
namespace ShortestGCS.Relax

/-- Remark 7.5, arXiv:2101.11565v5, p. 14: if `๐’ด โІ [0, 1]แต`, every `y โˆˆ ๐’ด โˆฉ {0, 1}แต` is an extreme point of
`๐’ด`. -/
theorem remark_7_5 {m : โ„•} (Y : Set (Fin m โ†’ โ„)) (hY : Y โІ {y | โˆ€ i, y i โˆˆ Set.Icc (0 : โ„) 1}) :
    โˆ€ y โˆˆ Y, (โˆ€ i, y i = 0 โˆจ y i = 1) โ†’ y โˆˆ Set.extremePoints โ„ Y := by sorry

end ShortestGCS.Relax
Source
arXiv:2101.11565v5, Remark 7.5, p. 14
Human review
  • Endorsed by Shuze Chen ยท Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 ยท Oct 10, 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