Disproving an incorrect theorem?

  • Thread starter Thread starter YamiBustamante
  • Start date Start date
  • Tags Tags
    Theorem
AI Thread Summary
The discussion centers around an incorrect theorem claiming that if x + y = 10, then x cannot be 3 and y cannot be 8. The proof presented is flawed because it incorrectly assumes that showing x = 3 and y = 8 leads to a contradiction, while failing to address the correct negation of the theorem. A counterexample, such as x = 3 and y = 7, demonstrates that the theorem is indeed false, as it satisfies the condition x + y = 10. Clarification on negation reveals that the correct negation is x = 3 or y = 8, not both conditions being false. Ultimately, the confusion is resolved, confirming that the theorem is false from the start.
YamiBustamante
Messages
17
Reaction score
0
Incorrect Theorem:
Suppose x and y are real numbers and x + y = 10, then x != 3 and y != 8.

(a) What’s wrong with the following proof of the theorem?

Proof. Suppose the conclusion of the theorem is false. Then x = 3 and y = 8. But then x + y = 11, which contradicts the given information that x + y = 10. Therefore the conclusion must be true.

(b) Show that the theorem is incorrect by finding a counterexample.So according to the answer it's false because x != 3 can't be proven with x = 3 because that's not the negation, but even so, isn't the theorem true because 3 + 8 = 11 which does contradict the premise... I'm very confused by this...

For b, the counter example was x = 3 and x = 7 but how does that disprove it? I'm still very confused by counter examples.
So would it be written as "Suppose x and y are real numbers and x + y = 10, then x = 3 and y = 7" Is that how the counter example would be written?

Please explain!
 
Physics news on Phys.org
YamiBustamante said:
Proof. Suppose the conclusion of the theorem is false. Then x = 3 and y = 8.

That is not the negation of the theorem.
 
micromass said:
That is not the negation of the theorem.
So the proof is false so therefore the theorem is false or is the theorem already false to begin with, so proof would also be false...
 
micromass said:
That is not the negation of the theorem.
Never mind. I figured it out. Thank you.
 
In the statement, the conclusion is "then ##x \ne 3 \text{ and } y \ne 8##"

The negation of the conclusion is ##x = 3 \text{ or } y = 8##. I believe this is what micromass was alluding to.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Replies
5
Views
2K
Replies
7
Views
1K
Replies
11
Views
4K
Replies
14
Views
2K
Replies
6
Views
3K
Replies
24
Views
3K
Replies
1
Views
2K
Back
Top