Help to prove that an inequality holds

  • Thread starter Thread starter ubiquitousuk
  • Start date Start date
  • Tags Tags
    Inequality
AI Thread Summary
The discussion revolves around proving a complex inequality involving parameters α, δ, and γ within the range (0,1) and for n≥2. The original inequality is simplified to demonstrate that a specific expression involving γ and n must be less than or equal to 101. The author has made progress by analyzing the behavior of the inequality with respect to δ and α, concluding that if the inequality holds for δ=0, it holds for all δ in (0,1). They express confidence in the validity of the inequality based on numerical explorations and the monotonic behavior of the reduced form, while also acknowledging the potential for further investigation or counterexamples. The author ultimately believes they have reached a satisfactory conclusion regarding the proof.
ubiquitousuk
Messages
7
Reaction score
0

Homework Statement



I am trying to prove that

\frac{1}{512} \left[101-(1-\alpha ) \gamma ^n \left(2 (37+64 \alpha )+27 (1-\alpha ) \gamma ^n\right) (1-\delta )-\frac{128 n (1-\alpha ) \alpha (1-\gamma ) \gamma ^{-1+n} (1-\delta )}{\alpha +\delta -\alpha \delta }\right]\geq0

for

\alpha,\delta,\gamma\in(0,1)

and

n\geq2.

Edit: I should add that this isn't homework per se, but rather part of my own ongoing research project. As such, it may be that the inequality does not hold over this range of parameters. (If someone can find a counterexample, that would also help). Playing with this inequality in Mathematica's manipulate function, however, it seems that it does indeed hold over the relevant range.

Any help with this is warmly appreciated.

Homework Equations



So far, I have managed to reduce this problem to one of showing that

\gamma ^{n-1} \left(128 n (1-\gamma )+\gamma \left(74+27 \gamma ^n\right)\right)\leq101

for

\gamma\in(0,1)

and

n\geq2

(for details see below).

The Attempt at a Solution



The second term in the big square brackets is decreasing in (absolute) size in \delta. Taking the derrivative of the third term inside the square brackets yields

\frac{\partial}{\partial\delta}\frac{128 n (1-\alpha ) \alpha (1-\gamma ) \gamma ^{-1+n} (1-\delta )}{\alpha +\delta -\alpha \delta }=-\frac{128 n (1-\alpha ) \alpha (1-\gamma ) \gamma ^{-1+n}}{(\alpha +\delta -\alpha \delta )^2}\leq0.

The whole LHS of the inequality is therefore increasing in \delta, so if the inequality holds for \delta=0, it holds for all \delta\in(0,1). Let's take the limit as \delta approaches zero. The problem is now reduced to one of showing that

101 \geq (1-\alpha)\gamma^{n-1}\left(128n(1-\gamma)+\gamma\left(2(37+64\alpha)+27(1-\alpha)\gamma^n\right)\right)

Differentiating the R.H.S. of this W.R.T. \alpha and solving the first order condition reveals that the R.H.S. is unconditionally maximised when

\alpha=\alpha^*=1-\frac{64 n (1-\gamma )+101 \gamma }{\gamma \left(128-27 \gamma ^n\right)}

(the second derrivative is nagative, so that the R.H.S is concave). Now, note that

\frac{\partial\alpha^*}{\partial \gamma}=\frac{n \left(8192+27 (-64+64 n (-1+\gamma )-101 \gamma ) \gamma ^n\right)}{\gamma ^2 \left(128-27 \gamma ^n\right)^2},

which has the same sign as \left(8192+27 (-64+64 n (-1+\gamma )-101 \gamma ) \gamma ^n\right).

Moreover,

\frac{\partial}{\partial\gamma}\left(8192+27 (-64+64 n (-1+\gamma )-101 \gamma ) \gamma ^n\right)=-27 (1+n) (64 n (1-\gamma )+101 \gamma ) \gamma ^{n-1}\leq0.

This implies that \partial\alpha^*/\partial\gamma can be negative for some \gamma\in(0,1) only if it is negative for \gamma=1. Making this substitution reveals that

\left.\frac{\partial\alpha^*}{\partial \gamma}\right|_{\gamma=1}=\frac{37n}{101}>0\ \Rightarrow\ \frac{\partial\alpha^*}{\partial \gamma}>0.

Thus, the largest admissible value of \alpha^* occurs where \gamma=1, in which case \left.\alpha^*\right|_{\gamma=1}=0. Concavity and the fact that \alpha\in(0,1) must be true then implies that the right hand side of the reduced inequality is maximised by its limit as \alpha goes to zero. Taking the limit of LHS of the original inequality first as \delta goes to zero and then as \alpha goes to zero reduces that inequality to

<br /> \frac{101 \gamma -128 n \gamma ^n+2 (-37+64 n) \gamma ^{1+n}-27 \gamma ^{1+2 n}}{512 \gamma }\geq0.<br />

Multiplying away extraneous terms and simplifying then leaves

\gamma ^{n-1} \left(128 n (1-\gamma )+\gamma \left(74+27 \gamma ^n\right)\right)\leq101,

but I still don't know how to show that this holds over the relative range of parameter values.
 
Last edited:
Physics news on Phys.org
In what sense is this an ongoing research project? Is it a task you are supposed to complete on your own?
 
To calrify: This is an ongoing research project in the sense that I am an independent researching academic (albeit not a proper mathematician) who has encountered the above problem in the course of an applied modelling project in my own academic research. I am hoping that some fresh eyes might spot a trick that I have missed and thus help in obtaining the proof, or at least suggest some alternative avenue of investigation.

It is because this is a part of original research that I can't be sure that a proof exists. However, plotting the reduced inequality, it seems pretty clear that the LHS is maximised at 101 (the function is smooth and continuous and approaches 101 at a corner solution). I am therefore pretty confident that the inequality does indeed hold. Alas, even though the reduced inequality appears to behave monotonically in both n and gamma, showing as much has also defied me.

I am not sure whether one of the main mathematics forums would have been a better place for this post, but I am not able to move the thread.
 
I think I managed to finish off the proof. The remaining steps are shown in the attached image for anyone who is interested, or encounters a similar problem.
 

Attachments

  • Untitled-1.png
    Untitled-1.png
    20.1 KB · Views: 492
I think this works.

Let k = \gamma^n

27 k^2 - (128n - 74) k - 101 &lt;= - 128 n k^{1 - 1/n}

1. Both sides are decreasing in k,
2. For k -> 0, LHS < RHS
3. d/dk LHS <= d/dk RHS
 
Vertigo, that indeed appears to work and is far more elegant that the method I posted--which helps me with my page count. Many thanks.
 
Back
Top