In the process of doing a proof by induction, can you use a contradiction to show that if P(k) holds then P(k+1) must hold? What I mean is, after establishing that P(0) holds, can I assume that P(k) holds and that P(k+1) does(adsbygoogle = window.adsbygoogle || []).push({}); not, and show that a contradiction arises, and thus conclude that if P(k) holds then P(k+1) must also hold? If I can, then in combination with showing that P(0) holds, then the proof for induction would be complete if I understand the process.

Let me give an example.

Say I wanted to prove that if (u_{1})^{2}, (u_{2})^{2}, ..., (u_{n})^{2}are all each ≥ 0 for u_{1}, u_{2}, ... u_{n}in R,

then the sum (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{n})^{2}≥ 0.

Well, clearly (u_{1})^{2}and (u_{2})^{2}are each ≥ 0 by the rules of squared numbers in R, so it's clear that (u_{1})^{2}+ (u_{2})^{2}≥ 0. So let's say I have shown that (I'm sure to actually prove it I'd have to get into some basic axioms, but let's just pretend that has been done).

Usually in an inductive proof, if I understand it correctly, the next step would be to assume that

(u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}≥ 0 and use that to show that it therefore follows that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}+ (u_{k+1})^{2}≥ 0.

Can I instead assume that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}≥ 0 AND assume that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}+ (u_{k+1})^{2}<0,

and show that I arrive at a contradiction, thereby proving that P(k) => P(k+1)? (Essentially what I'd be doing is instead of directly showing that if P(k) holds then P(k+1) holds, I'd be showing that if P(k) holds and P(k+1) does not hold that a contradiction is reached, and therefore if P(k) holds then P(k+1) holds).

So it would look like this:

Assume that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}≥ 0 holds and that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}+ (u_{k+1})^{2}< 0.

Then that would mean that

(u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}< -(u_{k+1})^{2}.

By the same reasoning I would have used to show that (u_{1})^{2}and (u_{2})^{2}≥ 0, I would show that (u_{k+1})^{2}≥ 0, which would make - (u_{k+1})^{2}< 0, but that would mean that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}< 0, which would contradiction my assumption that (u_{1})^{2}+ (u_{2})^{2}+ ...+ (u_{k})^{2}≥ 0. By contradiction, it would have to mean that the case for P(k+1) holds.

Granted, this proof outline itself is garbage and more or less ignores that a number times itself is positive in R, but I'm more worried about the principle itself. After showing P(0) is true, can we show that if P(k) holds then P(k+1) holds by assuming it does NOT and then arriving at a contradiction?

Also, if you want to critique/correct my "fake" proof please do. Thanks and sorry for this weird and all over the place question.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# I Can you use proof by contradiction in the midst of induction

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - proof contradiction midst | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Cantor's decimal proof that (0,1) is uncountable | Sep 27, 2017 |

Proof by Contradiction? | Oct 12, 2014 |

Proving the proof by contradiction method | Oct 25, 2011 |

Using negation of an for all statment in a proof by contradiction. | Mar 9, 2011 |

**Physics Forums - The Fusion of Science and Community**