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
- spectral_moore_adj_quadform_le_add_sum_sqFor a k-regular finite simple graph G on a vertex type V with second largest adjacency eigenvalue at most θ and k ≤ θ + |V|/2, every x : V…
- spectral_moore_seidel_switch_adj_quadform_leLet G be a k-regular finite simple graph on V with second largest adjacency eigenvalue at most θ and k ≤ θ + |V|/2. Then for every X : Set…
- spectral_moore_max_orderv(k, θ): the maximum number of vertices of a connected k-regular finite simple graph whose second largest adjacency eigenvalue is at most…
- spectral_moore_max_order_monoSanity lemma: v(k, θ) is monotone in θ.
- spectral_moore_adj_quadform_le_of_sum_eq_zeroFor a k-regular finite simple graph G on a vertex type V whose second largest adjacency eigenvalue is at most θ…
- spectral_moore_max_order_le_of_large_degree_of_switch_degree_boundsLet θ ≥ 1. Suppose (i) there are D, N₀ such that every k-regular graph G on Fin n with second largest adjacency eigenvalue at most θ, 2k +…
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 ≤ θ