Shannon–Khinchin axioms
E7559
The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Shannon–Khinchin axioms canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T59020 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shannon–Khinchin axioms Context triple: [Shannon entropy, satisfies, Shannon–Khinchin axioms]
-
A.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
-
B.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Shannon–Khinchin axioms Target entity description: The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
-
A.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
-
B.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
axiomatic system
ⓘ
information theory concept ⓘ |
| appliesTo | discrete probability distributions ⓘ |
| characterizes |
Boltzmann–Gibbs entropy in statistical mechanics
ⓘ
Shannon entropy ⓘ |
| contrastWith | generalized entropy axioms ⓘ |
| defines | properties of an entropy function ⓘ |
| field |
information theory
ⓘ
probability theory ⓘ |
| hasAxiom |
Shannon additivity axiom
ⓘ
linked to:
Shannon entropy
additivity axiom ⓘ continuity axiom ⓘ continuity in probabilities ⓘ expansibility axiom ⓘ expansibility with zero-probability events ⓘ maximal entropy for the uniform distribution ⓘ maximality axiom ⓘ recursivity axiom ⓘ recursivity for compound experiments ⓘ symmetry axiom ⓘ |
| hasConsequence |
additivity for independent systems
ⓘ
logarithmic form of entropy ⓘ uniqueness of Shannon entropy as information measure ⓘ |
| implies |
adding an event with probability zero does not change entropy
ⓘ
entropy is Schur-concave ⓘ entropy is continuous in its arguments ⓘ entropy is maximal for the uniform distribution ⓘ entropy is nonnegative ⓘ entropy is symmetric in its arguments ⓘ entropy is uniquely determined up to a positive multiplicative constant ⓘ entropy of a compound experiment is sum of entropies plus conditional entropy ⓘ |
| language | mathematical formulation ⓘ |
| namedAfter |
Aleksandr Khinchin
ⓘ
Claude Shannon ⓘ |
| purpose | to uniquely determine Shannon entropy up to a positive multiplicative constant ⓘ |
| relatedTo |
Boltzmann entropy
ⓘ
Faddeev’s axioms ⓘ Khinchin’s characterization of entropy ⓘ Rényi entropy ⓘ Shannon entropy ⓘ Tsallis entropy ⓘ |
| timePeriod | mid 20th century ⓘ |
| usedIn |
coding theory
ⓘ
foundations of information theory ⓘ information geometry ⓘ statistical mechanics ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Shannon–Khinchin axioms Description of subject: The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.