The finite head-semantics iteration reaches a fixed point at the stated bound
ProvedTreeEquivalenceHORS.Equivalence.finite_environment_fixed_pointcomputabilityrecursion-schemes
For every valid scheme, one further simultaneous update leaves the environment computed after exactly the product of the finite type-domain cardinalities unchanged.
Preamble
import Definitions.Def_TreeEquivalenceHORS_Equivalence_FiniteSemantics
Formal statement
namespace TreeEquivalenceHORS.Equivalence theorem finite_environment_fixed_point (G : HORS) (v : G.Valid) : G.Phi G.etaStar = G.etaStar := by sorry end TreeEquivalenceHORS.Equivalence
Source
Mingkun Xiao and Yixuan Sun, Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable, §§3 and 5.6. https://arxiv.org/html/2610.39678v1