Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 2.1, p. 4 — in a (k,α)-expander, ∣BG(v,r)∣≥min⁡{k,(1+α)r}|B_G(v,r)|\ge\min\{k,(1+\alpha)^r\}∣BG​(v,r)∣≥min{k,(1+α)r}

Proved
CycleLengthsExp.WellSpread.ball_growth

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

expander-graphsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vertex-expansion

Let k>0k>0k>0 and α>0\alpha>0α>0 be reals and let GGG be a finite (k,α)(k,\alpha)(k,α)-expander. Then for every vertex vvv and every integer r≥0r\ge 0r≥0 the ball of radius rrr around vvv satisfies

∣BG(v,r)∣ ≥ min⁡{k,(1+α)r}.|B_G(v,r)|\ \ge\ \min\{k,(1+\alpha)^r\}.∣BG​(v,r)∣ ≥ min{k,(1+α)r}.

Balls grow geometrically until they reach size kkk. This is the fact behind the diameter bound of Lemma 2.1, and behind the logarithmic depth of the breadth-first trees in Lemma 2.7 and Theorem 1.

Formalization Note. BG(v,r)B_G(v,r)BG​(v,r) is the set of vertices reachable from vvv by a walk with at most rrr edges. The vertex type is any finite type.

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

theorem ball_growth {V : Type*} [Fintype V] (G : SimpleGraph V) (k α : ℝ)
    (hk : 0 < k) (hα : 0 < α) (hG : IsKAlphaExpander k α G) (v : V) (r : ℕ) :
    min k ((1 + α) ^ r) ≤ ((ball G v r).ncard : ℝ) := by sorry

end CycleLengthsExp.WellSpread
Source
Friedman and Krivelevich, Cycle lengths in expanding graphs, arXiv:1912.11011v2, p. 4, proof of Lemma 2.1, first sentence (cited there from Proposition 3.1 of [21])
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