Published June 1, 2026
| Version v3
Preprint
Open
Machine-Certified Formalization of Cook's Rule 110 Universality Theorem in Lean 4
Authors/Creators
Description
Matthew Cook proved that elementary cellular automaton Rule 110 is
computationally universal by embedding cyclic tag systems (CTS) into the
glider dynamics of Rule 110's periodic ether background . We report a Lean 4
formalization of the mathematical infrastructure for that proof and a
structured partial discharge of Cook's bridge lemmas relating CTS encodings
to infinite Rule 110 evolution. The library rule110-lean formalizes
infinite-tape semantics, ether stability, CTS evaluation, glider overlays,
and the Cook–Neary–Woods collision checklist; on this foundation we discharge
the far-field one-step simulation axiom (cook_cts_step_sim_ax, ) and a
substantial partial family of tape-bit readback lemmas for words of length L
7 with ossifier–leader support encoding, including existence of a decoder
matching Cook's global C1 shape on that family
(cook_c2_tape_bit_decoder_exists_upto7), and a complete C1 discharge for
arbitrary words at slots 20 (cook_c2_tape_bit_general, , zero sorry). Five
construction-collision kinds are certified by finite native_decide witnesses;
Stage 3 data-cone simulation is discharged for empty appendants and fully for
the length-6 benchmark CTS; four TMCompilesStep scaffolds anchor Stage 4
compilation, and CookFinTM2Compiles is proved for Mathlib's halting identity
machine (idComputer Bool, ). The top theorem
rule110_turing_universal_from_cook (CookUniversalityTop) is a zero-sorry Lean
theorem, contingent on five named Cook bridge axioms formalizing Cook's 4
collision analysis for general CTS configurations
(cook_cts_data_cones_origin_one_step_ax and four companions). Closing all
five will upgrade the conditional UGP incompleteness results in from
physics-bridge status to unconditional .
Files
cook_theorem_paper.pdf
Additional details
Related works
- Is part of
- Publication: 10.5281/zenodo.20168144 (DOI)
- References
- Book: 10.5281/zenodo.19431574 (DOI)