Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, proof (p. 232) — if 3 ≤ n ≤ 3m, P splits into three nonempty parts of size at most m

Proved
InteractiveConsistency.Impossibility.partition_of_le_three_mul

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

byzantine-agreementcombinatoricsdistributed-computingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite set with n=∣P∣n=|P|n=∣P∣ elements and let mmm be a natural number. If

3≤n≤3m,3\le n\le 3m,3≤n≤3m,

then PPP can be partitioned into three nonempty, pairwise disjoint sets AAA, BBB, CCC with A∪B∪C=PA\cup B\cup C = PA∪B∪C=P, each of which has at most mmm members.

This is the first step of the impossibility proof: each of A∪CA\cup CA∪C, B∪CB\cup CB∪C, A∪BA\cup BA∪B then has at least n−mn-mn−m members, so each may serve as the set of nonfaulty processors.

Formalization Note The page writes "Since n≤3mn\le 3mn≤3m"; the hypothesis n≥3n\ge 3n≥3 needed for three nonempty parts is implicit there and is stated explicitly here.

Preamble
import Mathlib
Formal statement
namespace InteractiveConsistency.Impossibility

/-- Pease, Shostak & Lamport (1980), Section 4, proof of the THEOREM, p. 232: since `3 ≤ n ≤ 3m`
(`n = |P|`), `P` can be partitioned into three nonempty sets `A`, `B`, `C`, each of which has no
more than `m` members. -/
theorem partition_of_le_three_mul {α : Type*} [DecidableEq α] (P : Finset α) (m : ℕ)
    (h3 : 3 ≤ P.card) (hn : P.card ≤ 3 * m) :
    ∃ A B C : Finset α,
      A.Nonempty ∧ B.Nonempty ∧ C.Nonempty ∧
      Disjoint A B ∧ Disjoint A C ∧ Disjoint B C ∧
      A ∪ B ∪ C = P ∧
      A.card ≤ m ∧ B.card ≤ m ∧ C.card ≤ m := by sorry

end InteractiveConsistency.Impossibility
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 232, Section 4, proof of the THEOREM, first paragraph
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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