1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Need help with this proof about set relations

  1. Oct 20, 2011 #1
    1. I am triying to write a proof that states. Let R be a binary relation on a set A and let R^t be the transitive closure of R. Prove that for all x and y in A, xR^t y if and only if, there is a sequence of elements of A, say X1, X2,..., Xn, such that X= X1, X1RX2,... Xn-1RXn, and Xn = y.

    Im not very good with proofs and this one just has me stumped. Any help is appreciated


    1. The problem statement, all variables and given/known data



    2. Relevant equations



    3. The attempt at a solution
     
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?



Similar Discussions: Need help with this proof about set relations
  1. Cantor Set proof (Replies: 0)

Loading...