math.DS — Dynamical Systems
Contributed by Isaac kaimfa
Wolfram's Rule 30 Prize Problem 1 asks whether the centre column of Rule 30, started
from a single lit cell, is ever eventually periodic. We study the problem through a half-line
system driven by a periodic boundary signal. Combining a known local identity with the
standard reduction to finite seeds, Problem 1 follows from a single statement, the Echo
Lemma: no finite half-line configuration driven by a non-constant periodic boundary can
satisfy, at every lit boundary minute, the identity that Rule 30 forces on the neighbour of
the centre. Around this formulation we prove a collection of exact structural results: a
dependence-window lemma and a merging criterion for reconstructed columns,
triangularity and monotonicity of the finite-support constraints, a forced-creation identity
at boundary bounces, a description of the infinite survivors as a full shift for period two,
and, for the two-sided period-two problem, uniqueness of the compatible left half together
with exact forced identities near the centre, including a half-column that must vanish
identically. For the linear relative Rule 150 we prove the analogue of the Echo Lemma for
every odd period by a Frobenius self-similarity argument, and we identify exactly the two
steps that fail for Rule 30. We report exhaustive and SAT-certified computations excluding
counterexamples of bounded width, and we document a set of barriers: every exact
mechanism found is confined to a bounded neighbourhood of the centre, no additive
conserved quantity of small range exists, and the sideways reconstruction has a growing
number of distinguishable states. The Echo Lemma, and with it Problem 1, remains open;
the contribution of this article is a verified framework, labelled throughout as proved,
certified or open.
A mix of human-written and AI-generated textHuman understanding: all partsRule 150Rule 30SAT certificatescellular automatacentre columneventual periodicityleft-permutive rules