Is this logical reasoning correct?

  • Context: Undergrad 
  • Thread starter Thread starter frb
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around the logical reasoning involved in proving the equivalence of two functions, f and g, specifically whether demonstrating one direction of implication is sufficient to establish their equality. The scope includes mathematical reasoning and proof techniques.

Discussion Character

  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant proposes that to show f and g are equal, it suffices to prove f(x) = n implies g(x) = n, and questions if showing one side of the implication is enough.
  • Another participant expresses confusion about the proof and asserts that it is not correct, indicating a disagreement on the validity of the reasoning presented.
  • Several participants discuss the necessity of proving the converse, f(x) != n implies g(x) != n, to establish equivalence.
  • One participant suggests that if it is known that for all x, f(x) = n implies g(x) = n, then it follows that f(x) = g(x) without needing further logic.
  • A participant acknowledges their confusion and thanks others for clarifying the reasoning process.
  • Another participant points out that the proof assumes f and g have the same domain, noting that the proof fails if they do not, which raises further questions about the conditions under which the functions can be considered equal.

Areas of Agreement / Disagreement

Participants express differing views on the correctness of the initial proof and whether the implications discussed are sufficient for establishing function equality. The discussion remains unresolved regarding the validity of the reasoning and the implications of domain considerations.

Contextual Notes

The discussion highlights limitations related to assumptions about the domains of the functions involved, which are crucial for determining their equality.

frb
Messages
16
Reaction score
0
Suppose I want to show that two functions f and g are equal. A way to prove this could be to prove the statement:
[tex]f(x) = n \Leftrightarrow g(x) = n[/tex]

Is it enough to show one side of the implication?
Prove the following statement:
[tex]f(x) = n \Rightarrow g(x) = n[/tex]

and reason as follows, suppose [tex]f(x) \neq n[/tex],
[tex]\Rightarrow \exists m\neq n: f(x)=m[/tex]
[tex]\Rightarrow g(x)=m\neq n[/tex]
Which would mean that I have shown the converse implication, and thus I have equivalence.
 
Last edited:
Physics news on Phys.org
frb said:
Prove the following statement:
[tex]f(x) = n \Rightarrow g(x) = n[/tex]

and reason as follows, suppose [tex]f(x) \neq n[/tex],
[tex]\Rightarrow \exists m\neq n: f(x)=m[/tex]
[tex]\Rightarrow g(x)=m\neq n[/tex]
Which would mean that I have shown the converse implication, and thus I have equivalence.

Hi frb! :smile:

Sorry, but I don't understand your proof, so I'm going to say no, it's not correct. :redface:
 
Suppose I have proven the statement f(x) = n implies g(x)=n.

To obtain equivalence I have to prove f(x) != n implies g(x) != n.

So i reason as follows, suppose f(x) != n,
f(x) surely has another value, let this value be m, so f(x) = m, and m != n.
f(x) = m implies g(x) = m, and that implies that g(x) != n.
 
frb said:
Suppose I have proven the statement f(x) = n implies g(x)=n.

To obtain equivalence I have to prove f(x) != n implies g(x) != n.

So i reason as follows, suppose f(x) != n,
f(x) surely has another value, let this value be m, so f(x) = m, and m != n.
f(x) = m implies g(x) = m, and that implies that g(x) != n.

ah … that seems fine …

but if you want to prove f = g, which is the same as, for all x, f(x) = g(x),

then if you know for all x, f(x) = n implies g(x)=n,

then for all x, f(x) = g(x) … you don't need any more logic than that. :smile:
 
of course. My brain is fried due to too much studying. I tend to make things more difficult then. I thought that there should be a flaw or something. Thanks though!
 
This proof assumes that f and g have the same domain.

It fails if they have different domains. But then by definition the functions are not equal, so there was no need to go any further.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 22 ·
Replies
22
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 27 ·
Replies
27
Views
4K