Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, proof (p. 233) — α, β, σ are consistent with A ∪ C, B ∪ C, A ∪ B, respectively

Proved
InteractiveConsistency.Impossibility.construction_consistent

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

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

Let AAA, BBB, CCC be pairwise disjoint sets with A∪B∪C=PA\cup B\cup C=PA∪B∪C=P, let v,v′∈Vv, v'\in Vv,v′∈V, and let α\alphaα, β\betaβ, σ\sigmaσ be the scenarios defined by (i)–(iii) of p. 232. Then

  1. α\alphaα is consistent with N=A∪CN = A\cup CN=A∪C;
  2. β\betaβ is consistent with N=B∪CN = B\cup CN=B∪C;
  3. σ\sigmaσ is consistent with N=A∪BN = A\cup BN=A∪B.

That is, for instance, α(pqw)=α(qw)\alpha(pqw)=\alpha(qw)α(pqw)=α(qw) for all q∈A∪Cq\in A\cup Cq∈A∪C, p∈Pp\in Pp∈P and w∈P∗w\in P^*w∈P∗. Each of the three scenarios is therefore a legitimate behaviour of a system whose faulty processors are BBB, AAA, CCC respectively.

Formalization Note The page asserts this "by inspection"; the statement does not need AAA, BBB, CCC to be nonempty, nor v≠v′v\ne v'v=v′, so those hypotheses of the surrounding proof are omitted.

Preamble
import Mathlib
import Definitions.Def_InteractiveConsistency_Impossibility_Scenario
import Definitions.Def_InteractiveConsistency_Impossibility_Construction
Formal statement
namespace InteractiveConsistency.Impossibility

/-- Pease, Shostak & Lamport (1980), Section 4, proof of the THEOREM, p. 233: for a partition
`A, B, C` of `P` and any values `v, v'`, the scenarios `α`, `β`, `σ` defined by (i)–(iii) of p. 232
are consistent with `N = A ∪ C`, `B ∪ C`, `A ∪ B`, respectively. -/
theorem construction_consistent {α V : Type*} [DecidableEq α] (P A B C : Finset α) (v v' : V)
    (hAB : Disjoint A B) (hAC : Disjoint A C) (hBC : Disjoint B C) (hP : A ∪ B ∪ C = P) :
    ConsistentWith P (A ∪ C) (alphaScen P A B C v v') ∧
    ConsistentWith P (B ∪ C) (betaScen P A B C v v') ∧
    ConsistentWith P (A ∪ B) (sigmaScen P A B C v v') := by sorry

end InteractiveConsistency.Impossibility
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 233, Section 4, proof of the THEOREM, first sentence
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