Algebraic Representations of Entropy and Fixed-Sign Information Quantities

Many information-theoretic quantities have corresponding representations in terms of sets. Many of these information quantities do not have a fixed sign-for example, the co-information can be both positive and negative. In previous work, we presented a signed measure space for entropy where the smallest sets (called atoms) all have fixed signs. In the present work, we demonstrate that these atoms have natural algebraic behaviour which can be expressed in terms of ideals (characterised here as upper sets), and we show that this behaviour allows us to make bounding arguments and describe many fixed-sign information quantity expressions. As an application, we give an algebraic proof that the only completely synergistic system of three finite variables <i>X</i>, <i>Y</i> and Z=f(X,Y) is the XOR gate.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-02-01
DOI
https://doi.org/10.3390/e27020151
Citations
2
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
3.01
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algebraic Representations of Entropy and Fixed-Sign Information Quantities

Pedro A. M. Mediano, Keenan J. A. Down
2 citations
Entropy
Computability, Logic, AI Algorithms
3.01
article

Algebraic Representations of Entropy and Fixed-Sign Information Quantities

Pedro A. M. Mediano, Keenan J. A. Down
article en
2 citations

Abstract

Many information-theoretic quantities have corresponding representations in terms of sets. Many of these information quantities do not have a fixed sign-for example, the co-information can be both positive and negative. In previous work, we presented a signed measure space for entropy where the smallest sets (called atoms) all have fixed signs. In the present work, we demonstrate that these atoms have natural algebraic behaviour which can be expressed in terms of ideals (characterised here as upper sets), and we show that this behaviour allows us to make bounding arguments and describe many fixed-sign information quantity expressions. As an application, we give an algebraic proof that the only completely synergistic system of three finite variables <i>X</i>, <i>Y</i> and Z=f(X,Y) is the XOR gate.

EntropyVol. 27(2)
Queen Mary University of London (GB), University of Cambridge (GB), University College London (GB), Imperial College London (GB)
Openalex Percentile: Top 10%
Computability, Logic, AI Algorithms
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.