pre-injectivity
Let be a Cartesian product.Call two elements almost equalif the set is finite.A function is said to be pre-injectiveif it sends distinct almost equal elements into distinct elements,i.e., if implies .
If is finite, pre-injectivity is the same as injectivity;in general, the latter implies the former, but not the other way around.Moreover, it is not true in generalthat a composition![]()
of pre-injective functionsis itself pre-injective.
A cellular automaton![]()
is said to be pre-injective if its global function is.As cellular automata send almost equal configurations
![]()
into almost equal configurations,the composition of two pre-injective cellular automata is pre-injective.
Pre-injectivity of cellular automata can be characterizedvia mutually erasable patterns.Given a finite subset of ,two patternsare mutually erasable (briefly, m.e.)for a cellular automatonon if for any two configurationssuch thatandone has .
Lemma 1
For a cellular automatonthe following are equivalent![]()
.
- 1.
has no mutually erasable patterns.
- 2.
is pre-injective.
Proof.It is immediate that the negation![]()
of point 1implies the negation of point 2.So letbe two distinct almost equal configurations such thatit is not restrictive to suppose that is symmetric
(i.e., if then )and , the identity element
![]()
of , belongs to .Let be a finite subset of such thatand let
| (1) |
we shall prove thatandare mutually erasable.(They surely are distinct, since .)
So let satisfyandLet .If ,then ,because by constructionifthen as well,because by constructionSince and are arbitrary, and are mutually erasable.
References
- 1 Ceccherini-Silberstein, T. and Coornaert, M. (2010)Cellular Automata and Groups.Springer Verlag.
- 2