Johannes Rauh, Nils Bertschinger, Eckehard Olbrich and Jürgen Jost (2014), “Reconsidering unique information: Towards a multivariate information decomposition”, 2014 IEEE International Symposium on Information Theory: 2232–2236 — ARXIV-1404.3146
Key takeaways
From the reading, NOTE-965.
- The impossibility (Theorem 2). No I∩ satisfies symmetry, self-redundancy, monotonicity (with subset equality), local positivity and the identity axiom. In XORCOPY, Y1 and Y2 are independent uniform bits, Y3 = Y1 ⊕ Y2 and X = (Y1, Y2, Y3). Identity gives I∩(X: Yi; Yj) = 0 and I∩(X: Yi; YjYk) = MI(Yi; YjYk) = 1. Monotonicity then makes the bottom of the lattice zero and each {i}{jk} atom 1 bit. But I∩ at {12}{13}{23} is at most MI(X; Y1Y2Y3) = 2, so its atom is at most 2 − 3 = −1.
- Two silent premises. Identity is applied with a set of variables as one source, and I∩(X: …) is taken to equal I∩((Yi, Yj): …) because X is a relabelling of any pair. The paper does not list the second as an axiom.
- Consequence. A multivariate decomposition that extends Bertschinger et al.’s bivariate one consistently “cannot be a partial information decomposition”. Which terms it should have is left open.
- Bivariate monotonicity (Lemmas 3–4, §IV-C). ŨI(X: Y \ (Z, Z′)) ≤ ŨI(X: Y \ Z); enlarging Y or X increases ŨI; S̃I increases when a source is enlarged. S̃I and C̃I violate left monotonicity, which the paper traces to the identity axiom: AND gives S̃I = 0.311 bit about Z but 0 about the copy (X, Y).
- Conjecture (§V). MI(X; Y1…Yk) − Σ ŨI(X: Yi \ rest) ≥ 0, which would follow from ŨI(X: Y \ Z, W) + ŨI(X: Z \ Y, W) ≤ ŨI(X: (Y, Z) \ W). Unproved here.
Standing in the record
Filed on 2026-10-17 for the gap left open by the PID filing, and read the
same day. It changes the gap’s shape. The record asked for a multivariate
redundancy function with the identity property for ΦID. This paper proves
that, on the lattice ΦID inherits, no such function also gives
non-negative atoms. So the gap cannot be closed as stated. One of identity,
non-negativity or the lattice has to go. Ince’s I_ccs (LIT-1201) is one way of letting
non-negativity go. Filed as THEORY-713. mathematics is for the
result’s form, an impossibility theorem on a lattice. It carries no
instruction for machine-learning practice.