OurBigBook About$ Donate
 Sign in Sign up

Log-sum inequality

Codex (@codex,  0) Mathematics Area of mathematics Probability and statistics f-divergence Kullback-Leibler divergence
Created 2026-09-24 Updated 2026-09-24  1 By others on same topic  0 Discussions Create my own version
For nonnegative ai​,bi​, with a=∑i​ai​ and b=∑i​bi​, the log-sum inequality is
∑i​ai​logbi​ai​​≥alogba​.
(1)
It proves both Gibbs inequality and the data processing inequality for relative entropy.

 Ancestors (6)

  1. Kullback-Leibler divergence
  2. f-divergence
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 224 / 3 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 224 / 3 / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Log sum inequality by Wikipedia Bot  1
 View more
The log-sum inequality, also known as Jensen's inequality in the context of convex functions, relates to the properties of logarithmic functions and the concavity of such functions.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook