Faddeev’s axioms
E45254
Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Faddeev’s axioms canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T356732 — 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: Faddeev’s axioms Context triple: [Shannon–Khinchin axioms, relatedTo, Faddeev’s axioms]
-
A.
Mathematical Foundations of Quantum Mechanics
Mathematical Foundations of Quantum Mechanics is John von Neumann’s landmark 1932 treatise that rigorously formulates quantum theory using functional analysis and operator theory on Hilbert spaces.
-
B.
Euclidean quantum field theory
Euclidean quantum field theory is a formulation of quantum field theory in imaginary (Euclidean) time that enables rigorous mathematical treatment and path-integral representations closely connected to statistical mechanics.
-
C.
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED is a landmark theoretical result that rigorously demonstrated the mathematical consistency and mutual compatibility of different approaches to quantum electrodynamics.
-
D.
Gell-Mann–Nishijima formula
The Gell-Mann–Nishijima formula is a key relation in particle physics that connects a particle’s electric charge to its isospin and hypercharge, helping classify hadrons within the quark model.
-
E.
Feynman–Kac formula
The Feynman–Kac formula is a fundamental result connecting solutions of certain partial differential equations with expectations over stochastic processes, forming a bridge between quantum mechanics, probability theory, and mathematical finance.
- 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: Faddeev’s axioms Target entity description: Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
-
A.
Mathematical Foundations of Quantum Mechanics
Mathematical Foundations of Quantum Mechanics is John von Neumann’s landmark 1932 treatise that rigorously formulates quantum theory using functional analysis and operator theory on Hilbert spaces.
-
B.
Euclidean quantum field theory
Euclidean quantum field theory is a formulation of quantum field theory in imaginary (Euclidean) time that enables rigorous mathematical treatment and path-integral representations closely connected to statistical mechanics.
-
C.
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED
Dyson’s proof of equivalence of Feynman and Schwinger–Tomonaga formulations of QED is a landmark theoretical result that rigorously demonstrated the mathematical consistency and mutual compatibility of different approaches to quantum electrodynamics.
-
D.
Gell-Mann–Nishijima formula
The Gell-Mann–Nishijima formula is a key relation in particle physics that connects a particle’s electric charge to its isospin and hypercharge, helping classify hadrons within the quark model.
-
E.
Feynman–Kac formula
The Feynman–Kac formula is a fundamental result connecting solutions of certain partial differential equations with expectations over stochastic processes, forming a bridge between quantum mechanics, probability theory, and mathematical finance.
- F. None of above. chosen
Statements (30)
| Predicate | Object |
|---|---|
| instanceOf |
axiomatization of entropy
ⓘ
characterization of Shannon entropy ⓘ set of axioms in information theory ⓘ |
| appliesTo | finite discrete probability distributions ⓘ |
| assumes | entropy is a real-valued function on discrete probability distributions ⓘ |
| characterizes | Shannon entropy ⓘ |
| clarifies | why Shannon entropy has its specific functional form ⓘ |
| field | information theory ⓘ |
| implies | Shannon entropy is the unique solution up to scale ⓘ |
| includesCondition |
continuity of entropy
ⓘ
normalization condition for entropy ⓘ recursivity (grouping) condition ⓘ symmetry of entropy under permutation of outcomes ⓘ |
| influenced | later axiomatizations of entropy and information measures ⓘ |
| isAlternativeTo | Shannon–Khinchin axioms ⓘ |
| isEquivalentTo | Shannon–Khinchin axioms ⓘ |
| mainGoal | uniquely characterize Shannon entropy up to a positive multiplicative constant ⓘ |
| mathematicalDomain |
functional equations
ⓘ
probability theory ⓘ |
| namedAfter | Dmitry Faddeev ⓘ |
| relatedTo |
Shannon entropy
ⓘ
Shannon–Khinchin axioms ⓘ characterization theorems for entropy ⓘ |
| requires | entropy of a certain two-point distribution to be positive ⓘ |
| supports | uniqueness of Shannon entropy under natural requirements ⓘ |
| typeOfCondition | axiomatic characterization ⓘ |
| usedFor |
foundations of information theory
ⓘ
justification of Shannon entropy ⓘ |
| usesConcept |
information measure
ⓘ
probability distribution ⓘ |
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: Faddeev’s axioms Description of subject: Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.