Entropic Inequalities and Limit Theorems in Boolean Probability
Abstract
We study Boolean entropy and Fisher information in information inequalities and the Boolean central limit theorem. We prove a fractional Stam inequality for the Boolean Fisher information associated with arbitrary fractional partitions of subset sums, and derive an entropy power inequality for sums of Boolean independent random variables and its weighted version. We then establish a Boolean analogue of Barron's entropy convergence result along the Boolean central limit theorem: Boolean entropy converges to the entropy of the Rademacher law if and only if the initial entropy is finite. Furthermore, under a finite fourth moment, in the Boolean central limit theorem, we obtain Γ(μn|b)= (m4(μ)−1−m3(μ)2)/2(log n)/n +o ((log n)/n), with an explicit example showing sharpness. For symmetric laws with finite fourth moment and finite Boolean Fisher information, Ψ(μn|b) =2(m4(μ)−1)(log n)/n +o((log n)/n). Our approach is based on the Nevanlinna representation of Cauchy transforms.
Related
- From an entropic inequality for sums in abelian groups to the theorems of Ruzsa and Plünnecke
- Some entropic inequalities for primitive KMS symmetric quantum Markov semigroups
- Improved Bounds for the Entropic Central Limit Theorem in the Log-Concave Case
- The Berry--Esseen estimate in the Boolean central limit theorem
- Boolean Small-Ball Inequalities for Discrepancy Theory
BibTeX
@misc{pan2026entropic,
title = {{Entropic Inequalities and Limit Theorems in Boolean Probability}},
author = {Kewei Pan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.20178},
eprint = {2610.20178},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.20178},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Entropic Inequalities and Limit Theorems in Boolean Probability
AU - Kewei Pan
PY - 2026
DA - 2026/10/14
PB - arXiv
DO - 10.48550/arxiv.2610.20178
UR - https://arxiv.org/abs/2610.20178
AB - We study Boolean entropy and Fisher information in information inequalities and the Boolean central limit theorem. We prove a fractional Stam inequality for the Boolean Fisher information associated with arbitrary fractional partitions of subset sums, and derive an entropy power inequality for sums of Boolean independent random variables and its weighted version. We then establish a Boolean analogue of Barron's entropy convergence result along the Boolean central limit theorem: Boolean entropy converges to the entropy of the Rademacher law if and only if the initial entropy is finite. Furthermore, under a finite fourth moment, in the Boolean central limit theorem, we obtain Γ(μ_n|b)= (m_4(μ)−1−m_3(μ)^2)/2(log n)/n +o ((log n)/n), with an explicit example showing sharpness. For symmetric laws with finite fourth moment and finite Boolean Fisher information, Ψ(μ_n|b) =2(m_4(μ)−1)(log n)/n +o((log n)/n). Our approach is based on the Nevanlinna representation of Cauchy transforms.
ER -