AFTD Auto-Formalizing Theoretical Domains

is_endpoint_cut_stable

def

A tree T on vertex type V is endpoint cut-stable with respect to metric d if for every edge {u, v} of T, deleting the edge leaves components with u and v such that d(u, v) ≤ d(u, x) for all x in the component of v and d(u, v) ≤ d(v, y) for all y in the component of u.

Statement

def is_endpoint_cut_stable {V : Type*} (d : V → V → ℝ) (T : SimpleGraph V) : Prop
Defined in
arXiv:2610.23032 Section 8
Verified
30 Oct 2026
Axioms
none listed

Read back from the Lean

For a type V, a function d : V → V → ℝ, and a simple graph T on V, is_endpoint_cut_stable d T asserts that: For all vertices u, v : V, if u and v are adjacent in T, then: 1. For every x : V, if x is reachable from v in T after deleting the edge between u and v, then d u v ≤ d u x; and 2. For every y : V, if y is reachable from u in T after deleting the edge between u and v, then d u v ≤ d v y.

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 spanning tree T on V is endpoint cut-stable with respect to d if deleting any edge uv leaves components A and B such that u is at least as close to v as to any other node in B and v is at least as close to u as to any other node in A. -/
def is_endpoint_cut_stable {V : Type*} (d : V → V → ℝ) (T : SimpleGraph V) : Prop := ∀ ⦃u v : V⦄, T.Adj u v →
    (∀ x, (T.deleteEdges {s(u, v)}).Reachable v x → d u v ≤ d u x) ∧
    (∀ y, (T.deleteEdges {s(u, v)}).Reachable u y → d u v ≤ d v y)
See it in the graphDiscuss this resultChallenge it