Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.8 — Maj(Ham_k(S)) is Ham_k of an interval

Proved
SymBoolPCSP.CFixing.claim_4_8

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

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

Write Maj(P)=⋃L oddMajL(P)\mathrm{Maj}(P) = \bigcup_{L \text{ odd}} \mathrm{Maj}_L(P)Maj(P)=⋃L odd​MajL​(P). Let k≥1k \ge 1k≥1.

  1. If P⊆Hamk({0,k})P \subseteq \mathrm{Ham}_k(\{0, k\})P⊆Hamk​({0,k}), then Maj(P)=P\mathrm{Maj}(P) = PMaj(P)=P.
  2. If P=Hamk(S)P = \mathrm{Ham}_k(S)P=Hamk​(S) with S⊆{0,…,k}S \subseteq \{0, \dots, k\}S⊆{0,…,k} and S∖{0,k}≠∅S \setminus \{0, k\} \ne \emptysetS∖{0,k}=∅, then
Maj(P)=Hamk({0,…,k}∩{2(min⁡S)−k+1,…,2(max⁡S)−1}).\mathrm{Maj}(P) = \mathrm{Ham}_k\big(\{0, \dots, k\} \cap \{2(\min S) - k + 1, \dots, 2(\max S) - 1\}\big).Maj(P)=Hamk​({0,…,k}∩{2(minS)−k+1,…,2(maxS)−1}).

This is the majority analogue of Claim 4.6, the first step of Lemma 4.7.

Formalization Note The interval bounds are computed in Z\mathbb{Z}Z, since 2(min⁡S)−k+12(\min S) - k + 12(minS)−k+1 can be negative. SSS is a finite set of weights in {0,…,k}\{0, \dots, k\}{0,…,k}, the setting in which min⁡S\min SminS and max⁡S\max SmaxS are the extreme weights of PPP; its nonemptiness is a binder only so that min⁡S\min SminS and max⁡S\max SmaxS are defined (it follows from S∖{0,k}≠∅S \setminus \{0,k\} \ne \emptysetS∖{0,k}=∅).

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.8 (p. 19), with `Maj(P) = ⋃_{L odd} Maj_L(P)`: for `k ≥ 1`, if `P ⊆ Ham_k({0, k})` then
`Maj(P) = P`; and if `P = Ham_k(S)` with `S ⊆ {0, …, k}` and `S ∖ {0, k} ≠ ∅`, then
`Maj(P) = Ham_k({0, …, k} ∩ {2(min S) − k + 1, …, 2(max S) − 1})` (bounds computed in `ℤ`). -/
theorem claim_4_8 (k : ℕ) (hk : 1 ≤ k) :
    (∀ P : Set (Fin k → Bool), P ⊆ Ham k {0, k} → MajImage P = P) ∧
    (∀ (S : Finset ℕ) (hne : S.Nonempty), (∀ s ∈ S, s ≤ k) → (S \ {0, k}).Nonempty →
      MajImage (Ham k (S : Set ℕ)) =
        Ham k {b : ℕ | b ≤ k ∧ 2 * (S.min' hne : ℤ) - k + 1 ≤ b ∧
          (b : ℤ) ≤ 2 * (S.max' hne : ℤ) - 1}) := by sorry

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