Lemma 4.9, p. 6 ā the perspective š³Ģ and the cone of valid inequalities š³Ā° are dual to each other
ProvedShortestGCS.Relax.lemma_4_9bipolardual-conep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perspectivevalid-inequalities
Let be a nonempty closed convex set, its perspective and its cone of valid inequalities. With the dual cone taken for the pairing on ,
The second identity is the form used later: a point lies in the perspective exactly when for every valid inequality of . It converts the infinitely many inequalities of the relaxation into perspective-cone membership.
Formalization Note Nonemptiness of is added: for the perspective is empty while has dual , so the second identity fails. The paper's sets 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.