Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite terminal configuration of the Cook composite cleanup

Definition
CookPvsNP_CompCleanup

by arexychen · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

compositionturing-machines

The cleanup mask retains symbols until the first blank and replaces the remaining cells with blanks. The terminal configuration erases the first track from the output, clears administrative markers, and retains explicit blank padding. These are definitions only; the exact machine run and its output preservation are proved separately.

Definition code
import Definitions.Def_CookPvsNP_CompSecondFrame

set_option autoImplicit false

namespace CookPvsNP

/-- Keep symbols up to the first blank; retain the original list length using blanks. -/
def compCleanTail {Γ : Type} : Bool → List (Option Γ) → List (Option Γ)
  | _, [] => []
  | ended, b :: rest => (if ended then none else b) :: compCleanTail (ended || b.isNone) rest

def CompCell.finalMarker {Γ₁ Γ₂ : Type} (b : Option Γ₂) : Option (CompCell Γ₁ Γ₂) :=
  some ⟨none, b, false, false, false, false, true⟩

/-- The entire finite configuration produced by the final cleanup phase. -/
def compCleanCfg {Γ₁ Γ₂ Q₁ Q₂ : Type} (c : CompSecondFrame Γ₁ Γ₂ Q₂) :
    Cfg (CompCell Γ₁ Γ₂) (CompQ Q₁ Q₂) where
  state := .haltAccept
  left := (CompSecondFrame.encode (Q₁ := Q₁) c).left
  head := CompCell.secondSymbol c.head.2
  right := (compCleanTail c.head.2.isNone (c.right.map Prod.snd)).map CompCell.secondSymbol ++
    List.replicate (c.padding + 1) none

end CookPvsNP
Source
New auxiliary result derived from Sneed's exact published Prove2Me definition CookPvsNP_comp_machine, id 9c26b5f3-2f9d-4c5d-9194-692cbc786b4a (2026-09-30), without changing its transitions. It supports the existing CookPvsNP.tm_compose_poly_witness for the scheduling-hardness mission. The underlying one-tape machine model is Cook, The P versus NP problem, Clay Mathematics Institute (2000), Appendix. This particular representation and its equations are new formalization lemmas, not numbered claims of that paper.

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