  In an important (yet unpublished) research note, Ben Yaacov describes how to
turn a global Keisler measures into a type over a monster model of the
randomization. This transfer methods allow one to turn questions involving
measures into those involving types (in continuous logic). Assuming that T is
NIP, we show that the Morley product commutes with the transfer map for
finitely satisfiable measures. We characterize when the Morley product commutes
with the restriction map for pairs of global finitely satisfiable types in the
randomization. We end by making some brief observations about the Ellis
semigroup in this context.
