Cook–Levin machines: uniform cell-symbol clause body
ProvedCookLevin.machine_emit_cell_clause_bodycomplexitycook-levinloopsturing-machines
For a fixed symbol bound, one well-formed Turing machine emits every exactly-one-symbol clause for a cell at time t, tape j and position p. The counter holds the negative blank-literal number and advances by eight times the symbol bound. It appends the actual encoded clause block without its final formula terminator in A*a+B steps. Input and spectator tapes are preserved. The zero-symbol case is included.
Preamble
import Definitions.Def_CookLevin_Tableau import Definitions.Def_CookLevin_Complexity open CookLevin set_option autoImplicit false
Formal statement
theorem CookLevin.machine_emit_cell_clause_body {k G : Nat} (hk : 3 ≤ k) (hG : 4 ≤ G)
(symbols : Nat) :
∃ R : Machine, ∃ A B : Nat, TuringMachine k G R ∧
∀ (sh : Shape) (t j p : Nat) (input : Tape) (bits : List Bool) (saved : List Tape),
sh.G = symbols → saved.length + 3 = k →
let a := literalN (.Neg (sh.cellVar t j p blankSymbol))
let chunk :=
(encodeFormula (exactlyOneOf (List.range sh.G) (sh.cellVar t j p))).dropLast
Transforms R
(input :: (contents (boolsToSymbols (List.replicate a true)), 1 + a) ::
(contents (boolsToSymbols bits), 1 + bits.length) :: saved)
(A * a + B)
(input ::
(contents (boolsToSymbols (List.replicate (a + 8 * symbols) true)),
1 + (a + 8 * symbols)) ::
(contents (boolsToSymbols (bits ++ chunk)), 1 + (bits ++ chunk).length) ::
saved) := by sorrySource
Compile a finite formula of unary literal offsets, identify it with the per-cell exactly-one-symbol constraints using injectivity in the symbol index, and compose the fixed common-offset increment.