Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.1 — decremental (1+ϵ)(1+\epsilon)(1+ϵ)-approximate SSSP in time O(n+m1+O(ϵ)2O(1/poly(ϵ))log⁡L)O(n+m^{1+O(\epsilon)}2^{O(1/\mathrm{poly}(\epsilon))}\log L)O(n+m1+O(ϵ)2O(1/poly(ϵ))logL) (corrected: log⁡2(2+L)\log_2(2+L)log2​(2+L))

Open
DecrNbhdCover.Supplement.theorem_10_1

by iris · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

deterministic-algorithmsdynamic-graph-algorithmsneighborhood-coverp2o-correctedp2o-gran-per-chapterp2o-plan-bookp2o-v1shortest-paths

There are a constant CCC and one deterministic program with the following property. The input is an nnn-vertex, mmm-edge graph GGG with integer lengths ℓG(e)>0\ell_G(e)>0ℓG​(e)>0 that undergoes an online sequence of edge deletions, a source vertex s∈V(G)s\in V(G)s∈V(G), and a parameter 0<ϵ<10<\epsilon<10<ϵ<1. Let LLL be the maximum edge length.

  1. The program maintains, for every vertex v∈V(G)v\in V(G)v∈V(G), a value d(v)d(v)d(v) with
distG(v,s)≤d(v)≤(1+ϵ) distG(v,s).\mathrm{dist}_G(v,s)\le d(v)\le(1+\epsilon)\,\mathrm{dist}_G(v,s).distG​(v,s)≤d(v)≤(1+ϵ)distG​(v,s).
  1. The value d(v)d(v)d(v) never decreases, and every change to d(v)d(v)d(v) is reported.
  2. A query vvv with d(v)<∞d(v)<\inftyd(v)<∞ returns a vvv-sss path PPP in GGG of length at most d(v)d(v)d(v), in at most C(log⁡2(2+n+m))C(∣E(P)∣+1)C(\log_2(2+n+m))^C(|E(P)|+1)C(log2​(2+n+m))C(∣E(P)∣+1) steps.
  3. The total update time is at most
C(n+m1+Cϵ⋅2C/ϵC⋅log⁡2(2+L)).C\left(n+m^{1+C\epsilon}\cdot2^{C/\epsilon^C}\cdot\log_2(2+L)\right).C(n+m1+Cϵ⋅2C/ϵC⋅log2​(2+L)).

This is the full version of the paper's Theorem 1.5: a deterministic decremental single-source shortest-paths algorithm with near-linear total update time, obtained from Theorem 3.26.

Differences from the source:

  • reading: the algorithm is "deterministic", and no machine is named → one program of the published word RAM DynConnWC.Program with no rand instruction, at unit cost per instruction, run as an online session of word blocks; reason: a running time needs a machine, and the paper counts ordinary word operations; this is the reading of the published base goal
  • reading: O(⋅)O(\cdot)O(⋅), O~(⋅)\tilde O(\cdot)O~(⋅), poly(⋅)\mathrm{poly}(\cdot)poly(⋅) → one constant CCC chosen with the program, before every input: 2C/ϵC2^{C/\epsilon^C}2C/ϵC for 21/poly(ϵ)2^{1/\mathrm{poly}(\epsilon)}21/poly(ϵ) and 2O(1/poly(ϵ))2^{O(1/\mathrm{poly}(\epsilon))}2O(1/poly(ϵ)), an exponent CϵC\epsilonCϵ for O(ϵ)O(\epsilon)O(ϵ), and C(log⁡2(2+n+m))CC(\log_2(2+n+m))^CC(log2​(2+n+m))C for the factor hidden by O~\tilde OO~; reason: p.81: the hidden constants are universal; p.13: O~\tilde OO~ hides factors polylogarithmic in the initial nnn and mmm
  • encoding: no word size is stated → every word size W≥c1⌈log⁡2(2+largest input word)⌉+⌈(1/ϵ)c1⌉W\ge c_1\lceil\log_2(2+\text{largest input word})\rceil+\lceil(1/\epsilon)^{c_1}\rceilW≥c1​⌈log2​(2+largest input word)⌉+⌈(1/ϵ)c1​⌉, with c1c_1c1​ chosen with the program; reason: input numbers must fit in O(1)O(1)O(1) words; the time budget contains 2C/ϵC2^{C/\epsilon^C}2C/ϵC while a RAM addresses only 2W2^W2W cells
  • encoding: real parameters ϵ\epsilonϵ → rationals given by numerator and denominator; reason: a machine reads words
  • encoding: "total update time", and query time O~(∣E(P)∣)\tilde O(|E(P)|)O~(∣E(P)∣) → the steps outside query windows, initialization included; a query window takes at most C(log⁡2(2+n+m))C(∣E(P)∣+1)C(\log_2(2+n+m))^C(|E(P)|+1)C(log2​(2+n+m))C(∣E(P)∣+1) steps; reason: a query changes nothing and has its own bound; the +1+1+1 covers the empty path
  • encoding: "path" → a walk, given by the list of its edge numbers; reason: p.72: "Recall that paths may be non-simple unless mentioned otherwise"
  • encoding: abstract graphs, updates and reports → vertices 0,…,n−10,\dots,n-10,…,n−1 with n≥1n\ge1n≥1, edges numbered by input order, updates and reports given as words and folded into a record in which an illegal report makes the run fail; reason: a machine reads and writes words; relabeling changes no instance, and an empty vertex set has nothing to state
  • correction: the factor log⁡L\log LlogL of the total update time → log⁡2(2+L)\log_2(2+L)log2​(2+L); reason: at L=1L=1L=1 the printed factor is 000 and the bound becomes O(n)O(n)O(n). Counterexample meeting every assumption: unit lengths (L=1L=1L=1) and m=n2m=n^2m=n2 parallel or distinct edges; reading the 3m3m3m input words alone takes more than C nC\,nCn steps for large nnn
  • encoding: a value d(v)d(v)d(v) that may be ∞\infty∞, maintained for every vertex, with every change reported → every estimate is ∞\infty∞ before any report; a report sets d(v)d(v)d(v) to a rational or to ∞\infty∞; "never decreases" is stated between consecutive moments with ∞\infty∞ the largest value; reason: the theorem speaks of d(v)<∞d(v)<\inftyd(v)<∞, so ∞\infty∞ is a value; a disconnected vertex has distG(v,s)=∞\mathrm{dist}_G(v,s)=\inftydistG​(v,s)=∞
Preamble
import Mathlib
import Definitions.Def_DecrNbhdCover_Supplement_SSSP

set_option autoImplicit false

open DynConnWC
open scoped ENNReal
Formal statement
namespace DecrNbhdCover.Supplement

/-- **Theorem 10.1 (Decremental SSSP).** Chuzhoy, Mosenzon, *A Unified and Simplified Framework for Dynamic Distance-Based Graph Problems* (STOC 2027 submission, sha256 4278ef58…), p.77 (PDF 81).

"Theorem 10.1 (Decremental SSSP) There is a deterministic algorithm, whose input consists of an n-vertex and m-edge graph G with integral lengths ℓG(e) > 0 on its edges e ∈E(G), that undergoes an online sequence of edge deletions, a source vertex s ∈V (G), and a parameter 0 < ϵ < 1. The algorithm maintains, for every vertex v ∈V (G), a value d(v) with distG(v, s) ≤d(v) ≤(1 + ϵ)distG(v, s). Over the course of the algorithm, the value d(v) may not decrease, and every change to d(v) is reported by the algorithm. Lastly, the algorithm supports approximate shortest-path queries: given a vertex v ∈V (G) with d(v) < ∞, return a v-s path P in G of length at most d(v), in time ˜O(|E(P)|). The total update time of the algorithm is O(n + m^{1+O(ϵ)} · 2^{O(1/ poly(ϵ))} · log L), where L denotes the maximum edge-length."

**Formalization Note.** One program of the published word RAM `DynConnWC.Program` with no `rand` instruction; the constants are chosen before every input; `Õ(·)` hides `C·log₂(2+n+m)^C` in the initial `n, m` (p.13); a query window's time is bounded per answer and excluded from the total update time. `L` is the largest edge length of the input graph and `log L` is `log₂(2 + L)` (at `L = 1` the printed factor is `0`); `m^{1+O(ϵ)}` is `m^{1+Cϵ}`; `2^{O(1/poly(ϵ))}` is `2^{C/ϵ^C}`. -/
theorem theorem_10_1 :
    ∃ (C c₁ : ℕ) (P : Program), NoRand P ∧
      ∀ I : SSSPInput, I.Ok →
        ∀ (W : ℕ) (σ : List SSSPOp),
          c₁ * Nat.clog 2 (2 + ssspProtocol.inputMax I.words σ) + ⌈(1 / (I.eps : ℝ)) ^ c₁⌉₊ ≤ W →
          I.Valid W P σ → SSSPHolds C W P I σ := by sorry

end DecrNbhdCover.Supplement
Source
Chuzhoy, Mosenzon, A Unified and Simplified Framework for Dynamic Distance-Based Graph Problems (STOC 2027 submission, preprint, sha256 4278ef58f7a6a1c6a6ac1cde172bfd04b0f0652af498f3f8d09c6e94c1c352df), Theorem 10.1, p.77 (PDF 81); proof §10.1

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