Extensions of Boolean isometries (Q2566136): Difference between revisions

Let \(B\) be a Boolean algebra. A Boolean function is a map \(f:B^n\to B\) built up from variables and constants by compositions of the basic operations \(\vee\), \(\wedge\), \('\) of \(B\). A Boolean transformation is a map \(F:B^n\to B^m\) of the form \(F({\mathbf x})=(f_1({\mathbf x}),\dots,f_m({\mathbf x}))\) for some Boolean functions \(f_i:B^n\to B\;(i=1,\dots,n)\). A Boolean domain is a subset \(V\subseteq B^n\) of the form \(V=\{{\mathbf x}\in B^n\mid f({\mathbf x})=0\}\), where \(f\) is a Boolean function. An isomorphism between two Boolean domains is a bijective Boolean transformation. A Boolean metric space, or a metric space for short, is a set \(X\) endowed with a symmetric function \(d:X^2\to B\) satisfying \(d(x,y)\leq d(x,z)\vee d(z,y)\) and \(d(x,y)=0\) iff \(x=y\). A map \(f:X\to Y\) between two metric spaces is said to be contractive (an isometry) if \(d(f(x_1),f(x_2))\leq d(x_1,x_2)\) (if it is a bijection and satisfies the previous inequality as an equality). A metric space can be embedded into a module over the ring \(B\), which allows for the introduction of the concepts of convex linear combination and CFG-space, which is a finitely generated convex metric space. Every Boolean domain is a CFG-space with respect to the distance \(d({\mathbf x},{\mathbf y})=\bigvee_{i=1}^n(x_i+y_i)\), where + denotes the ring sum, and in fact every CFG-space is isometric to a Boolean domain. Theorem 1 (Theorem 2). Let \(U,V,W\subset B^n\) be Boolean domains (CFG-spaces) with \(U,V\subset W\) and suppose \(F:U\to V\) is a Boolean isomorphism (an isometry). Then \(F\) is the restriction of a Boolean isomorphism (isometry) \(F':W\to W\). Theorem 3 (Theorem 4). Suppose the Boolean algebra \(B\) is complete. Let \(W\) be a CFG-space and \(U,V\) subsets of \(W\). Suppose \(F:U\to V\) is an isometry (a contractive map). Then \(F\) is the restriction of an isometry (a contractive map) \(F':W\to W\).