How to Correct an Incorrect Proof Involving Set Theory?

  • Thread starter Thread starter ash25
  • Start date Start date
  • Tags Tags
    Proof
ash25
Messages
8
Reaction score
0

Homework Statement


PLEASE HELP!How would you correct this incorrect proof:
Suppose that S∩T≠0,T∩W≠0,and for a contradiction S∩W=0.From the first 2,we have some t∈S∩T,and similarly t∈T∩W.But then t∈S,t∈T,and t∈W.So t∈S∩W,giving a contradiction.
 
Physics news on Phys.org
There is no way to correct this "proof", since what you're trying to show is false!

Take S=[0,3],~T=[1,5],~W=[4,10]. Then S\cap W=\emptyset...
 
Thank you, so the claim was true though, right? It was:
For any sets S,T,and W,if S∩T≠0 and T∩W≠0,then S∩W≠0
 
No, I just gave you a counterexample...
 
You are being so helpful thank you!
but you are saying that the claim is false?
 
ash25 said:
but you are saying that the claim is false?

Yes!
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top