Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark after Lemma 4.9 — the bounded version with the same A(n), d(n)

Proved
SymBoolPCSP.CFixing.remark_4_9

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

additive-combinatoricsfrobenius-problemp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1promise-csp

Let nnn be a positive integer. There are constants A(n)A(n)A(n) (nnn odd) and d(n)d(n)d(n) (nnn even) that satisfy Lemma 4.9 and in addition the following bounded version. Let NNN be a positive integer and S0,S1⊆{0,…,N}S_0, S_1 \subseteq \{0, \dots, N\}S0​,S1​⊆{0,…,N} with 0∈S00 \in S_00∈S0​, 1∈S11 \in S_11∈S1​, such that (1) and (2) of Lemma 4.9 hold whenever the sum on the left is at most NNN. Then

  1. for odd nnn: if A(n)≤NA(n) \le NA(n)≤N, then A(n)∈S0∩S1A(n) \in S_0 \cap S_1A(n)∈S0​∩S1​;
  2. for even nnn: if d(n)≤Nd(n) \le Nd(n)≤N, then every even mmm with d(n)≤m≤Nd(n) \le m \le Nd(n)≤m≤N lies in S0S_0S0​ and every odd such mmm lies in S1S_1S1​.

This is the form in which Lemma 4.9 is applied in Lemma 4.10, with NNN the number of coordinates iii with f(ei)=1f(e_i) = 1f(ei​)=1.

Formalization Note The remark's "independent of S1,S2S_1, S_2S1​,S2​" is a typo for S0,S1S_0, S_1S0​,S1​. The statement asserts one constant serving both the unbounded lemma and its bounded version for every NNN.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.CFixing

/-- Remark after Lemma 4.9 (p. 22): the constants `A(n)`, `d(n)` of Lemma 4.9 also serve the
bounded version, in which `S₀, S₁ ⊆ {0, …, N}` and (1)–(2) are only required when the sum is at
most `N`: if `A(n) ≤ N` then `A(n) ∈ S₀ ∩ S₁` (odd `n`), and if `d(n) ≤ N` then every even
`m ∈ [d(n), N]` lies in `S₀` and every odd `m ∈ [d(n), N]` in `S₁` (even `n`). -/
theorem remark_4_9 (n : ℕ) (hn : 0 < n) :
    (Odd n → ∃ A : ℕ,
      (∀ S₀ S₁ : Set ℕ, 0 ∈ S₀ → 1 ∈ S₁ →
        (∀ b : Fin n → ℕ, (∀ i, b i ∈ S₁) → ∑ i, b i ∈ S₀) →
        (∀ a ∈ S₀, ∀ b : Fin (n - 1) → ℕ, (∀ i, b i ∈ S₁) → a + ∑ i, b i ∈ S₁) →
        A ∈ S₀ ∧ A ∈ S₁) ∧
      (∀ N : ℕ, 0 < N → A ≤ N → ∀ S₀ S₁ : Set ℕ, S₀ ⊆ Set.Iic N → S₁ ⊆ Set.Iic N →
        0 ∈ S₀ → 1 ∈ S₁ →
        (∀ b : Fin n → ℕ, (∀ i, b i ∈ S₁) → ∑ i, b i ≤ N → ∑ i, b i ∈ S₀) →
        (∀ a ∈ S₀, ∀ b : Fin (n - 1) → ℕ, (∀ i, b i ∈ S₁) →
          a + ∑ i, b i ≤ N → a + ∑ i, b i ∈ S₁) →
        A ∈ S₀ ∧ A ∈ S₁)) ∧
    (Even n → ∃ d : ℕ,
      (∀ S₀ S₁ : Set ℕ, 0 ∈ S₀ → 1 ∈ S₁ →
        (∀ b : Fin n → ℕ, (∀ i, b i ∈ S₁) → ∑ i, b i ∈ S₀) →
        (∀ a ∈ S₀, ∀ b : Fin (n - 1) → ℕ, (∀ i, b i ∈ S₁) → a + ∑ i, b i ∈ S₁) →
        (∀ m : ℕ, d ≤ m → Even m → m ∈ S₀) ∧ (∀ m : ℕ, d ≤ m → Odd m → m ∈ S₁)) ∧
      (∀ N : ℕ, 0 < N → d ≤ N → ∀ S₀ S₁ : Set ℕ, S₀ ⊆ Set.Iic N → S₁ ⊆ Set.Iic N →
        0 ∈ S₀ → 1 ∈ S₁ →
        (∀ b : Fin n → ℕ, (∀ i, b i ∈ S₁) → ∑ i, b i ≤ N → ∑ i, b i ∈ S₀) →
        (∀ a ∈ S₀, ∀ b : Fin (n - 1) → ℕ, (∀ i, b i ∈ S₁) →
          a + ∑ i, b i ≤ N → a + ∑ i, b i ∈ S₁) →
        (∀ m : ℕ, d ≤ m → m ≤ N → Even m → m ∈ S₀) ∧
        (∀ m : ℕ, d ≤ m → m ≤ N → Odd m → m ∈ S₁))) := by sorry

end SymBoolPCSP.CFixing
Source
J. Brakensiek, V. Guruswami, Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy, arXiv:1704.01937v2, p. 22, Remark after Lemma 4.9
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