Lemma 2, p. 17 — nonnegative a, c with Σ a_i > 0 admit convex multipliers θ with a_iθ_0 = c_iθ_i
ProvedRevConvexDisj.MultiTerm.lemma_2convex-combinationfarkas-lemmalinear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let and with . Then there is , indexed by , such that
The paper derives it from Farkas' lemma and uses the multipliers to merge the representations of a point in all the terms into a representation in (proof of Theorem 5).
Formalization Note. The indices are Fin (s+1); the paper's index of is i : Fin s, and the corresponding is θ i.succ.
Preamble
import Mathlib import Definitions.Def_RevConvexDisj_MultiTerm_Model
Formal statement
namespace RevConvexDisj.MultiTerm
theorem lemma_2 (s : ℕ) (a c : Fin s → ℝ) (ha : ∀ i, 0 ≤ a i) (hc : ∀ i, 0 ≤ c i)
(hsum : 0 < ∑ i, a i) :
∃ θ : Fin (s + 1) → ℝ, (∀ i, 0 ≤ θ i) ∧ ∑ i, θ i = 1 ∧
∀ i : Fin s, a i * θ 0 - c i * θ i.succ = 0 := by sorry
end RevConvexDisj.MultiTerm
Source
Towle & Luedtke, Intersection disjunctions for reverse convex sets, arXiv:1901.02112v5, p. 17, Lemma 2, (32)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.