Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — α-expanders have Ω(α³/log(1/α))n cycle lengths

Proved
CycleLengthsExp.ManyLengths.theorem_2

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

cycle-lengthsexpander-graphsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1vertex-expansion

There is an absolute constant c>0c>0c>0 such that, for every 0<α≤10<\alpha\le10<α≤1, all sufficiently large nnn, and every α\alphaα-expander GGG on nnn vertices,

∣L(G)∣≥c α3log⁡2(2/α) n.|L(G)|\ge c\,\frac{\alpha^3}{\log_2(2/\alpha)}\,n.∣L(G)∣≥clog2​(2/α)α3​n.

Here L(G)L(G)L(G) is the set of lengths of simple cycles of GGG, so the inequality counts distinct lengths rather than cycles.

The theorem gives a polynomial dependence on the expansion parameter for the number of available cycle lengths. Theorem 1 of the paper gives a weaker dependence through its spacing guarantee.

Formalization Note The paper writes Ω(α3/log⁡(1/α))n\Omega(\alpha^3/\log(1/\alpha))nΩ(α3/log(1/α))n. One positive constant ccc is fixed before α\alphaα, and log⁡2(2/α)\log_2(2/\alpha)log2​(2/α) is the disclosed endpoint-safe reading of its logarithm. The source does not state an nnn threshold, but K2K_2K2​ is an α\alphaα-expander with no cycle, so the necessary n0n_0n0​ is allowed to depend on α\alphaα and precedes the choice of GGG.

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

/-- Friedman–Krivelevich, Theorem 2, p. 3 (restated p. 13). -/
theorem theorem_2 :
    ∃ c : ℝ, 0 < c ∧ ∀ α : ℝ, 0 < α → α ≤ 1 →
      ∃ n₀ : ℕ, ∀ n ≥ n₀, ∀ G : SimpleGraph (Fin n), CycleLengthsExp.WellSpread.IsAlphaExpander α G →
        c * (α ^ 3 / Real.logb 2 (2 / α)) * (n : ℝ) ≤
          ((CycleLengthsExp.WellSpread.cycleLengths G).ncard : ℝ) := by sorry

end CycleLengthsExp.ManyLengths
Source
Friedman and Krivelevich, Cycle lengths in expanding graphs, arXiv:1912.11011v2, p. 3, Theorem 2 (restated 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