AFTD Auto-Formalizing Theoretical Domains

delta

def

For a finite simple graph G on vertex type V, delta G is the integer (max_induced_linear_forest G : ℤ) * (Fintype.card V : ℤ) * ((Fintype.card V : ℤ) - 1) - 4 * (wiener_index G : ℤ).

Statement

noncomputable def delta {V : Type*} [Fintype V] (G : SimpleGraph V) : ℤ
Defined in
arXiv:2611.12781, Section 2, equation (164)
Verified
13 Nov 2026
Axioms
none listed
Built on 2
  • max_induced_linear_forestThe maximum order of an induced linear forest in a finite simple graph G on a finite vertex type V is the supremum in ℕ of the…
  • wiener_indexThe Wiener index of a finite simple graph G is the sum of the shortest-path distances between all unordered pairs of vertices in G.

Read back from the Lean

For a finite type V and a simple graph G on V, delta G is defined as the integer: ((max_induced_linear_forest G : ℤ) * (Fintype.card V : ℤ) * ((Fintype.card V : ℤ) - 1)) - 4 * (wiener_index 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

/-- The deficit invariant delta(G) = L(G) * n * (n - 1) - 4 * W(G). -/
noncomputable def delta {V : Type*} [Fintype V] (G : SimpleGraph V) : ℤ := (max_induced_linear_forest G : ℤ) * (Fintype.card V : ℤ) * ((Fintype.card V : ℤ) - 1) - 4 * (wiener_index G : ℤ)
See it in the graphDiscuss this resultChallenge it