Garden of Eden
A Garden of Eden (briefly, GoE)for a cellular automatonon a group is a configuration
which is not in the image of the global function of .
In other words, a Garden of Eden is a global situationwhich can be started from, but never returned to.
The finitary counterpart of a GoE configurationis an orphan pattern:a pattern which cannot be obtainedby synchronous application of the local function .
Of course,any cellular automaton with an orphan patternalso has a GoE configuration.
Lemma 1 (Orphan pattern principle)
If a cellular automaton with finite set of states has a GoE configuration,then it also has an orphan pattern.
Proof.First, suppose that is countable.Letbe a cellular automaton with no orphan pattern.Let be a configuration:we will prove that there is some such that .
Letbe an enumeration of :put and let be defined asBy hypothesis, none of the ’s is an orphan,so there is a sequence
of configurationssatisfyingIt is easy to see thatBut if is finite,then is compact by Tychonoff’s theorem,so there exista a subsequenceand a configuration satisfyingSince is continuous in the product topology, .
Let now be arbitrary.Let be the subgroup generated by the neighborhood
index :since is finite, is countable.Let be a set of representatives of the left cosets
of in ,so that(Observe that we do not require that is normal in .)Call the cellular automaton on that has the same local description(set of states, neighborhood index, local function) as .Let be a Garden of Eden configuration for :then at least one of the configurationsmust be a Garden of Eden for .By the discussion above, must have an orphan pattern,which is also an orphan pattern for .