Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.7 — a projection-closed finitizable family containing id_D is Pol(Γ) for a finite Γ

Proved
SymBoolPCSP.PolChar.lemma_6_7

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

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

Let DDD be a finite domain and let F\mathcal FF be a family of functions over DDD which is projection-closed and finitizable and contains the identity idD\mathrm{id}_DidD​. Then there is a family Γ\GammaΓ of finitely many promise relations over DDD such that

Pol(Γ)=F.\mathrm{Pol}(\Gamma) = \mathcal F.Pol(Γ)=F.

This is the sufficiency half of Theorem 6.5, a finite-signature analogue of Pippenger's characterization of polymorphism families.

Formalization Note The finite family is existential together with its signature: a finite type τ, arities ar : τ → ℕ, and structures 𝔸 ⊆ 𝔹. The equality Pol(Γ)=F\mathrm{Pol}(\Gamma) = \mathcal FPol(Γ)=F is asserted at every arity L≥1L \ge 1L≥1. No assumption ∣D∣≥2|D| \ge 2∣D∣≥2 is made.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_PolChar_Basic
Formal statement
namespace SymBoolPCSP.PolChar

open PCSPBLPAff.Symmetric

/-- Lemma 6.7 (p. 29): if a family `F` of functions over a finite domain `D` is
projection-closed, finitizable and contains `id_D`, then there is a finite family `Γ` of
promise relations (a finite signature `τ` with arities `ar` and structures `𝔸 ⊆ 𝔹`) with
`Pol(Γ) = F` at every arity `L ≥ 1`. -/
theorem lemma_6_7 {D : Type} [Fintype D] [DecidableEq D] (F : FunFamily D)
    (hpc : ProjectionClosed F) (hfin : Finitizable F) (hid : ContainsId F) :
    ∃ (τ : Type) (_ : Fintype τ) (ar : τ → ℕ) (𝔸 𝔹 : RelStruct τ ar D),
      (∀ R : τ, 𝔸.rel R ⊆ 𝔹.rel R) ∧ ∀ L : ℕ, 0 < L → Pol 𝔸 𝔹 L = F L := by sorry

end SymBoolPCSP.PolChar
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, p. 29, Lemma 6.7 (proof pp. 29–30)
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