Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.9, p. 6 — the perspective š’³Ģƒ and the cone of valid inequalities š’³Ā° are dual to each other

Proved
ShortestGCS.Relax.lemma_4_9

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

bipolardual-conep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perspectivevalid-inequalities

Let XāŠ†Rn\mathcal X \subseteq \mathbb R^nXāŠ†Rn be a nonempty closed convex set, X~\tilde{\mathcal X}X~ its perspective and X∘\mathcal X^\circX∘ its cone of valid inequalities. With the dual cone taken for the pairing ⟨(a,b),(x,Ī»)⟩=a⊤x+bĪ»\langle (a, b), (x, \lambda) \rangle = a^\top x + b\lambda⟨(a,b),(x,Ī»)⟩=a⊤x+bĪ» on RnƗR\mathbb R^n \times \mathbb RRnƗR,

(X~)āˆ—=X∘and(X∘)āˆ—=X~.(\tilde{\mathcal X})^* = \mathcal X^\circ \qquad\text{and}\qquad (\mathcal X^\circ)^* = \tilde{\mathcal X}.(X~)āˆ—=X∘and(X∘)āˆ—=X~.

The second identity is the form used later: a point (x,Ī»)(x, \lambda)(x,Ī») lies in the perspective exactly when a⊤x+bλ≄0a^\top x + b\lambda \ge 0a⊤x+bλ≄0 for every valid inequality (a,b)(a, b)(a,b) of X\mathcal XX. It converts the infinitely many inequalities of the relaxation S′\mathcal S'S′ into perspective-cone membership.

Formalization Note Nonemptiness of X\mathcal XX is added: for X=āˆ…\mathcal X = \emptysetX=āˆ… the perspective is empty while X∘=Rn+1\mathcal X^\circ = \mathbb R^{n+1}X∘=Rn+1 has dual {0}\{0\}{0}, so the second identity fails. The paper's sets Xv\mathcal X_vXv​ are nonempty by the standing assumptions of Section 2. The paper's phrase "closed convex cones" is a presupposition and is not part of the Lean conclusion.

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

/-- Lemma 4.9, arXiv:2101.11565v5, p. 6: for a nonempty closed convex set `š’³ āŠ† ā„āæ`, the cones `š’³Ģƒ` and `š’³Ā°`
are dual to each other: `(š’³Ģƒ)* = š’³Ā°` and `(š’³Ā°)* = š’³Ģƒ`, for the pairing `((a, b), (x, Ī»)) ↦ aįµ€x + bĪ»`.
Nonemptiness is added: for `š’³ = āˆ…`, `š’³Ģƒ = āˆ…` while `(š’³Ā°)* = {0}`. -/
theorem lemma_4_9 {n : ā„•} (X : Set (Fin n → ā„)) (hXne : X.Nonempty) (hXc : IsClosed X)
    (hXcv : Convex ā„ X) :
    dualCone (ShortestGCS.MICP.perspectiveSet X) = validCone X ∧ dualCone (validCone X) = ShortestGCS.MICP.perspectiveSet X := by sorry

end ShortestGCS.Relax
Source
arXiv:2101.11565v5, Lemma 4.9, p. 6 (proof p. 7)
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