Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.9 — two sets closed under the sums (1)–(2) meet, or contain all large evens/odds

Proved
SymBoolPCSP.CFixing.lemma_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. Say that S0,S1⊆Z≥0S_0, S_1 \subseteq \mathbb{Z}_{\ge 0}S0​,S1​⊆Z≥0​ satisfy (1)–(2) if for all a∈S0a \in S_0a∈S0​ and all b1,…,bn∈S1b_1, \dots, b_n \in S_1b1​,…,bn​∈S1​ (not necessarily distinct)

b1+⋯+bn∈S0(1),a+b1+⋯+bn−1∈S1(2).b_1 + \dots + b_n \in S_0 \quad (1), \qquad a + b_1 + \dots + b_{n-1} \in S_1 \quad (2).b1​+⋯+bn​∈S0​(1),a+b1​+⋯+bn−1​∈S1​(2).
  1. If nnn is odd, there is A(n)∈Z≥0A(n) \in \mathbb{Z}_{\ge 0}A(n)∈Z≥0​ such that A(n)∈S0∩S1A(n) \in S_0 \cap S_1A(n)∈S0​∩S1​ for every pair satisfying (1)–(2) with 0∈S00 \in S_00∈S0​ and 1∈S11 \in S_11∈S1​.
  2. If nnn is even, there is d(n)∈Z≥0d(n) \in \mathbb{Z}_{\ge 0}d(n)∈Z≥0​ such that for every such pair, S0S_0S0​ contains all even integers ≥d(n)\ge d(n)≥d(n) and S1S_1S1​ contains all odd integers ≥d(n)\ge d(n)≥d(n).

This additive-combinatorics lemma is what forces a polymorphism with many coordinates iii having f(ei)=1f(e_i) = 1f(ei​)=1 to behave like parity (Lemma 4.10).

Formalization Note The constants depend on nnn only, not on S0,S1S_0, S_1S0​,S1​, as the notation A(n)A(n)A(n), d(n)d(n)d(n) and the remark after the lemma state; the quantifiers are ordered accordingly.

Preamble
import Mathlib
import Definitions.Def_PCSPBLPAff_Symmetric_Setting
import Definitions.Def_SymBoolPCSP_CFixing_Basic

open PCSPBLPAff.Symmetric
Formal statement
namespace SymBoolPCSP.CFixing

/-- Lemma 4.9 (p. 21). For a positive integer `n`, say that `S₀, S₁ ⊆ ℤ_{≥0}` satisfy (1)–(2) if
for all `a ∈ S₀` and `b₁, …, bₙ ∈ S₁`: (1) `b₁ + ⋯ + bₙ ∈ S₀` and (2) `a + b₁ + ⋯ + b_{n−1} ∈ S₁`.
If `n` is odd there is `A(n)` lying in `S₀ ∩ S₁` for every such pair with `0 ∈ S₀`, `1 ∈ S₁`; if `n`
is even there is `d(n)` such that every such pair has all even integers `≥ d(n)` in `S₀` and all
odd integers `≥ d(n)` in `S₁`. The constants depend on `n` only. -/
theorem lemma_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₁) ∧
    (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₁)) := by sorry

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