AFTD Auto-Formalizing Theoretical Domains

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
Used by 5

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
See it in the graphDiscuss this resultChallenge it