Proving AunionB=AunionC, B=C Theorem

  • Thread starter Thread starter kathrynag
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
3 replies · 2K views
kathrynag
Messages
595
Reaction score
0

Homework Statement


I need to decide whether the theorem is correct and decide where the proof fails.
AunionB=AunionC, B=C


Homework Equations





The Attempt at a Solution


We will prove by contradiction. Suppose that A[tex]\cup[/tex]B and A[tex]\cup[/tex]C are not equal. Then there is some object x that is in one and not the other. We proceed by looking at 2 cases:
First look at the case where x[tex]\in[/tex]A[tex]\cup[/tex]B and x[tex]\notin[/tex]A[tex]\cup[/tex]C. Then x[tex]\notin[/tex]A. So x[tex]\in[/tex]B. Also x[tex]\notin[/tex]C. Therefore x is in B and not in C, which contradicts the condition B=C.

I thought the theorme was correct, but I can't find where the proof goes wrong.
 
Physics news on Phys.org
kathrynag said:

Homework Statement


I need to decide whether the theorem is correct and decide where the proof fails.
AunionB=AunionC, B=C


Homework Equations





The Attempt at a Solution


We will prove by contradiction. Suppose that A[tex]\cup[/tex]B and A[tex]\cup[/tex]C are not equal.
That's NOT the way proof by contradiction works! To prove "if X then Y" by contradiction, you assume Y is not true. Here your theorem is "if [tex]A\cup B= A\cup C[/tex] then B= C. Proof by contradiction would start "suppose B is not equal to C".

Then there is some object x that is in one and not the other. We proceed by looking at 2 cases:
First look at the case where x[tex]\in[/tex]A[tex]\cup[/tex]B and x[tex]\notin[/tex]A[tex]\cup[/tex]C. Then x[tex]\notin[/tex]A. So x[tex]\in[/tex]B. Also x[tex]\notin[/tex]C. Therefore x is in B and not in C, which contradicts the condition B=C.

I thought the theorme was correct, but I can't find where the proof goes wrong.
 
HallsofIvy said:
That's NOT the way proof by contradiction works! To prove "if X then Y" by contradiction, you assume Y is not true. Here your theorem is "if [tex]A\cup B= A\cup C[/tex] then B= C. Proof by contradiction would start "suppose B is not equal to C".

Oh yeah I forgot about that.
 
I think it's not true. You take A={1,2,3}. B={1,0}, C={2,0}. Then B not = C but A union B= A union C