Chapter 0: Q12P (page 1)
Find the error in the following proof that all horses are the same color.
CLAIM: In any set of hhorses, all horses are the same color.
PROOF: By induction on h.
Basis: For . In any set containing just one horse, all horses clearly are the
same color.
Induction step: For , assume that the claim is true for and prove that
it is true for . Take any set H of horses. We show that all the horses
in this set are the same color. Remove one horse from this set to obtain the set
with just horses. By the induction hypothesis, all the horses in are the same
color. Now replace the removed horse and remove a different one to obtain the setrole="math" localid="1664255899729"
. By the same argument, all the horses in are the same color. Therefore, all
the horses in H must be the same color, and the proof is complete.
Short Answer
The given proof is wrong and it can be explained.