Proposition 7.1, inclusion ā, p. 12 ā every point of š®ā² satisfies the perspective-cone constraints (7.3)
ProvedShortestGCS.Relax.proposition_7_1_subsetconvex-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1perspectivepolyhedron
Let be a closed convex set, let be any family with , , and let . Then
This is the half of Proposition 7.1 used in the proof of Lemma 7.4: each defining inequality of , multiplied by all valid inequalities of , yields a perspective-cone constraint.
Formalization Note The paper states Proposition 7.1 for a polytope . This inclusion holds for every family of halfspaces, finite or not, bounded or not, and for (then ), 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.