is_m_leafy
def
A tree T is m-leafy if every rooted subtree T_v satisfies ℓ(T_v) > m * n(T_v).
Statement
def is_m_leafy (m : ℕ) (t : PlaneTree) : Prop
- Defined in
- arXiv:2611.10154 Def. 2.2
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 4
- plane_tree_subtreesThe collection of all rooted subtrees T_v of a plane tree T.
- PlaneTreeA finite plane tree is either a leaf or an internal node with a list of child plane trees.
- plane_tree_num_leavesThe number of leaves of a plane tree T, denoted ℓ(T).
- plane_tree_num_internalThe number of internal vertices of a plane tree T, denoted n(T).
- Used by 5
- in_m_leafy_treesLT_n^m is the set of m-leafy trees with n internal vertices and mn + 1 leaves.
- op_1429_mirror_symmetric_m_leafy_trees_involutionThe mirror reflection involution τ preserves the class LT_n^m of m-leafy trees with n internal vertices and mn + 1 leaves.
- op_1429_mirror_symmetric_m_leafy_trees_n_one_uniqueFor every natural number m ≥ 1, there exists a unique tree t such that t ∈ mirror_symmetric_m_leafy_trees m 1.
- op_1429_mirror_symmetric_m_leafy_trees_nonemptyFor all natural numbers m ≥ 1 and n ≥ 1, the set mirror_symmetric_m_leafy_trees m n is nonempty.
- op_1430_involution_group_n_oneFor n = 1 and any m ≥ 1, any two involutions on MLeafyTree m 1 generate a trivial (subsingleton) permutation subgroup.
Read back from the Lean
A plane tree t is defined to be m-leafy (for a natural number m) if and only if for every subtree s belonging to plane_tree_subtrees t, m times the number of internal nodes of s is strictly less than the number of leaves of s.
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
/-- Predicate that a plane tree is m-leafy. -/ def is_m_leafy (m : ℕ) (t : PlaneTree) : Prop := ∀ s ∈ plane_tree_subtrees t, m * plane_tree_num_internal s < plane_tree_num_leaves s