Prove: (S ∩ T) ∪ U = S ∩ (T ∪ U)

  • Thread starter Thread starter mutzy188
  • Start date Start date
  • Tags Tags
    Logic Proofs
mutzy188
Messages
37
Reaction score
0

Homework Statement



Prove or give a counterexample to each statement.

(S ∩ T) ∪ U = S ∩ (T ∪ U)


The Attempt at a Solution



If I proved by the contrapositive

S (T ∩ U) ≠ (S ∩ T) ∪ U

where would I go from there. How do I find the contrapositive with the unions and intersections?

Thanks
 
Physics news on Phys.org
I don't see how that's a contrpositive... contrapositive involves an implication... but this is an equality you need to prove or disprove...
 
(S ∩ T) ∪ U = S ∩ (T ∪ U)

then:

T∪U ∩ S = S ∩ (T ∪ U)

but then where do I go from here
 
mutzy188 said:
(S ∩ T) ∪ U = S ∩ (T ∪ U)

then:

T∪U ∩ S = S ∩ (T ∪ U)

but then where do I go from here

How did you get that?
 
The contrapositive doesn't work because you're not proving implication, but an equivalence of sets.

Choose an arbitrary element contained in the set on one side of the equality, and then show that it's contained in the set on the other side of the equality. That proves the first set is a subset of the set on the other side. Then start on the other side of the equality and follow the same process. That proves equivalence.

That's the gameplan for your proof.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top