Abstract:In this article, we introduce a notion of entropy for Boolean independence analogous to the Shannon's entropy and Voiculescu's free entropy through the study of asymptotic probabilities of the set of matrix approximates. To motivate this definition, we study two random matrix models exhibiting asymptotic Boolean independence, introduced respectively by Lenczewski and by Cébron-Gilliers. It turns out that the asymptotic probabilities of such matrix approximations can be characterized through large deviation principles for their empirical spectral measures. We prove that the associated rate functions coincide up to a scaling factor and attain their minimum at the Rademacher distribution, which plays the role of the Gaussian measure in Boolean probability. The logarithmic integral appearing in these rate functions is therefore identified as the Boolean entropy. We further show that this entropy is maximized, though not uniquely, by the Rademacher distribution and is monotone along the Boolean central limit theorem.
From: Kewei Pan [view email]
[v1]
Mon, 12 May 2025 12:25:02 UTC (45 KB)
[v2]
Thu, 26 Jun 2025 15:37:59 UTC (49 KB)
[v3]
Mon, 17 Nov 2025 13:06:33 UTC (49 KB)
[v4]
Fri, 4 Sep 2026 14:17:36 UTC (69 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。