Remark: No automatic closure for changing access libraries

Activation can enable a previously unavailable communication or gate interface. In such a graph-dependent language, pointwise capacity decrease does not imply that the new set of experiments is a subset of the old set. Run-invariant admissibility then needs a separate simulation or library-inclusion theorem. The present downward-closure claim is only the fixed-library claim of Lemma lem:restriction.