Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3, note after step (2) (p. 230) — σ̂(w) = σ(wq) is an m-level scenario on P − {q} consistent with N

Proved
InteractiveConsistency.OralAlgorithm.subscenario_consistent

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

byzantine-agreementdistributed-computinginteractive-consistencyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a finite set of nnn processors, m=m′+1≥1m = m'+1\ge 1m=m′+1≥1, N⊆PN\subseteq PN⊆P with ∣N∣≥n−m|N|\ge n-m∣N∣≥n−m, and σ\sigmaσ an (m+1)(m+1)(m+1)-level scenario consistent with NNN. Let q∈Pq\in Pq∈P be faulty, q∉Nq\notin Nq∈/N. Define

σ^(w)=σ(wq)\hat\sigma(w) = \sigma(wq)σ^(w)=σ(wq)

for strings www over P−{q}P-\{q\}P−{q}. Then N⊆P−{q}N\subseteq P-\{q\}N⊆P−{q}, ∣N∣≥(n−1)−(m−1)|N| \ge (n-1)-(m-1)∣N∣≥(n−1)−(m−1), and σ^\hat\sigmaσ^ is an mmm-level scenario on P−{q}P-\{q\}P−{q} consistent with NNN.

The paper notes that σ^p\hat\sigma_pσ^p​ "corresponds to the mmm-level subscenario of σ\sigmaσ in which qqq is excluded and in which each processor's private value is the value it obtains directly from qqq in σ\sigmaσ", and its induction hypothesis is applied to this subscenario. The restriction of σ^\hat\sigmaσ^ to strings beginning with ppp is exactly the view w↦σp(pwq)w\mapsto\sigma_p(pwq)w↦σp​(pwq) that the recursive call of step (2) receives.

Formalization Note. σ^\hat\sigmaσ^ is fun w => σ (w ++ [q]); level mmm means consistency on strings of length ≤m+1\le m+1≤m+1 (ConsistentUpTo (P.erase q) N (m' + 1)). ∣N∣≥(n−1)−(m−1)|N|\ge (n-1)-(m-1)∣N∣≥(n−1)−(m−1) is written (P.erase q).card ≤ N.card + m'.

Preamble
import Mathlib
import Definitions.Def_InteractiveConsistency_OralAlgorithm_Scenario
Formal statement
namespace InteractiveConsistency.OralAlgorithm

theorem subscenario_consistent {α V : Type*} [DecidableEq α] (P N : Finset α) (m' : ℕ)
    (hNP : N ⊆ P) (hN : P.card ≤ N.card + (m' + 1))
    (σ : List α → V) (hσ : ConsistentUpTo P N (m' + 2) σ)
    (q : α) (hqP : q ∈ P) (hqN : q ∉ N) :
    N ⊆ P.erase q ∧ (P.erase q).card ≤ N.card + m' ∧
      ConsistentUpTo (P.erase q) N (m' + 1) (fun w => σ (w ++ [q])) := by sorry

end InteractiveConsistency.OralAlgorithm
Source
Pease, Shostak & Lamport, Reaching agreement in the presence of faults, J. ACM 27 (1980), p. 230, Section 3, note after step (2); used on p. 231 (σ̂(w) = σ(wq), "By the induction hypothesis")
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