Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, proof, Case 2, pp. 14–15 — some probability vector vvv has (Mv)i≠w^i(Mv)_i \ne \hat w_i(Mv)i​=w^i​ wherever w^i∉{0,1}\hat w_i \notin \{0,1\}w^i​∈/{0,1}

Proved
SymBoolPCSP.LPRounding.case2_perturbation

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

linear-algebralinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n \ge 1n≥1, let M∈([0,1]∩Q)n×nM \in ([0,1] \cap \mathbb Q)^{n \times n}M∈([0,1]∩Q)n×n be a rational matrix with Mi,i∈{0,1}M_{i,i} \in \{0,1\}Mi,i​∈{0,1} for every iii, and let w^∈Qn\hat w \in \mathbb Q^nw^∈Qn be any rational vector. Then there is a rational vector v∈[0,1]nv \in [0,1]^nv∈[0,1]n with ∑jvj=1\sum_j v_j = 1∑j​vj​=1 such that w=Mvw = Mvw=Mv satisfies

wi≠w^ifor every i∈[n] with w^i∉{0,1}.w_i \ne \hat w_i \qquad \text{for every } i \in [n] \text{ with } \hat w_i \notin \{0,1\}.wi​=w^i​for every i∈[n] with w^i​∈/{0,1}.

In the Alternating-Threshold case of the correctness proof, w^\hat ww^ is a rational LP solution and w=Mvw = Mvw=Mv is a second LP solution that differs from w^\hat ww^ at every coordinate where w^\hat ww^ is fractional.

Formalization Note The paper takes w^\hat ww^ to be a rational LP solution; the statement here holds for every rational vector w^\hat ww^, which includes that case. The claim is stated directly over Q\mathbb QQ.

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, Case 2, pp. 14–15: for an `n × n` rational matrix `M` with entries in `[0, 1]`
and every diagonal entry in `{0, 1}` (`n ≥ 1`), and any rational vector `ŵ`, there is a rational
`v ∈ [0, 1]^n` with coordinate sum `1` such that `w = Mv` has `w_i ≠ ŵ_i` for every `i` with
`ŵ_i ∉ {0, 1}`. -/
theorem case2_perturbation (n : ℕ) (hn : 0 < n) (M : Fin n → Fin n → ℚ)
    (hM : ∀ i j, 0 ≤ M i j ∧ M i j ≤ 1) (hdiag : ∀ i, M i i = 0 ∨ M i i = 1)
    (what : Fin n → ℚ) :
    ∃ v : Fin n → ℚ, (∀ j, 0 ≤ v j ∧ v j ≤ 1) ∧ ∑ j, v j = 1 ∧
      ∀ i, what i ≠ 0 → what i ≠ 1 → ∑ j, M i j * v j ≠ what i := by sorry

end SymBoolPCSP.LPRounding
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, pp. 14–15, §3.2, proof, Case 2 (choice of v, w)
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