Is this logical reasoning correct?

  • Thread starter Thread starter frb
  • Start date Start date
AI Thread Summary
To prove that two functions f and g are equal, it is necessary to demonstrate that f(x) = n if and only if g(x) = n. The discussion highlights that proving just one direction, f(x) = n implies g(x) = n, is insufficient for establishing equivalence without also proving the converse. A correct approach involves showing that if f(x) is not equal to n, then g(x) must also not equal n. Additionally, the proof assumes that both functions share the same domain; if they do not, they cannot be considered equal. Overall, clarity in logical reasoning is essential for validating function equivalence.
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:
f(x) = n \Leftrightarrow g(x) = n

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

and reason as follows, suppose f(x) \neq n,
\Rightarrow \exists m\neq n: f(x)=m
\Rightarrow g(x)=m\neq n
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:
f(x) = n \Rightarrow g(x) = n

and reason as follows, suppose f(x) \neq n,
\Rightarrow \exists m\neq n: f(x)=m
\Rightarrow g(x)=m\neq n
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.
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...

Similar threads

Back
Top