MLeafyTree
abbrev
The type MLeafyTree m n is the subtype of plane trees belonging to LT_n^m.
Statement
abbrev MLeafyTree (m n : ℕ) : Type
- Defined in
- arXiv:2611.10154 Def. 2.2
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 2
- PlaneTreeA finite plane tree is either a leaf or an internal node with a list of child plane trees.
- in_m_leafy_treesLT_n^m is the set of m-leafy trees with n internal vertices and mn + 1 leaves.
- Used by 1
- 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
The type MLeafyTree m n (for natural numbers m and n) is the subtype of plane trees t : PlaneTree satisfying:
1. is_m_leafy m t: for every subtree s of t, the number of leaves of s is strictly greater than m times the number of internal nodes of s;
2. plane_tree_num_internal t = n: the number of internal nodes in t is n; and
3. plane_tree_num_leaves t = m * n + 1: the number of leaves in t is m * n + 1.
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 type of m-leafy trees with n internal vertices and mn + 1 leaves. -/ abbrev MLeafyTree (m n : ℕ) : Type := { t : PlaneTree // in_m_leafy_trees m n t }