Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2 — the LP algorithm decides PCSP(Γ) when MajL\mathrm{Maj}_LMajL​ or ATL∈Pol(Γ)\mathrm{AT}_L \in \mathrm{Pol}(\Gamma)ATL​∈Pol(Γ) for all odd LLL

Proved
SymBoolPCSP.LPRounding.algorithm_3_2_correct

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

dichotomylinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphismspromise-csp

Let Γ={(PR,QR):R∈τ}\Gamma = \{(P_R, Q_R) : R \in \tau\}Γ={(PR​,QR​):R∈τ} be a finite family of Boolean promise relations, PR⊆QRP_R \subseteq Q_RPR​⊆QR​, and suppose that

  1. MajL\mathrm{Maj}_LMajL​ is a polymorphism of Γ\GammaΓ for every odd LLL, or
  2. ATL\mathrm{AT}_LATL​ is a polymorphism of Γ\GammaΓ for every odd LLL.

Then the LP algorithm of §3.2 decides PCSP(Γ)\mathrm{PCSP}(\Gamma)PCSP(Γ): for every instance Ψ=(ΨP,ΨQ)\Psi = (\Psi_P, \Psi_Q)Ψ=(ΨP​,ΨQ​),

ΨP satisfiable  ⟹  the algorithm outputs “satisfiable”  ⟹  ΨQ satisfiable.\Psi_P \text{ satisfiable} \;\Longrightarrow\; \text{the algorithm outputs ``satisfiable''} \;\Longrightarrow\; \Psi_Q \text{ satisfiable}.ΨP​ satisfiable⟹the algorithm outputs “satisfiable”⟹ΨQ​ satisfiable.

Equivalently, it answers "satisfiable" on every YES instance and "unsatisfiable" on every NO instance. No symmetry of the relations is assumed.

This is the algebraic content of the Majority and Alternating-Threshold cases of Theorem 3.2: since the LP has size linear in the instance and LPs are solvable in polynomial time, it yields polynomial-time tractability of PCSP(Γ)\mathrm{PCSP}(\Gamma)PCSP(Γ).

Formalization Note The algorithm's answer is LPAlgAccepts 𝔸 X (an LP feasibility test over Q\mathbb QQ, see the definition file). The hypothesis is a disjunction of two universal statements, not "for every odd LLL, MajL\mathrm{Maj}_LMajL​ or ATL\mathrm{AT}_LATL​". The polynomial running time, and hence the printed conclusion "PCSP(Γ) is polynomial-time tractable", is not formalized.

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, pp. 13–15 (algebraic core of the Majority and Alternating-Threshold cases of
Theorem 3.2, p. 15): let `Γ` be a finite family of Boolean promise relations such that `Maj_L` is a
polymorphism of `Γ` for every odd `L`, or `AT_L` is a polymorphism of `Γ` for every odd `L`. Then
the LP algorithm of §3.2 decides `PCSP(Γ)`: it reports "satisfiable" on every instance with
`Ψ_P` satisfiable, and whenever it reports "satisfiable", `Ψ_Q` is satisfiable. -/
theorem algorithm_3_2_correct {τ : Type} [Fintype τ] {ar : τ → ℕ} (𝔸 𝔹 : RelStruct τ ar Bool)
    (hPQ : ∀ R, 𝔸.rel R ⊆ 𝔹.rel R)
    (hpol : (∀ L : ℕ, Odd L → IsPolymorphism 𝔸 𝔹 (SymBoolPCSP.CFixing.Maj L)) ∨
      (∀ L : ℕ, Odd L → IsPolymorphism 𝔸 𝔹 (SymBoolPCSP.CFixing.AT L))) :
    ∀ X : Instance τ ar,
      (SatIn X 𝔸 → LPAlgAccepts 𝔸 X) ∧ (LPAlgAccepts 𝔸 X → SatIn X 𝔹) := by sorry

end SymBoolPCSP.LPRounding
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, pp. 13–15, §3.2 (algorithm and proof of correctness); algebraic core of the Maj_L and AT_L cases of Theorem 3.2, p. 15
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