mirror_symmetric_m_leafy_trees
def
The set mirror_symmetric_m_leafy_trees m n consists of all trees t in in_m_leafy_trees m n satisfying plane_tree_mirror t = t.
Statement
def mirror_symmetric_m_leafy_trees (m n : ℕ) : Set PlaneTree- Defined in
- arXiv:2611.10154 Sec. 2.3
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Built on 3
- plane_tree_mirrorThe left-right mirror reflection involution τ on plane trees, recursively reversing child order.
- 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 2
- 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.
Read back from the Lean
The definition mirror_symmetric_m_leafy_trees m n is the set of plane trees t such that:
1. in_m_leafy_trees m n t holds, which means:
- is_m_leafy m t: for every subtree s of t (i.e., s ∈ plane_tree_subtrees t), m * plane_tree_num_internal s < plane_tree_num_leaves s;
- plane_tree_num_internal t = n;
- plane_tree_num_leaves t = m * n + 1;
2. plane_tree_mirror t = t, i.e., t is equal to its mirror reflection.
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 set of mirror-symmetric trees in in_m_leafy_trees m n. -/ def mirror_symmetric_m_leafy_trees (m n : ℕ) : Set PlaneTree := {t : PlaneTree | in_m_leafy_trees m n t ∧ plane_tree_mirror t = t}