colored_tree_subtree
def
The subtree rooted at vertex v consists of all descendants of v in the tree.
Statement
def colored_tree_subtree (T : ColoredRootedTree) (v : T.V) : Set T.V- Defined in
- arXiv:2611.03620 Section 2
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Built on 2
- ColoredRootedTreeA finite rooted tree properly colored with 4 colors, represented by an ancestorship partial order with a root element below all vertices,…
- instPartialOrderColoredRootedTreeThe ancestorship relation on the vertices of a colored rooted tree forms a partial order.
- Used by 2
- contiguous_interval_family_depth_lower_boundFor all integers R ≥ 1 and d ≥ 0 there is a finite rooted tree, properly colored with the 4 colors 0..3, with at most 11(2R+1)^d vertices,…
- has_contiguous_subtreesAn interval family has contiguous subtrees if the identifier image of every subtree is a closed integer interval.
Read back from the Lean
Given a colored rooted tree T and a vertex v : T.V, colored_tree_subtree T v is defined to be the set of all vertices w : T.V that are greater than or equal to v in the partial order of T (that is, the upper closed interval Set.Ici 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
/-- The subtree rooted at a vertex v in a ColoredRootedTree. -/ def colored_tree_subtree (T : ColoredRootedTree) (v : T.V) : Set T.V := Set.Ici v