Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.10 — avoiding Parity and Alternating-Threshold bounds |{i : f(e_i) = 1}|

Proved
SymBoolPCSP.CFixing.lemma_4_10

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, symmetric, folded, idempotent family of Boolean promise relations such that ParL1∉Pol(Γ)\mathrm{Par}_{L_1} \notin \mathrm{Pol}(\Gamma)ParL1​​∈/Pol(Γ) and ATL2∉Pol(Γ)\mathrm{AT}_{L_2} \notin \mathrm{Pol}(\Gamma)ATL2​​∈/Pol(Γ) for some odd L1,L2L_1, L_2L1​,L2​. Then there is c(Γ)∈Nc(\Gamma) \in \mathbb{N}c(Γ)∈N such that for every LLL and every polymorphism f:{0,1}L→{0,1}f : \{0,1\}^L \to \{0,1\}f:{0,1}L→{0,1} of Γ\GammaΓ,

∣{i∈{1,…,L}:f(ei)=1}∣≤c(Γ),\big|\{i \in \{1, \dots, L\} : f(e_i) = 1\}\big| \le c(\Gamma),​{i∈{1,…,L}:f(ei​)=1}​≤c(Γ),

where eie_iei​ is the iii-th unit vector.

The constant is uniform over all polymorphisms of all arities; this uniformity is the point of the lemma.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.CFixing

/-- Lemma 4.10 (p. 22): if `Γ` is finite, symmetric, folded and idempotent and
`Par_{L₁}, AT_{L₂} ∉ Pol(Γ)` for some odd `L₁, L₂`, then there is `c(Γ) ∈ ℕ` such that every
polymorphism `f` of `Γ`, of any arity `L`, has `|{i ∈ [L] : f(e_i) = 1}| ≤ c(Γ)`. -/
theorem lemma_4_10 {τ : Type} [Fintype τ] {ar : τ → ℕ} (𝔸 𝔹 : RelStruct τ ar Bool)
    (hPF : IsPromiseFamily 𝔸 𝔹) (hsym : IsSymmetricFamily 𝔸 𝔹) (hfold : IsFoldedFamily 𝔸 𝔹)
    (hidem : IsIdempotentFamily 𝔸 𝔹) (L₁ L₂ : ℕ) (hL₁ : Odd L₁) (hL₂ : Odd L₂)
    (hPar : ¬ IsPolymorphism 𝔸 𝔹 (Par L₁)) (hAT : ¬ IsPolymorphism 𝔸 𝔹 (AT L₂)) :
    ∃ c : ℕ, ∀ (L : ℕ) (f : (Fin L → Bool) → Bool), IsPolymorphism 𝔸 𝔹 f →
      (Finset.univ.filter (fun i : Fin L => f (indicator {i}) = true)).card ≤ c := by sorry

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