The claim
Circumstances w ∈ W, an observation map h: W → O, and for each w a set A(w) of acceptable actions. A policy π: O → actions is acceptable everywhere when π(h(w)) ∈ A(w) for every w.
- Criterion. Such a π exists exactly when ∩_{w ∈ h⁻¹(o)} A(w) ≠ ∅ for every o. If each such intersection is nonempty, pick π(o) in it. If one is empty, any π(o) fails some w in that class.
- Possibility is not enough. A(w) ≠ ∅ for every w does not give a policy, as in CLAIM-537’s triangle.
- Refinement. If h = g ∘ h′, any policy π for h gives π ∘ g for h′, so a finer observation never removes an acceptable policy (Blackwell’s easy direction, THEORY-1096).
- Policy-relativity. With W = {1, 2, 3}, A(1) = {a}, A(2) = {a, b}, A(3) = {b}, the partitions {1, 2} | {3} and {1} | {2, 3} both suffice, neither refines the other, and the trivial partition does not. So there is no unique coarsest sufficient observation. Which distinctions the organization must make legible depends on which acceptable action it commits to where it has a choice. CLAIM-350’s unique coarsest partition is the case with one acceptable action per circumstance.
So legibility, in TERM-064’s sense, has a positive job here: to make legible the distinctions that separate circumstances with no common acceptable action, under the policy the organization adopts.
What it does not say
- Anything about memory, the cost of observing, or limits on action. One step only. A32’s “bounded actuation” half is unproved and not filed.
- That the acceptable sets are the right ones.
- That choosing what to observe under cost is covered. That is active sensing and dual control (Feldbaum), not registered because its citation could not be checked.