An Information-Theoretic Proof of the Kac--Bernstein Theorem
J. Jon Ryu, Young-Han Kim

TL;DR
This paper provides an information-theoretic proof of the Kac--Bernstein theorem, demonstrating that independence of sums and differences of independent variables implies normality.
Contribution
It introduces a novel proof technique based on information theory for a classical characterization of normal distributions.
Findings
Independence of X+Y and X−Y implies X and Y are normal.
The proof offers new insights into distribution characterization.
Connects information theory with classical probability results.
Abstract
A short, information-theoretic proof of the Kac--Bernstein theorem, which is stated as follows, is presented: For any independent random variables and , if and are independent, then and are normally distributed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy
