Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Conditional-Independent Information Submodularity

Abstract

Conditional product laws make finite selected information submodular.

Theorem 1.1 (Selected mutual information has diminishing returns).

Proof. Machine-checked in Lean as D5/S3/Entropy/Submodularity/ConditionalIndependentInformationSubmodularity.conditional_independent_information_submodular (✓ std3). ∎

Source. Repository-derived.

Commentary.

A finite experiment index set carries finite dependent output types. For S contained in T and e outside T, the joint law is written on the tuple of outputs from S, the additional tuple from T minus S, the hidden state, and the output of e.

Conditional independence is stated on that joint law: at every active context consisting of the S-output tuple and hidden state, the joint conditional law of the remaining T-outputs and e factors as the product of its two marginals.

The four marginal laws constructed from the same joint mass are exactly the laws for S, S with e, T, and T with e. Their mutual-information increments satisfy the displayed diminishing-returns inequality.

The proof applies the finite mutual-information chain rule twice. The difference of conditional gains is the nonnegative conditional information between the remaining T-outputs and e given S, after the product-slice term is identified with zero.

References