Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inequality (2), p. 9 β€” |𝒦| ≀ Ξ£_S F(|N(S) ∩ Nβ‚‚(v)|, cβˆ’1)

Proved
CClosedGraphs.Improved.ineq_2

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

c-closed-graphmaximal-cliquep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be any graph, WWW a vertex set and v∈Wv\in Wv∈W; neighbourhoods and the second neighbourhood N2(v)N_2(v)N2​(v) are taken in G[W]G[W]G[W]. Let K\mathcal KK be the set of maximal cliques of G[W]G[W]G[W] that do not contain vvv but contain some neighbour of vvv. Then

∣Kβˆ£β€…β€Šβ‰€β€…β€Šβˆ‘βˆ…β‰ SβŠ†W∩N(v)mc(G[N(S)∩N2(v)]),|\mathcal K|\;\le\;\sum_{\emptyset\ne S\subseteq W\cap N(v)} \mathrm{mc}\big(G[N(S)\cap N_2(v)]\big),∣Kβˆ£β‰€βˆ…ξ€ =SβŠ†W∩N(v)βˆ‘β€‹mc(G[N(S)∩N2​(v)]),

where N(S)=β‹‚u∈SN(u)N(S)=\bigcap_{u\in S}N(u)N(S)=β‹‚u∈S​N(u).

This is inequality (2) of the proof of Theorem 3.1, with F(∣N(S)∩N2(v)∣,cβˆ’1)F(|N(S)\cap N_2(v)|,c-1)F(∣N(S)∩N2​(v)∣,cβˆ’1) replaced by the actual number of maximal cliques of G[N(S)∩N2(v)]G[N(S)\cap N_2(v)]G[N(S)∩N2​(v)]; the (cβˆ’1)(c-1)(cβˆ’1)-closedness of these graphs, which turns the count into FFF, is used in the Case 2 count. It groups the cliques K∈KK\in\mathcal KK∈K by S=K∩N(v)S=K\cap N(v)S=K∩N(v).

Formalization Note The sum runs over non-empty SSS, as the paper defines N(S)N(S)N(S) only for non-empty SSS; this makes the bound stronger than a sum over all SβŠ†N(v)S\subseteq N(v)SβŠ†N(v). No closure hypothesis is needed.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
open Classical in
theorem ineq_2 {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) (W : Set V) {v : V} (hv : v ∈ W) :
    ((CClosedGraphs.Peeling.maxCliquesIn G W).filter (fun K => v βˆ‰ K ∧ βˆƒ y ∈ K, G.Adj v y)).card ≀
      βˆ‘ S ∈ (Finset.univ.filter (fun x => x ∈ W ∧ G.Adj v x)).powerset.filter
          (fun S => S.Nonempty),
        CClosedGraphs.Peeling.numMaxCliquesIn G (commonNbrs G S ∩ dist2In G W 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, proof of Theorem 3.1, Case 2, inequality (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