Characterizing finite irreducible relational sets
A representation of a relational set and the irreducibility of such a system are defined similarly to the corresponding notions for partially ordered sets. One calls a relational set \(P\) strongly irreducible in a class \(K\) of relational sets of the same type if the fact that \(P\) is a retract of \(Q \times R\) implies \(P\) is a retract of \(Q\) or \(R\) for all relational sets \(Q\) and \(R\) of \(K\). \(P\) is called a relational set for an algebra \(A\) if \(P\) and \(A\) have the same base sets and each finitary term operation of \(A\) is a morphism (relation preserving map) from the suitable power of \(P\) into \(P\). The following results are proved: Let \(P\) be a finite relational set for a finite algebra \(A\) and let \(F_1\) denote the subalgebra generated by \(1_A\) in the algebra \(A^A\). Then the following are equivalent. 1. \(P\) is irreducible. 2. The non-onto unary term operations of \(A\) form a subuniverse of \(F_1\). 3. For all \(n\)-ary idempotent term operation \(h\), \(n\)-ary term operation \(t\) and unary term operations \(t_1, \ldots, t_n\) of \(A\), the equation \(h(x_1, \ldots, x_n) = t(t_1(x_1), \ldots, t_n(x_n))\) implies the existence of an \(i \in \{ 1, \ldots, n \}\) such that \(t_i\) is surjective. 4. The lattice \(\text{Sub}(F_1) \setminus \{ F_1 \}\) has a largest element. A finite relational set \(P\) is irreducible if all idempotent morphisms from finite powers of \(P\) into \(P\) are projections. Let a relational set \(P\) be a retract of the product \(Q \times R\) of the relational sets \(Q\) and \(R\) and assume there are morphisms from \(Q\) and \(R\) to \(P\). If the only idempotent morphisms from \(P^2\) to \(P\) are projections, then \(P\) is a retract of \(Q\) or \(R\). If \(K\) is a class of relational sets such that there is a morphism between each pair of members of \(K\) and if all idempotent morphisms from finite powers of \(P \in K\) to \(P\) are projections, then \(P\) is strongly irreducible in \(K\). The paper concludes with three examples.
This page was built for publication: Characterizing finite irreducible relational sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258689)