Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.6 — AT(Ham_k(S)) for |S| ≤ 2

Proved
SymBoolPCSP.CFixing.claim_4_6

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

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

Write AT(P)=⋃L oddATL(P)\mathrm{AT}(P) = \bigcup_{L \text{ odd}} \mathrm{AT}_L(P)AT(P)=⋃L odd​ATL​(P) for the set of all tuples obtained by applying an alternating-threshold function of odd arity coordinate-wise to elements of PPP. Let k≥1k \ge 1k≥1. Then

  1. AT(Hamk({0}))=Hamk({0})\mathrm{AT}(\mathrm{Ham}_k(\{0\})) = \mathrm{Ham}_k(\{0\})AT(Hamk​({0}))=Hamk​({0});
  2. AT(Hamk({k}))=Hamk({k})\mathrm{AT}(\mathrm{Ham}_k(\{k\})) = \mathrm{Ham}_k(\{k\})AT(Hamk​({k}))=Hamk​({k});
  3. AT(Hamk({0,k}))=Hamk({0,k})\mathrm{AT}(\mathrm{Ham}_k(\{0,k\})) = \mathrm{Ham}_k(\{0,k\})AT(Hamk​({0,k}))=Hamk​({0,k});
  4. if k≥2k \ge 2k≥2 and ℓ∈{1,…,k−1}\ell \in \{1, \dots, k-1\}ℓ∈{1,…,k−1}, then AT(Hamk({ℓ}))=Hamk({1,…,k−1})\mathrm{AT}(\mathrm{Ham}_k(\{\ell\})) = \mathrm{Ham}_k(\{1, \dots, k-1\})AT(Hamk​({ℓ}))=Hamk​({1,…,k−1});
  5. if k≥2k \ge 2k≥2 and ℓ1≠ℓ2\ell_1 \ne \ell_2ℓ1​=ℓ2​ in {0,…,k}\{0, \dots, k\}{0,…,k} with {ℓ1,ℓ2}≠{0,k}\{\ell_1, \ell_2\} \ne \{0, k\}{ℓ1​,ℓ2​}={0,k}, then AT(Hamk({ℓ1,ℓ2}))={0,1}k\mathrm{AT}(\mathrm{Ham}_k(\{\ell_1, \ell_2\})) = \{0,1\}^kAT(Hamk​({ℓ1​,ℓ2​}))={0,1}k.

These computations identify which symmetric relations can witness that ATL\mathrm{AT}_LATL​ is not a polymorphism, the first step of Lemma 4.5.

Formalization Note In fact 5 the weights ℓ1,ℓ2\ell_1, \ell_2ℓ1​,ℓ2​ range over {0,…,k}\{0,\dots,k\}{0,…,k}, the possible Hamming weights, as the source's notation implies.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.CFixing

/-- Claim 4.6 (p. 17), with `AT(P) = ⋃_{L odd} AT_L(P)`: for `k ≥ 1`,
1. `AT(Ham_k({0})) = Ham_k({0})`;
2. `AT(Ham_k({k})) = Ham_k({k})`;
3. `AT(Ham_k({0, k})) = Ham_k({0, k})`;
4. `AT(Ham_k({ℓ})) = Ham_k({1, …, k − 1})` for `k ≥ 2`, `ℓ ∈ {1, …, k − 1}`;
5. `AT(Ham_k({ℓ₁, ℓ₂})) = {0,1}^k` for `k ≥ 2`, `ℓ₁ ≠ ℓ₂` in `{0, …, k}`, `{ℓ₁, ℓ₂} ≠ {0, k}`. -/
theorem claim_4_6 (k : ℕ) (hk : 1 ≤ k) :
    ATImage (Ham k {0}) = Ham k {0} ∧
    ATImage (Ham k {k}) = Ham k {k} ∧
    ATImage (Ham k {0, k}) = Ham k {0, k} ∧
    (2 ≤ k → ∀ l : ℕ, 1 ≤ l → l ≤ k - 1 → ATImage (Ham k {l}) = Ham k (Set.Icc 1 (k - 1))) ∧
    (2 ≤ k → ∀ l₁ l₂ : ℕ, l₁ ≤ k → l₂ ≤ k → ({l₁, l₂} : Set ℕ) ≠ {0, k} → l₁ ≠ l₂ →
      ATImage (Ham k {l₁, l₂}) = Set.univ) := by sorry

end SymBoolPCSP.CFixing
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, p. 17, Claim 4.6 (in the proof of Lemma 4.5)
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