Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, proof, Case 1, p. 14 — some probability vector vvv has (Mv)i≠1/2(Mv)_i \ne 1/2(Mv)i​=1/2 for all iii

Proved
SymBoolPCSP.LPRounding.case1_claim

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 and 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 whose diagonal entries satisfy Mi,i∈{0,1}M_{i,i} \in \{0,1\}Mi,i​∈{0,1} for every iii. 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

(Mv)i=∑j=1nMi,jvj≠12for all i∈[n].(Mv)_i = \sum_{j=1}^n M_{i,j} v_j \ne \tfrac12 \qquad \text{for all } i \in [n].(Mv)i​=j=1∑n​Mi,j​vj​=21​for all i∈[n].

In the Majority case of the correctness proof, MMM is the matrix whose iii-th column is an LP solution with iii-th coordinate in {0,1}\{0,1\}{0,1}, and MvMvMv is then an LP solution with no coordinate equal to 1/21/21/2, ready to be rounded.

Formalization Note The paper first finds a real vvv and then perturbs it to a rational one; this item states the combined claim 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 1, p. 14: for an `n × n` rational matrix `M` with entries in `[0, 1]` and
every diagonal entry in `{0, 1}` (`n ≥ 1`), there is a rational `v ∈ [0, 1]^n` with coordinate
sum `1` such that `(Mv)_i ≠ 1/2` for all `i`. -/
theorem case1_claim (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) :
    ∃ v : Fin n → ℚ, (∀ j, 0 ≤ v j ∧ v j ≤ 1) ∧ ∑ j, v j = 1 ∧
      ∀ i, ∑ j, M i j * v j ≠ 1 / 2 := 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, Case 1 (claim and the perturbation to rational v′)
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