Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, proof, p. 14 — convex combinations of LP solutions are LP solutions

Proved
SymBoolPCSP.LPRounding.convex_combination

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

convexitylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1promise-csp

Let Γ\GammaΓ be a family of Boolean promise relations and Ψ\PsiΨ an instance with nnn variables. Let u(1),…,u(m)∈Qnu^{(1)}, \dots, u^{(m)} \in \mathbb Q^nu(1),…,u(m)∈Qn be solutions of the LP relaxation of §3.2 and let λ1,…,λm≥0\lambda_1, \dots, \lambda_m \ge 0λ1​,…,λm​≥0 be rationals with ∑kλk=1\sum_k \lambda_k = 1∑k​λk​=1. Then

∑k=1mλk u(k)\sum_{k=1}^m \lambda_k\, u^{(k)}k=1∑m​λk​u(k)

is also a solution of the LP relaxation.

In the proof of correctness this is applied to the nnn columns of the matrix MMM of LP solutions found by the algorithm, so that MvMvMv is a solution for every probability vector vvv.

Formalization Note The paper states the fact for the nnn columns of MMM; this item states the general convexity of the solution set over Q\mathbb QQ, for any finite number mmm of solutions.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_LPRounding_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.LPRounding

/-- §3.2, proof, p. 14: any convex combination of LP solutions is an LP solution. (The
paper applies this to the `n` columns of the matrix `M`; this is the general convexity.) -/
theorem convex_combination {τ : Type} {ar : τ → ℕ} (𝔸 : RelStruct τ ar Bool)
    (X : Instance τ ar) {m : ℕ} (u : Fin m → Fin X.n → ℚ) (hu : ∀ k, IsHullLPSol 𝔸 X (u k))
    (lam : Fin m → ℚ) (hlam0 : ∀ k, 0 ≤ lam k) (hlam1 : ∑ k, lam k = 1) :
    IsHullLPSol 𝔸 X (∑ k, lam k • u k) := by sorry

end SymBoolPCSP.LPRounding
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, p. 14, §3.2, proof (second paragraph)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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