AFTD Auto-Formalizing Theoretical Domains

simple_graph_laplacian_second_eigenvalue

def

Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_laplacian_second_eigenvalue is defined as (simple_graph_laplacian_matrix_isHermitian G).eigenvalues₀ evaluated at ⟨1, h⟩ if 2 ≤ Fintype.card V, and 0 otherwise.

Statement

noncomputable def simple_graph_laplacian_second_eigenvalue {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : ℝ
Defined in
arXiv:2611.03879, Section 1
Verified
04 Nov 2026
Axioms
none listed
Built on 2

Read back from the Lean

Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, simple_graph_laplacian_second_eigenvalue G is defined as a real number: - If V has at least 2 vertices (2 ≤ Fintype.card V), it is the second eigenvalue (at index 1 of Fin (Fintype.card V), where eigenvalues are sorted in non-decreasing order via Mathlib's Matrix.IsHermitian.eigenvalues₀) of the Hermitian matrix simple_graph_laplacian_matrix G. - Otherwise (if Fintype.card V < 2), it is defined to be 0.

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 second largest eigenvalue μ₂ of the Laplacian matrix of a finite simple graph. -/
noncomputable def simple_graph_laplacian_second_eigenvalue {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : ℝ := if h : 2 ≤ Fintype.card V then
    (simple_graph_laplacian_matrix_isHermitian G).eigenvalues₀ ⟨1, h⟩
  else 0
See it in the graphDiscuss this resultChallenge it