# ~/Blog

## Brandon Rozek PhD Student @ RPI studying Automated Reasoning in AI and Linux Enthusiast.

# Most Common Mistake in Induction Proofs

Published on

Updated on

One of the most common mistakes I see in induction proofs is assuming the recursive case and working backwards towards the induction hypothesis. This may be fine for formulas that are symmetric like those involving equality, but this way of proving induction fails if not. This post will show such example.

## Question

Prove $x - 1 \ge \frac{x}{2}$ for $x \in \mathbb{Z}^+$

## Base Case

Let $x = 1$. Then, \begin{align*} 1 -1 &\ge \frac{1}{2} \\ 0 &\ge 0 \checkmark \end{align*} The right side simplifies to zero since we’re doing integer division.

## Recursive Case (Correct)

Let us assume the induction hypothesis, that is, $x_n - 1 \ge \frac{x_n}{2}$. We will show that $x_{n + 1} - 1 \ge \frac{x_{n + 1}}{2}$.

We know $x_{n + 1} = x_n + 1$, therefore, $x_n = x_{n + 1} - 1$.

Substituting into our inductive hypothesis: \begin{align*} (x_{n + 1} - 1) - 1 &\ge \frac{x_{n + 1} - 1}{2} \iff \\ (x_{n + 1} - 1) - 1 &\ge \frac{x_{n + 1}}{2} - \frac{1}{2} \iff \\ x_{n + 1} - 1 &\ge \frac{x_{n + 1}}{2} + \frac{1}{2} \implies \\ x_{n + 1} - 1 &\ge \frac{x_{n + 1}}{2} \end{align*} Therefore, via induction this theorem holds. Note that the last step was only an implication, this is where the symmetry breaks.

## Recursive Case (Incorrect)

Now let us see how we can go astray if we start from the wrong direction. Substituting what we know about $x_n$ and $x_{n + 1}$: \begin{align*} x_{n + 1} - 1 &\ge \frac{x_{n + 1}}{2} \iff \\ (x_n + 1) - 1 &\ge \frac{(x_n + 1)}{2} \iff \\ x_n &\ge \frac{x_n}{2} + \frac{1}{2} \iff \\ x_n -1 &\ge \frac{x_n}{2} - \frac{1}{2} \end{align*} Sadly from here we cannot imply that $x_n - 1 \ge \frac{x_n}{2}$.

## Conclusion

Remember, when performing the induction step of the proof:

• State the induction hypotheses
• State what formulas you know about the various variables
• Substitute into the induction hypothesis
• Simplify until you reach the $n+1$th step.
{"ft_lang_label":"__label__en","ft_lang_prob":0.68787634,"math_prob":0.9997534,"size":1981,"snap":"2023-40-2023-50","text_gpt3_token_len":689,"char_repetition_ratio":0.1917046,"word_repetition_ratio":0.09142857,"special_character_ratio":0.37910146,"punctuation_ratio":0.06544503,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99996877,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-23T17:41:21Z\",\"WARC-Record-ID\":\"<urn:uuid:54eb3022-6d55-49e6-997c-8ba3316f5b91>\",\"Content-Length\":\"14791\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:52b08765-6118-4211-8b91-2e82a8649b89>\",\"WARC-Concurrent-To\":\"<urn:uuid:b3c1c1ec-df37-4caf-89df-11b231a970a0>\",\"WARC-IP-Address\":\"173.255.230.230\",\"WARC-Target-URI\":\"https://brandonrozek.com/blog/common-mistake-induction-proofs/\",\"WARC-Payload-Digest\":\"sha1:D3S4BYBECXCEIGXCWDURZS4SCMFAYM5P\",\"WARC-Block-Digest\":\"sha1:XVIZM4AB345Z7KBKOI3BXHCMBZD7XVBT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506528.19_warc_CC-MAIN-20230923162848-20230923192848-00365.warc.gz\"}"}