Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 4, proof (p. 233) — α(aw) = σ(aw) and β(bw) = σ(bw) for all a ∈ A, b ∈ B, w ∈ P*

Proved
InteractiveConsistency.Impossibility.construction_indistinguishable

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

α(aw)=σ(aw),β(bw)=σ(bw)\alpha(aw)=\sigma(aw),\qquad \beta(bw)=\sigma(bw)α(aw)=σ(aw),β(bw)=σ(bw)

for all a∈Aa\in Aa∈A, b∈Bb\in Bb∈B and w∈P∗w\in P^*w∈P∗. Equivalently, αa=σa\alpha_a=\sigma_aαa​=σa​ and βb=σb\beta_b=\sigma_bβb​=σb​: no processor of AAA can distinguish α\alphaα from σ\sigmaσ, and no processor of BBB can distinguish β\betaβ from σ\sigmaσ.

This is what turns the three consistent scenarios into a contradiction with interactive consistency: a processor's decision depends only on its own ppp-scenario.

Formalization Note Scenarios are total functions on lists; the statement is the equality of the restrictions w↦α(aw)w\mapsto\alpha(aw)w↦α(aw) and w↦σ(aw)w\mapsto\sigma(aw)w↦σ(aw) as functions, which on strings over PPP is the page's identity and on the remaining lists holds because all three scenarios take the same value vvv there.

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 of p. 232 satisfy `α(aw) = σ(aw)` and
`β(bw) = σ(bw)` for all `a ∈ A`, `b ∈ B` and strings `w`; that is, `α_a = σ_a` and `β_b = σ_b`
as `a`- and `b`-scenarios. -/
theorem construction_indistinguishable {α 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) :
    (∀ a ∈ A, restrict (alphaScen P A B C v v') a = restrict (sigmaScen P A B C v v') a) ∧
    (∀ b ∈ B, restrict (betaScen P A B C v v') b = restrict (sigmaScen P A B C v v') b) := 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, second 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