Proposition: Selected entropy does not determine recovery

For every pure logical input, the accessible entropy is zero for both isometries in (eq:hidden-visible). Their optimal accessible recovery errors are respectively $1-d^{-2}$ and $0$.

Proof. The accessible output of either map is pure for a pure input. The recovery assertions follow from Example ex:relocation and Lemma lem:constant.