Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.5 — a path of length ℓ from a prescribed vertex

Proved
CycleLengthsExp.ManyLengths.lemma_2_5

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

graph-pathsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vertex-expansion

Let kkk and ℓ\ellℓ be positive integers, and let G=(V,E)G=(V,E)G=(V,E) have more than kkk vertices. Suppose every kkk-element vertex set WWW has at least ℓ\ellℓ external neighbors. If the connected component containing vvv has at least kkk vertices, then there is a simple path starting at vvv with exactly ℓ\ellℓ edges:

∃P starting at v,∣E(P)∣=ℓ.\exists P\text{ starting at }v,\qquad |E(P)|=\ell.∃P starting at v,∣E(P)∣=ℓ.

This is the path-existence statement used before constructing the long path outside the initial tree in the proof of Theorem 2.

Formalization Note The component size is the number of vertices reachable from vvv. The theorem formalizes the first assertion of Lemma 2.5; the subsequent “In particular” corollary is not a separate item here.

Preamble
import Mathlib
import Definitions.Def_CycleLengthsExp_ManyLengths_Setting
Formal statement
namespace CycleLengthsExp.ManyLengths

/-- Friedman–Krivelevich, Lemma 2.5, p. 6, first assertion. -/
theorem lemma_2_5 {V : Type*} [Fintype V] (G : SimpleGraph V)
    (k ℓ : ℕ) (hk : 0 < k) (hℓ : 0 < ℓ) (hV : k < Fintype.card V)
    (hW : ∀ W : Set V, W.ncard = k → ℓ ≤ (CycleLengthsExp.WellSpread.extNbhd G W).ncard)
    (v : V) (hv : k ≤ {w | G.Reachable v w}.ncard) :
    ∃ (w : V) (p : G.Walk v w), p.IsPath ∧ p.length = ℓ := by sorry

end CycleLengthsExp.ManyLengths
Source
Friedman and Krivelevich, Cycle lengths in expanding graphs, arXiv:1912.11011v2, p. 6, Lemma 2.5, first assertion (cited as Lemma 2.4 on p. 13)
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