Question

prove right or wrong “if r and s are transitive, then r n s is transitive”

prove right or wrong
“if r and s are transitive, then r n s is transitive”

Homework Answers

Answer #1

Suppose (a, b) ∈ R∩S and (b, c) ∈ R∩S. We need to show that (a, c) ∈ R∩S. Because (a, b) ∈ R∩S, we know and (a, b) ∈ R and (a, b) ∈ S. Because (b, c) ∈ R∩S, we know and (b, c) ∈ R and (b, c) ∈ S. Since (a, b) ∈ R and (b, c) ∈ R and R is transitive we know that (a, c) ∈ R. Since (a, b) ∈ S and (b, c) ∈ S and S is transitive we know that (a, c) ∈ S. Since (a, c) ∈ R and (a, c) ∈ S, (a, c) ∈ R∩S. We have shown that whenever (a, b) ∈ R∩S, and (b, c) ∈ R∩S, (a, c) ∈R∩S , so R∩S is transitive

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Determine whether the relation R on N is reflexive, symmetric, and/or transitive. Prove your answer. a)R...
Determine whether the relation R on N is reflexive, symmetric, and/or transitive. Prove your answer. a)R = {(x,y) : x,y ∈N,2|x,2|y}. b)R = {(x,y) : x,y ∈ A}. A = {1,2,3,4} c)R = {(x,y) : x,y ∈N,x is even ,y is odd }.
Prove that if the relation R is symmetric, then its transitive closure, t(R)=R*, is also symmetric....
Prove that if the relation R is symmetric, then its transitive closure, t(R)=R*, is also symmetric. Please provide step by step solutions
Prove that implication is transitive.
Prove that implication is transitive.
a) Let R be an equivalence relation defined on some set A. Prove using induction that...
a) Let R be an equivalence relation defined on some set A. Prove using induction that R^n is also an equivalence relation. Note: In order to prove transitivity, you may use the fact that R is transitive if and only if R^n⊆R for ever positive integer ​n b) Prove or disprove that a partial order cannot have a cycle.
Let R be a ring and let M and N be right R-modules. Assume that the...
Let R be a ring and let M and N be right R-modules. Assume that the only R-homorphisms M → N and N → M are 0 maps. Prove that EndR(M⊕N) ∼= EndR(M) ⊕ EndR(N) (direct sum of rings). Remember the convention used for composition of R-homomorphismps.
Prove that 1 + r + r^2 + … + r n = (1 – r^(n...
Prove that 1 + r + r^2 + … + r n = (1 – r^(n +1) )/(1 – r) for all n ∈ N, when r ≠ 1
Prove that if ? ≡ ? (mod n) and ? ≡ ? (mod n), then ?...
Prove that if ? ≡ ? (mod n) and ? ≡ ? (mod n), then ? ≡ ? (mod n). This proves that congruence mod n is transitive. and : Prove that if ? ≡ ? (mod n) and ? ≡ ? (mod n), then a) ? + ? ≡ ? + ? (mod n) b) ?? ≡ ?? (mod n)
Prove that strong connectivity is reflexive, transitive and symmetric.
Prove that strong connectivity is reflexive, transitive and symmetric.
Exercise1.2.1: Prove that if t > 0 (t∈R), then there exists an n∈N such that 1/n^2...
Exercise1.2.1: Prove that if t > 0 (t∈R), then there exists an n∈N such that 1/n^2 < t. Exercise1.2.2: Prove that if t ≥ 0(t∈R), then there exists an n∈N such that n−1≤ t < n. Exercise1.2.8: Show that for any two real numbers x and y such that x < y, there exists an irrational number s such that x < s < y. Hint: Apply the density of Q to x/(√2) and y/(√2).
Prove or disprove: The relation "is-a-normal-subgroup-of" is a transitive relation.
Prove or disprove: The relation "is-a-normal-subgroup-of" is a transitive relation.