Polynomial multiplication and its variants are a key ingredient in effective computer algebra. While certifying a polynomial product is a well known task, it was not yet clear how to do a similar approach for its middle product variant. In this short note, we present a new algorithm that provides such a certification with the same complexity and probability that polynomial multiplication certification. Furthermore, we extend our algorithm to certify any operations that compute only a certain chunk of the product.