Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.4, p. 6 — contracting parts of size ≤ C gives a (k/C, α/C)-expander on r ≥ n/C vertices

Proved
CycleLengthsExp.WellSpread.lemma_2_4

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

expander-graphsgraph-contractionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k>0k>0k>0, α>0\alpha>0α>0, C>0C>0C>0, and let G=(V,E)G=(V,E)G=(V,E) be a (k,α)(k,\alpha)(k,α)-expander on nnn vertices. Let V1,…,VrV_1,\dots,V_rV1​,…,Vr​ be disjoint non-empty vertex sets, each of size at most CCC, with V=⋃i=1rViV=\bigcup_{i=1}^r V_iV=⋃i=1r​Vi​. Let G′G'G′ be the graph on {1,…,r}\{1,\dots,r\}{1,…,r} obtained by contracting each ViV_iVi​ to a vertex: i≠ji\ne ji=j are adjacent when some edge of GGG joins ViV_iVi​ and VjV_jVj​. Then

r ≥ nCandG′ is a (kC,αC)-expander.r\ \ge\ \frac nC\qquad\text{and}\qquad G' \text{ is a } \Bigl(\frac kC,\frac\alpha C\Bigr)\text{-expander}.r ≥ Cn​andG′ is a (Ck​,Cα​)-expander.

In the proof of Theorem 1 it turns subtrees of bounded size into single vertices, so that a long path can be found in the contracted graph.

Formalization Note. The partition is a surjection f:V→{1,…,r}f:V\to\{1,\dots,r\}f:V→{1,…,r} with Vi=f−1(i)V_i=f^{-1}(i)Vi​=f−1(i); surjectivity is the non-emptiness of the parts. The contracted graph has no loops.

Preamble
import Mathlib
import Definitions.Def_CycleLengthsExp_WellSpread_Setting
Formal statement
namespace CycleLengthsExp.WellSpread

theorem lemma_2_4 (n r : ℕ) (G : SimpleGraph (Fin n)) (k α C : ℝ)
    (hk : 0 < k) (hα : 0 < α) (hC : 0 < C) (hG : IsKAlphaExpander k α G)
    (f : Fin n → Fin r) (hf : Function.Surjective f)
    (hfib : ∀ i : Fin r, ((f ⁻¹' {i}).ncard : ℝ) ≤ C) :
    (n : ℝ) / C ≤ r ∧ IsKAlphaExpander (k / C) (α / C) (contract G f) := by sorry

end CycleLengthsExp.WellSpread
Source
Friedman and Krivelevich, Cycle lengths in expanding graphs, arXiv:1912.11011v2, p. 6, Lemma 2.4
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