PlaneTree
inductive
A finite plane tree is either a leaf or an internal node with a list of child plane trees.
Statement
inductive PlaneTree : Type
- Defined in
- arXiv:2611.10154 Sec. 2.2
- Verified
- 10 Nov 2026
- Axioms
- none listed
- Used by 13
- in_m_leafy_treesLT_n^m is the set of m-leafy trees with n internal vertices and mn + 1 leaves.
- MLeafyTreeThe type MLeafyTree m n is the subtype of plane trees belonging to LT_n^m.
- 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.
- is_m_leafyA tree T is m-leafy if every rooted subtree T_v satisfies ℓ(T_v) > m * n(T_v).
- plane_tree_mirrorThe left-right mirror reflection involution τ on plane trees, recursively reversing child order.
- plane_tree_subtrees_nodeThe rooted subtrees of a node with children cs are the node itself together with the rooted subtrees of each child: s is a rooted subtree…
- 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.
- plane_tree_num_internalThe number of internal vertices of a plane tree T, denoted n(T).
- plane_tree_num_leavesThe number of leaves of a plane tree T, denoted ℓ(T).
- plane_tree_subtreesThe collection of all rooted subtrees T_v of a plane tree T.
- mirror_symmetric_m_leafy_treesThe 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.
- 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 inductive type PlaneTree is defined in Type with two constructors:
1. PlaneTree.leaf, taking no arguments.
2. PlaneTree.node, taking an argument children : List PlaneTree.
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
/-- Inductive type of finite plane trees with ordered children. -/ inductive PlaneTree : Type | leaf : PlaneTree | node (children : List PlaneTree) : PlaneTree