Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4 ¶1 — with probability ≥ 1/4 none of ℰ₁, ℰ₂, ℰ₃(2g) occurs, g = 3β₁β₂c²

Proved
EDPHardness.IntegralityGap.good_event

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 of the mission (nnn vertices, ⌊β2n⌋\lfloor\beta_2n\rfloor⌊β2​n⌋ independent uniform ccc-subsets), and let g=⌈3β1β2c2⌉g=\lceil3\beta_1\beta_2c^2\rceilg=⌈3β1​β2​c2⌉.

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∧¬E2∧¬E3(2g)]≥14,\Pr\big[\neg\mathcal E_1\wedge\neg\mathcal E_2\wedge\neg\mathcal E_3(2g)\big]\ge\frac14,Pr[¬E1​∧¬E2​∧¬E3​(2g)]≥41​,

where E3(2g)\mathcal E_3(2g)E3​(2g) is the event that G′G'G′ has more than (6β2c2)2g+1(6\beta_2c^2)^{2g+1}(6β2​c2)2g+1 cycles of length at most 2g2g2g.

This is the step where the probabilistic part ends: a hypergraph with all three good properties exists, and the rest of the analysis is deterministic.

Formalization Note "Sufficiently large nnn" and the range of ccc are the constants N0N_0N0​ and α\alphaα, chosen before nnn and ccc; ggg is rounded up to an integer.

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

theorem good_event :
    ∃ α : ℝ, 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)) →
      1 / 4 ≤ hypProb n (numEdges n c) c
        (fun H => ¬ E1 n c H ∧ ¬ E2 n c H ∧ ¬ E3 n c (2 * gParam n c) H) := 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. 495, Section 2.4, first paragraph
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