Keyboard shortcuts

Press or to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Deterministic Readout Entropy Decomposition

Abstract

A deterministic finite readout splits source entropy into retained and residual parts, while garbling can only increase the residual.

Theorem 1.1 (Finite deterministic readouts split entropy and order residuals).

Proof. Machine-checked in Lean as D5/S3/Entropy/Observation/DeterministicReadoutEntropyDecomposition.deterministic_readout_entropy_decomposition (✓ std3). ∎

Source. Repository-derived.

Commentary.

The source, fine-readout, and coarse-readout carriers are finite. The source mass is nonnegative and normalized, so it represents the finite random state in the theorem.

The first conjunct identifies source entropy with the sum of the classification entropy retained by the fine readout and the conditional entropy remaining in its fibers.

The equation coarse = forget composed with fine is the deterministic garbling premise. The second conjunct states that the fine readout leaves no more conditional entropy than the coarse one.

References