Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 16 — agreement lemma for majority

Proved
SymmetricPSM1041.ORLowerBound.Supplement.agreement_lemma_majority

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

communication-complexityp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1support-privacy

Write p=⌈n/2⌉−1p=\lceil n/2\rceil-1p=⌈n/2⌉−1. There are an absolute constant c0>0c_0>0c0​>0 and a threshold N≥1N\ge1N≥1 such that the following holds for every n≥Nn\ge Nn≥N. Let Σ\SigmaΣ be a finite alphabet with ∣Σ∣≤c0n|\Sigma|\le c_0\sqrt n∣Σ∣≤c0​n​, and suppose that for every S⊆[n]S\subseteq[n]S⊆[n] with ∣S∣≥p+1|S|\ge p+1∣S∣≥p+1 we are given a coloring αS:S→Σ\alpha_S:S\to\SigmaαS​:S→Σ. Then there are sets T,S⊆[n]T,S\subseteq[n]T,S⊆[n] with ∣T∣≥p+1|T|\ge p+1∣T∣≥p+1 and ∣S∣≥p+1|S|\ge p+1∣S∣≥p+1 such that

  1. T⊊ST\subsetneq ST⊊S, and
  2. αT\alpha_TαT​ and αS∣T\alpha_S|_TαS​∣T​ disagree on at most ppp points:
#{i∈T:αT(i)≠αS(i)}≤p.\#\{i\in T:\alpha_T(i)\ne\alpha_S(i)\}\le p.#{i∈T:αT​(i)=αS​(i)}≤p.

Both sets are nonempty, since p+1≥1p+1\ge1p+1≥1. The lemma is the combinatorial core of the alphabet lower bound for majority (Theorem 22).

Formalization Note p+1=⌈n/2⌉p+1=\lceil n/2\rceilp+1=⌈n/2⌉ is written (n + 1) / 2 - 1 + 1 in natural numbers, which equals ⌈n/2⌉\lceil n/2\rceil⌈n/2⌉ for n≥1n\ge1n≥1. The family takes the set together with the proof of its size bound.

Differences from the source:

  • encoding: parties indexed by [n]={1,…,n} → parties indexed by Fin n; reason: the bijection i↦i+1 preserves every input and coordinate subset
  • encoding: an arbitrary finite alphabet Σ → a finite type Sig in an arbitrary universe; reason: every finite set is in bijection with a finite type; only |Σ| enters the statement
  • encoding: for sufficiently large n and a sufficiently small absolute constant c0 > 0 → ∃ c0 > 0, ∃ N ≥ 1, ∀ n ≥ N; reason: this is the meaning of the two existential constants; c0 and N do not depend on Σ or the family
Preamble
import Mathlib
Formal statement
namespace SymmetricPSM1041.ORLowerBound.Supplement

open Classical in
theorem agreement_lemma_majority :
    ∃ c₀ : ℝ, 0 < c₀ ∧ ∃ N : ℕ, 1 ≤ N ∧ ∀ n : ℕ, N ≤ n →
      ∀ (Sig : Type*) [Fintype Sig], (Fintype.card Sig : ℝ) ≤ c₀ * Real.sqrt n →
      ∀ α : (S : Finset (Fin n)) → (n + 1) / 2 - 1 + 1 ≤ S.card → (i : Fin n) → i ∈ S → Sig,
      ∃ (T S : Finset (Fin n)) (hT : (n + 1) / 2 - 1 + 1 ≤ T.card)
        (hS : (n + 1) / 2 - 1 + 1 ≤ S.card), T ⊂ S ∧
        (Finset.univ.filter (fun i : Fin n => ∃ (hiT : i ∈ T) (hiS : i ∈ S),
            α T hT i hiT ≠ α S hS i hiS)).card ≤ (n + 1) / 2 - 1 := by sorry

end SymmetricPSM1041.ORLowerBound.Supplement
Source
Marshall Ball, Peter Crawford-Kahrl, Vladimir Podolskii, Morgan Prior, STOC 2027 submission #1041 (October 2026), p. 13, Lemma 16 (proof pp. 13–14)

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