Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, p. 6 — if Pol(A, B) has symmetric polymorphisms of arbitrarily large arities, BLP+Affine correctly solves PCSP-Decision(A, B)

Proved
PCSPBLPAff.Symmetric.theorem_2

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

linear-programmingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphismpromise-cspsymmetric-functions

Let (A,B)(\mathbf A,\mathbf B)(A,B) be a promise template over finite domains AAA, BBB, i.e. relational structures of a common signature with a homomorphism A→B\mathbf A\to\mathbf BA→B. Suppose Pol(A,B)\mathrm{Pol}(\mathbf A,\mathbf B)Pol(A,B) contains symmetric polymorphisms of arbitrarily large arities: for every N∈NN\in\mathbb NN∈N there are L≥NL\ge NL≥N and a symmetric polymorphism f:AL→Bf:A^L\to Bf:AL→B. Then

the BLP+Affine algorithm correctly solves PCSP-Decision(A,B),\text{the BLP+Affine algorithm correctly solves } \mathrm{PCSP\text{-}Decision}(\mathbf A,\mathbf B),the BLP+Affine algorithm correctly solves PCSP-Decision(A,B),

that is, for every instance XXX: if XXX is satisfiable in A\mathbf AA, the algorithm accepts XXX; and if the algorithm accepts XXX, then XXX is satisfiable in B\mathbf BB.

The algorithm solves the Basic LP, takes a relative interior point, and checks whether the affine relaxation restricted to its support has an integer solution. The theorem shows that one algorithm covers every template with an infinite family of symmetric polymorphisms, without knowing the polymorphisms.

Formalization Note The algorithm is formalized by its acceptance condition (see the definitions module); polynomial running time is not part of the statement. The polymorphism hypothesis depends only on (A,B)(\mathbf A,\mathbf B)(A,B) and precedes the quantifier over instances.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
Formal statement
namespace PCSPBLPAff.Symmetric

/-- Theorem 2 (arXiv:1907.04383v3, p. 6): if `Pol(𝔸, 𝔹)` has symmetric polymorphisms of
arbitrarily large arities, the BLP+Affine algorithm correctly solves `PCSP-Decision(𝔸, 𝔹)`. -/
theorem theorem_2 {τ : Type} {ar : τ → ℕ} {A B : Type} [Fintype A] [DecidableEq A] [Fintype B]
    (𝔸 : RelStruct τ ar A) (𝔹 : RelStruct τ ar B) (hT : IsPromiseTemplate 𝔸 𝔹)
    (hsym : ∀ N : ℕ, ∃ L : ℕ, N ≤ L ∧
      ∃ f : (Fin L → A) → B, IsPolymorphism 𝔸 𝔹 f ∧ IsSymmetric f) :
    CorrectlySolves 𝔸 𝔹 := by sorry

end PCSPBLPAff.Symmetric
Source
arXiv:1907.04383v3, Theorem 2, p. 6
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