GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Algebra
  • Applied Mathematics
  • Calculus and Analysis
  • Discrete Mathematics
  • Foundations of Mathematics
  • Geometry
  • History and Terminology
  • Number Theory
  • Probability and Statistics
  • Recreational Mathematics
  • Topology
  • Alphabetical Index
  • Random Entry
  • New in MathWorld

This view

  • Original page
  • New address

GeezerVison is showing mathworld.wolfram.com — Differential Entropy -- from Wolfram MathWorld

Search

Differential Entropy


The differential entropy of a continuous random variable X with probability density function f_X(x) is

 h(X)=-int_(-infty)^inftyf_X(x)lnf_X(x)dx=-<lnf_X(x)>.
(1)

When we have a continuous random vector X that consists of n random variables X_1, X_2, ..., X_n, the differential entropy of X is defined as the n-fold integral

h(X)=-int_(-infty)^inftyf_(X)(x)lnf_(X)(x)dx
(2)
=-<lnf_(X)(x)>,
(3)

where f_(X)(x) is the joint probability density function of X.

Thus, for example, the differential entropy of a multivariate Gaussian random variate X with positive definite covariance matrix P is

h(X)=1/2ln[(2pie)^n|det(P)|]
(4)
=1/2n[1+ln(2pi)]+1/2ln|det(P)|.
(5)

Additional properties of differential entropy include

 h(X+c)=h(X),
(6)

where c is a constant and

 h(aX)=h(X)+ln|a|,
(7)

where a!=0 is a scaling factor and X is a scalar random variable. The above property can be generalized to the case of a random vector X premultiplied by a matrix A,

 h(AX)=h(X)+ln|det(A)|,
(8)

where A is a square invertible matrix and det(A) is its determinant.

For n>=150, Pang (2026) proved that among projections of the uniform distribution on the hypercube [-1,1]^n onto the line in a unit vector direction, differential entropy is maximized exactly when all coordinate magnitudes of that direction are equal. Equivalently, if U_1, ..., U_n are independent uniform random variables on [-1,1] and sum_(i=1)^(n)a_i^2=1, then

 h(sum_(i=1)^na_iU_i)<=h(1/(sqrt(n))sum_(i=1)^nU_i),
(9)

with equality iff |a_i|=1/sqrt(n) for every i.


See also

Entropy, Hirschman Uncertainty Principle, Isotropic Constant, Logarithmically Concave Distribution, Shannon Entropy, Strong Isotropic Constant Conjecture

Portions of this entry contributed by Marwan A. Mattar

Portions of this entry contributed by Matthew R. Rudary

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

  • 7 {1, 0, -2, 1} - 4 {2, -1, 1, -1}
  • evolve Wolfram 2,3 for 100 steps
  • minimal polynomial sqrt(2)+sqrt(3)

References

Cover, T. M. and Thomas, J. A. Elements of Information Theory. New York: Wiley, 1991.Pang, Z. "Entropy Maximization for Cube Projections." 10 Nov 2026. https://arxiv.org/abs/2611.13533v1.

Referenced on Wolfram|Alpha

Differential Entropy

Cite this as:

Weisstein, Eric W., with contributions by Marwan A. Mattar and Matthew R. Rudary. "Differential Entropy." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DifferentialEntropy.html

Subject classifications

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.