Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§7.1 — adjacency walk sum bounded by spectral radius

Proved
EvenCycleTuran.PathCount.rayleigh_step

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

adjacency-matrixp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1spectral-graph-theorywalks

Let GGG have nnn vertices, real adjacency matrix AAA, and spectral radius μ(G)\mu(G)μ(G). For every l≥1l\ge1l≥1,

∑i,j∈V(G)(Al−1)ij≤n μ(G)l−1.\sum_{i,j\in V(G)}(A^{l-1})_{ij}\le n\,\mu(G)^{l-1}.i,j∈V(G)∑​(Al−1)ij​≤nμ(G)l−1.

This bounds the total walk count by a graph-wide spectral quantity and is the matrix inequality used in both path-count upper bounds of the paper.

Formalization Note The spectral radius is the maximum of the absolute values of the real eigenvalues. The finite index set gives zero for the empty graph.

Preamble
import Mathlib
import Definitions.Def_EvenCycleTuran_PathCount_Setting
Formal statement
namespace EvenCycleTuran.PathCount

/-- The Rayleigh quotient bounds the all-ones quadratic form of a power of the
adjacency matrix by the graph's spectral radius. -/
theorem rayleigh_step (n l : ℕ) (hl : 1 ≤ l) (G : SimpleGraph (Fin n))
    [DecidableRel G.Adj] :
    (∑ i : Fin n, ∑ j : Fin n, ((G.adjMatrix ℝ) ^ (l - 1)) i j) ≤
      (n : ℝ) * specRad G ^ (l - 1) := by sorry

end EvenCycleTuran.PathCount
Source
Gerbner, Győri, Methuku and Vizer, Generalized Turán problems for even cycles, arXiv:1712.07079v3, p. 30, §7.1, paragraph following equation (7)
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