AFTD Auto-Formalizing Theoretical Domains

laplacian_mu2

def

For any finite vertex type V and any simple graph G on V, the second largest eigenvalue μ₂ of the real Laplacian matrix L = D - A of G, defined using Mathlib's antitone eigenvalue sequence Matrix.IsHermitian.eigenvalues₀ (where eigenvalues₀_antitone guarantees nonincreasing order): if 2 ≤ Fintype.card V (with proof h), it is (G.isHermitian_lapMatrix ℝ).eigenvalues₀ ⟨1, h⟩, and 0 otherwise.

Statement

noncomputable def laplacian_mu2 {V : Type*} [Fintype V] (G : SimpleGraph V) : ℝ
Defined in
arXiv:2611.03879, Section 1
Verified
05 Nov 2026
Axioms
none listed
Used by 1
  • laplacian_mu2_le_mu1For any finite vertex type V and any simple graph G on V with at least 2 vertices (2 ≤ Fintype.card V), the second largest Laplacian…

Read back from the Lean

laplacian_mu2 is a noncomputable definition that assigns to any simple graph G on a finite type V a real number, defined by cases on the cardinality of V: - If 2 ≤ Fintype.card V, it evaluates to (G.isHermitian_lapMatrix ℝ).eigenvalues₀ ⟨1, h⟩, which is the eigenvalue at index 1 (the second eigenvalue in 0-indexed, nondecreasing order) of the real Hermitian Laplacian matrix of G. - Otherwise (if Fintype.card V < 2), it evaluates to 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 real Laplacian matrix of a finite simple graph. -/
noncomputable def laplacian_mu2 {V : Type*} [Fintype V] (G : SimpleGraph V) : ℝ := open scoped Classical in
  if h : 2 ≤ Fintype.card V then
    (G.isHermitian_lapMatrix ℝ).eigenvalues₀ ⟨1, h⟩
  else 0
See it in the graphDiscuss this resultChallenge it