Idempotence criteria for lazy cellular automata

A lazy cellular automaton $\tau :A^G\to A^G$ is determined by a finite neighborhood $S\subseteq G$ containing the group identity, a pattern $p\in A^S$, and a writing symbol $a\in A\setminus \{p(e)\}$: its local rule changes the central symbol to $a$ precisely when the neighborhood pattern equals $p$. For a nonempty set $T$ of positions where $p$ takes the value $a$, we introduce two compatibility conditions on $p$ along the right translates $St$, $t\in T$. We show that the existence of a compatible set is necessary for $\tau$ to be non-idempotent over every group, and that it is also sufficient whenever every position where $p$ takes the value $a$ commutes with every position where $p$ takes the value $p(e)$. In particular, compatibility characterizes non-idempotence over abelian groups, replacing a search over patterns on $SS=\{st:s,t\in S\}$ by a search over sets of positions where $p$ takes the value $a$. Finally, for every dihedral group $D_n$ with $n\ge 4$, we construct an idempotent lazy cellular automaton that admits a compatible set, showing that the commutation hypothesis cannot simply be dropped.