Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.1, inclusion āŠ†, p. 12 — every point of š’®ā€² satisfies the perspective-cone constraints (7.3)

Proved
ShortestGCS.Relax.proposition_7_1_subset

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

convex-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perspectivepolyhedron

Let XāŠ†Rn\mathcal X \subseteq \mathbb R^nXāŠ†Rn be a closed convex set, let (ci,di)i∈I(c_i, d_i)_{i \in \mathcal I}(ci​,di​)i∈I​ be any family with ci∈Rmc_i \in \mathbb R^mciā€‹āˆˆRm, di∈Rd_i \in \mathbb Rdiā€‹āˆˆR, and let Y={y:ci⊤y+di≄0Ā forĀ allĀ i∈I}\mathcal Y = \{y : c_i^\top y + d_i \ge 0 \text{ for all } i \in \mathcal I\}Y={y:ciāŠ¤ā€‹y+di​≄0Ā forĀ allĀ i∈I}. Then

Sā€²āŠ†{(x,y,Z):(Zci+dix,Ā ci⊤y+di)∈X~Ā forĀ allĀ i∈I}.\mathcal S' \subseteq \{(x, y, Z) : (Zc_i + d_i x,\ c_i^\top y + d_i) \in \tilde{\mathcal X} \text{ for all } i \in \mathcal I\}.Sā€²āŠ†{(x,y,Z):(Zci​+di​x,Ā ciāŠ¤ā€‹y+di​)∈X~Ā forĀ allĀ i∈I}.

This is the half of Proposition 7.1 used in the proof of Lemma 7.4: each defining inequality of Y\mathcal YY, multiplied by all valid inequalities of X\mathcal XX, yields a perspective-cone constraint.

Formalization Note The paper states Proposition 7.1 for a polytope Y\mathcal YY. This inclusion holds for every family of halfspaces, finite or not, bounded or not, and for X=āˆ…\mathcal X = \emptysetX=āˆ… (then S′=āˆ…\mathcal S' = \emptysetS′=āˆ…), so these hypotheses are dropped; the statement is stronger.

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

/-- Proposition 7.1, inclusion `āŠ†`, arXiv:2101.11565v5, p. 12: for a closed convex `š’³` and any family of
halfspaces `cᵢᵀy + dįµ¢ ≄ 0`, every point of `š’®ā€²` (with `š’“ = {y : cᵢᵀy + dįµ¢ ≄ 0 āˆ€ i}`) satisfies the
perspective-cone constraints (7.3). Boundedness of `š’“` and finiteness of the index set are not needed. -/
theorem proposition_7_1_subset {n m : ā„•} {ι : Type*} (X : Set (Fin n → ā„)) (hXc : IsClosed X)
    (hXcv : Convex ā„ X) (c : ι → Fin m → ā„) (d : ι → ā„) :
    relaxSet X (polyhedron c d) āŠ† asymRelaxSet X c d := by sorry

end ShortestGCS.Relax
Source
arXiv:2101.11565v5, Proposition 7.1, (7.3), p. 12 (inclusion āŠ†)
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