AFTD Auto-Formalizing Theoretical Domains

laplacian_mu1

def

For any finite vertex type V and any simple graph G on V, the largest eigenvalue μ₁ (Laplacian spectral radius) of the real Laplacian matrix L = D - A of G (indexed by 0 in nonincreasing order of eigenvalues), defaulting to 0 if V is empty.

Statement

noncomputable def laplacian_mu1 {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

Given a finite type V and a simple graph G on V, laplacian_mu1 G is defined to be the real number obtained as follows: - If 1 ≤ Fintype.card V (i.e., V has at least one vertex), it is (G.isHermitian_lapMatrix ℝ).eigenvalues₀ ⟨0, h⟩, which is the 0-th eigenvalue of the real Laplacian matrix of G as ordered by Matrix.IsHermitian.eigenvalues₀. - Otherwise (if Fintype.card V = 0, i.e., V is empty), it is 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 largest eigenvalue (spectral radius) of the real Laplacian matrix of a finite simple graph. -/
noncomputable def laplacian_mu1 {V : Type*} [Fintype V] (G : SimpleGraph V) : ℝ := open scoped Classical in
  if h : 1 ≤ Fintype.card V then
    (G.isHermitian_lapMatrix ℝ).eigenvalues₀ ⟨0, h⟩
  else 0
See it in the graphDiscuss this resultChallenge it