Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 6.1 — P′ ⊆ S′_m ⊆ T′_m ⊆ Q′

Proved
SymBoolPCSP.Galois.chain

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

galois-correspondencep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1polymorphismspromise-csp

Let DDD be a finite domain, Γ\GammaΓ a finite family and Γ′\Gamma'Γ′ a family of promise relations on DDD with Pol(Γ)⊆Pol(Γ′)\mathrm{Pol}(\Gamma) \subseteq \mathrm{Pol}(\Gamma')Pol(Γ)⊆Pol(Γ′). Let (P′,Q′)∈Γ′(P', Q') \in \Gamma'(P′,Q′)∈Γ′ have arity kkk, let m=∣P′∣m = |P'|m=∣P′∣ and let x1,…,xmx^1, \dots, x^mx1,…,xm be an ordering of the elements of P′P'P′. With yji=xijy^i_j = x^j_iyji​=xij​ and Sm′,Tm′S'_m, T'_mSm′​,Tm′​ as in the previous milestone,

P′⊆Sm′⊆Tm′⊆Q′.P' \subseteq S'_m \subseteq T'_m \subseteq Q'.P′⊆Sm′​⊆Tm′​⊆Q′.

Together with the sandwich remark this makes (P′,Q′)(P', Q')(P′,Q′) ppp-definable from (Sm′,Tm′)(S'_m, T'_m)(Sm′​,Tm′​), and then from Γ\GammaΓ by transitivity.

Formalization Note The ordering of P′P'P′ is a bijection e : Fin m ≃ P', so m=∣P′∣m = |P'|m=∣P′∣ is enforced by the bijection; m=0m = 0m=0 (empty P′P'P′) is included. Pol(Γ)⊆Pol(Γ′)\mathrm{Pol}(\Gamma) \subseteq \mathrm{Pol}(\Gamma')Pol(Γ)⊆Pol(Γ′) ranges over all arities L≥0L \ge 0L≥0.

Preamble
import Mathlib
import Definitions.Def_SymBoolPCSP_Galois_Basic
Formal statement
namespace SymBoolPCSP.Galois

open PCSPBLPAff.Symmetric

/-- Proof of Theorem 6.1, p. 28: let `Pol(Γ) ⊆ Pol(Γ′)`, let `(P', Q') = (𝔸'.rel R', 𝔹'.rel R')`
be a relation of `Γ′` with `m = |P'|`, and let `x^1, …, x^m` be an ordering `e` of `P'`. With
`(y_i)_j = (x^j)_i`, `S′_m = {(f(y_1), …, f(y_k)) : f ∈ S_m}` and
`T′_m = {(f(y_1), …, f(y_k)) : f ∈ T_m}`, we have `P' ⊆ S′_m ⊆ T′_m ⊆ Q'`. -/
theorem chain {τ τ' : Type} [Fintype τ] {ar : τ → ℕ} {ar' : τ' → ℕ}
    {D : Type} [Fintype D] [DecidableEq D]
    (𝔸 𝔹 : RelStruct τ ar D) (𝔸' 𝔹' : RelStruct τ' ar' D)
    (hΓ : IsPromiseFamily 𝔸 𝔹) (hΓ' : IsPromiseFamily 𝔸' 𝔹')
    (hPol : PolSubset 𝔸 𝔹 𝔸' 𝔹') (R' : τ') (m : ℕ) (e : Fin m ≃ 𝔸'.rel R') :
    𝔸'.rel R' ⊆ evalAt (fun j => (e j : Fin (ar' R') → D)) (SL 𝔸 m) ∧
      evalAt (fun j => (e j : Fin (ar' R') → D)) (SL 𝔸 m) ⊆
        evalAt (fun j => (e j : Fin (ar' R') → D)) (TL 𝔸 𝔹 m) ∧
      evalAt (fun j => (e j : Fin (ar' R') → D)) (TL 𝔸 𝔹 m) ⊆ 𝔹'.rel R' := by sorry

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