Exhaustive finite calculation: bijectivity on cycles 1 through 4 leaves exactly six rules.
ProvedReversibleElementary.reversible_small_cycles_iffaether-catalognovelty
Exhaustive finite calculation: bijectivity on cycles 1 through 4 leaves exactly six rules.
theorem ReversibleElementary.reversible_small_cycles_iff(w : Fin 256) :
(ReversibleOn 1 w ∧ ReversibleOn 2 w ∧ ReversibleOn 3 w ∧ ReversibleOn 4 w) ↔
w ∈ ([15, 51, 85, 170, 204, 240] : List (Fin 256)) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/ReversibleElementary.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Novelty/ReversibleElementary.lean import Mathlib import Definitions.Def_Novelty_ReversibleElementary /-! # Reversible elementary cellular automata This file gives a finite, machine-checked correction to the proposed “local-rule permutation” picture. An elementary local rule has type `Bool³ → Bool`, so it is not a permutation of the eight neighborhoods. Reversibility concerns the induced global map on configurations. We prove a chain of structural results for the six projection/complement rules, then exhaustively classify the rules which are bijective on cyclic configurations of sizes 1 through 4. The finite test leaves exactly Wolfram rules 15, 51, 85, 170, 204, and 240. Since each of these six is proved reversible on every nonempty finite cycle, the test also gives a certified obstruction of period at most four for every other elementary rule. -/ open ReversibleElementary
Formal statement
theorem ReversibleElementary.reversible_small_cycles_iff(w : Fin 256) :
(ReversibleOn 1 w ∧ ReversibleOn 2 w ∧ ReversibleOn 3 w ∧ ReversibleOn 4 w) ↔
w ∈ ([15, 51, 85, 170, 204, 240] : List (Fin 256)) := by sorrySource