Invalid proof

From Exampleproblems

Jump to: navigation, search

In mathematics, there are a variety of spurious proofs of obvious contradictions. Although the proofs are flawed, the errors are comparatively subtle, usually by design. These fallacies are normally regarded as mere curiosities, but can be used to show the importance of rigor in mathematics.

Most of these proofs depend on some variation of the same error. The error is to take a function f that is not one-to-one, to observe that f(x) = f(y) for some x and y, and to (erroneously) conclude that therefore x = y. Division by zero is a special case of this; the function f is xx × 0, and the erroneous step is to start with x × 0 = y × 0 and to conclude that therefore x = y.

Contents

Examples

Proof that 1 equals −1

  • We start with
    − 1 = − 1
  • Then we convert these into vulgar fractions
    \frac{1}{-1} = \frac{-1}{1}
  • Applying square roots on both sides gives
    \sqrt{\frac{1}{-1}} = \sqrt{\frac{-1}{1}}
  • Which is equal to
    \frac{\sqrt{1}}{\sqrt{-1}} = \frac{\sqrt{-1}}{\sqrt{1}}
  • If we now clear fractions by multiplying both sides by \sqrt{-1} and then \sqrt{1}, we have
    \sqrt{1}\sqrt{1} = \sqrt{-1}\sqrt{-1}
  • But any number's square root squared gives the original number, so
    1 = − 1

Q.E.D.

This proof is invalid since it applies the following principle for square roots incorrectly:

\sqrt{\frac{x}{y}} = \frac{\sqrt{x}}{\sqrt{y}}

This principle is only correct when y is a positive number. In the "proof" above, this is not the case. Thus the proof is invalid.

Proof that 1 is less than 0

  • Let us first suppose that
    0 < x < 1
  • Now we will take the logarithm on both sides. As long as x > 0, we can do this because logarithms are monotonically increasing. Observing that the logarithm of 1 is 0, we get
    lnx < 0
  • Dividing by ln x gives
    1 < 0

Q.E.D.

The violation is found in the last step, the division. This step is wrong because the number we are dividing by is negative as can clearly be seen in the previous line. A multiplication with or division by a negative number flips the inequality sign; in other words, we should obtain 1 > 0, which is indeed correct.

Proof that 2 equals 1

  • Let a and b be equal non-zero quantities
    a = b
  • Multiply through by a
    a2 = ab
  • Subtract b2
    a2b2 = abb2
  • Factor both sides
    (ab)(a + b) = b(ab)
  • Divide out (ab)
    a + b = b
  • Observing that a = b
    b + b = b
  • Combine like terms on the left
    2b = b
  • Divide by the non-zero b
    2 = 1

Q.E.D.

The fallacy is in line 5: the progression from line 4 to line 5 involves division by (ab), which is zero since a equals b. Since division by zero is undefined, the argument is invalid.

A variation:

  • Let x and y be equal, non-zero quantities
    x = y
  • Add x to both sides
    2x = x + y
  • Take 2y from both sides
    2x − 2y = xy
  • Factorise
    2(xy) = xy
  • Divide out (xy)
    2 = 1

Q.E.D.

The fallacy here is the same as above in that by dividing by (xy), you are dividing by zero and as such, this argument is invalid.

Proof that a equals b

  • We start with:
    ab = c
  • Now, square both sides:
    a2 − 2ab + b2 = c2
  • Since ab = c, substitute:
    a2 − 2ab + b2 = (ab)c
  • Write out the multiplication:
    a2 − 2ab + b2 = acbc
  • Rearranging all, we get:
    a2abac = abb2bc
  • Factorize both members:
    a(abc) = b(abc)
  • Cancel the common factor:
    a = b

Q.E.D.

The catch is that since ab = c, abc = 0, and as a result we have performed an illegal division by zero.

Proof that 0 equals 1

  • Start with the addition of an infinite succession of zero's
    0 = 0 + 0 + 0 + \ldots
  • Then recognize that 0 = 1 − 1
     0 = (1 - 1) + (1 - 1) + (1 - 1) + \ldots
  • Applying the associative law of addition results in
    0 = 1 + (-1 + 1) + (-1 + 1) + (-1 + 1) + \ldots
  • Of course − 1 + 1 = 0
    0 = 1 + 0 + 0 + 0 + \ldots
  • And the addition of an infinite string of zero's can be discarded leaving
    0 = 1

Q.E.D.

The error here is that the associative law cannot be applied freely to an infinite sum unless the sum would converge without any parentheses. In this particular argument, the second line gives the sequence of partial sums 0, 0, 0, ... (which converges to 0) while the third line gives the sequence of partial sums 1, 1, 1, ... (which converges to 1), so it is unclear in what sense these expressions can be considered equal.

Another proof that 2 = 1

  • By the common intuitive meaning of multiplication we can see that
    4 * 3 = 3 + 3 + 3 + 3
  • It can also be seen that for a non-zero x
    x = 1 + 1 + ... + 1 (x terms)
  • Now we multiply through by x
    x2 = x + x + ... + x (x terms)
  • Then we take the derivative with respect to x
    2x = 1 + 1 + ... + 1 (x terms)
  • Now we see that the right hand side is x which gives us
    2x = x
  • Finally, dividing by our non-zero x we have
    2 = 1

Q.E.D.

The error here is that in line two our definition of x assumed that x was an integer, non-integer real numbers are precluded by this definition. For that reason the function x2 is not a continuous function and this thus not differentiable.

Conclusion

These arguments do constitute valid proofs, but not of the claimed assertions. For example, there is no a priori reason why division by zero should be defined (it's not a field axiom, for example, though 1 ≠ 0, from which 2 ≠ 1 follows, is an axiom), and the "proof" that 2 = 1 is, in fact, simply a demonstration that division by zero cannot be defined in general. A proof that division by zero could be defined would demonstrate a contradiction and show that the axiomatic system we are working under is logically inconsistent!

On the other hand it is possible to construct useful mathematical systems where 1 is technically equal to 2. Mathematics in domains modulo 1 are one example. In such domains 0.5 + 0.5 = 0 = 1 = 2...

See also

External links

visitor stats