Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma B.3 — the peeling procedure finds the largest induced subgraph with minimum degree above ttt

Proved
LNTopology.Hermetic.lemma_B_3

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

algorithmsgraph-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite simple graph with vertex set WWW, let ttt be a real number, and let peel(G,t)⊆W\mathrm{peel}(G,t)\subseteq Wpeel(G,t)⊆W be the output of the peeling procedure of Lemma B.3, which repeatedly deletes every vertex having at most ttt neighbours among the remaining vertices. Then

  1. every v∈peel(G,t)v\in\mathrm{peel}(G,t)v∈peel(G,t) has more than ttt neighbours in peel(G,t)\mathrm{peel}(G,t)peel(G,t); and
  2. every W′⊆WW'\subseteq WW′⊆W in which each vertex has more than ttt neighbours in W′W'W′ is contained in peel(G,t)\mathrm{peel}(G,t)peel(G,t).

Consequently the procedure returns a nonempty induced subgraph HHH with δ(H)>t\delta(H)>tδ(H)>t if one exists, and the empty graph otherwise. With t=g+−1(2 disc(G))t=g_+^{-1}(2\,\mathrm{disc}(G))t=g+−1​(2disc(G)) this is the algorithm of Lemma B.3, which finds the subnetwork to which Lemma B.2 is applied.

Formalization Note The statement of Lemma B.3 promises a subgraph with δ(H)≥t\delta(H)\ge tδ(H)≥t, while the procedure of its proof deletes vertices of degree ≤t\le t≤t and therefore finds δ(H)>t\delta(H)>tδ(H)>t; for integer ttt the two differ (a ttt-regular graph). The procedure as written in the proof is formalized; the proof of Theorem 3.8 needs only this strict version. The existence of "an algorithm" (trivial classically) and the O(V+E)O(V+E)O(V+E) running time are not formalized. The threshold is an arbitrary real ttt.

Preamble
import Mathlib
import Definitions.Def_LNTopology_Hermetic_Peel
Formal statement
namespace LNTopology.Hermetic

/-- Lemma B.3, correctness of the peeling procedure of its proof: repeatedly deleting every vertex
with at most `t` neighbours among the remaining vertices yields a set in which every vertex has
more than `t` neighbours, and which contains every vertex set with that property. -/
theorem lemma_B_3 {W : Type*} [Fintype W] [DecidableEq W] (G : SimpleGraph W)
    [DecidableRel G.Adj] (t : ℝ) :
    (∀ v ∈ peel G t, t < ((G.neighborFinset v ∩ peel G t).card : ℝ)) ∧
      ∀ W' : Finset W, (∀ v ∈ W', t < ((G.neighborFinset v ∩ W').card : ℝ)) →
        W' ⊆ peel G t := by sorry

end LNTopology.Hermetic
Source
Guasoni, Huberman & Shikhelman, Lightning Network Economics: Topology, SSRN 4439190 (version of Feb. 3, 2023), p. 12 (PDF p. 13), Lemma B.3 and its proof
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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