Can Proof by Contradiction Be Validated through Logical Equivalences?

Click For Summary

Homework Help Overview

The discussion revolves around a proof by contradiction involving the equation x² + y = 13 and the condition y ≠ 4, aiming to establish that x ≠ 3. Participants are exploring the logical validity of this proof method within the context of mathematical reasoning.

Discussion Character

  • Conceptual clarification, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to understand the logical structure of the proof by contradiction, questioning how to identify the contradictory statement among multiple assumptions. Some participants suggest simplifying the argument without delving into symbolic logic.

Discussion Status

The discussion is active, with participants providing insights into the proof's validity and addressing the original poster's concerns about the assumptions involved. There is acknowledgment of a potential typographical error in the original statement, which has been pointed out but not resolved.

Contextual Notes

Participants are working under the assumption that the statements x² + y = 13 and y ≠ 4 are true, which is central to the proof being discussed. There is a focus on understanding the implications of these assumptions in the context of the proof.

Cole A.
Messages
12
Reaction score
0

Homework Statement


Prove that if x^2 + y = 13 and y \neq 4, then x \neq 3.

Homework Equations


N.A.

The Attempt at a Solution


The proof itself is simple enough: suppose x^2 + y = 13 and y \neq 4. Suppose for the sake of contradiction that x = 3. Then
<br /> \begin{align*}<br /> (3)^2 + y &amp;= 13 \\<br /> y &amp;= 4.<br /> \end{align*}
But this contradicts the knowledge that y \neq 4. Therefore, if x^2 + y = 13 and y \neq 4, then x \neq 3.

The problem I am having is understanding why this is logically valid. Would it be correct to say that, for the statements
<br /> \begin{align*}<br /> A &amp;: x^2 + y = 13 \\<br /> B &amp;: y = 4 \\<br /> C &amp;: x = 3,<br /> \end{align*}<br />
what has been proven is below?
<br /> \begin{align*}<br /> &amp;(A \wedge \neg B \wedge C) \rightarrow B \\<br /> \text{which is equivalent to}~ &amp;(A \wedge \neg B) \rightarrow (C \rightarrow B) \\<br /> \text{which is equivalent to}~ &amp;(A \wedge \neg B) \rightarrow (\neg B \rightarrow \neg C) \\<br /> \text{which is equivalent to}~ &amp;(A \wedge \neg B \wedge \neg B) \rightarrow \neg C \\<br /> \text{which is equivalent to}~ &amp;(A \wedge \neg B) \rightarrow \neg C.<br /> \end{align*}<br />

Is this the proper way to think about the validity of proof by contradiction? (Sorry if this is a dumb question, I'm not a mathematician. What I am finding hard to stomach is identifying x = 3 as the contradictory statement when there are actually three statements that were assumed to be true (and thus possible culprits of the contradiction)).
 
Physics news on Phys.org
There is no need to write out the argument in symbolic logic. It works as follows: If x were 3 then y would have to be 4. Since we know that y is not 4, our assumption that x=3 must be false since we obtained an incorrect result with it. Therefore x \neq 4.

You ask why the other assumptions couldn't be the source of the contradiction. We are taking x^2 + y = 17 and y \neq 4 for granted. After all, the goal of the proof is to show that \mathbf {if} these two statements are true, then x \neq 4.
 
Last edited:
HS-Scientist said:
... then x \neq 4.

I'm sure that you have a typo.

You mean \ x \neq 3 .
 
@HS-Scientist: Thanks for your answer.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 3 ·
Replies
3
Views
4K