AFTD Auto-Formalizing Theoretical Domains

spectral_moore_second_eigenvalue_le

def

For a finite simple graph G, the second largest adjacency eigenvalue is at most θ.

Statement

open Classical SimpleGraph Matrix in
noncomputable def spectral_moore_second_eigenvalue_le {V : Type*} [Fintype V]
    (G : SimpleGraph V) (θ : ℝ) : Prop
Defined in
arXiv:2611.00591
Verified
07 Nov 2026
Axioms
none listed
Used by 6

Read back from the Lean

Given a finite type V, a simple graph G on V, and a real number θ, the definition spectral_moore_second_eigenvalue_le G θ asserts that for every index i : Fin (Fintype.card V) whose value is strictly positive (0 < i.val, i.e., excluding the zeroth eigenvalue), the i-th eigenvalue (G.isHermitian_adjMatrix ℝ).eigenvalues₀ i of the adjacency matrix of G is less than or equal to θ.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

open Classical SimpleGraph Matrix in
/-- The second largest eigenvalue of a finite simple graph G is at most θ. -/
noncomputable def spectral_moore_second_eigenvalue_le {V : Type*} [Fintype V]
    (G : SimpleGraph V) (θ : ℝ) : Prop := ∀ (i : Fin (Fintype.card V)), 0 < i.val → (G.isHermitian_adjMatrix ℝ).eigenvalues₀ i ≤ θ
See it in the graphDiscuss this resultChallenge it