Exact finite-configuration simulation of a second-machine step
ProvedCookPvsNP.comp_second_frame_stepcompositionturing-machines
Let be a decorated second-phase configuration, its source-machine projection, its composite-machine encoding, and the administrative frame update. Then
If the projected configuration is nonhalting, the existing composite machine satisfies
This includes both boundary-extension cases, arbitrary old first-track data, and any explicit blank padding beyond the right marker.
Preamble
import Definitions.Def_CookPvsNP_CompSecondFrame
Formal statement
namespace CookPvsNP
theorem comp_second_frame_step {S Γ₁ Γ₂ : Type} [Fintype Γ₁] [Fintype Γ₂]
(j₁ : S ↪ Γ₁) (j₂ : S ↪ Γ₂) (M₁ : TM Γ₁) (M₂ : TM Γ₂)
(c : CompSecondFrame Γ₁ Γ₂ M₂.Q) :
(c.step M₂).source = M₂.step c.source ∧
(¬ M₂.IsHalting c.source →
(compTM j₁ j₂ M₁ M₂).run 3 c.encode = (c.step M₂).encode) := by sorry
end CookPvsNPSource
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.