Show that the relation R consisting of all pairs(x,y) such that x and y are bit strings of length three or more that agree in their first three bits is an equivalence relation on the set of all bit strings of length three of more.

来源:学生作业帮助网 编辑:作业帮 时间:2024/11/06 04:20:33
Show that the relation R consisting of all pairs(x,y) such that x and y are bit strings of length three or more that agree in their first three bits is an equivalence relation on the set of all bit strings of length three of more.
xSOS@*{ԙL9pÌ_^0@fjRRZIe@F, Bڴøo|T#uCf{F VշX |ID! %Ueݐ.1' QG|LՐeQyID$(D744I"F^ H ߒ)kdu 5t"JkU;]HtQ{(%~v7'uV-xoN}zEX J J^-َqcچls l+vO#4u.dQg q{J Ι$C:8ߠ)y^݁R.2Ua/s@+7[P̳ԉ.u])ʚWu Fz

Show that the relation R consisting of all pairs(x,y) such that x and y are bit strings of length three or more that agree in their first three bits is an equivalence relation on the set of all bit strings of length three of more.
Show that the relation R consisting of all pairs(x,y) such that x and y are bit strings of length three or more that agree in their first three bits is an equivalence relation on the set of all bit strings of length three of more.

Show that the relation R consisting of all pairs(x,y) such that x and y are bit strings of length three or more that agree in their first three bits is an equivalence relation on the set of all bit strings of length three of more.
译文
证明由所有序偶(x,y)组成的关系R是全部长度等于3和大于3的字节串构成集合上的等价关系,其中x和y是长度等于3和大于3的字节串且它们前3个字节相同.
证明 显然关系具有自反性,对任意字节串x,它与它自身前3个字节相同.故R是自反的;如果x和y有关系R,则x和y的前3个字节相同,也即y和x的前3个字节相同,故R是对称的;如果x和y有关系R,y和z有关系R,则x和y的前3个字节相同,y和z的前3个字节相同,于是x和z的前3个字节也相同,故R是传递的,由A是自反的,对称的和传递的,则A是等价关系.

表明,与R组成的所有对(的x , y ) ,使得X和Y是位字符串的长度三个或更多,同意在其前3位是一个等价关系的一套所有位字符串的长度为3个多。
对不起哈......我还是个小学生,没那么厉害,我只会翻译......