Metraipolis › archive › dc_93040bcc6404

Entropic vector — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Entropic_vector
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:00:04.874Z
SHA-256 of the archived text
9e7fd40e8537979b3c0a5597c1200e58229904935cce4cedbe33e1d033eb41e2
Stable URL of this page
https://metraipolis.com/documento/dc_93040bcc6404

How to cite

Entropic vector — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Entropic_vector (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_93040bcc6404 (Metraipolis archive dc_93040bcc6404, sha256 9e7fd40e8537979b3c0a5597c1200e58229904935cce4cedbe33e1d033eb41e2)
BibTeX
@misc{dc93040bcc6404,
  title = {Entropic vector — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Entropic_vector},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_93040bcc6404; sha256 9e7fd40e8537979b3c0a5597c1200e58229904935cce4cedbe33e1d033eb41e2},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Entropic_vector. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The entropic vector or entropic function is a concept arising in information theory. It represents the possible values of Shannon's information entropy that subsets of one set of random variables may take. Understanding which vectors are entropic is a way to represent all possible inequalities between entropies of various subsets. For example, for any two random variables X 1 , X 2 {\displaystyle X_{1},X_{2}} , their joint entropy (the entropy of the random variable representing the pair X 1 , X 2 {\displaystyle X_{1},X_{2}} ) is at most the sum of the entropies of X 1 {\displaystyle X_{1}} and of X 2 {\displaystyle X_{2}} : H ( X 1 , X 2 ) ≤ H ( X 1 ) + H ( X 2 ) {\displaystyle H(X_{1},X_{2})\leq H(X_{1})+H(X_{2})} Other information-theoretic measures such as conditional information, mutual information, or total correlation can be expressed in terms of joint entropy and are thus related by the corresponding inequalities. Many inequalities satisfied by entropic vectors can be derived as linear combinations of a few basic ones, called Shannon-type inequalities. However, it has been proven that already for n = 4 {\displaystyle n=4} variables, no finite set of linear inequalities is sufficient to characterize all entropic vectors.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «information theory»).
Fonte: Wikipedia in inglese, voce «Entropic vector» — https://en.wikipedia.org/wiki/Entropic_vector
Wikidata Q5380785 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5380785
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Entropic_vector?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1298640694, consultata il 2026-10-07T21:37:53.193Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f3b5ebdc8c96dc8641a95428996548aaa771117485a0828a669198fb2f284168