Is there any significance to the logarithm of a sum?

Question

Many years ago, while working as a computer programmer, I tracked down a subtle bug in the software that we were using. Management had dispaired of finding the bug, but I pursued it in odd moments over a period of a few days, and finally found that the problem was that, in computing the geometric mean, the program was taking the log of the sum instead of the sum of the logs. When thinking back on that, I always wonder whether there is any situation in which taking the log of a sum would be of interest. The only case I can think of is that it is often convenient to shift the logarithm to the left by 1 unit, which is done by adding 1 to the argument, that is, one often wishes to deal with log(1 + x) instead of log(x), so that one has the convenient situation of f(0) = 0. Let’s call this the trivial scenario.

So, can anyone think of any non-trivial scenario in which taking the log of a sum is the thing to do?

Answer 1

The log of a sum has been a topic in the time of Gauss; I'll see whether I can find an article which I do recall in the german math newsgroup at about 2002. So far here is a link to tables of such logarithms of Tafeln der Additions- und Subtractions-Logarithmen für sieben Stellen. by Christoph Zech.
As far as I remember it was an approach to simplify computations in astronomy (where Gauss has been involved)

A longer article which explains the rationale and the use of the "Gauss'sche Additionslogarithmen", unfortunately only in german, is at this online archiv The article contains some references which might be helpful even if german is foreign language to you. Sorry I can't be of more help here...

Answer 2

The logarithm is a concave function. This means that Jensen's inequality can be applied to it, giving the Log sum inequality, an useful lemma in information theory.

Lemma (Log sum inequality) Let $a_i\dots a_n$ and $b_1\dots b_n$ be nonnegative reals. Then we have $$\sum_{i=1}^n a_i\log{\frac{a_i}{b_i}} \ge \left(\sum_{i=1}^n a_i\right)\log{\frac{\sum_{i=1}^n a_i}{\sum_{i=1}^n b_i}}$$

On the right hand side we recognize two logarithms of a sum.

Remark By convention, $0\log{0} = 0\log{\frac{0}{0}}=0$ and $a\log{\frac{a}{0}}=\infty$ for $a>0$. All these are justified by continuity.

Answer 3

One plausible scenario is this:

Say you want a soft maximum function. The usual function $\max(x,y)$ is not "soft" (try visualizing its graph).

So we define the "soft maximum function" $\mathrm{smax}(x,y)=\log(e^x+e^y)$. The idea is that if $x \gg y$, then $\log(e^x+e^y) \approx x$.

You can read more about this function in this blog post.

Answer 4

I don't know if this is anything like what you had in mind, but when you integrate rational functions (by partial fractions) you may get terms like $\ln|x+a|$ and $\ln((x+a)^2+b^2)$ in the result.