Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 15, pp. 14–15 — BLP+Affine correctly solves PCSP(A, B) iff X → F_{M_BLP+Aff}(A) implies X → B

Proved
PCSPBLPAff.Characterization.observation_15

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

affine-relaxationbasic-lpfree-structurep2o-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);
  2. for every instance XXX, if XXX is satisfiable in the free structure FMBLP+Aff(A)F_{\mathcal M_{\mathrm{BLP+Aff}}}(\mathbf A)FMBLP+Aff​​(A) then XXX is satisfiable in B\mathbf BB:
∀X:X→FMBLP+Aff(A) ⟹ X→B.\forall X:\quad X\to F_{\mathcal M_{\mathrm{BLP+Aff}}}(\mathbf A)\ \Longrightarrow\ X\to\mathbf B.∀X:X→FMBLP+Aff​​(A) ⟹ X→B.

This restates Definition 1 through the free structure; it is the first step of the proof of Lemma 7 in Appendix A.

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

/-- Observation 15, pp. 14–15: for a promise template `(𝔸, 𝔹)`, BLP+Affine correctly solves
`PCSP-Decision(𝔸, 𝔹)` iff every instance satisfiable in the free structure
`F_{M_BLP+Aff}(𝔸)` is satisfiable in `𝔹`. -/
theorem observation_15 {τ : 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 𝔸 𝔹 ↔ ∀ X : PCSPBLPAff.Symmetric.Instance τ ar, PCSPBLPAff.Symmetric.SatIn X (freeStruct 𝔸) → PCSPBLPAff.Symmetric.SatIn X 𝔹 := by sorry

end PCSPBLPAff.Characterization
Source
arXiv:1907.04383v3, Observation 15, pp. 14–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