sustainable_gts_step
def
A 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.
Statement
def sustainable_gts_step {V : Type*} [Fintype V] [DecidableEq V] (T T' : SimpleGraph V) : Prop
- Defined in
- arXiv:2610.17078 Open Problem 6.1
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Built on 2
- is_sustainable_treeA tree T is sustainable if every edge of T is sustainable.
- is_generalized_tree_shiftA simple graph T' on an arbitrary type V is obtained from a tree T by a generalized tree shift if T is a tree, and there exist distinct…
- Used by 2
- 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…
- 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…
Read back from the Lean
For a finite type $V$ with decidable equality and two simple graphs $T$ and $T'$ on $V$, sustainable_gts_step T T' asserts that:
1. $T$ is a sustainable tree (is_sustainable_tree T),
2. $T'$ is a sustainable tree (is_sustainable_tree T'), and
3. $T'$ is obtained from $T$ by a generalized tree shift (is_generalized_tree_shift T T').
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 single step of generalized tree shift between two sustainable trees. -/ def sustainable_gts_step {V : Type*} [Fintype V] [DecidableEq V] (T T' : SimpleGraph V) : Prop := is_sustainable_tree T ∧ is_sustainable_tree T' ∧ is_generalized_tree_shift T T'