AFTD Auto-Formalizing Theoretical Domains

adjacency_spectral_radius

def

The adjacency spectral radius of a simple graph G on a finite vertex set is the spectral radius of its real adjacency matrix.

Statement

noncomputable def adjacency_spectral_radius {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : ENNReal
Defined in
arXiv:2610.17078 Section 2
Verified
18 Oct 2026
Axioms
none listed
Used by 16

Read back from the Lean

For any type V with [Fintype V] and [DecidableEq V], and any simple graph G : SimpleGraph V, adjacency_spectral_radius G is defined as the spectral radius over ℝ of the real adjacency matrix G.adjMatrix ℝ, valued in ENNReal.

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

/-- The adjacency spectral radius of a simple graph on a finite vertex set. -/
noncomputable def adjacency_spectral_radius {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : ENNReal := open scoped Classical in spectralRadius ℝ (G.adjMatrix ℝ)
See it in the graphDiscuss this resultChallenge it