Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2 — after the first decision, at least t + 1 processors keep a lock on the decided value

Proved
DLSConsensus.BasicRound.lemma_3_2

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

consensusdistributed-computingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider any run of Algorithm 1 in the basic round model with t≤Nt\le Nt≤N, arbitrary initial values and delivery pattern, and an admissible choice function. Suppose some processor ppp (correct or faulty) decides vvv at phase kkk, and no processor decides any value at a phase k′<kk'<kk′<k. Then:

  1. at least t+1t+1t+1 processors lock vvv at phase kkk, that is,
∣{ q:q receives (lock v,k) in round 4k−2 }∣ ≥ t+1;\bigl|\{\,q : q \text{ receives } (\mathrm{lock}\ v,k) \text{ in round } 4k-2\,\}\bigr| \ \ge\ t+1;​{q:q receives (lock v,k) in round 4k−2}​ ≥ t+1;
  1. each processor qqq that locks vvv at phase kkk has, after every round r≥4k−2r\ge 4k-2r≥4k−2, a lock on vvv whose associated phase number hhh satisfies h≥kh\ge kh≥k.

This lemma is the core of the consistency argument for Algorithm 1: the t+1t+1t+1 persistent locks on vvv prevent any other value from being found acceptable by N−tN-tN−t processors at a later phase.

Formalization Note "From that time onward" is read as: after the computation subround of round 4k−24k-24k−2 and of every later round. The lemma is about the decisions of all processors, not only correct ones, since omission-faulty processors also run the algorithm. The hypothesis t≤Nt\le Nt≤N makes the threshold N−tN-tN−t meaningful (natural-number subtraction).

Preamble
import Mathlib
import Definitions.Def_DLSConsensus_BasicRound_Model
Formal statement
namespace DLSConsensus.BasicRound

/-- Lemma 3.2 (p. 297): if some processor (correct or not) decides `v` at phase `k`, and no
processor decides anything at a phase `< k`, then at least `t + 1` processors lock `v` at
phase `k`, and each processor that locks `v` at phase `k` has, after every round
`r ≥ 4k - 2`, a lock on `v` with associated phase at least `k`. -/
theorem lemma_3_2 {N : ℕ} {V : Type*} (t : ℕ) (ht : t ≤ N) (pick : ℕ → Set V → V)
    (hpick : PickAdmissible pick) (init : Fin N → V) (deliv : ℕ → Fin N → Fin N → Prop)
    (p : Fin N) (k : ℕ) (v : V) (hdec : DecidesAt t pick init deliv p k v)
    (hmin : ∀ k' < k, ∀ (q : Fin N) (w : V), ¬ DecidesAt t pick init deliv q k' w) :
    t + 1 ≤ (Lockers t pick init deliv k v).card ∧
      ∀ q : Fin N, LocksAt t pick init deliv q k v →
        ∀ r : ℕ, 4 * k - 2 ≤ r →
          ∃ h : ℕ, k ≤ h ∧ (exec t pick init deliv r q).lock v = some h := by sorry

end DLSConsensus.BasicRound
Source
Dwork, Lynch, Stockmeyer, Consensus in the presence of partial synchrony, J. ACM 35 (1988), p. 297, Lemma 3.2
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