Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2, p. 17 — nonnegative a, c with Σ a_i > 0 admit convex multipliers θ with a_iθ_0 = c_iθ_i

Proved
RevConvexDisj.MultiTerm.lemma_2

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

convex-combinationfarkas-lemmalinear-inequalitiesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let s≥0s\ge 0s≥0 and a,c∈R+sa,c\in\mathbb{R}^s_+a,c∈R+s​ with ∑i=1sai>0\sum_{i=1}^s a_i>0∑i=1s​ai​>0. Then there is θ∈R+s+1\theta\in\mathbb{R}^{s+1}_+θ∈R+s+1​, indexed by 0,1,…,s0,1,\dots,s0,1,…,s, such that

∑i=0sθi=1,aiθ0−ciθi=0(i=1,…,s)(32).\sum_{i=0}^s\theta_i = 1,\qquad a_i\theta_0 - c_i\theta_i = 0\quad (i=1,\dots,s)\qquad (32).i=0∑s​θi​=1,ai​θ0​−ci​θi​=0(i=1,…,s)(32).

The paper derives it from Farkas' lemma and uses the multipliers θ\thetaθ to merge the representations of a point in all the terms SkCS^C_kSkC​ into a representation in TCT^CTC (proof of Theorem 5).

Formalization Note. The indices 0,…,s0,\dots,s0,…,s are Fin (s+1); the paper's index i≥1i\ge 1i≥1 of ai,cia_i,c_iai​,ci​ is i : Fin s, and the corresponding θi\theta_iθi​ 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
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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