Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.2 (Safety of the compiler): every compiled scheme GM⋄G^\diamond_MGM⋄​ is safe

Proved
TreeEquivalenceHORS.Equivalence.lemma_5_2

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

higher-order-recursion-schemesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1safety

For every two-counter program MMM and side ⋄∈{L,R}\diamond\in\{L,R\}⋄∈{L,R}, the compiled scheme GM⋄G^\diamond_MGM⋄​ is safe in the sense of Section 3: all nonterminal and body-subterm types are homogeneous, and every application operand sss satisfies ord⁡(s)≤ord⁡(x)\operatorname{ord}(s)\le\operatorname{ord}(x)ord(s)≤ord(x) for every rule parameter xxx occurring in sss.

Safety of the compiler output is what places the lower bound in the safe class.

Differences from the source: none.

Preamble
import Mathlib
import Definitions.Def_TreeEquivalenceHORS_Equivalence_Compiler
Formal statement
namespace TreeEquivalenceHORS.Equivalence

/-- **Lemma 5.2 (Safety of the compiler)** (printed p. 16 / PDF p. 18). For every `M` and side `⋄`,
the compiled scheme `G^⋄_M` is safe. -/
theorem lemma_5_2 (M : Machine) (side : Side) : (compile side M).Safe := 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 5.2, printed p. 16 / PDF p. 18
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