Exact packing and symbol translation for the concrete Cook composite machine
ProvedCookPvsNP.comp_cell_lawscompositionencodingturing-machines
A cell of the existing concrete composite Cook machine stores two tape tracks and five marker bits. Packing represents the wholly blank cell by the external blank symbol and every other cell by a nonblank tape symbol. Unpacking is a left inverse of packing, and therefore packing is injective. In addition, for embeddings and , the intermediate symbol translator satisfies
These are elementary interface laws for the published two-track composition construction. They do not assert correctness of a complete simulation or any time bound. No right-inverse law for unpacking is claimed: an explicitly stored blank cell and the external blank can have the same unpacked value.
Preamble
import Definitions.Def_CookPvsNP_comp_machine
Formal statement
namespace CookPvsNP
theorem comp_cell_laws {Sym Γ₁ Γ₂ : Type} (ι₁ : Sym ↪ Γ₁) (ι₂ : Sym ↪ Γ₂) :
(∀ c : CompCell Γ₁ Γ₂, CompCell.unpack (CompCell.pack c) = c) ∧
Function.Injective (@CompCell.pack Γ₁ Γ₂) ∧
(∀ x : Sym, translateCell ι₁ ι₂ (ι₁ x) = some (ι₂ x)) := by sorry
end CookPvsNPSource
New elementary auxiliary laws for the existing Prove2Me definition CookPvsNP_comp_machine, id 9c26b5f3-2f9d-4c5d-9194-692cbc786b4a, published 2026-09-30. These laws are derived from its exact definitions without alteration and support the open CookPvsNP.tm_compose_poly_witness needed by the resource-scheduling hardness mission. The machine construction cites Cook, The P versus NP problem, Clay Mathematics Institute (2000), Definition 3.