Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inequality (3), p. 9 — Σ_S |N(S) ∩ N₂(v)| ≤ |N₂(v)| 2^{c−1} ≤ min{Δ², n} 2^{c−1}

Proved
CClosedGraphs.Improved.ineq_3

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\ge1c≥1, let G[W]G[W]G[W] be ccc-closed, let v∈Wv\in Wv∈W, and let Δ\DeltaΔ bound the degree in G[W]G[W]G[W] of every vertex of WWW. With N(S)N(S)N(S) and N2(v)N_2(v)N2​(v) as in the setting (computed in G[W]G[W]G[W]) and n=∣W∣n=|W|n=∣W∣,

∑∅≠S⊆W∩N(v)∣N(S)∩N2(v)∣  ≤  ∣N2(v)∣ 2c−1and∣N2(v)∣≤min⁡{Δ2,n}.\sum_{\emptyset\ne S\subseteq W\cap N(v)}|N(S)\cap N_2(v)|\;\le\;|N_2(v)|\,2^{c-1} \qquad\text{and}\qquad |N_2(v)|\le\min\{\Delta^2,n\}.∅=S⊆W∩N(v)∑​∣N(S)∩N2​(v)∣≤∣N2​(v)∣2c−1and∣N2​(v)∣≤min{Δ2,n}.

The first inequality holds because a vertex u∈N2(v)u\in N_2(v)u∈N2​(v) is not adjacent to vvv, so uuu and vvv have fewer than ccc common neighbours and uuu lies in N(S)N(S)N(S) for few sets SSS. Together the two give inequality (3), the constraint under which the sum (2) is maximised.

Formalization Note Δ\DeltaΔ is any common upper bound on the degrees in G[W]G[W]G[W] (the paper takes the maximum degree). The sum runs over non-empty SSS, matching the definition of N(S)N(S)N(S); this only strengthens the paper's display. All quantities are natural numbers.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
open Classical in
theorem ineq_3 {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)
    (Δ : ℕ) (hΔ : ∀ x ∈ W, (W ∩ G.neighborSet x).ncard ≤ Δ) :
    (∑ S ∈ (Finset.univ.filter (fun x => x ∈ W ∧ G.Adj v x)).powerset.filter
          (fun S => S.Nonempty),
        (commonNbrs G S ∩ dist2In G W v).ncard) ≤ (dist2In G W v).ncard * 2 ^ (c - 1) ∧
      (dist2In G W v).ncard ≤ min (Δ ^ 2) W.ncard := 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, proof of Theorem 3.1, Case 2, inequality (3)
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