Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.9 sum conditions from the relaxation (Ham_k{0,b}, Ham_k{0..k-1})

Proved
SymBoolPCSP.CFixing.sum_conditions_of_relax_zero

by Alien60 · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

booleanpolymorphismspromise-csp

Let 1≤b≤k−11 \le b \le k - 11≤b≤k−1, put n=k−b+1n = k - b + 1n=k−b+1, and let f:{0,1}L→{0,1}f : \{0,1\}^L \to \{0,1\}f:{0,1}L→{0,1} be a folded polymorphism of the promise relation (Hamk({0,b}),Hamk({0,…,k−1}))\big(\mathrm{Ham}_k(\{0, b\}), \mathrm{Ham}_k(\{0, \dots, k-1\})\big)(Hamk​({0,b}),Hamk​({0,…,k−1})). Fix T⊆[L]T \subseteq [L]T⊆[L] and, for β∈{0,1}\beta \in \{0,1\}β∈{0,1}, let SβS_\betaSβ​ be the set of s∈Ns \in \mathbb{N}s∈N such that f(eX)=βf(e_X) = \betaf(eX​)=β for every X⊆TX \subseteq TX⊆T with ∣X∣=s|X| = s∣X∣=s, where eXe_XeX​ is the indicator vector of XXX. Then:

  1. if b1,…,bn∈S1b_1, \dots, b_n \in S_1b1​,…,bn​∈S1​, then b1+⋯+bn∈S0b_1 + \cdots + b_n \in S_0b1​+⋯+bn​∈S0​;
  2. if a∈S0a \in S_0a∈S0​ and b1,…,bn−1∈S1b_1, \dots, b_{n-1} \in S_1b1​,…,bn−1​∈S1​, then a+b1+⋯+bn−1∈S1a + b_1 + \cdots + b_{n-1} \in S_1a+b1​+⋯+bn−1​∈S1​.

These are conditions (1) and (2) of Lemma 4.9 for the second relaxation produced by Lemma 4.5 (Case 2 of the proof of Lemma 4.10).

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic
Formal statement
open PCSPBLPAff.Symmetric
namespace SymBoolPCSP.CFixing

/-- Sum conditions from the second relaxation of Lemma 4.5: let `1 ≤ b ≤ k − 1`, `n = k − b + 1`, and let `f` be a folded polymorphism of `(Ham_k({0, b}), Ham_k({0,…,k−1}))`. Fix `T ⊆ [L]` and let `S_β` (`β ∈ {0,1}`) be the set of `s` such that `f(e_X) = β` for every `X ⊆ T` with `|X| = s`. Then any sum of `n` elements of `S₁` lies in `S₀`, and `a + b₁ + ⋯ + b_{n−1} ∈ S₁` whenever `a ∈ S₀` and all `bᵢ ∈ S₁`. -/
theorem sum_conditions_of_relax_zero {k b L : ℕ} (hb1 : 1 ≤ b) (hbk : b ≤ k - 1)
    (f : (Fin L → Bool) → Bool) (hfold : IsFolded f)
    (hf : PolOf (Ham k {0, b}) (Ham k (Set.Iic (k - 1))) f)
    (T : Finset (Fin L)) (S₀ S₁ : Set ℕ)
    (hS₀ : ∀ s, s ∈ S₀ ↔ ∀ X ⊆ T, X.card = s → f (indicator X) = false)
    (hS₁ : ∀ s, s ∈ S₁ ↔ ∀ X ⊆ T, X.card = s → f (indicator X) = true) :
    (∀ β : Fin (k - b + 1) → ℕ, (∀ i, β i ∈ S₁) → ∑ i, β i ∈ S₀) ∧
    (∀ a ∈ S₀, ∀ β : Fin (k - b + 1 - 1) → ℕ, (∀ i, β i ∈ S₁) → a + ∑ i, β i ∈ S₁) := by sorry

end SymBoolPCSP.CFixing
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, proof of Lemma 4.10, Case 2, pp. 22–23

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