Next: Ordering
Up: Relations
Previous: Relations
Definition 32
A relation from

to

is a subset

. In the case where

we call this a relation on

.
We often use infix notation for relations, writing
for
.
Definition 33
Relations can be composed using convolution: if

and

then
Definition 34
If

is a function then the graph of

is the relation

.
Proposition 55
(2 Points )
Definition 35
The identity relation on

is the diagonal set

. Note that this is also the graph of the identity function.
Definition 36
If

is a relation from

to

, then

is the relation from

to

given by

.
Definition 37
A relation

on

is reflexive iff the identity relation is contained in

.
Definition 38
A relation

on

is symmetric if whenever

, then

.
Definition 39
A relation

on

is antisymmetric if whenever

and

, then

.
Definition 40
A relation is transitive if whenever

and

, then

.
Definition 41
A relation

on

is total if whenever for every

either

or

.
Theorem 56
The properties antisymmetric, transitive,
and total are independent: there are relations which satisfy all
properties but one, and any of the properties can be the one which
fails.
(6 Points )
Proposition 57
For any relation

on

there is a smallest relation

with

such that

is reflexive.
(3 Points )
Proposition 58
The intersection of any family of symmetric relations is symmetric
(3 Points )
Corollary 59
For any relation

on

there is a smallest relation

with

such that

is symmetric.
(3 Points )
Proposition 60
The intersection of any family of transitive relations is transitive.
(3 Points )
Corollary 61
For any relation

on

there is a smallest relation

with

such that

is transitive.
(3 Points )
Next: Ordering
Up: Relations
Previous: Relations
Larry Stout
2001-08-17