Let U be a set with \(| U| \geq 2\), \(n\geq 1\) and \(m=U^ n\times U^ n\), \(m_{ij}=\{<(x_ 0,...,x_{n-1})\), \((y_ 0,...,y_{n- 1})>\in m|\) \(x_ i=y_ j\}\) for \(0\leq i,j<n\). Define m(n) as the algebra of binary relations on \(U^ n\), generated by m and the \(m_{ij}\), \(0\leq i,j<n\), which is closed under composition, converse \({}^*\) and intersection \(\wedge\). m(n) is axiomatically described as a modular semilattice pseudogroup M(n) which is freely generated by generators M, \(M_{ij}\), \(0\leq i,j<n\), satisfying the relations \(M_{ij}\leq M=M^*=MM\), \((M_{ij})^*=M_{ji}\), \(M_{ij}M_{jk}=M_{ik}\), \(M=M_{ii}C_ i\), where \(C_ i=\bigwedge <M_{jj}|\) \(i\neq j<n\}\) if \(n>1\) and \(C_ 0=M\) for \(n=1\). The main result, that M(n) is congruence free, is used to show that M(n) and m(n) are isomorphic.
This page was built for publication: Algebras of diagonal relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922573)
