op223_nonsustainable_connectivity_fin_four
Every non-sustainable tree X on Fin 4 can reach a star graph isomorphic to completeBipartiteGraph (Fin 1) (Fin 3) by a sequence of non-sustainable generalized tree shifts.
Statement
theorem op223_nonsustainable_connectivity_fin_four (X : SimpleGraph (Fin 4))
(hX : is_nonsustainable_tree X) :
∃ K : SimpleGraph (Fin 4), Nonempty (K ≃g completeBipartiteGraph (Fin 1) (Fin 3)) ∧
Relation.ReflTransGen nonsustainable_gts_step X K- Source
- arXiv:2610.17078, Open Problem 6.1
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- op223_nonsustainable_tree_fin_fourEvery non-sustainable tree on four vertices is isomorphic to the star graph K_{1,3}.
- nonsustainable_gts_stepA transition step between two non-sustainable trees T and T' on a finite type V where T' is obtained from T by a generalized tree shift.
- is_nonsustainable_treeA tree T is non-sustainable if T is a tree and T is not sustainable.
Read back from the Lean
For any simple graph $X$ on the vertex type Fin 4, if $X$ is a nonsustainable tree, then there exists a simple graph $K$ on Fin 4 such that:
1. $K$ is isomorphic (as a simple graph) to the complete bipartite graph $K_{1,3}$ (completeBipartiteGraph (Fin 1) (Fin 3)), and
2. $K$ is reachable from $X$ via zero or more steps of the nonsustainable_gts_step relation (the reflexive-transitive closure Relation.ReflTransGen nonsustainable_gts_step X K).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
Any non-sustainable tree on four vertices is already isomorphic to the star graph K_{1,3}, as established by op223_nonsustainable_tree_fin_four. Thus, taking K = X witnesses the existential statement immediately, reaching K in zero steps by reflexivity of the reflexive-transitive closure.
X itself is the desired star graph, reachable from X in zero steps
We choose K to be X. By op223_nonsustainable_tree_fin_four, any non-sustainable tree on 4 vertices is already isomorphic to K_{1,3}. Furthermore, reachability in the reflexive-transitive closure holds immediately in zero steps by reflexivity (Relation.ReflTransGen.refl).
uses
op223_nonsustainable_tree_fin_four,Relation.ReflTransGen.reflRelation.ReflTransGen nonsustainable_gts_step X K := ⟨X, op223_nonsustainable_tree_fin_four X hX, Relation.ReflTransGen.refl⟩
op223_nonsustainable_tree_fin_four- Every non-sustainable tree on 4 vertices is isomorphic to the complete bipartite star graph K_{1,3}
Relation.ReflTransGen.refl- The reflexive-transitive closure of any binary relation is reflexive (every element can reach itself in zero steps)
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- Every non-sustainable tree on four vertices can reach a star K_{1,3} by non-sustainable generalized tree shifts. -/theorem op223_nonsustainable_connectivity_fin_four (X : SimpleGraph (Fin 4)) (hX : is_nonsustainable_tree X) : ∃ K : SimpleGraph (Fin 4), Nonempty (K ≃g completeBipartiteGraph (Fin 1) (Fin 3)) ∧ Relation.ReflTransGen nonsustainable_gts_step X K := ⟨X, op223_nonsustainable_tree_fin_four X hX, Relation.ReflTransGen.refl⟩