A Note on Quasi-Partitions

Jan van Eijck

March 18, 1998

Abstract
A quasi-partition of X is a family of non-empty subsets of X such that
every element of X is in at least one member of the family and each mem-
ber of the family has a non-empty kernel. Just as partitions correspond
to equivalence relations, quasi-partitions correspond to quasi-equivalence
relations.

1 Denitions
A quasi-partition on a non-empty set X is a family C of subsets of X satisfying
the following:
1. If 2 C then 6= ;.
V V

2. [C = .X

3. For every 2 C , ( ) 6= ;, where : C ! P ( ) is given by

V k V k X

( ) = f 2 j 8 2 C ( 6= ! 2 )g
k V x V W W V x = W :

Call ( ) the kernel of .

k V V

A binary relation R on X is called serial if 8x9yxRy. R is called quasi-

symmetric if 8x8y8z ((xRy ^ yRz )) ! zRy).
Call a binary relation R on X that is transitive, serial and quasi-symmetric a
quasi-equivalence on X .
Quasi-partitions arise in the context of graph clustering. See Van Dongen [1].

2 Connections
X
S
A quasi-partition on satisfying the extra condition that V 2C ( ) = is a k V X

partition. Partitions and equivalence relations are two sides of the same coin.
Below we show that the same holds for quasi-partitions and quasi-equivalences.
Call a binary relation on quasi-re exive if 8 8 (
R X ! ).
x y xRy yRy

1
Theorem 1 Every quasi-equivalence is quasi-re exive.
Proof. Suppose is a quasi-equivalence on . Assume . Then by
R X xRy

seriality of there is a with

R . By quasi-symmetry of we get from
z yRz R xRy

and yRz that . Finally, by transitivity of we get from

zRy and that R yRz zRy

yRy . a
Theorem 2 Every quasi-equivalence on X determines a quasi-partition of X .

Proof. Let be given. Dene a family C of subsets of as follows:

R X

[
C = ff 2 j g j g z X zRy xRy :

2
x X

We show that C satises the conditions for a quasi-partition.

1. To show that the elements of C are non-empty, take a 2 C . Then
V V

V =f 2 j
z X g for some with . Because of the quasi-re exivity of
zRy x; y xRy

R , yRy . Therefore 2 and 6= ;. y V V

2. Take 2 . Then by the seriality of , there is a 2 with

x X . So
R y X xRy

x 2 f 2 j g, i.e., there is a 2 C with 2 .

z X zRy V x V

3. Take 2 C . Then = f 2 j
V g for some with . We show
V z X zRy x; y xRy

that 2 ( ). For that, it suces to show the following: if 2 2 C , then

y k V y W

W = . V

Assume 2 2 C . Then has the form f 2 j

y W W g, for some 2 . u X uRw w X

We show that = . V W

Assume 2 . Then
a W . From 2 we get that
aRx . From
y W and yRw xRy

yRw by quasi-symmetry of , . From Rand wRy by transitivity of :

aRw wRy R

aRy , and we have established that 2 . a V

Assume 2 . Then
a V . We also have
aRy , so transitivity of gives yRw , R aRw

and therefore 2 . a W a
Theorem 3 Every quasi-partition of X determines a quasi-equivalence on X .

Proof. Let a quasi-partition C of be given. Dene a binary relation

X R

on by means of
X : 9 2 C ( 2 ^ 2 ( )). We show that is a
xRy V x V y k V R

quasi-equivalence.
1. is serial: take 2 . Because [C = there is a 2 C with 2 .
R x X X V x V V

has a non-empty kernel, so there is a 2 with 2 ( ). Thus, there is a y V y k V

y 2 with .
X xRy

2. is transitive: take
R 2 with , . Then from : there is a
x; y; z X xRy yRz xRy

V 2 C with 2 2 ( ). From : there is a 2 C with 2

x V; y k V yRz2 ( ). W y W; z k W

From the fact that 2 ( ) it follows that = , so 2 ( ), and therefore

y k V V W z k V

xRz .
3. is quasi-symmetric: take
R 2 with , . Then from :
x; y; z X xRy yRz xRy

there is a 2 C with 2
V 2 ( ). From : there is a 2 C with
x V; y k V yRz W

2
y 2 W; z 2 ( ). Again, from 2 ( ) it follows that = , and therefore
k W y k V V W

z 2 W; y 2 ( ), i.e., .
k W zRy a
There is a well-known connection between equivalences and surjective mappings:
a surjection : ! can be viewed as an indexed partition of , for each
f X I X

index 2 determines a member i = 1 [f g] of the partition.

i I V f i

Can we get something similar for quasi-equivalences? Yes, we can. Instead of in-
dex functions in ! we consider mappings : ! (P ( ) ;). The require-
X I f X I

ment of surjectivity is replaced by the weaker requirement of quasi-surjectivity:

ff g j 2 g  rng ( ) i i I f :

Note that a surjective map in ! can be viewed as a function : ! X I f X

(P ( ) ;) with ff g j 2 g = rng ( ).
I i i I f

If 2 , we use Fi for the set f  j 2 g. Fi is the lter contained in P

i I J I i J I

generated by atom f g. i

Theorem 4 If : ! (P ( ) ;) is quasi-surjective, then f

f X I f
1 [Fi ] j 2 g is
i I

a quasi-partition of X .

Proof. 1. Assume 2 . Then ( )  , ( ) 6= ;. Take any 2 ( ).

x X f x I f x i f x

Then ( ) 2 Fi so 2 1 [Fi ].
f x x f

2. [ 1 [
f [Fi ]g = 1 [ Fi ] = 1 [P ( ) ;] =
f f f I X:

2
i I 2
i I

3. Take 2 1[Fi ]. Then 1 [ff gg] 6= ; because f g 2 rng ( ). Take

x f f i i f

y 2 1 [ff gg]. For all 6= , f g 2 Fj , so for all 6= , 2 1[Fj ]. This shows

f i j i i = j i y = f

that 1[ff gg] = ( 1 [Fi ]).

f i k f a
It is clear that the relation corresponding to the quasi-partition of theorem 4
R

is given by:
: 9 ( 2 1 [Fi ] ^ 2 1 [ff gg])
xRy i x f y f i :

Theorem 5 Every quasi-partition C of X has a quasi-surjective indexing.

Proof. Let be C itself, and dene : ! (P (C ) ;) by means of
I f X

( ) := f 2 C j 2 g. Then is quasi-surjective, because every 2 C has

f x V x V f V

a non-empty kernel ( ). k V a
Indexings for quasi-partitions on give rise to binary relations on , as
f X X

follows. Dene by means of : ( )  ( ). Then \ 1 is an

S xS y f x f y S S

equivalence relation that connects the elements of that are in the same quasi- X

parts of . X

Moreover, is transitive, re exive, and satises the following requirement of

S

tail symmetry :
8 9 ( ^ 8 ( ! )) x y xS y z yS z zS y :

We brie y explore the connection with quasi-equivalences.

3
Theorem 6 If is a transitive, re exive, and tail-symmetric binary relation
S

on then given by
X R : ^ 8 ( ! ) is a quasi-equivalence on
xRy xS y z yS z zS y

X .
Proof. Seriality and quasi-symmetry of follow immediately from the
R

tail-symmetry of , transitivity of follows from the transitivity of .

S R a S

Theorem 7 If is a quasi-equivalence on , then given by

R X S xS y : 8 (z yRz !
xRz ) is a transitive, re exive and tail-symmetric relation on . X

Proof. 1. is transitive. Assume

S and . Then 8 (
xS y !
yS z ), w yRw xRw

and 8 ( ! ). By transitivity of it follows from this that 8 ( !

w zRw yRw R w zRw

xRw ), i.e., .xS z

2. is re exive. We have for every 2 that 8 (

S x X ! ), i.e., .
z xRz xRz xS x

3. is tail-symmetric. Let 2 . We have to nd 2 with

S x X and
y X xS y

8 ( ! )). By seriality of , there is a with . Let 2 be such

z yS z zS y R y xRy z X

that . Then by transitivity of ,

yRz . This shows
R xRz . xS y

Next, let 2 be such that

z X . By denition of , this means that
yS z S

8 (
w zRw ! ). We will show that
yRw , i.e., that 8 (
zS y ! ). Sup- v yRv zRv

pose therefore that . We are done if we establish that

yRv . zRv

By seriality of , there is a 2 with

R w X. By ,
zRw and the denition
zRw yS z

of , we get
S . From
yRw and xRy , by quasi-symmetry of , we get
yRw . R wRy

From and
zRw , by transitivity of , we get
wRy R . From and
zRy , zRy yRv

again by transitivity of , we get R . zRv a

References
[1] Stijn van Dongen. A new cluster algorithm for graphs. Technical report,
CWI, 1998.