Is this inequality proof possible without induction?

Click For Summary

Homework Help Overview

The discussion revolves around proving an inequality involving the terms \( a \) and \( x_i \) under certain conditions. The original poster questions whether the inequality \( a^{n+1} \geq \prod_{i=0}^n x_i \) can be established without using mathematical induction.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • The original poster attempts to use induction, providing a base case and an assumption for \( n-1 \). They explore whether the inequality holds for all \( n \) if it holds for \( n=0 \). Some participants question the validity of assuming \( a \geq x_0 \) for all \( n \). Others discuss the implications of the function \( f(x) = \frac{x - 1}{1 + x} \) being increasing and its relevance to the inequality.

Discussion Status

The discussion is ongoing, with participants exploring various interpretations of the inequality and the assumptions involved. There is no explicit consensus, but some guidance is being offered regarding the properties of the function and its implications for the inequality.

Contextual Notes

Participants express uncertainty about the assumptions made regarding the relationship between \( a \) and \( x \). There is also mention of formatting issues with LaTeX in the posts, which may affect clarity.

teleport
Messages
240
Reaction score
0

Homework Statement



If we know that [tex](\frac{a - 1}{1 + a})^{n + 1} \geq \displaystyle\prod_{i=0}^n\frac{x_i - 1}{1+x_i}[/tex] is the inequality
[tex]a^{n+1} \geq \displaystyle\prod_{i=0}^n\ x_i[/tex] true? Prove your answer.

Homework Equations



Not sure

The Attempt at a Solution



I tried induction:

The base n = 0 works.

Assume it works for n -1

Proving it works for n:

[tex]a^{n +1} = aa^n \geq a\displaystyle\prod_{i=0}^{n - 1} x_i<br /> <br /> = \frac{a}{x_n}\displaystyle\prod_{i=0}^{n} x_i[/tex].

Now it would be great if I could assume that if it works for n = 0 then
[tex]a \geq x_0[/tex] and therefore [tex]a \geq x[/tex] for all n since I can allways permute the highest of the x and set it as [tex]x_0[/tex]. If this is true, then I would get the result immediately. But I don't really know if I could do this. Any help is appreciated. I am very interested to see if the inequality could be proven without induction. Thanks for any comments.
 
Last edited:
Physics news on Phys.org
wow my latex sucks. sorry for that. I am trying to fix some
 
Can it be proven here that [tex]a \geq x[/tex] for all n, or should I just say that the inequality is true iff [tex]a \geq x[/tex] for all n?
 
Oh I got it now. I didn't realize that

[tex](\frac{a - 1}{a + 1})^{n + 1} <br /> <br /> = \displaystyle\prod_{i=0}^n\ (\frac{a - 1}{a + 1}) <br /> <br /> \geq \displaystyle\prod_{i=0}^n\ \frac{x - 1}{1 + x}[/tex].

But since

[tex]f(x) = \frac{x - 1}{1 + x}[/tex]

is an increasing function, then a must be greater than x for all n. Is this reasoning correct? I am suspicious of that. I need some confirmation. Thanks
 
Last edited:
Wait, no I don't think that's true. Man!
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
4K
  • · Replies 11 ·
Replies
11
Views
4K
  • · Replies 19 ·
Replies
19
Views
4K
Replies
6
Views
3K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K