Cardinal arithmetic of general relational systems

From MaRDI portal





If \(F\), \(I\) are sets and \(R\) is a set of mappings of \(I\) into \(F\) then the pair \(\mathbb{F}= (F,R)\) is called a relational system with domain \(I\). Two relational systems with domains \(I\), \(J\) are of the same type if \(I\), \(J\) have the same cardinality. If \(\mathbb{F}= (F,R)\), \(\mathbb{G}= (G,S)\) with domains \(I\), \(J\) resp. are of the same type and \(\alpha: I\to J\) is bijection, then a homomorphism of \(\mathbb{F}\) into \(\mathbb{G}\) with regard to \(\alpha\) is such a mapping \(\varphi: F\to G\) that \(f\in R\Rightarrow \varphi\circ f\circ \alpha^{-1}\in S\). Isomorphism is defined in the obvious way. The classical cardinal operations are generalized to such relational systems. Let \(\mathbb{F}= (F,R)\), \(\mathbb{G}= (G,S)\) with domains \(I\), \(J\) resp. be relational systems of the same type and let \(\alpha: I\to J\) be a bijection. The cardinal sum \(\mathbb{F}\overset\alpha +\mathbb{G}\) with regard to \(\alpha\) (under the assumption \(F\cap G=\emptyset\)) is the relational system \((H,T)\) with domain \(\alpha\) where \(H= F\cup G\) and \(h\in T\Leftrightarrow\) there exists \(f\in R\) such that \(h(x,y)= f(x)\) for all \((x,y)\in \alpha\) or there exists \(g\in S\) such that \(h(x,y)= g(y)\) for all \((x,y)\in \alpha\). The cardinal product \(\mathbb{F}\overset\alpha\cdot\mathbb{G}\) with regard to \(\alpha\) is the relational system \((H,T)\) with domain \(\alpha\) where \(H= F\times G\) and \(h\in T\Leftrightarrow\) there exist \(f\in R\) and \(g\in S\) such that \(h(x,y)= (f(x),g(y))\) for all \((x,y)\in \alpha\). The cardinal power \(\mathbb{F}\overset\alpha\Delta \mathbb{G}\) with regard to \(\alpha\) is the relational system \((H,T)\) with domain \(\alpha\) where \(H\) is the set of all homomorphisms of \(\mathbb{G}\) into \(\mathbb{F}\) with regard to \(\alpha^{-1}\) and \(h\in T\Leftrightarrow{^ t h}\in R\) for all \(t\in G\); here \(^ th\) is the mapping of \(I\) into \(F\) defined by \(^ t h(x)= h(x,\alpha(x))(t)\). The author proves the expected properties for these operations. For the cardinal power, he derives conditions under which the exponential law \(\mathbb{F}\overset\gamma \Delta(\mathbb{G}\overset\beta\cdot \mathbb{H})\approx (\mathbb{F}\overset\alpha \Delta\mathbb{G})\overset\delta \Delta\mathbb{H}\) holds; here \(\mathbb{F}\), \(\mathbb{G}\), \(\mathbb{H}\) have domains \(I\), \(J\), \(K\) resp., \(\alpha: I\to J\), \(\beta: J\to K\) are bijections and \(\gamma: I\to \beta\), \(\delta: \alpha\to K\) are bijections given by \(\gamma(x)= (\alpha(x),\beta(\alpha(x))\), \(\delta(x,y)= \beta(y)\). The conditions are that \(\mathbb{G}\), \(\mathbb{H}\) are reflexive and \(\mathbb{F}\) is diagonal.











This page was built for publication: Cardinal arithmetic of general relational systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277390)