# Difference between revisions of "Fallacy"

IntrepidMath (talk | contribs) |
Flamefoxx99 (talk | contribs) (→All horses are the same color) |
||

(11 intermediate revisions by 4 users not shown) | |||

Line 1: | Line 1: | ||

− | A ''' | + | A '''fallacy''' is a step an attempted [[proof]] that is [[logic]]ally flawed in some way. The fact that a proof is fallacious says nothing about the validity of the original proposition. |

== Common false proofs == | == Common false proofs == | ||

Line 9: | Line 9: | ||

Then we have | Then we have | ||

− | <math> a^2 = ab </math> (since <math>a=b</math>) | + | <div style="text-align:center"><math> a^2 = ab </math> (since <math>a=b</math>)</div> |

− | <math> 2a^2 - 2ab = a^2 - ab </math> (adding <math>a^2-2ab</math> to both sides) | + | <div style="text-align:center"><math> 2a^2 - 2ab = a^2 - ab </math> (adding <math>a^2-2ab</math> to both sides)</div> |

− | <math> 2(a^2 - ab) = a^2 - ab </math> (factoring out a 2 on the [[LHS]]) | + | <div style="text-align:center"><math> 2(a^2 - ab) = a^2 - ab </math> (factoring out a 2 on the [[LHS]])</div> |

− | <math> 2 = 1 </math> (dividing by <math>a^2-ab</math>) | + | <div style="text-align:center"><math> 2 = 1 </math> (dividing by <math>a^2-ab</math>)</div> |

[[Fallacious proof/2equals1 | Explanation]] | [[Fallacious proof/2equals1 | Explanation]] | ||

− | === All horses | + | === Polya's Proof That All horses Are the Same Color === |

We shall prove that all horses are the same color by [[induction]] on the number of horses. | We shall prove that all horses are the same color by [[induction]] on the number of horses. | ||

− | First we shall show our base case, that all horses in a group of 1 horse have the same color | + | First we shall show our base case, that all horses in a group of 1 horse have the same color to be true. Of course, there's only 1 horse in the group so certainly our base case holds. |

Now assume that all the horses in any group of <math>k</math> horses are the same color. This is our inductive assumption. | Now assume that all the horses in any group of <math>k</math> horses are the same color. This is our inductive assumption. | ||

Line 29: | Line 29: | ||

[[Fallacious proof/all horses are the same color | Explanation]] | [[Fallacious proof/all horses are the same color | Explanation]] | ||

+ | |||

+ | === All numbers are equal === | ||

+ | Consider arbitrary reals <math>a</math> and <math>b</math>, and let <math>t</math> = <math>a + b</math>. Then | ||

+ | <cmath>a + b = t</cmath> | ||

+ | |||

+ | <cmath>(a + b)(a - b) = t(a - b)</cmath> | ||

+ | |||

+ | |||

+ | <cmath>a^2 - b^2 = ta - tb</cmath> | ||

+ | |||

+ | |||

+ | <cmath>a^2 - ta = b^2 - tb</cmath> | ||

+ | |||

+ | |||

+ | <cmath>a^2 - ta + \dfrac{t^2}{4} = b^2 - tb + \dfrac{t^2}{4}</cmath> | ||

+ | |||

+ | |||

+ | <cmath>\left(a - \dfrac{t}{2}\right)^2 = \left(b - \dfrac{t}{2}\right)^2</cmath> | ||

+ | |||

+ | |||

+ | <cmath>a - \dfrac{t}{2} = b - \dfrac{t}{2}</cmath> | ||

+ | |||

+ | |||

+ | <cmath>a = b</cmath> | ||

+ | |||

+ | [[Fallacious proof/All numbers are equal|Explanation]] | ||

+ | === Bread === | ||

+ | *Nothing is better than fame, happiness and success. | ||

+ | *A few small crumbs of bread are better than nothing. | ||

+ | *Thus, a few small crumbs of bread are better than fame, happiness, and success. | ||

+ | |||

+ | |||

+ | [[Fallacious proof/Bread|Explanation]] | ||

== See also == | == See also == | ||

* [[Proof writing]] | * [[Proof writing]] |

## Latest revision as of 08:27, 5 June 2013

A **fallacy** is a step an attempted proof that is logically flawed in some way. The fact that a proof is fallacious says nothing about the validity of the original proposition.

## Contents

## Common false proofs

The fallacious proofs are stated first and then links to the explanations of their fallacies follow.

### 2 = 1

Let .

Then we have

### Polya's Proof That All horses Are the Same Color

We shall prove that all horses are the same color by induction on the number of horses.

First we shall show our base case, that all horses in a group of 1 horse have the same color to be true. Of course, there's only 1 horse in the group so certainly our base case holds.

Now assume that all the horses in any group of horses are the same color. This is our inductive assumption.

Using our inductive assumption, we will now show that all horses in a group of horses have the same color. Number the horses 1 through . Horses 1 through must be the same color as must horses through . It follows that all of the horses are the same color.

### All numbers are equal

Consider arbitrary reals and , and let = . Then

### Bread

- Nothing is better than fame, happiness and success.
- A few small crumbs of bread are better than nothing.
- Thus, a few small crumbs of bread are better than fame, happiness, and success.