Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Extension by arbitrary unused catalyst bits

Definition
CatalyticTreeEval_PrefixExtension

by sragavan · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

Extend a native configuration by appending arbitrary bits beyond its current catalyst. The control state, all three heads, work tape and existing output are unchanged. Step and trajectory preservation under a strict prefix bound are subsequent proof obligations.

Definition code
import Definitions.Def_CatalyticTreeEval_MachineContracts

set_option autoImplicit false

namespace CatalyticTreeEval.Contracts.PrefixExtension

open CatalyticMatching.General

/-- Add untouched arbitrary bits beyond a configuration's current catalyst. -/
def extend {M : Machine} (suffix : List Bool) (c : Configuration M) : Configuration M :=
  { c with catalyst := c.catalyst ++ suffix }

end CatalyticTreeEval.Contracts.PrefixExtension
Source
Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, Section 3 machine model and Corollary 4.2.

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