Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How to prove the following known (Pinsker's) inequality?

For two strictly positive sequences $(p_i)^n_{i=l}$ and $(q_i)^n_{i=l}$ with $\sum_{i=1}^np_i=\sum_{i=1}^nq_i=1$ one has $$\sum_{i=1}^np_i\log\frac{p_i}{q_i}\ge \frac{1}{2}\left(\sum_{i=1}^n|p_i-q_i|\right)^2.$$

share|improve this question
1  
Retagged due to the relation to Kullback-Leibler_divergencecomments may only be edited for 5 minutes(click on this box to dismiss) –  Ilya Apr 4 '12 at 13:14
    
If it is known, does it have a name? Where did you find it and was a reference to a proof missing? –  Aryabhata Apr 4 '12 at 17:15
    
@Aryabhata yes it is known. Pinsker's inequality: mathoverflow.net/questions/42667/… –  Kolmo Apr 4 '12 at 18:35
    
@Kolmo: Please add an answer. Also, my point was OP knows it is known, and if OP knew the name, they could have done some research before posting it here. –  Aryabhata Apr 4 '12 at 18:51

1 Answer 1

up vote 3 down vote accepted

See here. Pinsker's inequality

http://mathoverflow.net/questions/42667/two-reference-requests-pinskers-inequality-and-pontryagin-duality

share|improve this answer
    
Thanks...... +1 –  Aryabhata Apr 4 '12 at 19:35
    
Is there a simpler proof? –  Sunni Apr 4 '12 at 20:17
    
I find a simpler one from Borwein\& Levis, 2005, page 63. –  Sunni Apr 10 '12 at 19:25

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.