By considering each element of R,determine the relation R' on X with the smallest number of elements satisfying;

(i)R proper subset R'

(ii)R' is symmetric

Printable View

- August 9th 2006, 07:23 AMkodirlcan sum1 pls show me an example of this...
By considering each element of R,determine the relation R' on X with the smallest number of elements satisfying;

(i)R proper subset R'

(ii)R' is symmetric - August 9th 2006, 11:56 AMThePerfectHackerQuote:

(i)R proper subset R'

Cuz, otherwise you have this problem.

---

Let X be a finite set. Then R can have at most elements where |X|=n. So you are saying that given any Relation R on X then you can find another relation R' on X that contains R which means that |R'|>|R|. But since R' is a relation on X there exists (according to your hypothesis) another set R'' that containts R' thus, |R''|>|R'|. But then you can use this argument again and again until your relation on X that has cardinality greater than , which is impossible.