Bounded second-phase simulation through the second source halt
ProvedCookPvsNP.comp_second_haltcompositionturing-machines
Suppose the second source machine halts by time from the projection of a decorated frame . There are and a decorated frame such that
Moreover, the length of the active right list in is at most its original length plus . The equality includes all administrative data. The length estimate supplies a linear bound for the following cleanup scan; it does not assume the old first-track data has been erased.
Preamble
import Definitions.Def_CookPvsNP_CompSecondFrame
Formal statement
namespace CookPvsNP
theorem comp_second_halt {S Γ₁ Γ₂ : Type} [Fintype Γ₁] [Fintype Γ₂]
(j₁ : S ↪ Γ₁) (j₂ : S ↪ Γ₂) (M₁ : TM Γ₁) (M₂ : TM Γ₂)
(c : CompSecondFrame Γ₁ Γ₂ M₂.Q) (n : ℕ)
(hn : M₂.IsHalting (M₂.run n c.source)) :
∃ m ≤ n, ∃ d : CompSecondFrame Γ₁ Γ₂ M₂.Q,
(compTM j₁ j₂ M₁ M₂).run (3 * m) c.encode = d.encode ∧
d.source = M₂.run n c.source ∧ d.right.length ≤ c.right.length + n := 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.