  We make two observations regarding a recent tight example for a composition
theorem for randomized query complexity: (1) it implies general randomized
query-to-communication lifting is not always true if one allows relations, (2)
it is in a certain sense essential that a relation is used in constructing the
example.
