请输入您要查询的字词:

 

单词 Preinjectivity
释义

pre-injectivity


Let X=iIXi be a Cartesian product.Call two elements x,yX almost equalif the set Δ(x,y)={iIxiyi} is finite.A function f:XX is said to be pre-injectiveif it sends distinct almost equal elements into distinct elements,i.e., if 0<|Δ(x,y)|< implies f(x)f(y).

If X 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 compositionMathworldPlanetmath of pre-injective functionsis itself pre-injective.

A cellular automatonMathworldPlanetmath is said to be pre-injective if its global function is.As cellular automata send almost equal configurationsMathworldPlanetmathPlanetmathinto 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 E of G,two patternsp1,p2:EQare mutually erasable (briefly, m.e.)for a cellular automaton𝒜=Q,𝒩,fon Gif for any two configurationsc1,c2:GQsuch thatci|E=piandc1|GE=c2|GEone has F𝒜(c1)=F𝒜(c2).

Lemma 1

For a cellular automatonA=Q,N,f,the following are equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath.

  1. 1.

    𝒜 has no mutually erasable patterns.

  2. 2.

    𝒜 is pre-injective.

Proof.It is immediate that the negationMathworldPlanetmath of point 1implies the negation of point 2.So letc1,c2:GQbe two distinct almost equal configurations such thatF𝒜(c1)=F𝒜(c2):it is not restrictive to suppose that𝒩 is symmetricPlanetmathPlanetmath(i.e., if x𝒩 then x-1𝒩)and e, the identity elementMathworldPlanetmath of G, belongs to 𝒩.Let Δ be a finite subset of G such thatc1|GΔ=c2|GΔ,and let

E=Δ𝒩2={gGzΔ,u,v𝒩g=zuv}:(1)

we shall prove thatp1=c1|Eandp2=c2|Eare mutually erasable.(They surely are distinct, since ΔE.)

So let γ1,γ2:GQ satisfyγi|E=piandγ2|GE=pi=γ2|GE.Let zG.If zΔ𝒩,then F𝒜(γ1)(z)=F𝒜(γ2)(z),because by constructionγi|z𝒩=ci|z𝒩;ifzGΔ𝒩,then F𝒜(γ1)(z)=F𝒜(γ2)(z) as well,because by constructionγ1|z𝒩=γ2|z𝒩.Since γ1 and γ2 are arbitrary,p1 and p2 are mutually erasable.

References

  • 1 Ceccherini-Silberstein, T. and Coornaert, M. (2010)Cellular Automata and Groups.Springer Verlag.
  • 2
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 23:20:09