18.10.2014 Views

PDF - Computer Science - Brock University

PDF - Computer Science - Brock University

PDF - Computer Science - Brock University

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

where the last inclusion follows from Ξ; Θ ⊑ Θ as shown above using converse.<br />

Now, consider the following computation<br />

(Ξ ⊓ Θ); Ξ ⊑ Ξ; Ξ ⊓ Θ; Ξ<br />

⊑ Ξ ⊓ Θ,<br />

Ξ ⊓ Θ = Ξ; Ξ ⊓ Θ<br />

⊑ (Ξ ⊓ Θ; Ξ); Ξ<br />

⊑ (Ξ ⊓ Θ); Ξ,<br />

Ξ idempotent and see above<br />

Ξ idempotent<br />

Ξ symmetric<br />

see above<br />

which shows the additional equation (Ξ ⊓ Θ); Ξ = Ξ ⊓ Θ.<br />

⊓⊔<br />

Given a partial equivalence relation Ξ in Rel one can compute the set of all<br />

equivalence classes whenever Ξ is defined. This concept is called a splitting [10].<br />

Definition 4. Let Ξ ∈R[A, A] be a partial equivalence relation. An object B<br />

together with a relation ψ ∈R[B,A] is called a splitting of Ξ iff<br />

ψ; ψ ⌣ = I B , ψ ⌣ ; ψ = Ξ.<br />

A relation algebra has splittings iff for all partial equivalence relations a splitting<br />

exists.<br />

Notice that splittings are unique up to isomorphism. Furthermore, we may<br />

distinguish two special cases of splittings. If Ξ is also reflexive, i.e., an equivalence<br />

relation, the splitting corresponds to the construction of the set of equivalence<br />

classes. If Ξ ⊑ I A ,thenΞ corresponds to a subset of A. In this case the splitting<br />

becomes the subobject induced by Ξ.<br />

The last construction we want to introduce in this section is the abstract<br />

counterpart of a power set, called the relational power. The definition is based<br />

on the fact that every relation R : A → B in Rel can be transformed into a<br />

function f R : A →P(B) whereP(B) denotes the power set of B.<br />

Definition 5. Let R be a relation algebra. An object P(A), together with a<br />

relation ε A : A →P(A) is called a relational power of A iff<br />

syQ(ε A ,ε A ) ⊑ I P(A) and syQ(R, ε A ) is total<br />

for all relations R : B → A. R has relational powers iff the relational power for<br />

any object exists.<br />

Notice that in the case of the relation algebra Rel and a relation R : A → B<br />

the construction syQ(R ⌣ ,ε B ):A →P(B) is the function f R mentioned above.<br />

For technical reasons we follow [10] and call an object B a pre-power of<br />

A if there a relation T : A → B so that syQ(R, T ) is total for all relations<br />

R : C → A, i.e., a relational power is a pre-power with the additional requirement<br />

syQ(T,T) ⊑ I. IfR has splittings, then we obtain a relational power of A from<br />

a pre-power by splitting the equivalence relation syQ(T,T). This fact indicates<br />

once more that splittings are an important construction in the theory of relations.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!