I am trying to understand who first derived the formula I(x) = -log(p(x)) for self-information from axioms. The wiki entry on information content and several other online sources all say it is in Shannon's well known article ``A mathematical theory of communication'' Bell Journal July 1948. However, I have looked closely at this article and can only find an axiomatization of Shannon entropy. I cannot find an axiomatization of self-information. Can anyone please tell me the page number, equation number, or section number where this supposed axiomatization of self-information is hiding? I have found references after Shannon 1948 eg Luce 1960 with the axiomatization of self-information I am seeking.
2026-03-27 16:26:15.1774628775
On what page did Shannon axiomatize self-information?
137 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REFERENCE-REQUEST
- Best book to study Lie group theory
- Alternative definition for characteristic foliation of a surface
- Transition from theory of PDEs to applied analysis and industrial problems and models with PDEs
- Random variables in integrals, how to analyze?
- Abstract Algebra Preparation
- Definition of matrix valued smooth function
- CLT for Martingales
- Almost locality of cubic spline interpolation
- Identify sequences from OEIS or the literature, or find examples of odd integers $n\geq 1$ satisfying these equations related to odd perfect numbers
- property of Lebesgue measure involving small intervals
Related Questions in INFORMATION-THEORY
- KL divergence between two multivariate Bernoulli distribution
- convexity of mutual information-like function
- Maximizing a mutual information w.r.t. (i.i.d.) variation of the channel.
- Probability of a block error of the (N, K) Hamming code used for a binary symmetric channel.
- Kac Lemma for Ergodic Stationary Process
- Encryption with $|K| = |P| = |C| = 1$ is perfectly secure?
- How to maximise the difference between entropy and expected length of an Huffman code?
- Number of codes with max codeword length over an alphabet
- Aggregating information and bayesian information
- Compactness of the Gaussian random variable distribution as a statistical manifold?
Related Questions in ENTROPY
- Relation between Shanon entropy via relation of probabilities
- How to maximise the difference between entropy and expected length of an Huffman code?
- Appoximation of Multiplicity
- Two questions about limits (in an exercise about the axiomatic definition of entropy)
- Computing entropy from joint probability table
- Joint differential entropy of sum of random variables: $h(X,X+Y)=h(X,Y)$?
- What is the least prime which has 32 1-bits?
- Eggs, buildings and entropy
- Markov chains, entropy and mutual information
- Entropy and Maximum Mutual Information
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Most of the time, people cited Shannon's work to appreciate his contributions, not necessarily the case that all results are derived by Shannon or presented in the same way as Shannon did. As you already see from Shannon's original paper, he considered uncertainty for a random variable (or information conveyed in a random variable) and directly obtained the entropy function.
As I know, the term "self-information" first appears in Prof. Fano's textbook (and later in Prof. Gallager's IT textbook). However, they all began with a more general quantity $i(E_1; E_2)$ called the "mutual information between events $E_1$ and $E_2$." The self-information $h(E)$ of an event $E$ is then defined as $h(E)=i(E;E)$. In fact, when taking expectation for $i(E;E)=h(E)$ with respect to all elementary events $E$ associated with a random variable $X$, we obtain this known formula $I(X;X)=H(X)$, where $I(\cdot)$ and $H(\cdot)$ are the usual mutual information and entropy, respectively.
In Prof. Fano's approach, you may find a different set of axioms to obtain a mathematical expression for the mutual information between two events. From that expression, an expression for the self-information is immediate. However, I personally like to use the four axioms as shown on the Wiki page to define self-information since it is more straightforward. I hope the above helps.