Algebra: proving an inequality

vers
Messages
3
Reaction score
0

Homework Statement


Let
f(x) = (1/2+x) log [(1+x)/x] + (3/2-x) log [(1-x)/(2-x)]
where log is natural logarithm and 0 < x <= 1/2. Show that f(x) >= 0 for all x.

Homework Equations


The only inequality that I can think of is the log sum inequality:
http://en.wikipedia.org/wiki/Log_sum_inequality

The Attempt at a Solution


I try to plot f (see figure), and it seems that the statement is correct. In fact, the figure suggests that f is decreasing and equals 0 at x = 1/2. However, I can't figure out an analytical proof of this.
 

Attachments

  • f_x.jpg
    f_x.jpg
    11 KB · Views: 396
Physics news on Phys.org
I haven't done this out, but, if you find f(1/2) = 0 and that f(x) is decreasing on (0,1/2], what does that tell you about f(x) on (0,1/2]? How would you show that f(1/2) = 0 and f(x) is decreasing on (0,1/2]?

EDIT: On second thought, it may not be completely straightforward to show that f(x) is decreasing on (0,1/2]. If so, let us know what you've tried.
 
Certainly if I can show that f'(x) <=0 then the inequality is proved. However, it seems to me that showing f' being negative is even more difficult than showing f being nonnegative directly.

Tedjn said:
I haven't done this out, but, if you find f(1/2) = 0 and that f(x) is decreasing on (0,1/2], what does that tell you about f(x) on (0,1/2]? How would you show that f(1/2) = 0 and f(x) is decreasing on (0,1/2]?
 
It turns out that the function f can be simplified as
<br /> f(x) = d\left(\frac{1+x}{2} \parallel \frac{x}{2}\right) - d\left(\frac{x}{2} \parallel \frac{1+x}{2}\right)<br />
where
<br /> d(p \parallel q) = p \log \frac{p}{q} + (1 - p) \log \frac{1-p}{1-q}<br />
is the KL divergence between two Bernoulli random variables with respective expectations p and q. So all I need to do now is to show that the difference of these two KL divergences is nonnegative when x <= 1/2. Any idea how to do that?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top