hello everyone,

I have a problem with this question, I hope someone can help me out:

prove that a relations R over the set A is transitive if and only if for all n>=2 R contains R^n.

thanks !!

Printable View

- Apr 21st 2006, 11:52 AMWeeGRelations - Set Theory
hello everyone,

I have a problem with this question, I hope someone can help me out:

prove that a relations R over the set A is transitive if and only if for all n>=2 R contains R^n.

thanks !! - Apr 22nd 2006, 07:56 AMRebesquesQuote:

contains R^n.

- Apr 22nd 2006, 09:44 AMWeeGQuote:

Originally Posted by**WeeG**

I have no data except for that, it's a hard question....

:confused: - Apr 22nd 2006, 11:56 AMrgep
If is a relation between sets and : that is, , and similarly is a relation between and , then the composition is the relation between and given by .

If is a relation between and itself, then it makes sense to define as and more generally . Of course it turns out that composition is associative so that all the possible ways of defining are the same. - Apr 22nd 2006, 11:07 PMWeeG
thanks a lot !!!!

I am impressed !!

:)

thanks ! - Apr 23rd 2006, 07:19 PMRebesques
That's the rgep we know... :)

Alright Weeg, can you tackle it now?