AFTD Auto-Formalizing Theoretical Domains

is_sustainable_tree

def

A tree T is sustainable if every edge of T is sustainable.

Statement

def is_sustainable_tree {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) : Prop
Defined in
arXiv:2610.17078 Section 1
Verified
18 Oct 2026
Axioms
none listed
Built on 1
  • is_sustainable_edgeAn edge e in a tree T is sustainable if there exists a non-edge f such that T - e + f is a tree and the adjacency spectral radius of T - e…
Used by 12

Read back from the Lean

For a finite type V with decidable equality and a simple graph T on V, is_sustainable_tree T asserts that T is a tree (T.IsTree) and that every edge e in T.edgeSet is a sustainable edge of T (is_sustainable_edge T e).

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

/-- A tree is sustainable if every edge in it is sustainable. -/
def is_sustainable_tree {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) : Prop := T.IsTree ∧ ∀ e ∈ T.edgeSet, is_sustainable_edge T e
See it in the graphDiscuss this resultChallenge it