Is R Transitive if R^2 is a Subset of R?

  • Thread starter Thread starter 4Fun
  • Start date Start date
  • Tags Tags
    Proofs Relations
4Fun
Messages
10
Reaction score
0
I'm currently reading the section on relations in Velleman's "How to prove it" and I have found a statement somewhere that I want to prove, but I'm not sure whether what I have come up with is reasonable and I also have some questions on the logic used in these type of proofs.

The theorem is: Let R be a relation on set A. Then it holds that:
R^2 \subseteq R <=> R is transitive <=> R^i \subseteq R ,\forall i \geq 1

I'll start with R^2 \subseteq R <=> R is transitive:

=> Assume that R^2 \subseteq R. R^2 means that for an arbitrary ordered pair (x, z)\inA there is a y\inA such that xRy and yRz. The goal is to show that R is transitive, which is basically a conditional statement. If xRy and yRz hold, then we can infer that xRz. Therefore I can assume xRy and yRz, and now should prove that xRz.But because R^2\subseteqR, I know that xRy and yRz is true for an arbitrary (x, z)\inA. It follows that (x, z)\inR.

<= Assume that R is transitive. Therefore if for any (x, z)\inA it is true that there is a y\inA such that xRy and yRz, I know that xRz. Now since R^2\subseteqR is also a conditional statement of the form \forall(x,y)\niAxA((x,y)\niR^2 then (x,y)\niR, I can assume that there is an ordered pair, call it (x,z)\niR^2. Since we assumed that R is transitive, it follows by modus ponens that (x,z)\niR.

Now I'll try to prove: R is transitive <=> R^i \subseteqR, \foralli\geq1.

=> Assume R is transitive. To prove that R^i\subseteqR, for all i \geq1 we can use induction.

Base case: i=1 -> R\subseteqR obviously holds.

Now I'm not really sure whether I actually have to use induction here. I think what needs to be shown here is pretty straightforward. If there is a y\inA such that x1Ry and yRx2 hold, then because R is transitive it follows that x1Rx2. And then you can continue this way with x2 and x3 and in general any value i. But I don't really know how to write this in a formally correct way. Can anybody help me with that? And please give some feedback on the first part of the proof.
 
Physics news on Phys.org
4Fun said:
R^2 means that for an arbitrary ordered pair (x, z)\inA there is a y\inA such that xRy and yRz.

It that a typo?

R^2 is a set, so you shouldn't say it "means" something. The definition of a set tells you what it means for an element to be in that set. So you may say "To say an element x is in R^2 means that ...".
 
^Agreed.

In particular, it's the set R^2 = \{(x,z)\in A^2:\enspace \exists y\in A \text{ such that } xRy \text{ and } yRz\}, and we use the notation xR^2z as a shorthand for (x,z)\in R^2.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
4
Views
1K
Replies
22
Views
5K
Replies
5
Views
2K
Replies
1
Views
2K
Replies
7
Views
2K
Replies
12
Views
1K
Back
Top