is_internal_piece_thread
def
An internal thread of a piece of a tree T is a piece thread whose endpoints both have degree at least 3 in T and are not special.
Statement
def is_internal_piece_thread {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] {u v : V} (p : T.Walk u v) : Prop
- Defined in
- arXiv:2610.15145, Question 11.4
- Verified
- 25 Oct 2026
- Axioms
- none listed
- Built on 2
- is_piece_threadA thread of a piece of a tree T is a path of length at least 1 whose interior vertices have degree 2 and are not special, and whose…
- is_tree_specialA vertex in a graph is special if it is not a leaf (degree not equal to 1) but is adjacent to a leaf (degree 1).
Read back from the Lean
Given a finite type V with decidable equality, a simple graph T on V with decidable adjacency, vertices u, v : V, and a walk p : T.Walk u v, is_internal_piece_thread T p is the proposition that:
1. is_piece_thread T p holds,
2. the degree of u in T is at least 3,
3. u is not "tree special" in T (¬ is_tree_special T u),
4. the degree of v in T is at least 3, and
5. v is not "tree special" in T (¬ is_tree_special T v).
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
/-- An internal thread of a piece is a thread whose endpoints both have degree at least 3 in the piece. -/ def is_internal_piece_thread {V : Type*} [Fintype V] [DecidableEq V] (T : SimpleGraph V) [DecidableRel T.Adj] {u v : V} (p : T.Walk u v) : Prop := is_piece_thread T p ∧ 3 ≤ T.degree u ∧ ¬ is_tree_special T u ∧ 3 ≤ T.degree v ∧ ¬ is_tree_special T v