Search arXivSearch

arXiv · 2606.03813

Finite-Temperature de Bruijn Identities: Fisher Information as the Spectral Gap of Blahut--Arimoto Dynamics

Abstract

We uncover a finite-temperature extension of de Bruijn's identity -- the classical relation $\frac{d}{dt}h(X+\sqrt{t}Z)=\frac{1}{2}J(X)$ connecting differential entropy and Fisher information. Our framework is the spectral theory of Blahut--Arimoto (BA) dynamics, recently developed by Wang~\cite{Wang2026} for the analysis of rate-distortion optimization. The central observation is elementary yet profound: for Gaussian sources, the spectral gap $\lam$ of the BA relaxation kernel $\G$ satisfies $\lam = 1/(2βσ^2)$~\cite{Wang2026}, while the Fisher information of the source is $J = 1/σ^2$. Hence \[ {\lam = \frac{J}{2β}} \] for all inverse temperatures $β> 1/(2σ^2)$. This identifies the BA spectral gap as a \emph{finite-temperature regularization of Fisher information}. From this observation we derive an exact finite-temperature de Bruijn identity: \[ \frac{\partial F_β}{\partial σ^2} = \frac{1}{2βσ^2} = \lam, \] where $F_β$ is the BA free energy. This identity holds for all finite $β$ without any limit procedure. The classical de Bruijn identity follows as the exact consequence $β\,\partial F_β/\partialσ^2 = J/2$. The significance is structural: classical de Bruijn is not an isolated fact about Gaussian convolutions, but the $β\to\infty$ shadow of a one-parameter family of exact identities living in the spectral geometry of rate-distortion optimization. We discuss implications for the entropy power inequality, the $χ^2$-dissipation structure of BA dynamics, and the geometric unification of information inequalities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qiao Wang. 2026-06-02. Finite-Temperature de Bruijn Identities: Fisher Information as the Spectral Gap of Blahut--Arimoto Dynamics. https://arxiv.org/abs/2606.03813

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT