Exact finite-configuration simulation of a first-machine step
ProvedCookPvsNP.comp_first_frame_stepcompositionturing-machines
Let be the published two-track composite of machines , with the fixed intermediate alphabet embeddings. Let place the source configuration on the first track and put a right sentinel immediately beyond its finite right list. For every nonhalting configuration of ,
Equality holds for the entire finite configuration, including the state, both finite tape lists, head symbol and boundary position. Thus it is stronger than equality only after projecting away administrative cells.
Preamble
import Definitions.Def_CookPvsNP_CompFrames
Formal statement
namespace CookPvsNP
theorem comp_first_frame_step {S Γ₁ Γ₂ : Type} [Fintype Γ₁] [Fintype Γ₂]
(j₁ : S ↪ Γ₁) (j₂ : S ↪ Γ₂) (M₁ : TM Γ₁) (M₂ : TM Γ₂)
(c : Cfg Γ₁ M₁.Q) (hn : ¬ M₁.IsHalting c) :
(compTM j₁ j₂ M₁ M₂).run 3 (compFirstCfg c) = compFirstCfg (M₁.step c) := 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.