Solving Induction Proof w/ Homework: Step by Step Guide

  • Thread starter Thread starter ar6
  • Start date Start date
  • Tags Tags
    Induction Proof
Click For Summary

Homework Help Overview

The discussion revolves around an induction proof related to inequalities involving a sequence of terms. The original poster attempts to establish the validity of a statement for all natural numbers using mathematical induction, specifically focusing on the case for n+1.

Discussion Character

  • Exploratory, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the initial steps of proving the base case and the inductive step. There is an exploration of how to transition from the assumption for n to n+1, with some questioning the abstract nature of the problem. Others suggest demonstrating the case for n=2 specifically, noting its relation to the triangle inequality.

Discussion Status

The discussion is ongoing, with participants providing insights into the inductive reasoning process. Some guidance has been offered regarding the structure of the proof, but there is no explicit consensus on the approach or resolution of the problem.

Contextual Notes

There are mentions of the need to validate the proof for specific cases, such as n=2, and the discussion includes references to the triangle inequality as a foundational concept in this context.

ar6
Messages
5
Reaction score
0

Homework Statement


http://img87.imageshack.us/img87/469/17317851uu7.jpg


Homework Equations





The Attempt at a Solution



First I have to show that P(1) is true
|a1| ≤ |a1| This is true

Assume above is true for all n.

Show that

|∑i=1n+1 ai| ≤ n+1∑i=1 |ai|


|a1 + a2 + a3…+ an + an+1| ≤ |a1| + |a2| + |a3| +…+ |an| + |an+1|

|∑i=1n ai + an+1| ≤ n+1∑i=1 |ai| + |an+1|

assuming I'm on the right track. How can i proceed. This problem is so abstract its driving me crazy. Sorry for formatting.
 
Last edited by a moderator:
Physics news on Phys.org
ar6 said:

Homework Statement


http://img87.imageshack.us/img87/469/17317851uu7.jpg


Homework Equations





The Attempt at a Solution



First I have to show that P(1) is true
|a1| ≤ |a1| This is true

Assume above is true for all n.

Show that

|∑i=1n+1 ai| ≤ n+1∑i=1 |ai|


|a1 + a2 + a3…+ an + an+1| ≤ |a1| + |a2| + |a3| +…+ |an| + |an+1|

.
you have to arrive at the last equation using the preceding equation.
Lets start with the left hand side of last equation.
|a1 + a2 + a3…+ an + an+1|≤|a1 + a2 + a3…+ an |+ |an+1|
.......{ since it is valid for n=2}
|a1 + a2 + a3…+ an + an+1|≤|a1| + |a2 |+ |a3|+…+ |an |+ |an+1|
........{since valid for n=n(seond last equation i your post)}

Keep Smiling
Malay
 
Last edited by a moderator:
You use a strong induction. Assume true for all k<n. Then

\left|\sum_i a_i\right|=\left|\sum_{i=1}^{n-1}a_i +a_n\right|

You should see where to go from here.Problems like these are often trivial inductions. Like, for example, showing that taking the intersection of two open sets is open immediately implies that the finite intersection of open sets is always open. Why? Well, for n=3 we have (A n B)nC but we showed AnB is open! So we just repeatedly use this fact.

It's the same thing here, really.

Edit: If you know nothing about open sets, completely disregard.
 
Last edited:
You should demonstrate that it is true for n = 2...

MalayInd showed the main inductive step which is valid for n+1>2 but not for n+1 = 2.
 
for n+1=2, it reduces to triangle inequality.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
4K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K