Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 — no two distinct values acquire locks with the same associated phase

Proved
DLSConsensus.BasicRound.lemma_3_1

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 arbitrary initial values, delivery pattern and choice function. Say that a processor locks vvv at phase kkk (k≥1k\ge1k≥1) if it receives the message (lock v,k)(\mathrm{lock}\ v,k)(lock v,k) in round 4k−24k-24k−2.

It is impossible for two distinct values to acquire locks with the same associated phase: for all processors p,qp,qp,q, all k≥1k\ge1k≥1 and all values v,wv,wv,w,

p locks v at phase k  and  q locks w at phase k ⟹ v=w.p \text{ locks } v \text{ at phase } k \ \text{ and } \ q \text{ locks } w \text{ at phase } k \ \Longrightarrow\ v=w.p locks v at phase k  and  q locks w at phase k ⟹ v=w.

Phase numbers thus identify the locked value uniquely; this is used in the proof of Lemma 3.2 to exclude a competing lock with the same phase.

Formalization Note No hypothesis on ttt, on the delivery pattern or on the choice function is needed, and none is assumed.

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

/-- Lemma 3.1 (p. 296): it is impossible for two distinct values to acquire locks with the same
associated phase. If processor `p` locks `v` at phase `k` and processor `q` locks `w` at the
same phase `k`, then `v = w`. -/
theorem lemma_3_1 {N : ℕ} {V : Type*} (t : ℕ) (pick : ℕ → Set V → V) (init : Fin N → V)
    (deliv : ℕ → Fin N → Fin N → Prop) (k : ℕ) (p q : Fin N) (v w : V)
    (hp : LocksAt t pick init deliv p k v) (hq : LocksAt t pick init deliv q k w) :
    v = w := by sorry

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