AFTD Auto-Formalizing Theoretical Domains

simple_graph_adj_eigenvalues_sorted

def

For a type V with [Fintype V] and [DecidableEq V] (implicit V) and a simple graph G : SimpleGraph V, simple_graph_adj_eigenvalues_sorted G : Fin (Fintype.card V) → ℝ is defined, under open scoped Classical for the adjacency decidability, as (G.isHermitian_adjMatrix ℝ).eigenvalues₀: Matrix.IsHermitian.eigenvalues₀ of the Hermitian real adjacency matrix G.adjMatrix ℝ, with the ring ℝ passed explicitly to SimpleGraph.isHermitian_adjMatrix. These are the adjacency eigenvalues with multiplicity, listed in nonincreasing order (Mathlib proves Matrix.IsHermitian.eigenvalues₀_antitone).

Statement

noncomputable def simple_graph_adj_eigenvalues_sorted {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) : Fin (Fintype.card V) → ℝ
Defined in
arXiv:2610.18636 (spectral distances; nearest spectra to complete multipartite graphs): the adjacency eigenvalues lambda_1 >= ... >= lambda_n used in its spectral distances
Verified
27 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

For any type V with [Fintype V] and [DecidableEq V], and any simple graph G : SimpleGraph V, simple_graph_adj_eigenvalues_sorted G is defined as (G.isHermitian_adjMatrix ℝ).eigenvalues₀, which is the function Fin (Fintype.card V) → ℝ giving the sorted eigenvalues of the real adjacency matrix of G.

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

noncomputable def simple_graph_adj_eigenvalues_sorted {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) : Fin (Fintype.card V) → ℝ := open scoped Classical in (G.isHermitian_adjMatrix ℝ).eigenvalues₀
See it in the graphDiscuss this resultChallenge it