Theorem 5.5 — tree-unfolding characterisation
ProvedCallCountPOPBR.Supplement.theorem_5_5graph-theoryp2o-gran-per-chapterp2o-plan-paperp2o-v1recursive-algorithms
Fix . A family of rooted, naturally labelled, ordered trees is generated by a deterministic decreasing-argument recursive specification with at most immediate calls per invocation if and only if the family is recursively consistent and every vertex has at most children.
Recursive consistency means that has root label , labels strictly decrease along every parent–child edge, and every subtree rooted at label is as a labelled ordered tree.
Differences from the source:
- encoding: isomorphism as a labelled ordered tree → equality of values of an inductive finite labelled ordered-tree type; reason: the inductive representation has no vertex identities beyond labels and ordered tree structure, so equality is precisely the stated isomorphism
- encoding: rooted integer-labelled trees indexed by nonnegative inputs → trees with natural-number labels; reason: every label is an input to the decreasing recursion and hence is nonnegative
Preamble
import Mathlib import Definitions.Def_CallCountPOPBR_Supplement_DecSpec_unfold import Definitions.Def_CallCountPOPBR_Supplement_RecConsistent set_option autoImplicit false
Formal statement
namespace CallCountPOPBR.Supplement
/-- **Theorem 5.5 (Tree-unfolding characterisation).** Swain, *Recursive Call-Count Sequences: Structural Realisability, Periodic Branching, and
Partial-Observation Reconstruction*, STOC 2027 submission (manuscript sha256 79135884…), Theorem 5.5, p.10: "A family (T_n) is
generated by a deterministic decreasing-argument recursive specification with at most b immediate
calls per invocation if and only if it is recursively consistent and each vertex has at most b
children."
Generated: `T n = s.unfold n` for every `n`, for some decreasing-argument specification `s` making
at most `b` calls at each input. "Each vertex has at most `b` children" ranges over every vertex of
every `T_n`. -/
theorem theorem_5_5 (b : ℕ) (T : ℕ → LTree) :
(∃ s : DecSpec, (∀ n, (s.calls n).length ≤ b) ∧ ∀ n, T n = s.unfold n) ↔
(RecConsistent T ∧ ∀ n t, LTree.Sub t (T n) → t.children.length ≤ b) := by sorry
end CallCountPOPBR.Supplement
Source
Swain, Recursive Call-Count Sequences: Structural Realisability, Periodic Branching, and Partial-Observation Reconstruction, STOC 2027 submission (manuscript sha256 79135884…), Theorem 5.5, p.10