AFTD Auto-Formalizing Theoretical Domains

plane_tree_num_internal

def

The number of internal vertices of a plane tree T, denoted n(T).

Statement

def plane_tree_num_internal : PlaneTree → ℕ
Defined in
arXiv:2611.10154 Sec. 2.2
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • PlaneTreeA finite plane tree is either a leaf or an internal node with a list of child plane trees.
Used by 6

Read back from the Lean

A recursively defined function plane_tree_num_internal mapping a PlaneTree to a natural number (ℕ): - PlaneTree.leaf maps to 0. - PlaneTree.node cs (where cs : List PlaneTree is the list of child subtrees) maps to 1 plus the sum of plane_tree_num_internal c for all children c in cs.

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 number of internal vertices in a finite plane tree. -/
def plane_tree_num_internal : PlaneTree → ℕ
  | .leaf => 0
  | .node cs => 1 + (cs.attach.map (fun ⟨c, _⟩ => plane_tree_num_internal c) |>.sum)
termination_by t => sizeOf t
See it in the graphDiscuss this resultChallenge it