Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

pp. 10–11 — the recurrence's two cases are bounded by F₀(n, c)

Proved
CClosedGraphs.Improved.recurrence_bound

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-inequality

Let c≥2c\ge2c≥2 be an integer and let n,Δn,\Deltan,Δ be real numbers with n≥1n\ge1n≥1 and 0<Δ≤n0<\Delta\le n0<Δ≤n. With F0(m,c)=4(c+4)(c−1)/2m2−21−cF_0(m,c)=4^{(c+4)(c-1)/2}m^{2-2^{1-c}}F0​(m,c)=4(c+4)(c−1)/2m2−21−c:

  1. if Δ≤n\Delta\le\sqrt nΔ≤n​, then n F0(Δ,c−1)≤F0(n,c)n\,F_0(\Delta,c-1)\le F_0(n,c)nF0​(Δ,c−1)≤F0​(n,c);
  2. if Δ>n\Delta>\sqrt nΔ>n​, then
F0(Δ,c−1) nΔ 2c+F0(n−Δ,c)  ≤  F0(n,c).F_0(\Delta,c-1)\,\frac{n}{\Delta}\,2^{c}+F_0(n-\Delta,c)\;\le\;F_0(n,c).F0​(Δ,c−1)Δn​2c+F0​(n−Δ,c)≤F0​(n,c).

These are the two inequalities "we need to show" in the inductive step of Theorem 3.1: the right-hand sides of the recurrence for F(n,c)F(n,c)F(n,c), with FFF at the smaller parameters replaced by F0F_0F0​, do not exceed F0(n,c)F_0(n,c)F0​(n,c).

Formalization Note The paper prints this display with base 222 in place of the base 444 of F0F_0F0​; the statement here uses F0F_0F0​ as the paper defines it on p. 10. The second case keeps the paper's n−Δn-\Deltan−Δ (the vertex vvv itself is also deleted, so n−Δ−1n-\Delta-1n−Δ−1 would suffice); F0(0,c)=0F_0(0,c)=0F0​(0,c)=0.

Preamble
import Mathlib
import Definitions.Def_CClosedGraphs_Improved_Setting
Formal statement
namespace CClosedGraphs.Improved
theorem recurrence_bound {c : ℕ} (hc : 2 ≤ c) {n Δ : ℝ} (hn : 1 ≤ n) (hΔ0 : 0 < Δ)
    (hΔn : Δ ≤ n) :
    (Δ ≤ Real.sqrt n → n * F0 Δ (c - 1) ≤ F0 n c) ∧
      (Real.sqrt n < Δ → F0 Δ (c - 1) * (n / Δ) * 2 ^ c + F0 (n - Δ) c ≤ F0 n c) := 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, pp. 10–11, proof of Theorem 3.1, recurrence and inductive-case display
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