{
  "id": "enwiki-001306421995",
  "slug": "information-dimension",
  "title": "Information dimension",
  "qid": "",
  "lead": "In information theory, information dimension is an information measure for random vectors in Euclidean space, based on the normalized entropy of finely quantized versions of the random vectors. This concept was first introduced by Alfréd Rényi in 1959. Simply speaking, it is a measure of the fractal dimension of a probability distribution. It characterizes the growth rate of the Shannon entropy given by successively finer discretizations of the space. In 2010, Wu and Verdú gave an operational characterization of Rényi information dimension as the fundamental limit of almost lossless data compression for analog sources under various regularity constraints of the encoder/decoder.",
  "body": "In information theory, information dimension is an information measure for random vectors in Euclidean space, based on the normalized entropy of finely quantized versions of the random vectors. This concept was first introduced by Alfréd Rényi in 1959. Simply speaking, it is a measure of the fractal dimension of a probability distribution. It characterizes the growth rate of the Shannon entropy given by successively finer discretizations of the space. In 2010, Wu and Verdú gave an operational characterization of Rényi information dimension as the fundamental limit of almost lossless data compression for analog sources under various regularity constraints of the encoder/decoder. \\mathbb{H}_0(Z)=\\sum_{z \\in supp(P_Z)}P_Z(z)\\log_2\\frac{1}{P_Z(z)} where P_Z(z) is the probability measure of Z when Z=z , and the supp(P_Z) denotes a set \\{z|z \\in\\mathcal{Z},P_Z(z)>0\\} . Let X be an arbitrary real-valued random variable. Given a positive integer m , we create a new discrete random variable \\langle X\\rangle_m=\\frac{\\lfloor mX\\rfloor}{m} where the \\lfloor \\cdot \\rfloor is the floor operator which converts a real number to the greatest integer less than it. Then \\underline{d}(X)=\\liminf_{m \\rightarrow \\infty}\\frac{\\mathbb{H}_0(\\langle X \\rangle_m)}{\\log_2m} and \\bar{d}(X)=\\limsup_{m \\rightarrow \\infty}\\frac{\\mathbb{H}_0(\\langle X \\rangle_m)}{\\log_2m} are called lower and upper information dimensions of X respectively. When \\underline{d}(X)=\\bar{d}(X) , we call this value information dimension of X , d(X)=\\lim_{m \\rightarrow \\infty}\\frac{\\mathbb{H}_0(\\langle X \\rangle_m)}{\\log_2m} Some important properties of information dimension d(X) : If the mild condition \\mathbb{H}(\\lfloor X\\rfloor) is fulfilled, we have 0\\leq\\underline{d}(X)\\leq\\bar{d}(X)\\leq1 . For an n -dimensional random vector \\vec{X} , the first property can be generalized to 0\\leq\\underline{d}(\\vec{X})\\leq \\bar{d}(\\vec{X})\\leq n . It is sufficient to calculate the upper and lower information dimensions when restricting to the exponential subsequence m=2^l . \\underline{d}(X) and \\bar{d}(X) are kept unchanged if rounding or ceiling functions are used in quantization. \\mathbb{H}_{d(X)}(X)=\\lim_{n \\rightarrow + \\infty}(\\mathbb{H}_0(\\langle X \\rangle_n)-d(X)\\log_2n) provided the limit exists. If d=0 , the zero-dimensional entropy equals the standard Shannon entropy \\mathbb{H}_0(X) . For integer dimension d=n\\ge 1 , the n -dimensional entropy is the n -fold integral defining the respective differential entropy. d_R(X)=-2\\frac{R(X, D)}{\\log D}, where R(X, D) is the rate-distortion function that is defined as R(X, D) = \\min_{\\|X-\\hat{X}\\|_2\\leq D} I(X, \\hat{X}), or equivalently, minimum information that could lead to a D -close approximation of X . They further, proved that such definition is equivalent to the definition of information dimension. Formally, d_R(X) = d(X). R(X, D)=-\\frac{d(X)}{2}\\log \\frac{2\\pi e D}{d(X)}+b(X). The dimensional-rate bias is equal to d-dimensional rate for continuous, discrete, and discrete-continuous mixed distribution. Furthermore, it is calculable for a set of singular random variables, while d-dimensional entropy does not necessarily exist there. Finally, dimensional-rate bias generalizes the Shannon's entropy and differential entropy, as one could find the mutual information I(X; Y) using the following formula: I(X;Y) = b(X)+b(Y)-b(X, Y). According to Lebesgue decomposition theorem, a probability distribution can be uniquely represented by the mixture v=pP_{Xd}+qP_{Xc}+rP_{Xs} where p+q+r=1 and p,q,r\\geq0 ; P_{Xd} is a purely atomic probability measure (discrete part), P_{Xc} is the absolutely continuous probability measure, and P_{Xs} is a probability measure singular with respect to Lebesgue measure but with no atoms (singular part). Let X be a random variable such that \\mathbb{H}(\\lfloor X \\rfloor) . Assume the distribution of X can be represented as v=(1-\\rho)P_{Xd}+\\rho P_{Xc} where P_{Xd} is a discrete measure and P_{Xc} is the absolutely continuous probability measure with 0\\leq\\rho\\leq1 . Then d(X)=\\rho Moreover, given \\mathbb{H}_0(P_{Xd}) and differential entropy h(P_{Xc}) , the d -Dimensional Entropy is simply given by \\mathbb{H}_\\rho(X)=(1-\\rho)\\mathbb{H}_0(P_{Xd})+\\rho h(P_{Xc})+\\mathbb{H}_0(\\rho) where \\mathbb{H}_0(\\rho) is the Shannon entropy of a discrete random variable Z with P_Z(1)=\\rho and P_Z(0)=1-\\rho and given by \\mathbb{H}_0(\\rho)=\\rho\\log_2\\frac{1}{\\rho}+(1-\\rho)\\log_2\\frac{1}{1-\\rho} We pass the signal through a half-wave rectifier which converts all negative value to 0, and maintains all other values. The half-wave rectifier can be characterized by the function f(x)= \\begin{cases} x,& \\text{if } x\\geq 0\\\\ 0,&x Then, at the output of the rectifier, the signal has a rectified Gaussian distribution. It is characterized by an atomic mass of weight 0.5 and has a Gaussian PDF for all x>0 . With this mixture distribution, we apply the formula above and get the information dimension d of the distribution and calculate the d -dimensional entropy. d(X)=\\rho=0.5 The normalized right part of the zero-mean Gaussian distribution has entropy h(P_{Xc})=\\frac{1}{2}\\log_2(2\\pi e\\sigma^2)-1 , hence \\begin{align} \\mathbb{H}_{0.5}(X)&=(1-0.5)(1\\log_21)+0.5h(P_{Xc})+\\mathbb{H}_0(0.5)\\\\ &=0+\\frac{1}{2}(\\frac{1}{2}\\log_2(2\\pi e\\sigma^2)-1)+1\\\\ &=\\frac{1}{4}\\log_2(2\\pi e\\sigma^2)+\\frac{1}{2}\\,\\text{ bit(s)} \\end{align} f(x_i)\\Delta=\\int_{i\\Delta}^{(i+1)\\Delta}f(x)\\;\\mathrm{d}x Consider the discretized random variable X^\\Delta=x_i if i\\Delta\\leq X . The probability of each support point X^\\Delta=x_i is P_{X^\\Delta}(x_i)=\\int_{i\\Delta}^{(i+1)\\Delta}f(x)\\;\\mathrm{d}x=f(x_i)\\Delta Let S = \\operatorname{supp}(P_{X^\\Delta}) . The entropy of X^\\Delta is \\begin{align} \\mathbb{H}_0(X^\\Delta)&=-\\sum_{x_i \\in S} P_{X^\\Delta}\\log_2P_{X^\\Delta}\\\\ &=-\\sum_{x_i \\in S} f(x_i)\\Delta\\log_2(f(x_i)\\Delta)\\\\ &=-\\sum_{x_i \\in S} \\Delta f(x_i)\\log_2f(x_i)-\\sum_{x_i \\in S} f(x_i)\\Delta \\log_2\\Delta\\\\ &=-\\sum_{x_i \\in S} \\Delta f(x_i)\\log_2f(x_i)-\\log_2\\Delta\\\\ \\end{align} If we set \\Delta=1/m and x_i=i/m then we are doing exactly the same quantization as the definition of information dimension. Since relabeling the events of a discrete random variable does not change its entropy, we have \\mathbb{H}_0(X^{1/m})=\\mathbb{H}_0(\\langle X\\rangle_m). This yields \\mathbb{H}_0(\\langle X\\rangle_m)=-\\sum \\frac{1}{m} f(x_i)\\log_2f(x_i)+\\log_2m and when m is sufficiently large, -\\sum \\Delta f(x_i)\\log_2f(x_i) \\approx \\int f(x)\\log_2 \\frac{1}{f(x)}\\mathrm{d}x which is the differential entropy h(x) of the continuous random variable. In particular, if f(x) is Riemann integrable, then h(X)=\\lim_{m\\rightarrow \\infty}\\mathbb{H}_0(\\langle X\\rangle_m)-\\log_2(m). Comparing this with the d -dimensional entropy shows that the differential entropy is exactly the one-dimensional entropy h(X)=\\mathbb{H}_1(X). In fact, this can be generalized to higher dimensions. Rényi shows that, if \\vec{X} is a random vector in a n -dimensional Euclidean space \\real^n with an absolutely continuous distribution with a probability density function f_{\\vec{X}}(\\vec{x}) and finite entropy of the integer part ( H_0(\\langle \\vec{X} \\rangle_m) ), we have d(\\vec{X})=n and \\mathbb{H}_n(\\vec{X})=\\int\\cdots\\int f_{\\vec{X}}(\\vec{x})\\log_2\\frac{1}{f_{\\vec{X}}(\\vec{x})}\\mathrm{d}\\vec{x}, if the integral exists. Consider a continuous encoder function f(x):{\\mathbb{R}}^n\\rightarrow {\\mathbb{R}}^{\\lfloor Rn\\rfloor} with its continuous decoder function g(x):{\\mathbb{R}}^{\\lfloor Rn\\rfloor}\\rightarrow {\\mathbb{R}}^n . If we impose no regularity on f(x) and g(x) , due to the rich structure of \\real , we have the minimum \\epsilon -achievable rate R_0(\\epsilon)=0 for all 0 . It means that one can build an encoder-decoder pair with infinity compression rate. In order to get some nontrivial and meaningful conclusions, let R^*(\\epsilon ) the minimum \\epsilon- achievable rate for linear encoder and Borel decoder. If random variable X has a distribution which is a mixture of discrete and continuous part. Then R^*(\\epsilon)=d(X) for all 0 Suppose we restrict the decoder to be a Lipschitz continuous function and \\bar{d}(X) holds, then the minimum \\epsilon- achievable rate R(\\epsilon)\\geq \\bar{d}(X) for all 0 . The fundamental role of information dimension in lossless data compression further extends beyond the i.i.d. data. It is shown that for specified processes (e.g., moving-average processes) the ratio of lossless compression is also equal to the information dimension rate. This result allows for further compression that was not possible by considering only marginal distribution of the process. ==Notes== ==References==",
  "categories": [
    "20157965",
    "23118434",
    "23603337"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1306421995",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1755444141.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001306421995",
    "type": "webpage",
    "title": "Information dimension",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/information-dimension",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          18
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001306421995",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1306421995",
    "note": "Immutable snapshot enwiki-001306421995"
  }
}