Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.2, p. 9 — the neighbourhood of a vertex induces a (c−1)-closed graph

Proved
CClosedGraphs.Improved.lemma_3_2

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

c-closed-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let c≥1c\ge 1c≥1, let GGG be a graph and WWW a vertex set such that G[W]G[W]G[W] is ccc-closed, and let v∈Wv\in Wv∈W. Then the neighbourhood of vvv inside WWW induces a (c−1)(c-1)(c−1)-closed graph: G[W∩N(v)] is (c−1)-closed.G[W\cap N(v)]\ \text{is $(c-1)$-closed}.G[W∩N(v)] is (c−1)-closed.

The paper states this for W=VW=VW=V ("For any vvv, G[N(v)]G[N(v)]G[N(v)] is a (c−1)(c-1)(c−1)-closed graph"); the relative form is what the induction on induced subgraphs uses. It lowers the closure parameter by one, which drives the induction on ccc in Theorem 3.1.

Formalization Note c−1c-1c−1 is natural-number subtraction, safe because c≥1c\ge1c≥1. For c=1c=1c=1 the conclusion says that W∩N(v)W\cap N(v)W∩N(v) is a clique.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
theorem lemma_3_2 {V : Type*} [Fintype V] [DecidableEq V] {c : ℕ} (hc : 0 < c)
    {G : SimpleGraph V} {W : Set V} (hW : IsCClosedOn c G W) {v : V} (hv : v ∈ W) :
    IsCClosedOn (c - 1) G (W ∩ G.neighborSet v) := by sorry
end CClosedGraphs.Improved
Source
Fox, Roughgarden, Seshadhri, Wei and Wein, Finding cliques in social networks: a new distribution-free model, arXiv:1804.07431v1, p. 9, Lemma 3.2
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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