Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 11 — BLP+Affine correctly solves PCSP-Decision(A, B) iff M_BLP+Aff has a minion homomorphism to Pol(A, B)

Proved
PCSPBLPAff.Characterization.lemma_7

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

affine-relaxationbasic-lpminionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1promise-csp

Let (A,B)(\mathbf A,\mathbf B)(A,B) be a promise template on finite domains. The following are equivalent:

  1. the BLP+Affine algorithm correctly solves PCSP-Decision(A,B)\mathrm{PCSP\text{-}Decision}(\mathbf A,\mathbf B)PCSP-Decision(A,B) (Definition 1);
  2. MBLP+Aff\mathcal M_{\mathrm{BLP+Aff}}MBLP+Aff​ admits a minion homomorphism to Pol(A,B)\mathrm{Pol}(\mathbf A,\mathbf B)Pol(A,B).
BLP+Affine correctly solves PCSP(A,B)  ⟺  MBLP+Aff→Pol(A,B).\text{BLP+Affine correctly solves }\mathrm{PCSP}(\mathbf A,\mathbf B)\iff \mathcal M_{\mathrm{BLP+Aff}}\to\mathrm{Pol}(\mathbf A,\mathbf B).BLP+Affine correctly solves PCSP(A,B)⟺MBLP+Aff​→Pol(A,B).

This is the algebraic characterization of the algorithm's power; Lemmas 8 and 9 translate its right-hand side into concrete polymorphisms, giving Theorem 4.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Characterization_Setting
Formal statement
namespace PCSPBLPAff.Characterization

/-- Lemma 7, p. 11: for a promise template `(𝔸, 𝔹)`, BLP+Affine correctly solves
`PCSP-Decision(𝔸, 𝔹)` (Definition 1) iff `M_BLP+Aff` admits a minion homomorphism to
`Pol(𝔸, 𝔹)`. -/
theorem lemma_7 {τ : Type} {ar : τ → ℕ} {A B : Type} [Fintype A] [DecidableEq A] [Fintype B]
    (𝔸 : PCSPBLPAff.Symmetric.RelStruct τ ar A) (𝔹 : PCSPBLPAff.Symmetric.RelStruct τ ar B) (hT : PCSPBLPAff.Symmetric.IsPromiseTemplate 𝔸 𝔹) :
    PCSPBLPAff.Symmetric.CorrectlySolves 𝔸 𝔹 ↔ HasMinionHomToPol 𝔸 𝔹 := by sorry

end PCSPBLPAff.Characterization
Source
arXiv:1907.04383v3, Lemma 7, p. 11 (proof in Appendix A, pp. 13–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