R is a relation from A to B. S and T are relations from B to C. Prove/disprove (S ∩ T) o R = (S ∩ R) o (T ∩ R)? I'm having a hunch that's is true. I already proved t (S∩T) o R ⊆ (S∩R) o (T∩R). Now I need help proving the other direction
here is what i have so far...
oh wait, typo hold on
(S ∩ T) o R = (S o R) ∩ (T o R)?
again, I proved (S∩T) o R ⊆ (SoR) ∩ (T o R)
Use \[ (b,c)\in S\land (b,c)\in T \land (a,b) \in R \\ \implies [(b,c)\in S\land (a,b) \in R]\land [(b,c)\in T \land (a,b) \in R] \]
Basically \(p\implies p\land p\)
Then move them around with commutative property.
I fixed my typo. It was supposed to be (S ∩ T) o R = (S o R) ∩ (T o R) not (S ∩ R) o (T ∩ R) :D
ok, here is what i have: let (x,y) ∈ (S o R) ∩ (T o R), then (x,y) ∈(SoR) and (x,y) ∈ (ToR) ∃b∈B [(x,b)∈R and (b,y)∈S] and ∃b'∈B [(x,b')∈R and (b',y)∈T]
the problem is that i can not move the ∃b out in front because that is not equivalent to the statement above
also b and b' may not be the same element
Then find a counter example.
huhm... so I need to come up with (x,y) ∈ (S o R) ∩ (T o R) but, (x,y) ∉ (S ∩ T) o R ?
S = {(1,2)} T = {(1,3)} R = {(2,1), (3,1)} \((S\cap T) \circ R= \emptyset \circ R = \emptyset \) While \[ (S\circ R)\cap (T\circ R) = \{(1,1)\}\cap \{(1,1)\} = \{(1,1)\} \]
|dw:1397110414909:dw|
|dw:1397110623808:dw|
wait how is S o R = { (1,1) }
?
Just reverse the order
reverse what order?
S = {(2,1)} T = {(3,1)} R = {(1,2), (1,3)} \((S\cap T) \circ R= \emptyset \circ R = \emptyset \) While \[ (S\circ R)\cap (T\circ R) = \{(1,1)\}\cap \{(1,1)\} = \{(1,1)\} \]
Perfect! thanks a punch! ^^
so the statement is false after all.
thanks a *bunch* XD haha
Join our real-time social learning platform and learn together with your friends!