is_spectrally_sustainable
def
A simple graph G on a finite vertex set is spectrally sustainable if G is connected and every edge of G is spectrally sustainable.
Statement
def is_spectrally_sustainable {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Prop
- Defined in
- arXiv:2610.17078, Sustainable trees, Section 1
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Built on 1
- is_spectrally_sustainable_edgeAn edge e in a simple graph G on a finite vertex set is spectrally sustainable if there exists a non-edge f of G such that deleting e and…
Read back from the Lean
For a finite type V with decidable equality and a simple graph G on V, is_spectrally_sustainable G asserts that G is connected, and for every edge e in G.edgeSet, e is a spectrally sustainable edge of G (that is, e ∈ G.edgeSet and there exists an edge f in the complement graph Gᶜ such that the graph obtained by deleting e and adding f is connected, and the adjacency spectral radius of G is less than or equal to the adjacency spectral radius of the graph obtained by deleting e and adding f).
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 simple graph is spectrally sustainable if it is connected and every edge is spectrally sustainable. -/ def is_spectrally_sustainable {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) : Prop := G.Connected ∧ ∀ e ∈ G.edgeSet, is_spectrally_sustainable_edge G e