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
- op223_path_connectivity_of_leaf_rank_stepIf every sustainable tree X on Fin n (n ≥ 1) that is not a path has a sustainable generalized-tree-shift predecessor Y with strictly fewer…
- is_nonsustainable_treeA tree T is non-sustainable if T is a tree and T is not sustainable.
- sustainable_gts_stepA transition step between two sustainable trees T and T' on a finite type V where T' is obtained from T by a generalized tree shift.
- op223_shift_bad_edge_yields_stepIf a nonsustainable tree undergoes an adjacent shift and a retained beneficiary edge remains nonsustainable, the shift is a step between…
- no_sustainable_tree_fin_twoNo simple graph on the two-element vertex type Fin 2 is a sustainable tree: a tree there has one edge and the complement has no edge at…
- op223_conditional_slide_refutationIf the example graph is sustainable and its two possible slides at the edge 4-5 are nonsustainable, then the universal leaf-slide…
- not_op223_path_is_sustainableThe statement
op223_path_is_sustainableis false: The statement fails at n = 2.SimpleGraph.pathGraph 2 = SimpleGraph.hasse (Fin 2)is… - op223_nonsustainable_tree_fin_fourEvery non-sustainable tree on four vertices is isomorphic to the star graph K_{1,3}.
- op223_nonsustainable_has_bad_edgeEvery nonsustainable finite tree contains an edge that is not sustainable.
- op223_no_nonsustainable_tree_fin_threeThere are no non-sustainable trees on three vertices.
- sustainable_path_connectivity_of_descent_stepIf every sustainable tree on Fin n (n ≥ 1) that is not a path has a sustainable generalized-tree-shift predecessor with strictly smaller…
- op223_star_connectivity_from_edge_preservationAssume shifting along a nonsustainable edge preserves it, shifting a branch toward the center of a nonsustainable pendant edge preserves…
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