Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.13 — folded symmetric Γ avoiding Par, AT, Maj and their antis has only C(Γ)-fixing polymorphisms

Proved
SymBoolPCSP.CFixing.theorem_4_13

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

booleanp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphismspromise-csp

Let Γ\GammaΓ be a finite, folded, symmetric family of Boolean promise relations. Assume that there are odd L1,…,L6L_1, \dots, L_6L1​,…,L6​ such that

ParL1, ATL2, MajL3, Par‾L4, AT‾L5, Maj‾L6\mathrm{Par}_{L_1},\ \mathrm{AT}_{L_2},\ \mathrm{Maj}_{L_3},\ \overline{\mathrm{Par}}_{L_4},\ \overline{\mathrm{AT}}_{L_5},\ \overline{\mathrm{Maj}}_{L_6}ParL1​​, ATL2​​, MajL3​​, ParL4​​, ATL5​​, Maj​L6​​

are not polymorphisms of Γ\GammaΓ, where g‾=¬g\overline{g} = \neg gg​=¬g. Then there is a constant C(Γ)C(\Gamma)C(Γ) such that every polymorphism of Γ\GammaΓ, of every arity LLL, is C(Γ)C(\Gamma)C(Γ)-fixing: for each such fff there is S⊆[L]S \subseteq [L]S⊆[L] with ∣S∣≤C(Γ)|S| \le C(\Gamma)∣S∣≤C(Γ) and f(x)=f(0,…,0)f(x) = f(0, \dots, 0)f(x)=f(0,…,0) whenever xxx vanishes on SSS.

Here ParL(x)=x1⊕⋯⊕xL\mathrm{Par}_L(x) = x_1 \oplus \dots \oplus x_LParL​(x)=x1​⊕⋯⊕xL​, MajL(x)=[∑ixi>L/2]\mathrm{Maj}_L(x) = [\sum_i x_i > L/2]MajL​(x)=[∑i​xi​>L/2] and ATL(x)=[∑i=1L(−1)i−1xi>0]\mathrm{AT}_L(x) = [\sum_{i=1}^L (-1)^{i-1} x_i > 0]ATL​(x)=[∑i=1L​(−1)i−1xi​>0]. Combined with the Label Cover reduction of §5 (Theorem 5.3), this structural statement gives the NP-hardness half of the paper's dichotomy for folded symmetric Boolean PCSPs (Theorem 2.16).

Formalization Note Only the structural statement is formalized; the NP-hardness conclusion of Theorems 2.16 and 5.3 is out of scope. Polymorphisms of every arity L≥0L \ge 0L≥0 are quantified, as in the published IsPolymorphism; a folded family has no nullary polymorphisms, so this changes nothing. The constant CCC precedes LLL and fff.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.CFixing

/-- Theorem 4.13 (p. 25): let `Γ` be a finite, folded, symmetric family of Boolean promise
relations, and assume there are odd `L₁, …, L₆` such that `Par_{L₁}`, `AT_{L₂}`, `Maj_{L₃}`,
`¬Par_{L₄}`, `¬AT_{L₅}` and `¬Maj_{L₆}` are not polymorphisms of `Γ`. Then there is `C(Γ)` such that
all polymorphisms of `Γ` (of every arity) are `C(Γ)`-fixing. -/
theorem theorem_4_13 {τ : Type} [Fintype τ] {ar : τ → ℕ} (𝔸 𝔹 : RelStruct τ ar Bool)
    (hPF : IsPromiseFamily 𝔸 𝔹) (hfold : IsFoldedFamily 𝔸 𝔹) (hsym : IsSymmetricFamily 𝔸 𝔹)
    (L₁ L₂ L₃ L₄ L₅ L₆ : ℕ) (hL₁ : Odd L₁) (hL₂ : Odd L₂) (hL₃ : Odd L₃) (hL₄ : Odd L₄)
    (hL₅ : Odd L₅) (hL₆ : Odd L₆)
    (h₁ : ¬ IsPolymorphism 𝔸 𝔹 (Par L₁)) (h₂ : ¬ IsPolymorphism 𝔸 𝔹 (AT L₂))
    (h₃ : ¬ IsPolymorphism 𝔸 𝔹 (Maj L₃))
    (h₄ : ¬ IsPolymorphism 𝔸 𝔹 (fun x : Fin L₄ → Bool => !Par L₄ x))
    (h₅ : ¬ IsPolymorphism 𝔸 𝔹 (fun x : Fin L₅ → Bool => !AT L₅ x))
    (h₆ : ¬ IsPolymorphism 𝔸 𝔹 (fun x : Fin L₆ → Bool => !Maj L₆ x)) :
    ∃ C : ℕ, ∀ (L : ℕ) (f : (Fin L → Bool) → Bool), IsPolymorphism 𝔸 𝔹 f → IsCFixing C f := by sorry

end SymBoolPCSP.CFixing
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, p. 25, Theorem 4.13
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