Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — Pr[ℰ₁] ≤ 1/4: with probability ≥ 3/4 every set of n/β₁ vertices contains a hyperedge

Proved
EDPHardness.IntegralityGap.lemma_6

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-hypergraphunion-bound

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, where β1=14(log⁡n150(log⁡log⁡n)2)1/c\beta_1=\frac14\big(\frac{\log n}{150(\log\log n)^2}\big)^{1/c}β1​=41​(150(loglogn)2logn​)1/c, β2=6(2β1)c−1ln⁡β1\beta_2=6(2\beta_1)^{c-1}\ln\beta_1β2​=6(2β1​)c−1lnβ1​ (log⁡\loglog to base 222, ln⁡\lnln natural). A set of ⌈n/β1⌉\lceil n/\beta_1\rceil⌈n/β1​⌉ vertices is bad if it contains none of the hyperedges, and E1\mathcal E_1E1​ is the event that a bad set exists.

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⁡[E1]≤14.\Pr[\mathcal E_1]\le\frac14 .Pr[E1​]≤41​.

This is the property that makes canonical routings expensive: if no bad set exists, any ⌈n/β1⌉\lceil n/\beta_1\rceil⌈n/β1​⌉ pairs routed on their canonical paths include all ccc members of some hyperedge, which then share its special edge.

Formalization Note The paper states the lemma for "sufficiently large nnn" in the regime c≤O(log⁡log⁡n/log⁡log⁡log⁡n)c\le O(\log\log n/\log\log\log n)c≤O(loglogn/logloglogn) of Theorem 5; these two asymptotic qualifiers are the constants N0N_0N0​ and α\alphaα, chosen before nnn and ccc. The probability is the fraction of all ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋-tuples of ccc-subsets that satisfy the event. Bad sets have size ⌈n/β1⌉\lceil n/\beta_1\rceil⌈n/β1​⌉.

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

theorem lemma_6 :
    ∃ α : ℝ, 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 (E1 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. 492, Lemma 6 (with p. 491 for β₁, β₂ and the range of c)
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