Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3.4 — V∖Rt−1⊆Lt−1V\setminus R_{t-1}\subseteq L_{t-1}V∖Rt−1​⊆Lt−1​ for t<(dp−1)/2t<(d^p-1)/2t<(dp−1)/2

Proved
DistVerif.Simulation.compl_R_subset_L

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

communication-complexitydistributed-computinglower-boundsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G(Γ,d,p)G(\Gamma,d,p)G(Γ,d,p) be the network of §3.1 with vertex set VVV and iii-left and iii-right sets LiL_iLi​, RiR_iRi​, and let ttt be an integer with 0<t<(dp−1)/20<t<(d^p-1)/20<t<(dp−1)/2. Then

V∖Rt−1⊆Lt−1andV∖Lt−1⊆Rt−1.V\setminus R_{t-1}\subseteq L_{t-1}\qquad\text{and}\qquad V\setminus L_{t-1}\subseteq R_{t-1}.V∖Rt−1​⊆Lt−1​andV∖Lt−1​⊆Rt−1​.

The first inclusion is stated in the proof of Lemma 3.4 ("since Lt−1L_{t-1}Lt−1​ and Rt−1R_{t-1}Rt−1​ share some path vertices"); the second is its mirror image, used for equation (3.1), which the paper says "is proved in exactly the same way". Together they say that every vertex whose state Bob does not track is tracked by Alice and vice versa, so Alice can compute every message that crosses into Bob's region.

Formalization Note 0<t0<t0<t makes t−1t-1t−1 a genuine predecessor; at t=1t=1t=1 the inclusions concern L0=V∖{r}L_0=V\setminus\{r\}L0​=V∖{r} and R0=V∖{s}R_0=V\setminus\{s\}R0​=V∖{s}.

Preamble
import Mathlib
import Definitions.Def_DistVerif_Simulation_Network
Formal statement
namespace DistVerif.Simulation

/-- **Proof of Lemma 3.4, second paragraph** (p. 1250). For `0 < t < (d^p - 1)/2`,
`V \ R_{t-1} ⊆ L_{t-1}`, and symmetrically (the mirror image used for (3.1))
`V \ L_{t-1} ⊆ R_{t-1}`. -/
theorem compl_R_subset_L (Γ d p t : ℕ) (ht0 : 0 < t) (ht : (t : ℝ) < ((d : ℝ) ^ p - 1) / 2) :
    (R Γ d p (t - 1))ᶜ ⊆ L Γ d p (t - 1) ∧ (L Γ d p (t - 1))ᶜ ⊆ R Γ d p (t - 1) := by sorry

end DistVerif.Simulation
Source
Das Sarma, Holzer, Kor, Korman, Nanongkai, Pandurangan, Peleg, Wattenhofer, Distributed Verification and Hardness of Distributed Approximation, SIAM J. Comput. 41 (2012), p. 1250, proof of Lemma 3.4, second paragraph ("for any t < (d^p − 1)/2, V \ R_{t−1} ⊆ L_{t−1}")
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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