First we will require an extension of the forward direction to Blackwell's ordering of information structures [1]} to sequential dynamic teams in standard Borel spaces (see also [2]}).

For sequential dynamic team problems, if each agent's information under a set of measurement channels \((p^1, \dots , p^N)\)  is a garbling of their information under another set of measurement channels \((\tilde{p}_1, \dots , \tilde{p}_N)\)  then the team-optimal cost cannot be strictly lower under \((p^1, \dots , p^N)\)  than under \((\tilde{p}_1, \dots , \tilde{p}_N)\) .
