Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — Pr[ℰ₃] ≤ 1/4 for every integer g > 2: G′ has at most (6β₂c²)^{g+1} cycles of length ≤ g

Proved
EDPHardness.IntegralityGap.lemma_8

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

markov-inequalityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-hypergraphshort-cycles

Let HHH be the random hypergraph on nnn vertices with m=⌊β2n⌋m=\lfloor\beta_2n\rfloorm=⌊β2​n⌋ independent hyperedges, each uniform among the ccc-subsets, let G′G'G′ be the graph on the hyperedges obtained from G(H)G(H)G(H) by shrinking every special edge, and let KgK_gKg​ be the number of (simple) cycles of length at most ggg in G′G'G′. The event E3\mathcal E_3E3​ (for the value ggg) is Kg>(6β2c2)g+1K_g>(6\beta_2c^2)^{g+1}Kg​>(6β2​c2)g+1.

Let 2≤c≤n2\le c\le n2≤c≤n and assume β2>0\beta_2>0β2​>0. Then for every integer g>2g>2g>2,

Pr⁡[Kg>(6β2c2)g+1]≤14.\Pr\big[K_g>(6\beta_2c^2)^{g+1}\big]\le\frac14 .Pr[Kg​>(6β2​c2)g+1]≤41​.

Short cycles of G′G'G′ are what a short non-canonical path must create together with a canonical path; the lemma says there are few of them.

Formalization Note The paper's definition says "cycles of length at most ggg in GGG", but its proof ("a cycle CCC of length kkk in the graph G′G'G′") and its use in Section 2.4 count cycles in G′G'G′; cycles in G′G'G′ are formalized. Each cycle is counted once, as its edge set. The proof needs no largeness of nnn; the hypotheses c≤nc\le nc≤n (the hyperedges exist) and β2>0\beta_2>0β2​>0 (otherwise there are no hyperedges and the threshold can be negative) are the ones the statement needs to be the paper's.

Preamble
import Mathlib
import Definitions.Def_EDPHardness_IntegralityGap_GapInstance
Formal statement
namespace EDPHardness.IntegralityGap

theorem lemma_8 (n c : ℕ) (hc : 2 ≤ c) (hcn : c ≤ n) (hβ₂ : 0 < beta2 n c) (g : ℕ) (hg : 2 < g) :
    hypProb n (numEdges n c) c (E3 n c g) ≤ 1 / 4 := by sorry

end EDPHardness.IntegralityGap
Source
Andrews, Chuzhoy, Guruswami, Khanna, Talwar, Zhang, Inapproximability of Edge-Disjoint Paths and Low Congestion Routing on Undirected Graphs, Combinatorica 30 (2010), pp. 493–495, Lemma 8 (statement p. 494)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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