Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.1 (Head adequacy): [ ⁣[t] ⁣]η∗=1  ⟺  ∃a,u⃗ t⇓Ga(u⃗)[\![t]\!]_{\eta^*}=1\iff\exists a,\vec u\ t\Downarrow_G a(\vec u)[[t]]η∗​=1⟺∃a,u t⇓G​a(u)

Proved
TreeEquivalenceHORS.Equivalence.lemma_6_1

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

abstract-interpretationdomain-theoryhigher-order-recursion-schemesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For a well-formed scheme GGG (of any finite order, not necessarily safe or productive) and a closed ground term ttt,

[ ⁣[t] ⁣]η∗=1  ⟺  ∃a,u⃗  t⇓Ga(u⃗),[\![t]\!]_{\eta^*}=1\iff\exists a,\vec u\ \ t\Downarrow_G a(\vec u),[[t]]η∗​=1⟺∃a,u  t⇓G​a(u),

where η∗=ΦGB(η0)\eta^*=\Phi_G^{B}(\eta_0)η∗=ΦGB​(η0​) is the least fixed point of the finite monotone semantics.

This decides head convergence, which a search over unfolding budgets alone can only semidecide.

Differences from the source:

  • encoding: finite posets D_σ of monotone maps; environments in the finite product E_G → enumerated finite tables enum σ of type List SVal (Section 6.2), application by table lookup, environments as lists indexed by nonterminals; reason: the representation of Section 6.2; the tables are exactly the monotone maps
Preamble
import Mathlib
import Definitions.Def_TreeEquivalenceHORS_Equivalence_FiniteSemantics
Formal statement
namespace TreeEquivalenceHORS.Equivalence

/-- **Lemma 6.1 (Head adequacy)** (printed p. 23 / PDF p. 25). For a well-formed scheme `G` and a
closed ground term `t`, `⟦t⟧_{η*} = 1 ⟺ ∃ a, u⃗, t ⇓_G a(u⃗)`. -/
theorem lemma_6_1 (G : HORS) (hG : G.Valid) (t : Tm) (ht : G.typeOf [] t = some .o) :
    G.den [] G.etaStar [] t = .bit true ↔ ∃ (c : ℕ) (us : List Tm), G.HeadConv t c us := by sorry

end TreeEquivalenceHORS.Equivalence
Source
Mingkun Xiao, Yixuan Sun, Tree Equivalence of Higher-Order Recursion Schemes Is Undecidable, STOC 2027 submission #421 (October 2026), source.pdf SHA-256 e875d09ced029e3f5cb114abba049e4a2b1bdaa9b064c98b0d71f2ec7451c7af, Lemma 6.1, printed p. 23 / PDF p. 25
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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