Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.3 — at most dpdpdp edges join V∖Rt−1V\setminus R_{t-1}V∖Rt−1​ to RtR_tRt​ (and V∖Lt−1V\setminus L_{t-1}V∖Lt−1​ to LtL_tLt​)

Proved
DistVerif.Simulation.cut_edges_le

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 its iii-left and iii-right sets LiL_iLi​, RiR_iRi​, and let ttt be an integer with

0<t<dp−12.0<t<\frac{d^p-1}{2}.0<t<2dp−1​.

Then at most d⋅pd\cdot pd⋅p edges of G(Γ,d,p)G(\Gamma,d,p)G(Γ,d,p) join a vertex of V∖Rt−1V\setminus R_{t-1}V∖Rt−1​ to a vertex of RtR_tRt​, and at most d⋅pd\cdot pd⋅p edges join a vertex of V∖Lt−1V\setminus L_{t-1}V∖Lt−1​ to a vertex of LtL_tLt​.

The paper states this observation in the sentence preceding Lemma 3.4, and identifies the edges in its proof: all edges linking vertices in RtR_tRt​ and V∖Rt−1V\setminus R_{t-1}V∖Rt−1​ are of the form (uℓ(Rt),u′)(u^\ell(R_t),u')(uℓ(Rt​),u′) where uℓ(Rt)u^\ell(R_t)uℓ(Rt​) is the leftmost level-ℓ\ellℓ tree vertex in RtR_tRt​ and u′u'u′ one of its ddd children, for ℓ=0,…,p−1\ell=0,\dots,p-1ℓ=0,…,p−1. The bound is what limits the information crossing from Alice's side to Bob's side in one round to dpdpdp messages, independently of the number Γ\GammaΓ of paths.

Formalization Note Edges are counted as ordered pairs (w,u)(w,u)(w,u) with www outside Rt−1R_{t-1}Rt−1​ (resp. Lt−1L_{t-1}Lt−1​) and u∈Rtu\in R_tu∈Rt​ (resp. LtL_tLt​). Since Rt⊆Rt−1R_t\subseteq R_{t-1}Rt​⊆Rt−1​, at most one orientation of an edge qualifies, so this is the number of edges. The hypotheses 0<t0<t0<t (so that t−1t-1t−1 is a genuine predecessor) and the strict inequality, written in R\mathbb RR, are those of Lemma 3.4.

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

/-- **§3.3, sentence before Lemma 3.4** (p. 1249). For `0 < t < (d^p - 1)/2`, at most `d·p`
edges of `G(Γ, d, p)` join a vertex of `V \ R_{t-1}` to a vertex of `R_t`, and at most `d·p`
join a vertex of `V \ L_{t-1}` to a vertex of `L_t`. Edges are counted as ordered pairs
`(w, u)` with `w` outside and `u` inside; since `R_t ⊆ R_{t-1}` (and `L_t ⊆ L_{t-1}`), each
edge contributes at most one such pair. -/
theorem cut_edges_le (Γ d p t : ℕ) (ht0 : 0 < t) (ht : (t : ℝ) < ((d : ℝ) ^ p - 1) / 2) :
    (Finset.univ.filter fun q : Vtx Γ d p × Vtx Γ d p =>
        (graph Γ d p).Adj q.1 q.2 ∧ q.1 ∉ R Γ d p (t - 1) ∧ q.2 ∈ R Γ d p t).card ≤ d * p ∧
    (Finset.univ.filter fun q : Vtx Γ d p × Vtx Γ d p =>
        (graph Γ d p).Adj q.1 q.2 ∧ q.1 ∉ L Γ d p (t - 1) ∧ q.2 ∈ L Γ d p t).card ≤ d * p := 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. 1249, §3.3, sentence before Lemma 3.4 ("there are at most dp edges between vertices in V \ R_{t−1} (V \ L_{t−1}, respectively) and vertices in R_t (L_t, respectively)"); edge form identified in the proof of Lemma 3.4, p. 1250
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