(7.2), p. 12 — the bilinear set 𝒮 is contained in its relaxation 𝒮′
ProvedShortestGCS.Relax.bilin_subset_relaxbilinear-constraintsconvex-relaxationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1valid-inequalities
Let and be arbitrary sets, let , and let be the set of with for all and . Then
This says that the inequalities defining are valid for , so is a convex relaxation of . It is the easy direction of Lemma 7.4.
Preamble
import Mathlib import Definitions.Def_ShortestGCS_MICP_Perspective import Definitions.Def_ShortestGCS_Relax_Setting
Formal statement
namespace ShortestGCS.Relax
/-- (7.2), arXiv:2101.11565v5, p. 12: `𝒮 ⊆ 𝒮′` for any sets `𝒳 ⊆ ℝⁿ`, `𝒴 ⊆ ℝᵐ`. -/
theorem bilin_subset_relax {n m : ℕ} (X : Set (Fin n → ℝ)) (Y : Set (Fin m → ℝ)) :
bilinSet X Y ⊆ relaxSet X Y := by sorry
end ShortestGCS.Relax
Source
arXiv:2101.11565v5, (7.2), p. 12, with the preceding sentence
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.