Theorem: C2: exact information-theoretic baseline

For the three-step benchmark,

Proof. Use Proposition prop:prefix and Lemma lem:constant for the first three values. At the third step, apply $U$, destructively read positions $1,3$, forget their outcomes, and return position $2$. Equation (eq:normal) proves exact recovery with every reference.