Intuitive Proof of Cramer's Decomposition Theorem Cramer's decomposition theorem states that if $X$ and $Y$ are independent real random variables and $X+Y$ has normal distribution, then both $X$ and $Y$ are normally distributed. I've seen a few proofs of this result which involve grunt work in the realm of complex analysis. I was wondering if there is an intuitive proof of this result. I would like to see a proof that exploits the unique nature of the normal distribution. For example, can one derive the result from the fact that on the real line, the normal distribution maximizes entropy for a given mean and standard deviation? 
Edit: The complex analysis proof I'm thinking of uses the fact that if $E[\exp(\alpha X^2)]<\infty$ for some $\alpha>0$ and the analytic continuation of the characteristic function of $X$ is nonzero, then $X$ is normally distributed. 
 A: 
For example, can one derive the result from the fact that on the real line, the normal distribution maximizes entropy for a given mean and standard deviation?

That sounds like a workable approach. Here's an intuitive proof:
Visualize the convolution of two functions as the smoothing of one function by the other one's shape. Smoothing can only spread out probability mass and not concentrate it, so entropy cannot decrease in the process. If one function is kept fixed while the entropy of the other is increased, the entropy of the convolution also increases.
Now suppose $X$ and $Y$ are independent random variables such that $X + Y$ has maximum entropy among those random variables with its mean and variance, but $X$ does not have maximum entropy in its mean and variance class. Let $X'$ be a random variable with the same mean and variance as $X$ but greater entropy. Then $X' + Y$ has the same mean and variance as $X + Y$, and by the entropy convolution inequality in the previous paragraph $X' + Y$ has greater entropy than $X + Y$. But this is a contradiction, so $X$ and by symmetry $Y$ must have maximum entropy.
