AFTD Auto-Formalizing Theoretical Domains

simple_graph_laplacian_matrix

def

The Laplacian matrix of a finite simple graph G is the diagonal degree matrix minus the real adjacency matrix of G.

Statement

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

Read back from the Lean

Given a type V with [Fintype V] and [DecidableEq V], and a simple graph G on V with [DecidableRel G.Adj], simple_graph_laplacian_matrix G is defined as the V × V real matrix given by the diagonal degree matrix of G (where the entry at (v, v) is G.degree v cast to ℝ) minus the real adjacency matrix G.adjMatrix ℝ.

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 Laplacian matrix L = D - A of a finite simple graph G over ℝ. -/
def simple_graph_laplacian_matrix {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj] : Matrix V V ℝ := Matrix.diagonal (fun v => (G.degree v : ℝ)) - G.adjMatrix ℝ
See it in the graphDiscuss this resultChallenge it