What is the problem in this Proof

  • Context: MHB 
  • Thread starter Thread starter Amer
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary
SUMMARY

The discussion centers on a flawed proof claiming that any two natural numbers \(a\) and \(b\) are equal using mathematical induction. The critical error lies in the assumption that \(\max(a, b) = k\) implies \(a = b\), which is incorrect, as demonstrated by the example of \(5\) and \(7\). The proof fails particularly in the last two sentences, where it incorrectly applies the induction hypothesis without confirming that \(a-1\) and \(b-1\) are natural numbers, potentially leading to one of them being zero.

PREREQUISITES
  • Understanding of mathematical induction
  • Knowledge of natural numbers and their properties
  • Familiarity with the maximum function, \(\max(a, b)\)
  • Basic logic and proof techniques in mathematics
NEXT STEPS
  • Study the principles of mathematical induction in depth
  • Learn about the properties of natural numbers and their implications in proofs
  • Examine common pitfalls in mathematical proofs involving the maximum function
  • Explore counterexamples in mathematical logic to strengthen proof techniques
USEFUL FOR

Mathematicians, students studying mathematical proofs, and anyone interested in understanding the nuances of mathematical induction and logical reasoning.

Amer
Messages
259
Reaction score
0
In your point of view what is the problem in this Proof
Claim any two natural a,b are equal
By induction
Let m= max{a,b}
if m=1 then a=b=1 since a,b natural
suppose it is hold for m=k
if
max{a,b} = k then a=b
test if
max{a,b} = k+1 , sub 1
max{a-1,b-1} = k which is the previous so a-1 = b-1 , a=b

I saw it in facebook
 
Physics news on Phys.org
Amer said:
In your point of view what is the problem in this Proof
Claim any two natural a,b are equal
By induction
Let m= max{a,b}
if m=1 then a=b=1 since a,b natural
suppose it is hold for m=k
if
max{a,b} = k then a=b
test if
max{a,b} = k+1 , sub 1
max{a-1,b-1} = k which is the previous so a-1 = b-1 , a=b

I saw it in facebook

I saw it on math.stackexchange too. The problem is that $\max{(a, b)} = k ~ \implies ~ a = b$ is clearly wrong, and the proof was designed to hide this fact. For instance, $\max{(5, 7)} = 7$, but last time I checked we had $5 \ne 7$.

In essence, this "proof" doesn't show that all natural numbers are equal, it shows that any two equal natural numbers are equal ;)​
 
Bacterius said:
The problem is that $\max{(a, b)} = k ~ \implies ~ a = b$ is clearly wrong, and the proof was designed to hide this fact. For instance, $\max{(5, 7)} = 7$, but last time I checked we had $5 \ne 7$.
But this does not explain which proof step in particular is wrong. Of course the implication max(a, b) = k ⇒ a = b is false, just like the original claim that a = b for all a, b. But the proof claims to show just that, and the question is where the mistake in the proof is located.
 
Amer said:
In your point of view what is the problem in this Proof
Claim any two natural a,b are equal
By induction
Let m= max{a,b}
if m=1 then a=b=1 since a,b natural
suppose it is hold for m=k
if
max{a,b} = k then a=b
test if
max{a,b} = k+1 , sub 1
max{a-1,b-1} = k which is the previous so a-1 = b-1 , a=b

I saw it in facebook

The proof goes wrong in the last two sentences.

We have max{a,b}=k+1

Now we have max{a-1,b-1}=k.

We now want to apply the induction hypothesis here to have a-1=b-1 and thus a=b. But we can't do this. This is because we are not sure if a-1 and b-1 are natural numbers. We can very well have one of a-1 and b-1 equal to 0.

So this is the problem in the proof.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 40 ·
2
Replies
40
Views
3K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K