Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — Pr[ℰ₂] ≤ 1/4: at most n/β₁ vertices lie in more than 10β₂c hyperedges

Proved
EDPHardness.IntegralityGap.lemma_7

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

chernoff-boundmarkov-inequalityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-hypergraph

Let HHH be the random hypergraph on nnn vertices with ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋ independent hyperedges, each uniform among the ccc-subsets, with β1,β2\beta_1,\beta_2β1​,β2​ as in the definitions (log⁡\loglog to base 222, ln⁡\lnln natural). A vertex is high-degree if it lies in more than 10β2c10\beta_2c10β2​c hyperedges, and E2\mathcal E_2E2​ is the event that more than n/β1n/\beta_1n/β1​ vertices are high-degree.

There are absolute constants α>0\alpha>0α>0 and N0N_0N0​ such that for every n≥N0n\ge N_0n≥N0​ and every integer ccc with 2≤c≤α log⁡log⁡nlog⁡log⁡log⁡n2\le c\le \alpha\,\frac{\log\log n}{\log\log\log n}2≤c≤αlogloglognloglogn​,

Pr⁡[E2]≤14.\Pr[\mathcal E_2]\le\frac14 .Pr[E2​]≤41​.

Together with Lemma 6 this controls the vertices whose canonical paths are long, which the analysis of short non-canonical paths has to discard.

Formalization Note "Sufficiently large nnn" and the range c≤O(log⁡log⁡n/log⁡log⁡log⁡n)c\le O(\log\log n/\log\log\log n)c≤O(loglogn/logloglogn) are the constants N0N_0N0​ and α\alphaα, chosen before nnn and ccc. The probability is a normalized count over all hyperedge tuples.

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

theorem lemma_7 :
    ∃ α : ℝ, 0 < α ∧ ∃ N₀ : ℕ, ∀ n : ℕ, N₀ ≤ n → ∀ c : ℕ, 2 ≤ c →
      (c : ℝ) ≤ α * Real.logb 2 (Real.logb 2 n) / Real.logb 2 (Real.logb 2 (Real.logb 2 n)) →
      hypProb n (numEdges n c) c (E2 n c) ≤ 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), p. 493, Lemma 7
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