Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tree equivalence is undecidable for all four scheme languages

Proved
TreeEquivalenceHORS.Equivalence.four_tree_equivalence_languages_undecidable

by kmehltretter82 · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilityrecursion-schemes

Each of the four tree-equivalence languages is undecidable and every co-c.e. predicate many-one reduces to it. The same computable map works for all four, and produces safe, productive order-at-most-four pairs over the fixed binary alphabet.

Preamble
import Definitions.Def_TreeEquivalenceHORS_Equivalence_Languages
Formal statement
namespace TreeEquivalenceHORS.Equivalence

theorem four_tree_equivalence_languages_undecidable :
    ∀ P ∈ [EqHORS, Eq4Sigma2, Eq4Sigma2Prod, Eq4Sigma2SafeProd],
      (∀ A : ℕ → Prop, CoCE A → A ≤₀ P) ∧ ¬ ComputablePred P := 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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me