All Horses Are the Same Color: The Classic Mathematical Induction Fallacy Explained

Imagine someone claiming that all horses on Earth are the same color — and backing it up with a rigorous mathematical proof. Sounds like a joke? It isn’t. This is a classic example of a sophism invented by Hungarian mathematician George Pólya. His goal was to show how easy it is to go wrong when mathematical induction is used incorrectly.

How the “Proof” Works

Step 1 — Base case:
Start with a single horse. Obviously, it is the same color as itself.

Step 2 — Inductive step:
Assume that any group of K horses is always the same color.
Now consider a group of K + 1 horses.

• Remove one horse. The remaining K horses are all the same color (by assumption).
• Put that horse back, but remove a different one. Again, K horses remain — all the same color.

Since the two subsets overlap (they share horses in common), their colors must match. Therefore, all K + 1 horses are the same color.

Sounds convincing? But something is clearly off.

Spotting the Mathematical Induction Fallacy

The error lies in the transition from K to K + 1 — specifically, the step from 1 to 2.

When there are only two horses, removing one leaves just a single horse. That means there is no overlap between the two subsets — no shared horse to serve as a common reference for comparing colors.

That one missing link is enough to collapse the entire proof.

Why This Fallacy in Mathematical Induction Matters

This example teaches us that a neatly structured proof is not automatically a correct one. Errors can be subtle and buried in details, especially when induction and logic are involved.

The lesson: in mathematics, it is not enough to construct proofs — you must also know how to look for flaws in them. Because sometimes a well-hidden mistake is far more instructive than a straightforward truth.