Bounded first-phase simulation through the first source halt
ProvedCookPvsNP.comp_first_haltcompositionturing-machines
Suppose has halted after at most steps from configuration . Let be the published composite machine and its exact first-phase representation. There is an integer such that
The simulated phase stops when the first source machine first halts. Its resulting configuration is exactly the one obtained at the declared source deadline, because later source steps fix a halting configuration. The composite machine has not yet entered its conversion phase.
Preamble
import Definitions.Def_CookPvsNP_CompFrames
Formal statement
namespace CookPvsNP
theorem comp_first_halt {S Γ₁ Γ₂ : Type} [Fintype Γ₁] [Fintype Γ₂]
(j₁ : S ↪ Γ₁) (j₂ : S ↪ Γ₂) (M₁ : TM Γ₁) (M₂ : TM Γ₂)
(c : Cfg Γ₁ M₁.Q) (n : ℕ) (hn : M₁.IsHalting (M₁.run n c)) :
∃ m ≤ n, (compTM j₁ j₂ M₁ M₂).run (3 * m) (compFirstCfg c) =
compFirstCfg (M₁.run n 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.