Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.1 — every graph with m edges has a (6 log_{4/3} 2m)⁻¹-decomposition with |∂(A₁, …, A_k)| ≤ |E|/2

Proved
SpectralSparsify.Decomp.theorem_7_1

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

conductancegraph-partitioninggraph-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-sparsification

Let G=(V,E)G=(V,E)G=(V,E) be a finite simple graph without isolated vertices and let m=∣E∣m=|E|m=∣E∣. Then GGG has a decomposition (A1,…,Ak)(A_1,\dots,A_k)(A1​,…,Ak​), that is, a partition of VVV into nonempty sets, such that

  1. every part has conductance
ΦAiG ≥ (6log⁡4/32m)−1(i=1,…,k),\Phi^G_{A_i}\ \ge\ \big(6\log_{4/3}2m\big)^{-1}\qquad(i=1,\dots,k),ΦAi​G​ ≥ (6log4/3​2m)−1(i=1,…,k),

where ΦAiG\Phi^G_{A_i}ΦAi​G​ measures volumes with the degrees of GGG; and 2. the number of edges between different parts satisfies

∣∂(A1,…,Ak)∣ ≤ ∣E∣2.|\partial(A_1,\dots,A_k)|\ \le\ \frac{|E|}{2}.∣∂(A1​,…,Ak​)∣ ≤ 2∣E∣​.

Both conditions hold for the same partition: a partition into singletons has conductance 111 everywhere but cuts every edge, and the trivial partition cuts nothing but may have small conductance. The theorem is the existence statement behind the paper's spectral sparsifiers: each high-conductance part can be sparsified by sampling, and the at most ∣E∣/2|E|/2∣E∣/2 crossing edges are handled recursively.

Formalization Note The paper leaves implicit that GGG has no isolated vertices; conductance is 0/00/00/0 otherwise, and the hypothesis is the setting in which ΦBG\Phi^G_BΦBG​ is defined. Under it, m=0m=0m=0 forces V=∅V=\emptysetV=∅ and the statement is trivially true (Lean's log⁡4/30=0\log_{4/3}0=0log4/3​0=0 makes the bound 0−1=00^{-1}=00−1=0). The logarithm is Real.logb (4/3) applied to 2m=Vol⁡(V)2m=\operatorname{Vol}(V)2m=Vol(V). The bound on the boundary is stated over R\mathbb RR as ∣∂∣≤m/2|\partial|\le m/2∣∂∣≤m/2.

Preamble
import Mathlib
import Definitions.Def_SpectralSparsify_Decomp_cond
import Definitions.Def_SpectralSparsify_Decomp_decompBoundary
Formal statement
namespace SpectralSparsify.Decomp

/-- Theorem 7.1 (arXiv:0808.4134v3, p. 17). Let `G = (V, E)` be a graph without isolated
vertices and `m = |E|`. Then `G` has a `(6 log_{4/3} 2m)⁻¹`-decomposition `(A₁, …, A_k)`,
i.e. a partition of `V` with `Φ^G_{Aᵢ} ≥ (6 log_{4/3} 2m)⁻¹` for all `i`, whose boundary
satisfies `|∂(A₁, …, A_k)| ≤ |E|/2`. -/
theorem theorem_7_1 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (hdeg : ∀ v, 0 < G.degree v) :
    ∃ P : Finpartition (Finset.univ : Finset V),
      (∀ A ∈ P.parts,
        (6 * Real.logb (4 / 3) (2 * (G.edgeFinset.card : ℝ)))⁻¹ ≤ cond G A) ∧
      ((decompBoundary G P).card : ℝ) ≤ (G.edgeFinset.card : ℝ) / 2 := by sorry

end SpectralSparsify.Decomp
Source
D. A. Spielman, S.-H. Teng, Spectral Sparsification of Graphs, arXiv:0808.4134v3, p. 17, Theorem 7.1 (proof p. 19)
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