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

ยง7.1, p. 12 (after (7.2)) โ€” the inequalities of ๐’ฎโ€ฒ imply x โˆˆ ๐’ณ and y โˆˆ ๐’ด

Proved
ShortestGCS.Relax.note_after_7_2

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

convex-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1separationvalid-inequalities

Let XโІRn\mathcal X \subseteq \mathbb R^nXโІRn and YโІRm\mathcal Y \subseteq \mathbb R^mYโІRm be closed convex sets and let Sโ€ฒ\mathcal S'Sโ€ฒ be the relaxation (7.2). Then every (x,y,Z)โˆˆSโ€ฒ(x, y, Z) \in \mathcal S'(x,y,Z)โˆˆSโ€ฒ satisfies

xโˆˆXandyโˆˆY.x \in \mathcal X \quad\text{and}\quad y \in \mathcal Y .xโˆˆXandyโˆˆY.

In the paper this is obtained from the inequalities of (7.2) corresponding to (0,1)โˆˆYโˆ˜(0, 1) \in \mathcal Y^\circ(0,1)โˆˆYโˆ˜ and (0,1)โˆˆXโˆ˜(0, 1) \in \mathcal X^\circ(0,1)โˆˆXโˆ˜. It is the first step of the proof of Lemma 7.4.

Formalization Note No nonemptiness is assumed: if X=โˆ…\mathcal X = \emptysetX=โˆ… then (0,โˆ’1)โˆˆXโˆ˜(0, -1) \in \mathcal X^\circ(0,โˆ’1)โˆˆXโˆ˜ and Sโ€ฒ=โˆ…\mathcal S' = \emptysetSโ€ฒ=โˆ….

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

/-- ยง7.1, p. 12, the sentence after (7.2), arXiv:2101.11565v5: for closed convex `๐’ณ` and `๐’ด`, the
inequalities of `๐’ฎโ€ฒ` imply `x โˆˆ ๐’ณ` and `y โˆˆ ๐’ด`. -/
theorem note_after_7_2 {n m : โ„•} (X : Set (Fin n โ†’ โ„)) (Y : Set (Fin m โ†’ โ„))
    (hXc : IsClosed X) (hXcv : Convex โ„ X) (hYc : IsClosed Y) (hYcv : Convex โ„ Y) :
    relaxSet X Y โІ {w | w.1 โˆˆ X โˆง w.2.1 โˆˆ Y} := by sorry

end ShortestGCS.Relax
Source
arXiv:2101.11565v5, ยง7.1, p. 12, the sentence after (7.2)
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